Skip to main content
SpringerLink
Log in

Membrane Computing with Genetic Algorithm for the Travelling Salesman Problem

  • Conference paper
Theory and Practice of Computation

Part of the book series: Proceedings in Information and Communications Technology ((PICT,volume 7))

Abstract

We propose a heuristic solution to the travelling salesman problem that uses membrane computing to allow for distributed asynchronous parallel computation, and genetic algorithm to select the Hamiltonian cycles that are to be included in the computation in each membrane. We applied this heuristic solution to several asymmetric problems in the TSP Lib website, and obtained solutions that are more costly than the known optimal solutions. We propose modifications to improve this heuristic solution.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Cox, A., Hosi, E., et al.: Maximum number of threads per process in Linux (2011), http://stackoverflow.com/questions/5635362/max-thread-per-process-in-linux

  2. Kjellstrm, G., Gong, Y., Renier, M., et al.: Genetic Algorithm (2012), http://en.wikipedia.org/wiki/Genetic_algorithm

  3. Nishida, T.: Membrane Algorithms: Approximate Algorithms for NP-Complete Optimization Problems (2006), http://www.springerlink.com/content/pw578u2456342074/fulltext.pdf

  4. Paun, G.: Introduction to Membrane Computing, http://psystems.disco.unimib.it/download/MembIntro2004.pdf

  5. Pesko, S.: Enumerating permutations using inversion vectors and factoradic numbering (2007), http://lin-ear-th-inking.blogspot.com/2012/11/enumerating-permutations-using.html

  6. TSPLIB: Library of travelling salesman problems, http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems and Computer Science, Ateneo de Manila, Quezon City, Philippines

    Pablo Manalastas

  2. Department of Computer Science, University of the Philippines, Quezon City, Philippines

    Pablo Manalastas

Authors
  1. Pablo Manalastas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tokyo Institute of Technology, Japan

    Shin-ya Nishizaki

  2. Osaka University, Japan

    Masayuki Numao

  3. University of the Philippines Diliman, The Philippines

    Jaime Caro

  4. De La Salle University-Manila, The Philippines

    Merlin Teodosia Suarez

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Tokyo

About this paper

Cite this paper

Manalastas, P. (2013). Membrane Computing with Genetic Algorithm for the Travelling Salesman Problem. In: Nishizaki, Sy., Numao, M., Caro, J., Suarez, M.T. (eds) Theory and Practice of Computation. Proceedings in Information and Communications Technology, vol 7. Springer, Tokyo. https://doi.org/10.1007/978-4-431-54436-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-54436-4_9

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-54435-7

  • Online ISBN: 978-4-431-54436-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation