Effective neighborhood structures for the generalized traveling salesman problem

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

Volumn 4972 LNCS, Issue , 2008, Pages 36-47

  Hu, Bin ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Generalized traveling salesman problem; Network design; Variable neighborhood search

Indexed keywords

CLUSTERING ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; PLATES (STRUCTURAL COMPONENTS);

EUROPEAN; EVOLUTIONARY COMPUTATION (EC); GENERALIZED TRAVELING SALESMAN PROBLEMS; GEOGRAPHICAL CLUSTERING; HEIDELBERG (CO); INCREMENTAL EVALUATION; LARGE NEIGHBORHOOD; LIN-KERNIGHAN; META HEURISTICS; MINIMUM COSTS; NEIGHBORHOOD STRUCTURES; ROUND TRIPS; SPEED UPS; VARIABLE NEIGHBORHOOD SEARCH (VNS);

TRAVELING SALESMAN PROBLEM;

EID: 47249157722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78604-7_4     Document Type: Conference Paper

References (23)

1. Behzad, A., Modarres, M.: A new efficient transformation of the generalized traveling salesman problem into traveling salesman problem. In: Proceedings of the 15th International Conference of Systems Engineering, pp. 6-8 (2002)
2. Dimitrijevic, V., Saric, Z.: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs. Information Science 102(1-4), 105-110 (1997)
3. Feremans, C.: Generalized Spanning Trees and Extensions. PhD thesis, Universite Libre de Bruxelles (2001)
4. Fischetti, M., Salazar, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks 26, 113-123 (1995)
5. Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research 45, 378-394 (1997)
6. Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search. In: Voss, S., et al. (eds.) Meta-heuristics, Advances and trends in local search paradigms for optimization, pp. 433-458. Kluwer Academic Publishers, Dordrecht (1999)
7. Henry-Labordere.: The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem. RAIRO Operations Research B2, 43-49 (1969)
8. Huang, H., Yang, X., Hao, Z., Wu, C., Liang, Y., Zhao, X.: Hybrid chromosome genetic algorithm for generalized traveling salesman problems. Advances in Natural Computation 3612, 137-140 (2005)
9. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. Journal of the Operational Research Society 47(12), 1461-1467 (1996)
10. Laporte, G., Mercure, H., Nobert, Y.: Generalized traveling salesman problem through n sets of nodes: The asymmetric case. Discrete Applied Mathematics 18, 185-197 (1987)
11. Laporte, G., Nobert, Y.: Generalized traveling salesman problem through n sets of nodes: An integer programming approach. INFOR 21(1), 61-75 (1983)
12. Laporte, G., Semet, F.: Computational evaluation of a transformation procedure for the symmetric generalized traveling salesman problem. INFOR 37(2), 114-120 (1999)
13. Lien, Y.N., Ma, E., Wah, B.W.S.: Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Information Sciences 74(1-2), 177-189 (1993)
14. Lin, S.: Computer solutions of the traveling salesman problem. Bell Systems Computer Journal 44, 2245-2269 (1965)
15. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Systems 5, 299-326 (1991)
16. Noon, C., Bean, J.C.: An efficient transformation of the generalized traveling salesman problem. INFOR 31(1), 39-44 (1993)
17. Noon, C.E.: The Generalized Traveling Salesman Problem. PhD thesis, University of Michigan (1988)
18. Renaud, J., Boctor, F.F.: An efficient composite heuristic for the symmetric generalized traveling salesman problem. European Journal of Operational Research 108, 571-584 (1998)
19. Renaud, J., Boctor, F.F., Laporte, G.: A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing 8(2), 134-143 (1996)
20. Saskena, J.P.: Mathematical model of scheduling clients through welfare agencies. Journal of the Canadian Operational Research Society 8, 185-200 (1970)
21. Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. Technical Report 04T-018, Dept. of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA (2004)
22. Srivastava, Kumar, S.S.S., Garg, R.C., Sen, P.: Generalized traveling salesman problem through n sets of nodes. CORS Journal 7, 97-101 (1969)
23. Wu, C., Liang, Y., Lee, H.P., Lu, C.: Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining. Physical Review E 70(1) (2004)