Solving a Long-Distance Routing Problem using Ant Colony Optimization
Year: 2015
Type: article
Abstract: This paper presents a mathematical model and an algorithm based on ant colony optimization to solve a long distance routing \nproblems. The size of freight is relatively small, which uses Last In First Out “LIFO” policy and with several time constraints. The \nobjective consists of reducing costs by optimizing the loading of goods in vehicles grouping orders and minimizing number of routes. \nThe performance of the algorithm has been proved using experimental data based on historical data from a large Spanish transport \ncompany.
DOI: 10.12785/amis/092l16
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2182015126
