Solving a long-distance routing problem using ant colony optimization

Abstract

This paper presents a mathematical model and an algorithm based on ant colony optimization to solve a long distance routing problems. The size of freight is relatively small, which uses Last In First Out “LIFO” policy and with several time constraints. The objective consists of reducing costs by optimizing the loading of goods in vehicles grouping orders and minimizing number of routes. The performance of the algorithm has been proved using experimental data based on historical data from a large Spanish transport company.