A scatter search based approach with approximate evaluation for the heterogeneous probabilistic traveling salesman problem

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 1603-1609

  Liu, Yu Hsin ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; COMPUTER SIMULATION; NUMERICAL METHODS; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM;

PROBABILISTIC TRAVELING SALESMAN PROBLEM; SALESMAN PROBLEM; SCATTER SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 34547277312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. P. Jaillet, "Probabilistic traveling salesman problems," Ph.D. dissertation, Massachusetts Institute of Technology, MA, USA, 1985.
2. D. Bertsimas, "Probabilistic combinatorial optimization problems," Ph.D. dissertation, Massachusetts Institute of Technology, MA, USA, 1988.
3. D. Bertsimas, P. Jaillet, and A. R. Odoni, "A priori optimization," Oper. Res., vol. 38, no. 6, pp. 1019-1033, 1990.
4. P. Jaillet, "A priori solution of a traveling salesman problem in which a random subset of the customers are visited," Oper. Res., vol. 36, no. 6, pp. 929-936, 1988.
5. J. J. Bartholdi, L. K. Platzman, R. L. Collins, and W. H. Warden, "A minimal technology routing system for meals on wheels," Interfaces, vol. 13, no. 3, pp. 1-8, 1983.
6. H. Tang and E. Miller-Hooks, "Approximate procedures for the probabilistic traveling salesperson problem," Transport. Res. Rec., vol. 1882, pp. 27-36, 2004.
7. D. Bertsimas, P. Chervi, and M. Peterson, "Computational approaches to stochastic vehicle routing problems," Transport. Sci., vol. 29, no. 4, pp. 342-352, 1995.
8. P. Jaillet, "Stochastic routing problems," In G. Andreatta, F. Mason, and P. Serafini (Eds.), Advanced School on Stochastics in Combinatorial Optimization, World Scientific Publisher, Singapore, pp. 192-213, 1987.
9. D. Bertsimas and L. Howell, "Further results on the probabilistic traveling salesman problem," Eur. J. Oper. Res., vol. 65, no. 1, pp. 68-95, 1993.
10. L. Bianchi, J. Knowles, and N. Bowler, "Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms," Eur. J. Oper. Res., vol. 162, no. 1, pp. 206-219, 2005.
11. F. Rossi and I. Gavioli, "Aspects of heuristic method in the probabilistic traveling salesman problem," In G. Andreatta, F. Mason, and P. Serafini (Eds.), Advanced School on Stochastics in Combinatorial Optimization, World Scientific Publisher, Singapore, pp. 214-227, 1987.
12. G. Laporte, F. Louveaux, and H. Mercure, "A priori optimization of the probabilistic traveling salesman problem," Oper. Res., vol. 42, no. 3, pp. 543-549, 1994.
13. L. Bianchi, L. M. Gambardella, and M. Dorigo, "An ant colony optimization approach to the probabilistic traveling salesman problem," Lect. Notes Comput. Sc. 2439, pp. 883-892, 2002.
14. L. Bianchi, L. M. Gambardella, and M. Dorigo, "Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic," Lect. Notes Comput. Sc. 2463, pp. 176-187, 2002.
15. Y.-H. Liu, R.-C. Jou, and C.-J. Wang, "Genetic algorithms for the probabilistic traveling salesman problem," in Proceedings of the Conference on E-Logistics, Taoyuan, Taiwan, pp. 77-82, 2004.
16. N. E. Bowler, T. M. A. Fink, and R. C. Ball, "Characterization of the probabilistic traveling salesman problem," Phys. Rev. E, vol. 68, no. 3, 036703, 2003.
17. F. Glover, M. Laguna, and R. Martí, "Scatter search," In A. Ghosh and S. Tsutsui (Eds.), Advances in Evolutionary Computing: Theory and Applications, Springer, Berlin, pp. 519-538, 2003.
18. M. Laguna and R. Martí, Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, London, 2003.
19. Y.-H. Liu, Incorporating Scatter Search and Threshold Accepting in Multinomial Probit Model Estimation. Technical Report NSC 93-2416-H-260-002, National Science Council, Taiwan; 2005.
20. P. Jaillet and A. R. Odoni, "The probabilistic vehicle routing problem," In B. L. Golden and A. A. Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp. 293-318, 1988.
21. F. Chu, N. Labadi, and C. Prins, "A scatter search for the periodic capacitated arc routing problem," Eur. J. Oper. Res., vol. 169, no. 2, pp. 586-605, 2006.
22. R. A. Russell and W. -C. Chiang, "Scatter search for the vehicle routing problem with time windows," Eur. J. Oper. Res., vol. 169, no. 2, pp. 606-622, 2006.
23. S. Scheuerer and R. Wendolsky, "A scatter search heuristic for the capacitated clustering problem," Eur. J. Oper. Res., vol. 169, no. 2, pp. 533-547, 2006.
24. C. A. J. Hurkens and G. J. Woeginger, "On the nearest neighbor rule for the traveling salesman problem," Oper. Res. Lett., vol. 32, no. 1, pp. 1-4, 2004.
25. J.-Y. Potvin, "Genetic algorithms for the traveling salesman problem," Ann. Oper. Res., vol. 63, pp. 339-370, 1996.
26. D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling salesmen: The genetic edge recombination operator," in Proc. 3rd Int. Conf. Genet. Algorithm (ICGA '89), pp. 133-140, 1989.
27. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.