Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem

European Journal of Operational Research

Volumn 199, Issue 1, 2009, Pages 98-110

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

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Combinatorial optimization; Heuristics; Importance sampling; Iterative improvement algorithm; Metaheuristics; Probabilistic traveling salesman problem

Indexed keywords

HEURISTICS; IMPORTANCE SAMPLING; ITERATIVE IMPROVEMENT ALGORITHM; METAHEURISTICS; PROBABILISTIC TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; ESTIMATION; HEURISTIC METHODS; ITERATIVE METHODS; LEARNING ALGORITHMS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 65749084339     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.027     Document Type: Article

References (28)

1. Alkhamis T.M., Ahmed M.A., and Tuan V.K. Simulated annealing for discrete optimization with estimation. European Journal of Operational Research 116 3 (1999) 530-544
2. 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 of LNCS vol. 4771 (2007), Springer-Verlag, Berlin, Germany 113-127
3. Balaprakash, P., Birattari, M., Stützle, T., Dorigo, M., 2007b. Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem: A complete analysis. Technical Report TR/IRIDIA/2007-015, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium. .
4. Balaprakash, P., Birattari, M., Stützle, T., Dorigo, M., 2008. Extended empirical analysis of adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem. IRIDIA Supplementary Page. .
5. Bentley J.L. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4 4 (1992) 387-411
6. Bertsimas, D., 1988. Probabilistic combinatorial optimization problems. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA.
7. Bertsimas D., Jaillet P., and Odoni A. A priori optimization. Operations Research 38 6 (1990) 1019-1033
8. 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.
9. 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
10. 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 (2005) 206-219
11. Birattari, M., 2004. The problem of tuning metaheuristics as seen from a machine learning perspective. Ph.D. Thesis, Université Libre de Bruxelles, Brussels, Belgium.
12. Birattari M., Balaprakash P., and Dorigo M. The ACO/F-RACE algorithm for combinatorial optimization under uncertainty. In: Doerner K.F., Gendreau M., Greistorfer P., Gutjahr W.J., Hartl R.F., and Reimann M. (Eds). Metaheuristics - Progress in Complex Systems Optimization Operations Research/Computer Science Interfaces Series (2006), Springer-Verlag, Berlin, Germany 189-203
13. Birattari, M., Balaprakash, P., Stützle, T., Dorigo, M., 2007. Extended empirical analysis of estimation-based local search for stochastic combinatorial optimization. IRIDIA Supplementary Page. .
14. 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
15. Chervi, P., 1988. A computational approach to probabilistic vehicle routing problems. Master's Thesis, Massachusetts Institute of Technology, Cambridge, MA.
16. 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/
17. Gutjahr, W.J., 2004. S-ACO: An ant based approach to combinatorial optimization under uncertainity. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (Eds.), Ant Colony Optimization and Swarm Intelligence, Fifth International Workshop, ANTS 2004, of LNCS, vol. 3172. Springer-Verlag, Berlin, Germany, pp. 238-249.
18. Gutjahr W.J., Strauss C., and Toth M. Crashing of stochastic activities by sampling and optimization. Business Process Management Journal 12 (2000) 125-135
19. Gutjahr W.J., Strauss C., and Wagner E. A stochastic branch-and-bound approach to activity crashing in project management. INFORMS Journal on Computing 12 (2000) 125-135
20. Homem-de-Mello T. Variable-sample methods for stochastic optimization. ACM Transactions on Modeling and Computer Simulation 13 2 (2003) 108-133
21. Hoos H., and Stützle T. Stochastic Local Search: Foundations and Applications (2005), Morgan Kaufmann, San Francisco, CA
22. Jaillet, P., 1985. Probabilistic traveling salesman problems. Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA.
23. 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), John Wiley and Sons, Chichester, UK 215-310
24. Johnson, D.S., McGeoch, L.A., Rego, C., Glover, F., 2001. In: Eighth DIMACS Implementation Challenge. .
25. Lourenço H.R., Martin O., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics of International Series in Operation Research and Management Science vol. 57 (2002), Kluwer Academic Publishers, Norwell, MA 321-353
26. 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
27. Pichitlamken J., and Nelson B.L. A combined procedure for optimization via simulation. ACM Transactions on Modeling and Computer Simulation 13 2 (2003) 55-179
28. Rubinstein R.Y. Simulation and the Monte Carlo Method (1981), John Wiley and Sons Inc., New York, NY