A new and efficient ant-based heuristic method for solving the traveling salesman problem

Expert Systems

Volumn 20, Issue 4, 2003, Pages 179-186

  Tsai, Cheng Fa ^a   Tsai, Chun Wei ^a   Tseng, Ching Chang ^a  

^a NATIONAL PINGTUNG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Ant colony system; Metaheuristic approach; Traveling salesman problem

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; LOGISTICS;

VEHICLE ROUTING;

TRAVELING SALESMAN PROBLEM;

EID: 0242368003     PISSN: 02664720     EISSN: None     Source Type: Journal    
DOI: 10.1111/1468-0394.00242     Document Type: Article

References (25)

1. BAPTISTA, S., R.C. OLIVEIRA and E. ZUQUETE (2002) A period vehicle routing case study, European Journal of Operational Research, 139, 220-229.
2. BULLNHEIMER, B., R.F. HARTL and C. STRAUSS (1999) An improved ant system algorithm for the vehicle routing problem, Annals of Operation Research, 89, 319-328.
3. CANTU-PAZ, E. (1995) A summary of research on parallel genetic algorithms, IlliGAL Report 95007, July.
4. DI CARO, G. and M. DORIGO (1998) AntNet: distributed stigmergetic control for communications networks, Journal of Artificial Intelligence Research, 9, 317-365.
5. DORIGO, M. (1992) Optimization learning, and natural algorithms, PhD thesis, Dip. Elettronica, Politecnico di Milano.
6. DORIGO, M. and L.M. GAMBARDELLA (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1 (1), 53-66.
7. DORIGO, M., V. MANIEZZO and A. COLORNI (1991) Positive feedback as a search strategy, Technical Report 91-106, Dip. Elettronica, Politecnico di Milano.
8. DORIGO, M., V. MANIEZZO and A. COLORNI (1996) The ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B, 26 (1), 29-42.
9. DORIGO, M., V. MANIEZZO and A. COLORNI (1999) Evolutionary Algorithms in Engineering and Computer Science, Chichester: Wiley.
10. FLOOD, M.M. (1955) The traveling salesman problem, Operations Research, 4, 61-78.
11. GAMBARDELLA, L.M. and M. DORIGO (1997) HAS-SOP: hybrid ant system for the sequential ordering problem, Technical Report IDSIA 11-97, IDSIA, Lugano, Switzerland.
12. GERDESSEN, J.C. (1996) Vehicle routing problem with trailers, European Journal of Operational Research, 93, 135-147.
13. GHIANI, G. and G. IMPROTA (2000) An efficient transformation of the generalized vehicle routing problem, European Journal of Operational Research, 122, 11-17.
14. GLOVER, F. (1989) Tabu search - Part I, ORSA Journal of Computing, 1 (3), 190-206.
15. GLOVER, F. (1990) Tabu search - Part II, ORSA Journal of Computing, 2 (1), 4-32.
16. HOPFIELD, J. and D. TANK (1958) Neural computations of decisions in optimization problems, Biological Cybernetics, 51, 141-152.
17. HWANG, H.-S. (2002) Design of supply-chain logistics system considering service level, Computers and Industrial Engineering, 43, 283-297.
18. KEENAN, P.B. (1998) Spatial decision support systems for vehicle routing, Decision Support Systems, 22, 65-71.
19. LAWER, E.L., J.K. LENSTRA, A.H.R. KAN and D.B. SHMOYS (1985) The Traveling Salesman Problem, New York: Wiley.
20. LO, C.C. and C.C. Hus (1998) Annealing framework with learning memory, IEEE Transactions on Systems, Man and Cybernetics, Part A, 28 (5), 1-13.
21. NOSCHANG, M.H. WebPage, http://www.ececs.uc.edu/̃mnoschan/sale.html.
22. ROSENKRANTZ, D.J., R.E. STEARNS and P.M. LEWIS (1977) An analysis of several heuristics for the traveling salesman problem, SIAM Journal of Computing, 6, 563-581.
23. STUTZLE, T. and H.H, HOOS (1997) The MAZ-MIN ant system and local search for the traveling salesman problem, in Proceedings of the IEEE International Conference on Evolutionary Computation, T. Baeck, Z. Michalewicz and X. Yao (eds), 309-314.
24. TSPLIB WebPage, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/.
25. WANG, L. and L. JIAO (1998) The immune genetic algorithm and its convergence, IEEE Signal Processing Proceedings, New York: IEEE, Vol. 2, pp. 1347-1350.