Solving the probabilistic TSP with Ant Colony Optimization

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 4, 2004, Pages 403-425

  Branke, Jürgen ^a   Guntsch, Michael ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

ACO; Ant Colony Optimization; Approximated evaluation; Heuristic guidance; Probabilistic Traveling Salesperson Problem; PTSP

Indexed keywords

EID: 20944446505     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000049380.86987.d4     Document Type: Article

References (22)

1. Bartholdi, J. and Platzman, L.: An O(N log N) planar traveling salesman heuristic based on spacefilling curves, Oper. Res. Lett. 1 (1982), 121-125.
2. Berstimas, D. J., Jaillet, P. and Odoni, A.: A priori optimization, Oper. Res. 38 (1990), 1019-1033.
3. Bertsimas, D., Chervi, P. and Peterson, M.: Computational approaches to stochastic vehicle routing problems, Transport. Sci. 29(4) (1995), 342-352.
4. Bertsimas, D. and Howell, L. H.: Further results on the probabilistic traveling salesman problem, European J. Oper. Res. 65 (1993), 68-95.
5. Bianchi, L., Gambardella, L. M. and Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem, in J. J. M. G. et al. (eds), Parallel Problem Solving from Nature, Lecture Notes in Comput. Sci. 2439, 2002, pp. 883-892.
6. Bianchi, L., Gambardella, L. M. and Dorigo, M.: Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic, in M. Dorigo, G. D. Caro and M. Sampels (eds), Ant Algorithms, Lectures Notes in Comput. Sci. 2463, 2002, pp. 176-187.
7. Bianchi, L. and Knowles, J.: Local search for the probabilistic traveling salesman problem: A proof of the incorretness of Bertsimas' proposed 2-p-opt and 1-shift algorithms, Technical Report IDSIA-21-02, IDSIA, Lugano, Switzerland, 2002.
8. Bianchi, L., Knowles, J. and Bowler, N.: Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms, European J. Oper. Res. (2004), to appear.
9. Bowler, N., Fink, T. and Ball, R. C.: Characterization of the probabilistic travelling salesman problem, Phys. Rev. (2003), to appear.
10. Branke, J. and Guntsch, M.: New ideas for applying ant colony optimization to the probabilistic TSP, in Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2003, 2003, pp. 165-175.
11. Dorigo, M. and Di Caro, G.: The ant colony optimization meta-heuristic, in D. Corne, M. Dorigo and F. Glover (eds), New Ideas in Optimization, 1999, pp. 11-32.
12. Dorigo, M. and Gambardella, L. M.: Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Trans. Evolut. Comput. 1(1) (1997), 53-66.
13. Dorigo, M. and Maniezzo, A. C. V.: The ant system: Optimization by a colony of cooperating agents, IEEE Trans. Systems Man Cybernet. B(26) (1996), 29-41.
14. Guntsch, M. and Middendorf, M.: Pheromone modification strategies for ant algorithms applied to dynamic TSP, in E. B. et al. (eds), Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001, 2000, pp. 213-222.
15. Guntsch, M., Middendorf, M. and Schmeck, H.: An ant colony optimization approach to dynamic TSP, in L. S. et al. (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), 2001, pp. 860-867.
16. Jaillet, P.: Probabilistic traveling salesman problems, Ph.D. thesis, MIT, Cambridge, MA, 1985.
17. Jaillet, P.: Analysis of probabilistic combinatorial optimization problems in Euclidean spaces, MOR: Math. Oper. Res. 18 (1993).
18. Jezequel, A.: Probabilistic vehicle routing problems, Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, 1985.
19. Laporte, G., Louveaux, F. V. and Mercure, H.: A priori optimization of the probabilistic traveling salesman problem, Oper. Res. 42(3) (1994), 543-549.
20. Lawler, E. (ed.): The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985.
21. Rossi, F. and Gavioli, I.: Aspects of heuristic methods in the probabilistic traveling salesman problem, in G. Andreatta, F. Mason and P. Serani (eds), Advanced School on Stochastics in Combinatorial Optimization, World Scientific, Singapore, 1987, pp. 214-227.
22. TSPLIB: http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ index.html, 2002.