Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem

Optimization Letters

Volumn 2, Issue 3, 2008, Pages 351-361

  Marinakis, Yannis ^a   Migdalas, Athanasios ^a   Pardalos, Panos M ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b University of Florida   (United States)

Author keywords

Expanding neighborhood search GRASP; Metaheuristics; Probabilistic traveling salesman problem

Indexed keywords

ALGORITHMS; BENCHMARKING; PROBABILISTIC LOGICS; TABU SEARCH;

EXPANDING NEIGHBORHOOD SEARCH-GRASP; METAHEURISTICS;

TRAVELING SALESMAN PROBLEM;

EID: 43249129176     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-007-0064-3     Document Type: Article

References (31)

1. Bertsimas, D. J.: Probabilistic Combinatorial Optimization Problems. Ph.D. thesis, MIT, Cambridge (1988)
2. Bertsimas D., Howell L. (1993). Further results on the probabilistic traveling salesman problem. Eur. J. Oper. Res. 65(1): 68-95
3. Bertsimas D., Chervi P., Peterson M. (1995). Computational approaches to stochastic vehicle routingproblems. Transp. Sci. 29(4): 342-352
4. Bianchi, L.: Ant Colony Optimization and Local Search for the Probabilistic Traveling Salesman Problem: A Case Study in Stochastic Combinatorial Optimization. Ph.D. Thesis, Universite Libre de Bruxelles, Belgium (2006)
5. Bianchi L., Knowles J., Bowler N. (2005). Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. Eur. J. Oper. Res. 162(1): 206-219
6. Bianchi, L., Gambardella, L.M., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. In: Merelo Guervòs, J.J., Adamidis, P., Beyer, H.-G., Fernández- Villacañas, J.-L., Schwefel, H.-P. (eds.) Proceedings of the Seventh Parallel Problem Solving from Nature (PPSN VII), Lecture Notes in Computer Science, vol. 2439, pp. 883-892. Springer, Berlin (2002)
7. Bianchi, L., Gambardella, L.M., Dorigo, M.: Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic. In: Dorigo, M., DiCaro, G., Sampels, M. (eds.) Proceedings of Third International Workshop ANTS 2002, Lecture Notes in Computer Science, vol. 2463, pp. 176-187. Springer, Berlin (2002)
8. Bowler, N.E., Fink, T.M.A., Ball, R.C.: Characterization of the probabilistic traveling salesmanproblem. Phys. Rev. E 68 (2003)
9. Branke J., Guntsch M. (2004). Solving the probabilistic TSP with ant colony optimization. J. Math. Model. Algorithms 3(4): 403-425
10. Campbell A.M. (2006). Aggregation for the probabilistic travelling salesman problem. Comput. Oper. Res. 33: 2703-2724
11. Choi J., Lee J.H., Realff M.J. (2004). An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem. Comput. Chem. Eng. 28(8): 1297-1307
12. Feo T.A., Resende M.G.C. (1995). Greedy randomized adaptive search procedure. J. Glob. Optim. 6: 109-133
13. Garfinkel R., Nemhauser G. (1972). Integer Programming. Wiley, New York
14. Glover F. (1989). Tabu search I. ORSA J. Comput. 1(3): 190-206
15. Glover F. (1990). Tabu search II. ORSA J. Comput. 2(1): 4-32
16. Hansen P., Mladenovic N. (2001). Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130: 449-467
17. Jaillet, P.: Probabilistic traveling salesman problems. PhD Thesis, MIT, Cambridge (1985)
18. Jaillet P., Odoni A.R. (1988). The probabilistic vehicle routing problem. In: Golden, B.L., Assad, A.A. (eds) Vehicle Routing: Methods and Studies, pp 293-318. Elsevier, North Holland, Amsterdam
19. Jaillet P. (1988). A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6): 929-936
20. Laporte G., Louveaux E., Mercure H. (1994). A priori optimization of the probabilistic traveling salesman problem. Oper. Res. 42: 543-549
21. Lin S. (1965). Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44: 2245-2269
22. Liu, Y.H.: A hybrid scatter search for the probabilistic traveling salesman problem. Comput. Oper. Res (available on line) (2007)
23. Liu, Y.-H., Jou, R.-C., Wang, C.-J.: Genetic algorithms for the probabilistic traveling salesman problem. In: Proceedings of the conference on E-logistics. Taoyuan, Taiwan, pp. 77-82 (2004)
24. Marinakis, Y.: Vehicle routing in distribution problems. Ph.D. Thesis, Technical University of Crete, Department of Production Engineering and Management, Chania, Greece (2005)
25. Marinakis Y., Migdalas A., Pardalos P.M. (2005). Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl. 32: 231-257
26. Powell W.B., Jaillet P., Odoni A. (1995). Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Momma, C.L., and Nemhauser, G.L. (eds) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp 141-295. Elsevier, Amsterdam
27. Psaraftis H.N. (1988). Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A. (eds) Vehicle Routing: Methods and Studies, pp 223-248. Elsevier, North Holland, Amsterdam
28. Resende M.G.C., Ribeiro C.C. (2003). Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics, pp 219-249. Kluwer, Boston
29. Rossi F.A., Gavioli I. (1987). Aspects of heuristics methods in the probabilistic traveling salesman problem. In: Andreatta, G., Mason, F., Serafini, P. (eds) Advanced School on Stochastics in Combinatorial Optimization, pp 214-227. World Scientific Press, Singapore
30. Tang H., Miller-Hooks E. (2004). Approximate procedures for the probabilistic traveling salesperson problem. Transp. Res. Rec. 1882: 27-36
31. Tarjan R. (1983). Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia