Skip to main content
SpringerLink
Log in

Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem

  • Chapter
Nature Inspired Cooperative Strategies for Optimization (NICSO 2007)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 129))

Abstract

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a new memetic algorithm for GTSP which clearly outperforms the state-of-the-art memetic algorithm of Snyder and Daskin [21] with respect to the quality of solutions. Computational experiments conducted to compare the two heuristics also show that our improvements come at a cost of longer running times, but the running times still remain within reasonable bounds (at most a few minutes). While the Snyder-Daskin memetic algorithm is designed only for the Symmetric GTSP, our algorithm can solve both symmetric and asymmetric instances. Unlike the Snyder-Daskin heuristic, we use a simple machine learning approach as well.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bang-Jensen J, Gutin G (2000) Digraphs: Theory, Algorithms and Applications. Springer, London

    Google Scholar 

  2. Bean JC (1994) ORSA J Computing 6:154–160

    MATH  Google Scholar 

  3. Ben-Arieh D, Gutin G, Penn M, Yeo A, Zverovitch A (2003) Operations Research Letters 31:357–365

    Article  MATH  MathSciNet  Google Scholar 

  4. Bruckschlegel T (2005) Microbenchmarking C++, C#, and Java, Dr. Dobbs, www.ddj.com/ 184401976/ 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

    Google Scholar 

  6. Fischetti M, Salazar-González JJ, Toth P (2003) In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press

    Google Scholar 

  7. Gutin G (2003) Traveling Salesman Problems. In: Gross J, Yellen J (eds) Handbook of Graph Theory. CRC Press

    Google Scholar 

  8. Gutin G, Yeo A (2003) Ausralasian J Combinatorics 27:149–154

    MATH  MathSciNet  Google Scholar 

  9. Gutin G, Punnen AP (eds) (2002) Traveling Salesman Problem and its Variations. Kluwer, Dordrecht

    MATH  Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  13. Krasnogor N, Smith JE (2005) IEEE Trans Evolut Comput 9:474–488

    Article  Google Scholar 

  14. Laporte G, Asef-Vaziri A, Sriskandarajah C (1996) J Operational Research Society 47: 1461–1467

    MATH  Google Scholar 

  15. Lawler EL, Lenstra JK, Rinooy Kan AHG, Shmoys DB (eds) (1985) Travelling Salesman Problem: a Guided Tour of Combinatorial Optimization. Wiley, Chichester

    Google Scholar 

  16. Moscato P, Memetic algorithms: A short introduction. In: Corne D, Glover F, Dorigo M (eds) (1999) New Ideas in Optimization. McGraw-Hill

    Google Scholar 

  17. Motta L, Ochi LS, Martinhon C (2001) Grasp metaheuristics for the generalized covering tour problem. In: MIC2001-4th Metaheuristics Int Conf. Porto, Portugal

    Google Scholar 

  18. Ong YS, Lim MH, Zhu N, Wong W (2006) IEEE Trans Systems Man Cybern Part B 36:141–152

    Google Scholar 

  19. Reinelt G (1991) ORSA J Computing 3:376–384

    MATH  Google Scholar 

  20. Samanlioglu F, Kurz MB, Ferrell WG, Tangudu S (2006) Intern J Operational Res 2:47–63

    Article  Google Scholar 

  21. Snyder LV, Daskin MS (2006) Europ J Operational Research 174:38–53

    Article  MATH  MathSciNet  Google Scholar 

  22. Spears WM, De Jong KA (1991) On the virtues of parameterized uniform crossover. In: Proc 4th Int Conf Genetic Algorithms

    Google Scholar 

  23. Tsai H-K, Yang J-M, Tsai Y-F, Kao C-Y (2004) IEEE Transactions on SMC-part B 34:1718–1729

    Google Scholar 

  24. Zverovitch A (2002) GTSP instances. www.cs.rhul.ac.uk/home/zvero/GTSPLIB/

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, TW20 OEX, UK

    Gregory Gutin & Daniel Karapetyan

  2. Automatic Scheduling and Planning group, School of Computer Science and I.T., University of Nottingham, Nottingham, NG8 IBB, UK

    Natalio Krasnogor

Authors
  1. Gregory Gutin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Karapetyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Natalio Krasnogor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Sciences and Information Technology, University of Nottingham, Jubilee Campus, Nottingham, NG81BB, UK

    Natalio Krasnogor

  2. Department of Mathematics and Computer Science, University of Catania, v.le A. Doria, 6, 95125, Catania, Italy

    Giuseppe Nicosia  & Mario Pavone  & 

  3. Department of Computer Science and Artificial Intelligence E.T.S. Ingenieria Informatica C/ Periodista Daniel Saucedo Aranda s/n, University of Granada, 18071, Granada, Spain

    David Pelta

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gutin, G., Karapetyan, D., Krasnogor, N. (2008). Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78987-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78986-4

  • Online ISBN: 978-3-540-78987-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation