An ant colony optimization algorithm for the multiple traveling salesmen problem

2009 4th IEEE Conference on Industrial Electronics and Applications, ICIEA 2009

Volumn , Issue , 2009, Pages 1533-1537

  Liu, Weimin ^a,b   Li, Sujian ^a   Zhao, Fanggeng ^c   Zhen, Aiyun ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^b HEBEI POLYTECHNIC UNIVERSITY   (China)

^c Vehicle Management Institute   (China)

Author keywords

Ant colony optimization; Heuristic approach; The multiple traveling salesmen problem

Indexed keywords

ANT COLONY OPTIMIZATION; ANT COLONY OPTIMIZATION ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; HEURISTIC APPROACH; LOCAL SEARCH; MAX-MIN ANT SYSTEM; PHEROMONE TRAILS; ROUTING AND SCHEDULING; THE MULTIPLE TRAVELING SALESMEN PROBLEM; TRAVELING SALESMAN;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; INDUSTRIAL ELECTRONICS; ROUTING ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 70349306349     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIEA.2009.5138451     Document Type: Conference Paper

References (26)

1. M.G. Van Buer, D.L. Woodru, R.T. Olson, "Solving the medium newspaper production/distribution problem", European Journal of Operational Research, 115, 1999, pp. 237-253.
2. A.E. Carter, C.T. Ragsdale, "Scheduling pre-printed newspaper advertising inserts using genetic algorithms", Omega, 30, 2002, pp. 415-421.
3. Kewei Huang, Dingwei Wang, "Multiple traveling salesman problem and its application to hot rolling planning", Application Research of Computers, 24 (7), July 2007, pp. 43-46.
4. Lixin Tang, Jiyin Liu, Aiying Ronga, Zihou Yang, "A multiple traveling salesman problem model for hot rolling schedule in Shanghai Baoshan Iron and Steel Complex", European Journal of Operational Research, 124(2), 2000, pp. 267-282.
5. K. H. Kim, Y.M. Park, "A crane scheduling method for port container terminals", European Journal of Operational Research, 156, 2004, pp. 752-768.
6. Sheldon H. Jacobson, Laura A. McLay, Shane N. Hall, Darrall Henderson, Diane E. Vaughan, "Optimal search strategies using simultaneous generalized hill climbing algorithms", Mathematical and Computer Modelling, 43, 2006, pp. 1061-1073.
7. Evelyn C. Brown, Cliff T. Ragsdale, Arthur E. Carter, "A grouping genetic algorithm for the multiple traveling salesperson problem", International Journal of Information Technology & Decision Making, Vol. 6, No. 2, 2007, pp. 333-347.
8. YuPo CHAN, S. F. BAKER, "The Multiple Depot, Multiple Traveling Salesmen Facility-Location Problem: Vehicle Range, Service Frequency, and Heuristic Implementations", Mathematical and Computer Modelling, 41, 2005. pp. 1035-1053.
9. S. Rathinam, R. Sengupta, "Lower and Upper Bounds for a Symmetric Multiple Depots, Multiple Travelling Salesman Problem", Research Report, UCB-ITS-RR-2006-2, ISSN 0192 4095, March 2006.
10. Sanem Sariel, Tucker Balch. "Real Time Auction Based Allocation of Tasks for Multi-Robot Exploration Problem in Dynamic Environments". In the 20th National Conference on Artificial Intelligence (AAAI-05) Pittsburgh, Pennsylvania, July 9-13, 2005.
11. Xiubin Wang, Amelia C. Regan, "Local truckload pickup and delivery with hard time window constraints", Transportation Research Part B, 36, 2002, pp. 97-112.
12. Tolga Bektas, "The multiple traveling salesman problem: an overview of formulations and solution procedures", Omega, 34, 2006, pp. 209-219.
13. J. L. Ryan, T. G. Bailey, J. T. Moore, and W. B. Carlton, "Reactive Tabu search in unmanned aerial reconnaissance simulations", Proceeding of the 1998 winter simulation conference, 1998, pp. 873-882.
14. Paul M. Thompson, Harilaos N. Psaraftis, "Cyclic transfer algorithms for mutivehicle routing and scheduling problems", Operations Research, Vol. 41, No. 5, September-October 1993, pp. 935-946.
15. Samerkae Somhom, Abdolhamid Modares, Takao Enkawa, "Competition- based neural network for the multiple travelling salesmen problem with minmax objective", Computers & Operations Research, 26, 1999, pp. 395-407.
16. Ching Fang Liaw, "A hybrid genetic algorithm for the open shop scheduling problem", European Journal of Operational Research, 124, 2000, pp. 28-42.
17. Arthur E. Carter, Cliff T. Ragsdale, "A new approach to solving the multiple traveling salesperson problem using genetic algorithms", European Journal of Operational Research, 175, 2006, pp. 246-257.
18. Marco Dorigo, Luca Maria Gambardella, "Ant colonies for the travelling salesman problem", BioSystems, 43, 1997, pp. 73-81.
19. Pan Junjie, Wang Dingwei, "An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem", Proceedings of the First International Conference on Innovative Computing, Information and Control (ICICIC'06), IEEE Computer Society Washington, DC, USA, 2006, PP. 210-213.
20. Hong Qu, Zhang Yi, HuaJin Tang, "A columnar competitive model for solving multi-traveling salesman problem", Chaos, Solitons and Fractals, 31, 2007, pp. 1009-1019.
21. S. D. Shtovba, "Ant algorithms: theory and applications", Programming and Computer Software, Vol. 31, No. 4, 2005, pp. 167-178.
22. Thomas Stützle, Holger H. Hoos, "MAX-MIN Ant System", Future Generation Computer Systems, 16, 2000, pp. 889-914.
23. M. W. P. Savelsbergh, "The vehicle routing problem with time windows: minimizing route duration", Informs Journal on Computing, Vol. 4, 1992, pp. 146-154.
24. J.Y Potvin, and J. M. Rousseau, "An exchange heuristic for routing problems with time windows", Journal of the Operational Research Society, Vol. 46, 1995, pp. 1433-1446.
25. M. M. Flood, "The traveling-salesman problem", Operations Research, Vol. 4, 1956, pp. 61-75.
26. Alok Singh, Anurag Singh Baghel, "A new grouping genetic algorithm approach to the multiple traveling salesperson problem", Soft Comput, 13, 2009, pp. 95-101.