A memetic algorithm for the generalized traveling salesman problem

Natural Computing

Volumn 9, Issue 1, 2010, Pages 47-60

  Gutin, Gregory ^a   Karapetyan, Daniel ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Asymmetric generalized traveling salesman problem; Generalized traveling salesman problem; Genetic algorithm; Local search; Memetic algorithm

Indexed keywords

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; COMPUTER ANALYSIS; GENERALIZED TRAVELING SALESMAN PROBLEM; GENETIC ALGORITHM; K NEAREST NEIGHBOR; MUTATION; PROBLEM SOLVING;

EID: 77949912268     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-009-9111-6     Document Type: Article

References (20)

1. Bang-Jensen J, Gutin G (2000) Digraphs: theory, algorithms and applications. Springer-Verlag, London, 754 pp
2. D Ben-Arieh G Gutin M Penn A Yeo A Zverovitch 2003 Transformations of generalized ATSP into ATSP Oper Res Lett 31 357 365 1033.90097 10.1016/S0167-6377(03)00031-2 1993925
3. Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceeding of the international joint conference on artificial intelligence, pp 162-164
4. M Fischetti JJ Salazar-González P Toth 1997 A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Oper Res 45 3 378 394 0893.90164 10.1287/opre.45.3.378 1644243
5. Fischetti M, Salazar-González JJ, Toth P (2002) The generalized traveling salesman and orientering problems. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht
6. Gutin G (2003) Traveling salesman problems. In: Gross J, Yellen J (eds) Handbook of Graph theory. CRC Press, Boca Raton
7. Gutin G, Punnen AP (eds) (2002) Traveling salesman problem and its variations. Kluwer, Dordrecht
8. G Gutin A Yeo 2003 Assignment problem based algorithms are impractical for the generalized TSP Australas J Combinatorics 27 149 154 1107.90038 1955395
9. Hart WE, Krasnogor N, Smith JE (eds) (2004) Recent advances in memetic algorithms. Studies in fuzzyness and soft computing, vol 166. Springer, Berlin
10. Johnson DS, McGeoch L (2002) Experimental analysis of heuristics for STSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht
11. Johnson DS, Gutin G, McGeoch L, Yeo A, Zhang X, Zverovitch A (2002) Experimental analysis of heuristics for ATSP. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, Dordrecht
12. N Krasnogor J Smith 2005 A tutorial for competent memetic algorithms: model, taxonomy and design issues IEEE Trans Evol Comput 9 474 488 10.1109/TEVC.2005.850260
13. G Laporte A Asef-Vaziri C Sriskandarajah 1996 Some applications of the generalized travelling salesman problem J Oper Res Soc 47 12 1461 1467 0873.90104
14. Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester
15. Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimization. McGraw-Hill, New York
16. Reinelt G (1991) TSPLIB-a traveling salesman problem library. ORSA J Comput 3:376-384. http://www.crpc.rice.edu/softlib/tsplib/
17. Silberholz J, Golden B (2007) The generalized traveling salesman problem: a new genetic algorithm approach. In: Baker et al. (eds) Extending the horizons: advances in computing, optimization, and decision technologies, vol 37. Springer, Heidelberg, pp 165-181
18. LV Snyder MS Daskin 2006 A random-key genetic algorithm for the generalized traveling salesman problem Eur J Oper Res 174 38 53 1116.90091 10.1016/j.ejor.2004.09.057 2245925
19. Tasgetiren MF, Suganthan PN, Pan Q-K (2007) A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. In: GECCO '07: proceedings of the 9th annual conference on genetic and evolutionary computation, pp 158-167
20. H-K Tsai J-M Yang Y-F Tsai C-Y Kao 2004 An evolutionary algorithms for large traveling salesman problems IEEE Trans SMC B 34 1718 1729