An ant colony system algorithm to solve routing problems applied to the delivery of bottled products

Authors:
Laura Cruz Reyes;José F. Delgado Orta;Juan J. González Barbosa;José Torres Jimenez;Héctor J. Fraire Huacuja;Bárbara A. Arrañaga Cruz
Affiliations:
Instituto Tecnológico de Ciudad Madero, México;Instituto Tecnológico de Ciudad Madero, México;Instituto Tecnológico de Ciudad Madero, México;Instituto Tecnológico de Ciudad Madero, México;Instituto Tecnológico de Ciudad Madero, México;Instituto Tecnológico de Ciudad Madero, México
Venue:
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Year:
2008

Citing 5
Cited 1

The vehicle routing problem

The vehicle routing problem
Analyzing a unified ant system for the VRP and some of its variants

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
DiPro: an algorithm for the packing in product transportation problems with multiple loading and routing variants

MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A distributed metaheuristic for solving a real-world scheduling-routing-loading problem

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a methodology of solution for the well-known vehicle routing problem (VRP) based on an ant colony system heuristic algorithm (ACS), which is applied to optimize the delivery process of RoSLoP (Routing-Scheduling-Loading Problem) identified in the company case of study. A first version of this algorithm models six variants of VRP and its solution satisfies the 100% of demands of the customers. The new version of the algorithm can solve 11 variants of VRP as a rich VRP. Experiments were carried out with real instances. The new algorithm shows a saving of two vehicles with regard to the first version, reducing the operation costs of the company. These results prove the viability of using heuristic methods and optimization techniques to develop new software applications.