Estimation-based local search for stochastic combinatorial optimization using delta evaluations: A case study on the probabilistic traveling salesman problem

INFORMS Journal on Computing

Volumn 20, Issue 4, 2008, Pages 644-658

  Birattari, Mauro ^a   Balaprakash, Prasanna ^a   Stutzle, Thomas ^a   Dorigo, Marco ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Iterative improvement; Simulation; Stochastic combinatorial optimization; Suboptimal algorithms

Indexed keywords

EID: 61349123657     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0276     Document Type: Article

References (26)

1. Bcntley, J. L. 1992. Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4 387-411.
2. Bertsimas, D. 1988. Probabilistic combinatorial optimization problems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge.
3. Bertsimas, D., P. Jaillet, A. Odoni. 1990. A priori optimization. Oper. Res. 38 1019-1033.
4. Bianchi, L. 2006. Ant colony optimization and local search for the probabilistic traveling salesman problem: A case study in stochastic combinatorial optimization. Ph.D. thesis, Université Libre de Bruxelles, Brussels, Belgium.
5. Bianchi, L., A. Campbell. 2007. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. Eur. J. Oper. Res. 176 131-144.
6. Bianchi, L., J. Knowles, N. Bowler. 2005. Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms. Eur. J. Oper. Res. 162 206-219.
7. Bianchi, L., M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paqucte, O. Rossi-Doria, T. Schiavinotto. 2006. Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J. Math. Model. Algorithms 5 91-110.
8. Birattari, M., P. Balaprakash, T. Stützle, M. Dorigo. 2007. Extended empirical analysis of estimation-based local search for stochastic combinatorial optimization. IRIDIA Supplementary page, http://iridia.ulb.ac.be/ supp/IridiaSupp2007-001/.
9. Chervi, P. 1988. A computational approach to probabilistic vehicle routing problems. Master's thesis, Massachusetts Institute of Technology, Cambridge.
10. Fousse, L., G. Hanrot, V. Lefèvre, P. Pélissier, P. Zimmermann. 2007. MPFR: A multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Software 33 1-15.
11. Fu, M. C. 1994. Optimization via simulation: A review. Ann. Oper. Res. 53 199-248.
12. Fu, M. C. 2002. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. 14 192-215.
13. Griffith, A. 2002. GCC: The Complete Reference. McGraw Hill/Osborne Media, San Francisco.
14. Gutjahr, W. J. 2003. A converging ACO algorithm for stochastic combinatorial optimization. A. Albrecht, K. Steinhofl, eds. Stochastic Algorithms: Foundations and Applications, Lecture Notes in Computer Science, Vol. 2827. Springer-Verlag, Berlin, 10-25.
15. Gutjahr, W. J. 2004. S-ACO: An ant based approach to combinatorial optimization under uncertainity. M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, T. Stützle, eds. Ant Colony Optimization and Swarm Intelligence, 5th International Workshop, ANTS 2004, Lecture Notes in Computer Science, Vol. 3172. Springer-Verlag, Berlin, 238-249.
16. Hoos, H., T. Stützle. 2005. Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, San Francisco.
17. IEEE. 1985. IEEE standard for binary floating-point arithmetic. Institute of Electrical and Electronics Engineers, New York.
18. Jaillet, P. 1985. Probabilistic traveling salesman problems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge.
19. Johnson, D. S., L. A. McGeoch. 1997. The travelling salesman problem: A case study in local optimization. E. H. L. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 215-310.
20. Johnson, D. S., L. A. McGeoch, C. Rego, F. Glover. 2001. 8th DIMACS implementation challenge. Retrieved January 2007, http://www.rcsearch.att.com/- dsj/chtsp/.
21. Kleywegt, A. J., A. Shapiro, T. Homem de Mello. 2002. The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12 479-502.
22. Lourenço, H. R., O. Martin, T. Stützle. 2002. Iterated local search. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics, International Series in Operation Research and Management Science, Vol. 57. Kluwer Academic Publishers, Norwell, MA, 321-353.
23. Martin, O., S. W. Otto, E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Complex Systems 5 299-326.
24. Penky, J. F, D. L. Miller. 1994. A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph. ORSA J. Comput. 6 68-81.
25. Pichitlamken, J., B. L. Nelson. 2003. A combined procedure for optimization via simulation. ACM Trans. Model. Comput. Simulation 13 155-179.
26. Verweij, B., S. Ahmed, A. J. Kleywegt, G. Nemhauser, A. Shapiro. 2003. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24 289-333.