A hybrid random-key genetic algorithm for a symmetric travelling salesman problem

International Journal of Operational Research

Volumn 2, Issue 1, 2007, Pages 47-63

  Samanlioglu, Funda ^a   Kurz, Mary Beth ^b   Ferrell, William G ^b   Tangudu, Sarat ^b  

^a NORTH CAROLINA A AND T STATE UNIVERSITY   (United States)

^b Clemson University   (United States)

Author keywords

GA; Genetic Algorithms; Local search; Memetic algorithms; Random key; Travelling Salesman Problem; TSP

Indexed keywords

EID: 33846051076     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2007.011443     Document Type: Article

References (18)

1. Aarts, E.H.L., Korst, J.H.M. and van Laarhoven, P.J.M. (1997) 'Simulated Annealing', in E. Aarts and J.K. Lenstra (Eds). Local Search in Combinatorial Optimization, New York: Wiley, pp.91-120.
2. Aras, N., Altinel, K. and Oommen, J. (2003) 'A Kohonen-like decomposition method for the euclidean traveling salesman problem - KNIES_DECOM- POSE', IEEE Transactions on Neural Networks, Vol. 14, No. 4, pp.869-890.
3. Bean, J. (1994) 'Genetic algorithms and random keys for sequencing and optimization', ORSA Journal on Computing, Vol. 6, No. 2, pp.154-160.
4. Braysy, I. and Gendreau, M. (2005) 'Vehicle routing problem with time windows, Part II: metaheuristics', Transportation Science, Vol. 39, No. 1, pp. 119-139.
5. Chatterjee, S., Carrera, C. and Lynch, L. (1996) 'Theory and methodology, genetic algorithms and traveling salesman problems', European Journal of Operational Research, Vol. 93, pp.490-510.
6. Gendreau, M. and Potvin, J. (2005) 'Metaheuristics in combinatorial optimization', Annals Of Operations Research, Vol. 140, No. 1, pp.189-213.
7. Hansen, M.P. (2000) 'Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP', Journal of Heuristics, Vol. 6, pp.419-431.
8. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, Ann Arbor: The University of Michigan Press.
9. Hsu, J.C. (1996) Multiple Comparisons - Theory and Methods, Chapman & Hall.
10. Jaszkiewicz, A. (2002) 'Discrete optimization, genetic local search for multi-objective combinatorial optimization', European Journal of Operational Research, Vol. 137, pp.50-71.
11. Kurz, M.E. and Askin, R.G. (2004) 'Scheduling flexible flow lines with sequence-dependent setup times', European Journal of Operational Research, Vol. 159, No. 1, pp.66-82.
12. Merz, P. and Freisleben, B. (2001) 'Memetic algorithms for the traveling salesman problem', Complex Systems, Vol. 13, pp.297-345.
13. Michalewicz, Z. (2000) ' Evolutionary algorithm and their standard instances', in T. Back, D.B. Fogel and Z. Michalewicz (Eds). Evolutionary Computation 1, Basic Algorithms and Operators, Bristol: Philadelphia Institute of Physics Publishing, pp.56-61.
14. Norman, B.A. and Bean, J.C. (1999) 'A genetic algorithm methodology for complex scheduling problems', Naval Research Logistics, Vol. 46, pp. 199-211.
15. Norman, B.A. and Bean, J.C. (2000) 'Scheduling operations on parallel machine tools', IIE Transactions, Vol. 32, pp.449-459.
16. Reinelt, G. (1995) TSPLIB, Available at: http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
17. Snyder, L.V. and Daskin, M.S. (forthcoming) 'A random-key genetic algorithm for the generalized traveling salesman problem', European Journal of Operational Research.
18. Stutzle, T. and Hoos, H. (1997) 'Max-Min ant system and local search for the traveling Salesman problem', Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'97), Piscataway, NJ: IEEE Press, pp.309-314.