Ant colony system for a VRP with multiple time windows and multiple visits

Journal of Interdisciplinary Mathematics

Volumn 10, Issue 2, 2007, Pages 263-284

  Favaretto, Daniela ^a   Moretti, Elena ^a   Pellegrini, Paola ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Ant colony system; Logistics; Multiple time windows; Vehicle routing problem

Indexed keywords

ANT COLONY SYSTEMS; COMPUTATIONAL RESULTS; MATHEMATICAL FORMULATION; MULTIPLE TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

LOGISTICS; ROUTING ALGORITHMS;

NETWORK ROUTING;

EID: 63849153037     PISSN: 09720502     EISSN: None     Source Type: Journal    
DOI: 10.1080/09720502.2007.10700491     Document Type: Article

References (16)

1. B. Bullnheimer, R. F. Hartl and C. Strauss, An improved ant system for the vehicle routing problem, Annals of Operations Research, Vol. 89 (1999), pp. 319-328.
2. B. Bullnheimer, R. F. Hartl and C. Strauss, Applying the ant system to the vehicle routing problem, in Meta-heuristics: Advances and Trends in Local Search for Optimization, S. Voss, S. Martello, I. H. Osman and C. Roucairol (editors), Kluver Academic Publishers, Boston, 1999.
3. A. Colorni, M. Dorigo and V. Maniezzo, An investigation of some properties of an ant algorithm, in Proceedings of the Parallel Problem Solving form Nature Conference (PPSN92), Elsevier Publishing, Bruxelles, 1992.
4. J. F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon and F. Soumis, The VRP with time windows, in The Vehicle Routing Problem, P. Toth and D. Vigo, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelpia, 2000.
5. C. de Jong, G. Kant and A. van Vlient, On finding minimal route duration in the vehicle routing problem with multiple time windows, Manuscript, Department of Computer Science, Utrecht University, Netherlands, 1996.
6. M. Desrochers, J. K. Lenstra, M. W. P. Savelsbrgh and F. Soumis, Vehicle routing with time windows: optimization and approximation, in Vehicle Routing: Methods and Studies, B. L. di Golden and A. A. Assad (editors), North-Holland, Amsterdam, 1988.
7. M. Dorigo and L. M. Gambardella, Ant colonies for the traveling salesman problem, BioSystems, Vol. 43 (1997), pp. 73-81.
8. M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transaction on Evolutionary Computation, Vol. 1 (1) (1997), pp. 53-66.
9. M. Dorigo and T. Stutzle, Ant Colony Optimization, MIT Press, 2004, Massachusetts Institute of Technology, Cambridge.
10. D. Favaretto, E. Moretti and P. Pellegrini, Ant colony system for variants of traveling salesman problem with time windows, Technical Report, Applied Mathematics Department of Ca' Foscari University of Venice, No. 120/2004, 2004, Venice.
11. M. L. Fisher, Optimal solution of vehicle routing problems using minimum K-trees, Operations Research, Vol. 42 (1994), pp. 626-642.
12. L. M. Gambardella, E. Taillard and G. Agazzi, MACS-VRPTW: a multiple ant colony system for vehicle routing problem with time windows, in New Idea in Optimization, D. Corne, M. Dorigo and F. Glover (editors), McGraw-Hill, 1999, pp. 63-76.
13. M. W. P. Savelsberg, Local search in routing problems with time windows, Annals of Operations Research, Vol. 4 (1985), pp. 285-305.
14. R. W. Sinnott, Virtues of the Haversine, Sky and Telescope, Vol. 68 (2) (1984), p. 159.
15. M. M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Operation Research, Vol. 35 (1987).
16. T. Stutzle and M. Dorigo, AGO algorithms for the traveling salesman problem, in Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming and Industrial Applications, K. Miettien, M. Mkel, P. Neittaanmki and J. Periaux (editors), JohnWiley & Sons, 1999.