Skip to main content
SpringerLink
Log in

A SN P System for Travelling Salesman Problem

  • Conference paper
  • First Online:
Human Centered Computing (HCC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11354))

Included in the following conference series:

Abstract

The Spiking Neural P system is a branch of the neuronal-like P system in the membrane system with great parallelism. However, The Travelling Salesman Problem is a long-term NP-hard problem that finds the minimum costly Hamiltonian cycles in a weighted undirected graph. In this paper, we use the rules of division and dissolution of spiking neurons, combined with the idea of point-by-point traversal, we find all Hamiltonian cycles in weighted undirected graphs. Then computing by the binary form of the spike, resulting in the minimum cost Hamiltonian cycles. A bi-directional weighted digraph is applied to prove the feasibility of the algorithm in this paper. This method takes full advantage of the great parallelism of the SN P system, using fewer neurons and simpler rules and procedures to solve Travelling Salesman Problem.

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 EPUB and 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

References

  1. Guo, P., Dai, Y.: A P system for travelling salesman problem. In: 18th International Conference on Membrane Computing (CMC 2018), pp. 147–165. International Membrane Computing Society, 24–28 July 2017

    Google Scholar 

  2. Vitale, A., Mauri, G., Zandron, C.: Simulation of a bounded symport/antiport P system with Brane calculi. Biosystems 91(3), 558–571 (2008)

    Article  Google Scholar 

  3. Martin-Vide, C., P\(\breve{a}\)un, Gh., Rodríguez-Patón, A.: On P systems with membrane creation. Comput. Sci. J. Mold. 9(2), 134–145 (2001)

    Google Scholar 

  4. Mart, C., P\(\breve{a}\)un, Gh., Pazos, J.: Tissue P systems. Theor. Comput. Sci. 296(2), 295–326 (2003)

    Google Scholar 

  5. Freund, R., P\(\breve{a}\)un, Gh., Pérez-Jiménez, M.J.: Tissue P systems with channel states. Theor. Comput. Sci. 330(1), 101–116 (2005)

    Google Scholar 

  6. Zhang, X.Y., Zeng, X.X., Luo, B., Xu, J.B.: J. Comput. Theoret. Nanosci. 9, 769 (2012)

    Article  Google Scholar 

  7. Song, T., Jiang, Y., Shi, X.L., Zeng, X.X.: J. Comput. Theoret. Nanosci. 10, 999 (2013)

    Article  Google Scholar 

  8. Zhao, Y., Liu, X., Wang, W.: Spiking neural P systems with neuron division and dissolution. PLOS ONE 11(9), e0162882 (2016)

    Article  Google Scholar 

  9. Cooper, J., Nicolescu, R.: The travelling salesman problem in cP systems. In: The Sixth Asian Conference on Membrane Computing (ACMC 2017), pp. 9–21 (2017)

    Google Scholar 

  10. Guo, P., Liu, Z.J.: Moderate ant system: an improved algorithm for solving TSP. In: 7th International Conference on Natural Computation, pp. 1190–1196 (2011)

    Google Scholar 

  11. He, J., Xiao, J., Shao, Z.: An adaptive membrane algorithm for solving combinatorial optimization problems. Acta Math. Sci. 34(5), 1377–1394 (2014)

    Article  MathSciNet  Google Scholar 

  12. Manalastas, P.: Membrane computing with genetic algorithm for the travelling salesman problem. In: Nishizaki, S., Numao, M., Caro, J., Suarez, M.T. (eds.) Theory and Practice of Computation: 2nd Workshop on Computation: Theory and Practice, pp. 116–123. Springer, Tokyo (2013). https://doi.org/10.1007/978-4-431-54436-4_9

    Chapter  Google Scholar 

  13. Cabarle, F.G.C., Adorna, H.N., Pérez-Jiménez, M.J., Song, T.: Spiking neural P systems with structural plasticity. Neural Comput. Appl. 26(8), 1905–1917 (2015). https://doi.org/10.1007/s00521-015-1857-4

    Article  MATH  Google Scholar 

  14. Cabarle, F.G.C., Adorna, H.N., Pérez-Jiménez, M.J.: Sequential spiking neural P systems with structural plasticity based on max/min spike number. Neural Comput. Appl. 27(5), 1337–1347 (2016). https://doi.org/10.1007/s00521-015-1937-5

    Article  Google Scholar 

  15. Song, T., Zheng, P., Wong, M.L.D., Wang, X.: Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control. Inf. Sci. 372, 380–391 (2016). https://doi.org/10.1016/j.ins.2016.08.055

    Article  Google Scholar 

  16. Zhang, X., Pan, L., P\(\breve{a}\)un, A.: On universality of axon P systems. IEEE Trans. Neural Netw. Learn. Syst. 26(11), 2816–2829 (2015). https://doi.org/10.1109/TNNLS.2015.2396940. PMID: 25680218

  17. He, J., Zhang, K.: A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem. Fundam. Inform. 136(3), 199–208 (2015)

    MathSciNet  MATH  Google Scholar 

  18. Smith, S.L., Imeson, F.: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. Comput. Oper. Res. 87, 1–19 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

Project is supported by National Natural Science Foundation of China (61472231, 61502283, 61876101, 61802234, 61806114), Ministry of Eduction of Humanities and Social Science Research Project, China (12YJA630152), Social Science Fund Project of Shandong Province, China (16BGLJ06, 11CGLJ22), China Postdoctoral Project (40411583).

Author information

Authors and Affiliations

  1. Business School, Shandong Normal University, Jinan, China

    Hui Zhang, Laisheng Xiang & Xiyu Liu

Authors
  1. Hui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laisheng Xiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiyu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiyu Liu .

Editor information

Editors and Affiliations

  1. South China Normal University, Guangzhou, China

    Yong Tang

  2. Wuhan University of Technology, Wuhan City, China

    Qiaohong Zu

  3. CINVESTAV, Mexico City, Mexico

    José G. Rodríguez García

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, H., Xiang, L., Liu, X. (2019). A SN P System for Travelling Salesman Problem. In: Tang, Y., Zu, Q., Rodríguez García, J. (eds) Human Centered Computing. HCC 2018. Lecture Notes in Computer Science(), vol 11354. Springer, Cham. https://doi.org/10.1007/978-3-030-15127-0_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-15127-0_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-15126-3

  • Online ISBN: 978-3-030-15127-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation