An evolutionary algorithm with diversified crossover operator for the heterogeneous probabilistic TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4617 LNAI, Issue , 2007, Pages 351-360

  Liu, Yu Hsin ^a   Jou, Rong Chang ^a   Wang, Cheng Chieh ^a   Chiu, Ching Shu ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS; PROBABILITY; PROBLEM SOLVING;

DIVERSIFIED CROSSOVER OPERATOR; MEMETIC ALGORITHM; ORDER CROSSOVER (OX); POSITION BASED CROSSOVER (PBX);

EVOLUTIONARY ALGORITHMS;

EID: 37249084630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73729-2_33     Document Type: Conference Paper

References (26)

1. Bartholdi, J.J., Platzman, L.K.: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space. Manage. Sci. 34, 291-305 (1988)
2. Bartholdi, J.J., Platzman, L.K., Collins, R.L., Warden, W.H.: A Minimal Technology Routing System for Meals on Wheels. Interfaces 13, 1-8 (1983)
3. Bertsimas, D.: Probabilistic Combinatorial Optimization Problems. Ph.D. Thesis, Massachusetts Institute of Technology, USA (1988)
4. Bertsimas, D., Chervi, P., Peterson, M.: Computational Approaches to Stochastic Vehicle Routing Problems. Transp. Sci. 29, 342-352 (1995)
5. Bertsimas, D., Howell, L.: Further Results on the Probabilistic Traveling Salesman Problem. Eur. J. Oper. Res. 65, 68-95 (1993)
6. Bianchi, L., Gambardella, L.M., Dorigo, M.: An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem. In: Guervós, J.J.M., Adamidis, P., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN VII. LNCS, vol. 2439, pp. 883-892. Springer, Heidelberg (2002)
7. Bianchi, L., Knowles, J., Bowler, N.: 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 (2005)
8. Bowler, N.E., Fink, T.M.A., Ball, R.C.: Characterization of the Probabilistic Traveling Salesman Problem. Phys. Rev. E 68, 036703 (2003)
9. Branke, J., Guntsch, M.: Solving the Probabilistic TSP with Ant Colony Optimization. J. Math. Model. Algorithm 3, 403-425 (2004)
10. Campbell, A.M.: Aggregation for the Probabilistic Traveling Salesman Problem. Comput. Oper. Res. 33, 2703-2724 (2006)
11. Gendron, B., Potvin, J.Y., Soriano, P.: Diversification Strategies in Local Search for a Nonbifurcated Network Loading Problem. Eur. J. Oper. Res. 142, 231-241 (2002)
12. Hansen, P., Mladenović, N.: Variable Neighborhood Search: Principles and Applications. Eur. J. Oper. Res. 130, 449-467 (2001)
13. Hurkens, C.A.J., Woeginger, G.J.: On the Nearest Neighbor Rule for the Traveling Salesman Problem. Oper. Res. Lett. 32, 1-4 (2004)
14. Ishibuchi, H., Shibata, Y.: Mating Scheme for Controlling the Diversity-Convergence Balance for Multiobjective Optimization. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 1259-1271. Springer, Heidelberg (2004)
15. Jaillet, P.: Probabilistic Traveling Salesman Problems. Ph.D. Thesis, Massachusetts Institute of Technology, USA (1985)
16. Jaillet, P.: A Priori Solution of a Traveling Salesman Problem in which a Random Subset of the Customers Are Visited. Oper. Res. 36, 929-936 (1988)
17. Jaillet, P., Odoni, A.R.: The Probabilistic Vehicle Routing Problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp. 293-318(1988)
18. Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, London (2003)
19. Laporte, G., Louveaux, F., Mercure, H.: A Priori Optimization of the Probabilistic Traveling Salesman Problem. Oper. Res. 42, 543-549 (1994)
20. Liu, Y.-H.: A Scatter Search Based Approach with Approximation Evaluation for the Heterogeneous Probabilistic Traveling Salesman Problem. In: Proc. of IEEE Congr. Evolut. Comput. (CEC 2006), Vancouver, Canada (2006)
21. Liu, Y.-H.: A Hybrid Scatter Search for the Probabilistic Traveling Salesman Problem. Comput. Oper. Res. 34, 2949-2963 (2007)
22. Liu, Y.-H.: Diversified Local Search Strategy under Scatter Search Framework for the Probabilistic Traveling Salesman Problem. Eur. J. Oper. Res. (accepted after minor revisions)
23. Liu, Y.-H., Jou, R.-C., Wang, C.-C.: Genetic Algorithms for the Probabilistic Traveling Salesman Problem. In: Proc. Conf. on E-Logistics, Taoyuan, Taiwan, pp. 77-82 (2004)
24. Potvin, J.Y.: Genetic Algorithms for the Traveling Salesman Problem. Ann. Oper. Res. 63, 339-370 (1996)
25. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., Whitley, C.: A Comparison of Genetic Sequencing Operators. In: Proc. 4th Int. Conf. on Genetic Algorithms (IGGA '91). University of California at San Diego, San Diego, CA, pp. 69-76 (1991)
26. Tang, H., Miller-Hooks, E.: Approximate Procedures for the Probabilistic Traveling Salesperson Problem. Transport. Res. Rec. 1882, 27-36 (2004)