Skip to main content

A Real Adjacency Matrix-Coded Differential Evolution Algorithm for Traveling Salesman Problems

  • Conference paper
  • First Online:
Bio-inspired Computing – Theories and Applications (BIC-TA 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 682))

  • 1160 Accesses

Abstract

Permutation-based combinatorial optimization problems have very wide application. Aim of the study is to design a real coding mechanism for evolutionary computing to solve permutation-based COPs. A real adjacency matrix-coded differential evolutionary algorithm (RAMDE) is proposed to solve traveling salesman problem (TSP): a classic COP. Considering TSP structure, a swarm of real adjacency matrices is adopted to represent individuals within population and arithmetical operators of DE execute in form of real matrices. Experimental results show that the proposed real adjacency matrix-coding mechanism is promising to extend DE for COPs.

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

Access this chapter

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. Onwubolu, G.C., Davendra, D.: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. Springer, Heidelberg (2009)

    Book  MATH  Google Scholar 

  2. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to thetraveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

  3. Chen, W., Zhang, J., Chung, H.H., et al.: A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans. Evol. Comput. 14(2), 278–300 (2010)

    Article  Google Scholar 

  4. Liu, Y., Chen, W.N., Zhan, Z.H., et al.: A set-based discrete differential evolution algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 1347–1352. IEEE press, Manchester (2013)

    Google Scholar 

  5. Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2010)

    Article  Google Scholar 

  6. Matai, R., Mittal, M.L., Singh, S.: Traveling Salesman Problem: An Overview of applications, Formulations, and Solution Approaches. Intech Open Access Publisher, Rijeka (2010)

    Google Scholar 

  7. TSPLIB. http://www.Iwr.uni_heidelberg.de

  8. Zhou, A., Zhang, Q.: A surrogate-assisted evolutionary algorithm for mini max optimization. In: IEEE Congress on Evolutionary Computation, pp. 1–7. IEEE Press, Barcelona (2010)

    Google Scholar 

  9. Song, T., Pan, L.: Spiking neural P systems with request rules. Neurocomputing 193(12), 193–200 (2016)

    Article  Google Scholar 

  10. Song, T., Liu, X., Zhao, Y., Zhang, X.: Spiking neural P systems with white hole neurons. IEEE Trans. Nanobiosci. (2016). doi:10.1109/TNB.2016.2598879

    Google Scholar 

  11. Song, T., Pan, Z., Wong, D.M., Wang, X.: Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control. Inf. Sci. 372, 380–391 (2016)

    Article  Google Scholar 

Download references

Acknowledgments

This work is financially supported by NSFC-Guangdong Joint Found (U1501254), Natural Science Foundation of China (61370102, 61202269, 61472089, 61572143, 61502108, 61502109), Natural Science Foundation of Guangdong province (2015 A030310312, 2014A030309013, 2014A030306050, 2014A030306004, 2014A030308 008), Key Technology Research and Development Programs of Guangdong Province (2015B010108006, 2015B010131015), Science and Technology Plan Project of Guangzhou City (2014Y2-00027), Opening Project of the State Key Laboratory for Novel Software Technology (KFKT2014B03, KFKT2014B23), the Fundamental Research Funds for the Central Universities, SCUT (2015PT022), Philosophy and social science project of Guangdong Provenience (GD14XYJ24), Guang dong High-level personnel of special support program (2014TQ01X664).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Han Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Wei, H., Hao, Z., Huang, H., Li, G., Chen, Q. (2016). A Real Adjacency Matrix-Coded Differential Evolution Algorithm for Traveling Salesman Problems. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 682. Springer, Singapore. https://doi.org/10.1007/978-981-10-3614-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3614-9_18

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3613-2

  • Online ISBN: 978-981-10-3614-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics