Estimation-based metaheuristics for the probabilistic traveling salesman problem

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1939-1951

  Balaprakash, Prasanna ^a   Birattari, Mauro ^a   Stützle, Thomas ^a   Dorigo, Marco ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Empirical estimation; Metaheuristics; Probabilistic traveling salesman problem

Indexed keywords

CENTRAL PROBLEMS; EXPERIMENTAL STUDIES; ITERATED LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MEMETIC ALGORITHMS; META HEURISTIC ALGORITHM; META HEURISTICS; PROBABILISTIC TRAVELING SALESMAN PROBLEM;

ESTIMATION; LEARNING ALGORITHMS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 77951263646     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.12.005     Document Type: Article

References (49)

1. Hoos H., and Stützle T. Stochastic local search: foundations and applications (2005), Morgan Kaufmann, San Francisco, CA
2. Jaillet P. A priori solution of a travelling salesman problem in which a random subset of the customers are visited. Operations Research 36 6 (1988) 929-936
3. Bertsimas D. Probabilistic combinatorial optimization problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 1988.
4. Birattari M., Balaprakash P., Stützle T., and Dorigo M. Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study in the probabilistic traveling salesman problem. INFORMS Journal on Computing 20 4 (2008) 644-658
5. Balaprakash P., Birattari M., Stützle T., and Dorigo M. Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem. European Journal of Operational Research 199 1 (2009) 98-110
6. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press, Cambridge, MA
7. Balaprakash P., Birattari M., Stützle T., Yuan Z., and Dorigo M. Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem. Swarm Intelligence 3 3 (2009) 223-242
8. Lourenço H.R., Martin O., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics. International series in operations research and management science vol. 57 (2002), Kluwer Academic Publishers, Norwell, MA 321-353
9. Moscato P. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. C3P Report 826, Caltech Concurrent Computation Program; 1989.
10. Moscato P. Memetic algorithms: a short introduction. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London, UK 219-234
11. Bertsimas D., Jaillet P., and Odoni A. A priori optimization. Operations Research 38 6 (1990) 1019-1033
12. Kleywegt A.J., Shapiro A., and Homem-de-Mello T. The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization 12 2 (2002) 479-502
13. Laporte G., Louveaux F., and Mercure H. A priori optimization of the probabilistic traveling salesman problem. Operations Research 42 (1994) 543-549
14. Bianchi L., Gambardella L., and Dorigo M. Solving the homogeneous probabilistic travelling salesman problem by the ACO metaheuristic. In: Dorigo M., Di Caro G., and Sampels M. (Eds). Ant algorithms, third international workshop, ANTS 2002. Lecture notes in computer science vol. 2463 (2002), Springer, Berlin, Germany 176-187
15. Bianchi L., Gambardella L.M., and Dorigo M. An ant colony optimization approach to the probabilistic traveling salesman problem. In: Guervós J.J., Adamidis P., Beyer H., Martín J.L., and Schwefel H.-P. (Eds). 7th international conference on parallel problem solving from nature, PPSN VII, Lecture notes in computer science vol. 2439 (2002), Springer, Berlin, Germany 883-892
16. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
17. Branke J., and Guntsch M. New ideas for applying ant colony optimization to the probabilistic TSP. In: Raidl G., Cagnoni S., Cardalda J., Corne D., Gottlieb J., Guillot A., Hart E., Johnson C., Marchiori E., Meyer J.-A., and Middendorf M. (Eds). Applications of evolutionary computing. Lecture notes in computer science vol. 2611 (2003), Springer, Berlin, Germany 127-134
18. Branke J., and Guntsch M. Solving the probabilistic TSP with ant colony optimization. Journal of Mathematical Modelling and Algorithms 3 4 (2004) 403-425
19. Liu Y. A hybrid scatter search for the probabilistic traveling salesman problem. Computers & Operations Research 34 10 (2007) 2949-2963
20. Liu Y. Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem. European Journal of Operational Research 191 2 (2008) 332-346
21. Bianchi L. Ant colony optimization and local search for the probabilistic traveling salesman problem: a case study in stochastic combinatorial optimization. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium; 2006.
22. Bianchi L, Gambardella LM. Ant colony optimization and local search based on exact and estimated objective values for the probabilistic traveling salesman problem. Technical Report IDSIA-06-07, IDSIA, USI-SUPSI, Manno, Switzerland; June 2007.
23. Marinakis Y., and Marinaki M. A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Computers & Operations Research 37 3 (2010) 432-442
24. Marinakis Y., Migdalas A., and Pardalos P. Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem. Optimization Letters 2 3 (2008) 351-361
25. Birattari M., Zlochin M., and Dorigo M. Towards a theory of practice in metaheuristics design: a machine learning perspective. Theoretical Informatics and Applications 40 2 (2006) 353-369
26. Birattari M. Tuning metaheuristics: a machine learning perspective. Studies in computational intelligence vol. 197 (2009), Springer, Berlin, Germany
27. Gutjahr W.J. A converging ACO algorithm for stochastic combinatorial optimization. In: Albrecht A., and Steinhofl K. (Eds). Stochastic algorithms: foundations and applications. Lecture notes in computer science vol. 2827 (2003), Springer, Berlin, Germany 10-25
28. Gutjahr W.J. S-ACO: an ant based approach to combinatorial optimization under uncertainity. In: Dorigo M., Birattari M., Blum C., Gambardella L.M., Mondada F., and Stützle T. (Eds). Ant colony optimization and swarm intelligence, 5th international workshop, ANTS 2004. Lecture notes in computer science vol. 3172 (2004), Springer, Berlin, Germany 238-249
29. Birattari M, Balaprakash P, Dorigo M. ACO/F-Race: ant colony optimization and racing techniques for combinatorial optimization under uncertainty. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M, editors. Proceedings of the 6th metaheuristics international conference, MIC 2005, 2005. p. 107-12.
30. Birattari M., Stützle T., Paquete L., and Varrentrapp K. A racing algorithm for configuring metaheuristics. In: Langdon W.B., et al. (Ed). Proceedings of the genetic and evolutionary computation conference, GECCO 2002 (2002), Morgan Kaufmann, San Francisco, CA 11-18
31. Bowler N.E., Fink T.M.A., and Ball R.C. Characterization of the probabilistic traveling salesman problem. Physical Review E 68 3 (2003) 036703-036710
32. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4 4 (1992) 387-411
33. Rubinstein R.Y. Simulation and the Monte Carlo method (1981), Wiley, New York, NY
34. Johnson D.S., and McGeoch L.A. The travelling salesman problem: a case study in local optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), Wiley, Chichester, UK 215-310
35. Fisher R.A. Statistical methods for research workers (1925), Oliver and Boyd, London, UK
36. Tukey J.W. Comparing individual means in the analysis of variance. Biometrics 5 2 (1949) 99-114
37. 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 Journal of Operational Research 162 1 (2005) 206-219
38. Bianchi L., and Campbell A. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. European Journal of Operational Research 176 1 (2007) 131-144
39. Merz P., and Freisleben B. Memetic algorithms for the traveling salesman problem. Complex Systems 13 4 (2001) 297-345
40. Johnson DS, McGeoch LA, Rego C, Glover F. 8th DIMACS implementation challenge, 2001. URL 〈http://www.research.att.com/ dsj/chtsp/〉.
41. Stützle T. ACOTSP: a software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem, 2002. URL 〈http://www.aco-metaheuristic.org/aco-code/〉.
42. Penky J.F., and Miller D.L. A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph. ORSA Journal on Computing 6 1 (1994) 68-81
43. Campbell A.M. Aggregation for the probabilistic traveling salesman problem. Computers & Operations Research 33 9 (2006) 2703-2724
44. Tang H., and Miller-Hooks E. Approximate procedures for probabilistic traveling salesperson problem. Transportation Research Record: Journal of the Transportation Research Board 1882 (2004) 27-36
45. Campbell AM, Thomas BW. Challenges and advances in a priori routing. In Golden B, Raghavan S, Wasil E, editors. The vehicle routing problem: latest advances and new challenges, Operations Research/Computer Science Interfaces, vol. 43. SV, 2008. p. 123-42.
46. Balaprakash P., Birattari M., and Stützle T. Improvement strategies for the F-Race algorithm: sampling design and iterative refinement. In: Bartz-Beielstein T., Blesa M., Blum C., Naujoks B., Roli A., Rudolph G., and Sampels M. (Eds). Hybrid metaheuristics, HM 2007. Lecture notes in computer science vol. 4771 (2007), Springer, Berlin, Germany 113-127
47. Gutjahr W.J., and Pflug G.C. Simulated annealing for noisy cost functions. Journal of Global Optimization 8 1 (1996) 1-13
48. Fousse L., Hanrot G., Lefèvre V., Pélissier P., and Zimmermann P. MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Transactions on Mathematical Software 33 2 (2007) 1-15. http://www.mpfr.org/ URL 〈http://www.mpfr.org/〉
49. Applegate D, Bixby RE, Chvatal V, Cook WJ. Concorde-a code for solving traveling salesman problems, 2001. URL 〈http://www.math.princeton.edu/tsp/concorde.html〉.