Skip to main content
SpringerLink
Log in

Adaptive Neighborhood Search’s DGSO Applied to Travelling Saleman Problem

  • Conference paper
  • First Online:
Bio-Inspired Computing -- Theories and Applications (BIC-TA 2015)

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

Included in the following conference series:

  • 1916 Accesses

Abstract

In order to further study the effectiveness and applicability of the glowworm swarm optimization algorithm, this paper proposed a discrete glowworm swarm optimization algorithm with an adaptive neighborhood search, and used it to solve traveling salesman problem (TSP). Based on the analysis and optimization of the different genetic operations, a new adaptive DGSO algorithm is presented (ADGSO), which is effective for both local search and global search. And we defined a new kind of glowworm, which can adjust the flight length of particles by self-adapting. By solving the different instances of TSP, experimental results indicate that ADGSO has a remarkable quality of the global convergence reliability and convergence velocity. It solved the problems of traditional DGSO algorithm “premature”. Unlike existing TSP approaches that often aggregate multiple criteria and constraints into a compromise function, the proposed ADGSO optimizes all routing constraints and objectives simultaneously, which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence trace. The ADGSO is applied to solve the TSP, which yields solutions better than or competitive as compared to the best solutions published in literature.

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. Zhou, K., Chen, J.: Simulation DNA algorithm of set covering problem. Appl. Math. Inf. Sci. 8, 139–144 (2014)

    Article  MathSciNet  Google Scholar 

  2. Song, T., Pan, L., Wang, J., et al.: Normal forms of spiking neural P systems with anti-spikes. IEEE Trans. Nanobiosci. 11(4), 352–359 (2012)

    Article  Google Scholar 

  3. Zhou, K., Fan, L.L., Shao, K.: Simulation DNA algorithm model of satisfiability problem. J. Comput. Theor. Nanosci. 12, 1220–1227 (2015)

    Article  Google Scholar 

  4. Zhou, K., Tong, X.J., Xu, J.: Closed circle DNA algorithm of change positive-weighted hamilton circuit problem. J. Syst. Eng. Electron. 20, 636–642 (2009)

    Google Scholar 

  5. Song, T., Pan, L., Păun, G.: Asynchronous spiking neural P systems with local synchronization. Inf. Sci. 219, 197–207 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zhou, Y.Q., Huang, Z.X., Liu, H.X.: Discrete glowworm swarm optimization algorithm for TSP problems. Acta Electronica Sin. 40, 1164–1170 (2012)

    Google Scholar 

  7. Krishnand, K.N., Ghose, D.: Glowworm swarm optimisation: a new method for optimising multi-modal functions. Int. J. Comput. Intell. Stud. 1, 93–119 (2009)

    Article  Google Scholar 

  8. Li, H.Z., Yang, J.H.: Application in TSP based on genetic algorithm. Comput. Knowl. Technol. 6(3), 672–673 (2010)

    MathSciNet  Google Scholar 

  9. Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)

    Article  Google Scholar 

  10. Song, T., Pan, L., Jiang, K., et al.: Normal forms for some classes of sequential spiking neural P systems. IEEE Trans. Nanobiosci. 12(3), 255–264 (2013)

    Article  Google Scholar 

  11. Yao, M.H., Wang, N., Zhao, L.P.: Improved simulated annealing algorithm and genetic algorithm for TSP. Comput. Eng. Appl. 49(14), 60–65 (2013)

    Google Scholar 

  12. Zhong, Y.W., Yang, J.G., Ning, Z.Y.: Discrete particle swarm optimization algorithm for TSP problem. Syst. Eng. Theory Pract. 26(6), 88–94 (2006)

    Google Scholar 

  13. He, Y., Liu, G.Y.: Research on solving TSP in tabu search algorithm. J. Southwest China Normal Univ. 27(3), 341–345 (2002)

    Google Scholar 

  14. TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/?C=D;O=A

  15. Song, T., Pan, L.: Spiking neural P systems with rules on synapses working in maximum spikes consumption strategy. IEEE Trans. Nanobiosci. 14(1), 38–44 (2015)

    Article  Google Scholar 

  16. Song, T., Pan, L.: Spiking neural P systems with rules on synapses working in maximum spiking strateg. IEEE Trans. Nanobiosci. 14(4), 465–477 (2015)

    Article  Google Scholar 

  17. Zhang, X., Pan, L., Paun, A.: On the universality of axon P systems. IEEE Trans. Neural Networks Learn. Syst. (2015). doi:10.1109/TNNLS.2015.2396940

  18. Shi, X., Wang, Z., Deng, C., Song, T., Pan, L., Chen, Z.: A novel bio-sensor based on DNA strand displacement. Plos One 9, e108856 (2014)

    Article  Google Scholar 

  19. Wang, X., Miao, Y., Cheng, M.: Finding motifs in DNA sequences using low-dispersion sequences. J. Comput. Biol. 21(4), 320–329 (2014)

    Article  MathSciNet  Google Scholar 

  20. Wang, X., Miao, Y.: GAEM: a hybrid algorithm incorporating GA with EM for planted edited motif finding problem. Curr. Bioinform. 9(5), 463–469 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This project was supported by National Natural Science Foundation of China (Grant No. 61179032), and the Graduate Innovation Fund of Wuhan Polytechnic University (2014cx007). In addition, we would also thank every authors appeared in the references.

Author information

Authors and Affiliations

  1. School of Math and Computer, Wuhan Polytechnic University, Wuhan, 430023, Hubei, China

    Wenbo Dong, Kang Zhou, Qinhong Fu & Yingying Duan

Authors
  1. Wenbo Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qinhong Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yingying Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kang Zhou .

Editor information

Editors and Affiliations

  1. Xidian University, Xi'an, China

    Maoguo Gong

  2. Huazhong Univ. of Science and Technology, Wuhan, China

    Pan Linqiang

  3. University of Petroleum, Qingdao, China

    Song Tao

  4. University of Science and Technology of China, Hefei, China

    Ke Tang

  5. Anhui University, Hefei, China

    Xingyi Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, W., Zhou, K., Fu, Q., Duan, Y. (2015). Adaptive Neighborhood Search’s DGSO Applied to Travelling Saleman Problem. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49014-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49013-6

  • Online ISBN: 978-3-662-49014-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation