Memetic algorithm for the generalized asymmetric traveling salesman problem

Studies in Computational Intelligence

Volumn 129, Issue , 2008, Pages 199-210

  Gutin, Gregory ^a   Karapetyan, Daniel ^a   Krasnogor, Natalio ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44949128098     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78987-1_19     Document Type: Article

References (24)

1. Bang-Jensen J, Gutin G (2000) Digraphs: Theory, Algorithms and Applications. Springer, London
2. Bean JC (1994) ORSA J Computing 6:154-160
3. Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A (2003) Operations Research Letters 31:357-365
4. Bruckschlegel T (2005) Microbenchmarking C++, C#, and Java, Dr. Dobbs, www.ddj.com/184401976
5. Fischetti M, Salazar-González JJ, Toth P (2002) The generalized traveling salesman and orientering problems. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht
6. Fischetti M, Salazar-González JJ, Toth P (2003) In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press
7. Gutin G (2003) Traveling Salesman Problems. In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press
8. Gutin G, Yeo A (2003) Ausralasian J Combinatorics 27:149-154
9. Gutin G, Punnen AP (eds) (2002) Traveling Salesman Problem and its Variations. Kluwer, Dordrecht
10. Johnson DS, Gutin G, McGeoch L, Yeo A, Zhang X, Zverovitch A (2002) Experimental Analysis of Heuristics for ATSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht
11. Johnson DS, McGeoch L (2002) Experimental Analysis of Heuristics for STSP. In: Gutin G, Punnen AP (eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht
12. Krasnogor N, Smith JE (2001) Emergence of profitable search strategies based on a simple inheritanc mechanism. In: Spector L et al (eds) Intern Genetic and Evolut Comput Conf (GECCO2001). Morgan Kauffman, San Francisco
13. Krasnogor N, Smith JE (2005) IEEE Trans Evolut Comput 9:474-488
14. Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) J Operational Research Society 47: 1461-1467
15. Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester
16. Moscato P, Memetic algorithms: A short introduction. In: Corne D, Glover F, Dorigo M (eds) (1999) New Ideas in Optimization. McGraw-Hill
17. Motta L, Ochi LS, Martinhon C (2001) Grasp metaheuristics for the generalized covering tour problem. In: MIC2001-4th Metaheuristics Int Conf. Porto, Portugal
18. Ong YS, Lim MH, Zhu N, Wong W (2006) IEEE Trans Systems Man Cybern Part B 36:141-152
19. Reinelt G (1991) ORSA J Computing 3:376-384
20. Samanlioglu F, Kurz MB, Ferrell WG, Tangudu S (2006) Intern J Operational Res 2:47-63
21. Snyder LV, Daskin MS (2006) Europ J Operational Research 174:38-53
22. Spears WM, De Jong KA (1991) On the virtues of parameterized uniform crossover. In: Proc 4th Int Conf Genetic Algorithms
23. Tsai H-K, Yang J-M, Tsai Y-F, Kao C-Y (2004) IEEE Transactions on SMC-part B 34:1718-1729
24. Zverovitch A (2002) GTSP instances. www.cs.rhul.ac.uk/home/zvero/GTSPLIB/