Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem

European Journal of Operational Research

Volumn 191, Issue 2, 2008, Pages 332-346

  Liu, Yu Hsin ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Diversified local search; Metaheuristics; Permutation test; Probabilistic traveling salesman problem; Scatter search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; METADATA; NUMERICAL METHODS; PROBABILITY; SEARCH ENGINES;

DIVERSIFIED LOCAL SEARCH; METAHEURISTICS; PERMUTATION TEST; PROBABILISTIC TRAVELING SALESMAN PROBLEM; SCATTER SEARCH;

TRAVELING SALESMAN PROBLEM;

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

References (36)

1. Bartholdi J.J., and Platzman L.K. Heuristics based on spacefilling curves for combinatorial problems in Euclidean space. Management Science 34 (1988) 291-305
2. Basso D., Chiarandini M., and Salmaso L. Synchronized permutation tests in replicated I × J designs. Journal of Statistical Planning and Inference 137 (2007) 2564-2578
3. Bertsimas, D., 1988. Probabilistic combinatorial optimization problems. Ph.D. Dissertation, Massachusetts Institute of Technology, MA, USA.
4. Bertsimas D., and Howell L. Further results on the probabilistic traveling salesman problem. European Journal of Operational Research 65 (1993) 68-95
5. Bertsimas D., Jaillet P., and Odoni A.R. A priori optimization. Operations Research 38 (1990) 1019-1033
6. Bertsimas D., Chervi P., and Peterson M. Computational approaches to stochastic vehicle routing problems. Transportation Science 29 (1995) 342-352
7. Bianchi, L., 2006. Ant colony optimization and local search for the probabilistic traveling salesman problem: A case study in stochastic combinatorial optimization. Ph.D. Dissertation, Université Libre de Bruxelles, Brussles, Belgium.
8. Bianchi L., and Campbell A.M. Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. European Journal of Operational Research 176 (2007) 131-144
9. Bianchi L., Gambardella L.M., and Dorigo M. An ant colony optimization approach to the probabilistic traveling salesman problem. Lecture Notes in Computer Science vol. 2439 (2002), Springer, Berlin 883-892
10. Bianchi L., Gambardella L.M., and Dorigo M. Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic. Lecture Notes in Computer Science vol. 2463 (2002), Springer, Berlin 176-187
11. 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
12. Bowler N.E., Fink T.M.A., and Ball R.C. Characterization of the probabilistic traveling salesman problem. Physical Review E 68 (2003) 036703
13. Branke J., and Guntsch M. Solving the probabilistic TSP with ant colony optimization. Journal of Mathematical Modelling and Algorithms 3 (2004) 403-425
14. Campbell A.M. Aggregation for the probabilistic traveling salesman problem. Computers & Operations Research 33 (2006) 2703-2724
15. Chiarandini, M., Basso, D., Stützle, T., 2005. Statistical methods for the comparison of stochastic optimizers. Presented at the Sixth Metaheuristics International Conference (MIC2005), August 22-26, 2005, Vienna, Austria.
16. Gendron B., Potvin J.-Y., and Soriano P. Diversification strategies in local search for a nonbifurcated network loading problem. European Journal of Operational Research 142 (2002) 231-241
17. Glover F., Laguna M., and Martí R. Scatter search. In: Ghosh A., and Tsutsui S. (Eds). Advances in Evolutionary Computing: Theory and Applications (2003), Springer, Berlin 519-538
18. Hansen P., and Mladenović N. Variable neighborhood search: Principles and applications. European Journal of Operational Research 130 (2001) 449-467
19. Hurkens C.A.J., and Woeginger G.J. On the nearest neighbor rule for the traveling salesman problem. Operations Research Letters 32 (2004) 1-4
20. Ishibuchi H., and Shibata Y. Mating Scheme for Controlling the Diversity-convergence Balance for Multiobjective Optimization. Lecture Notes in Computer Science vol. 3102 (2004), Springer, Berlin 1259-1271
21. Jaillet, P., 1985. Probabilistic traveling salesman problems. Ph.D. Dissertation, Massachusetts Institute of Technology, MA, USA.
22. Jaillet P. Stochastic routing problems. In: Andreatta G., Mason F., and Serafini P. (Eds). Advanced School on Stochastics in Combinatorial Optimization (1987), World Scientific Publisher, Singapore 192-213
23. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 36 (1988) 929-936
24. Jaillet P., and Odoni A.R. The probabilistic vehicle routing problem. In: Golden B.L., and Assad A.A. (Eds). Vehicle Routing: Methods and Studies (1988), North-Holland, Amsterdam 293-318
25. Laguna M., and Martí R. Scatter Search: Methodology and Implementations in C (2003), Kluwer Academic Publishers, London
26. Laporte G., Louveaux F., and Mercure H. A priori optimization of the probabilistic traveling salesman problem. Operations Research 42 (1994) 543-549
27. Lin M.-D., Liu Y.-H., Liu G.-F., and Chu C.-W. Scatter search heuristic for least-cost design of water distribution networks. Engineering Optimization. 39 (2007) 857-876
28. Liu, Y.-H., 2006. A scatter search based approach with approximation evaluation for the heterogeneous probabilistic traveling salesman problem. In: Proceedings of 2006 IEEE Congress on Evolutionary Computation (CEC 2006), Vancouver, British Columbia, Canada.
29. Liu Y.-H. A hybrid scatter search for the probabilistic traveling salesman problem. Computers & Operations Research 34 (2007) 2949-2963
30. Liu, Y.-H., Jou, R.-C., Wang, C.-C., 2004. Genetic algorithms for the probabilistic traveling salesman problem. In: Proceedings of the Conference on E-Logistics, Taoyuan, Taiwan, pp. 77-82.
31. Liu Y.-H., Jou R.-C., Wang C.-C., and Chiu C.-S. An Evolutionary Algorithm with Diversified Crossover Operator for the Heterogeneous Probabilistic TSP. Lecture Notes in Artificial Intelligence vol. 4617 (2007), Springer, Berlin 351-360
32. Potvin J.Y. Genetic algorithms for the traveling salesman problem. Annals of Operations Research 63 (1996) 339-370
33. Rosenkrantz D.J., Stearns R.E., and Lewis II P.M. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing 6 (1977) 563-581
34. Rossi F., and Gavioli I. Aspects of heuristic method in the "probabilistic traveling salesman problem". In: Andreatta G., Mason F., and Serafini P. (Eds). Advanced School on Stochastics in Combinatorial Optimization (1987), World Scientific Publisher, Singapore 214-227
35. Tang H., and Miller-Hooks E. Approximate procedures for the probabilistic traveling salesperson problem. Transportation Research Record 1882 (2004) 27-36
36. Whitley D., Starkweather T., and Fuquay D. Scheduling problems and traveling salesmen: the genetic edge recombination operator. Proceedings of the Third International Conference on Genetic Algorithms (ICGA'89) (1989), Morgan Kaufmann, Palo Alto, CA 133-140