Skip to main content
SpringerLink
Log in

A Temporal Representation for GA and TSP

  • Conference paper
Parallel Problem Solving from Nature PPSN VI (PPSN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Included in the following conference series:

  • 7308 Accesses

Abstract

This paper proposes an algorithm that incorporates parallel message passing with an evolutionary process that is applied to the traveling salesman problem (TSP). The algorithm is a parallel system that relies on each city sending messages to all the other cities. A dilating circle represents the messages transmitted from each city. The emerging route is dependent on the collision criteria of the dilating circles. Each city is prohibited from transmitting messages until its temporal delay has expired. The delays associated with each city may be different and are represented in a genetic algorithm (GA) which is used to optimise the search space. This technique is not restricted to the euclidean domian, unlike the analogy used to explain it. This representation of the TSP requires no repair algorithm. The algorithm is a heuristic method for finding a near optimal route and tests on several TSPLIB are reported.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Aras, N., Oommen, B.J. and Altinel, I.K., The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks, 12:1273–1284, 1999.

    Article  Google Scholar 

  2. Carpaneto, G., Dell’Amico, M. and Toth, P., Exact Solution of Large-Scale, Asymetric Traveling Salesman Problems, in ACM Transactions on Mathematical Software, 12(4):394–409, 1995.

    Article  Google Scholar 

  3. Courant, R. and Robbins, H., What is Mathematics? Oxford University Press, 1941.

    Google Scholar 

  4. Dorigo M., Ant Colonies for the Traveling Salesman Problem. BioSystems, 43:73–81, 1997.

    Article  Google Scholar 

  5. Durbin, R. and D. Willshaw., An Analogue Approach to the Traveling Salesman Problem Using an Elastic Net Method., Nature 326:689–691, 1987.

    Article  Google Scholar 

  6. Holland, J. H., Adaptation in Natural and Artificial Systems. MIT Press, 1992.

    Google Scholar 

  7. Larrañaga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I. and Dizdarevic, S., Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artificial Intelligence Review, 13:129–170, 1999.

    Article  Google Scholar 

  8. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1992.

    Google Scholar 

  9. Mitchell, M., An Introduction to Genetic Algorithms. MIT Press, 1992.

    Google Scholar 

  10. Reinelt, G., TSPLIB-a traveling salesman library. ORSA journal on Computing, 3:376–384.

    Google Scholar 

  11. Tateson, R., Self-Organising Pattern Formation: Fruit Flies and Cell Phones. The fifth conference on Parallel Problem Solving from Nature, PPSNV, 5, 1999.

    Google Scholar 

  12. Walters, T., Repair and Brood Selection in the traveling salesman problem. The fifth conference on Parallel Problem Solving from Nature, PPSNV, 5, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science Hendon, Middlesex University, London, NW4 4BT, UK

    Ian Mitchell & Philip Pocknell

Authors
  1. Ian Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philip Pocknell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CMAP, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Marc Schoenauer

  2. Dept. of Mechanical Engineering Kanpur Genetic Algorithms Laboratory, Indian Institute of Technology Kanpur, Kanpur, Pin, 208 016, India

    Kalyanmoy Deb

  3. Fachbereich Informatik, Lehrstuhl für Systemanalyse, Universität Dortmund, Joseph-von-Fraunhofer-Str. 20, 44221, Dortmund, Germany

    Günther Rudolph  & Hans-Paul Schwefel  & 

  4. School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Xin Yao

  5. Projet Fractales, INRIA Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  6. Dept. de Arquitectura y Technologa de los Computadores, GeNeura Team, Universidad de Granada, Campus Fuenetenueva, s/n, Granada

    Juan Julian Merelo

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitchell, I., Pocknell, P. (2000). A Temporal Representation for GA and TSP. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation