Skip to main content

Distributed Evolutionary Algorithms to TSP with Ring Topology

  • Conference paper
Computational Intelligence and Intelligent Systems (ISICA 2009)

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

Included in the following conference series:

Abstract

Distributed Evolutionary Algorithms (dEAs) are stochastic search methods applied successfully in many searches, optimization, and machine learning problems. This paper proposes a dEA based on IGT. The dEA uses a ring topology ,with each population choosing a random individual from it in a migration interval. The individual will be sent to next population and replace the worst individual of the population. It can be seen from the experiment that dEA with Ring transmission can produce better solutions when the population size of a TSP problem is large enough. The numerical results show the utility, versatility, efficiency and potential value of the proposed distributed evolutionary algorithm.

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 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. Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6(5) (October 2002)

    Google Scholar 

  2. Tsujimura, Y., Gen, M.: Entropy-based genetic algorithm for solving TSP. In: Proceedings of the 1998 2nd International Conference on knowledge-Based Intelligent Electronic Systems (KES 1998), April 21-23 (1998)

    Google Scholar 

  3. Michalewicz, Z.: Genetic algorithms + data structure = evolution programs. Springer, Heidelberg (1996)

    Google Scholar 

  4. Sun, J., Zhang, L., Chi, X., Wang, D.: Network parallel computing and distributed programming environment. Science Press, Beijing (1997)

    Google Scholar 

  5. Xiong, S., Li, C.: Distributed Evolutionary Algorithms to TSP Based on Cluster of PC. Mini-Micro Systems 24(6) (June 2003)

    Google Scholar 

  6. Cai, Z., Guo, P., Gao, W., Wei, W., Kang, L.: An Improved Evolutionary Algorithm for theTraveling Salesman Problem. Chinese journal of Computers 28(5) (May 2005)

    Google Scholar 

  7. Tao, G., Michalewicz, Z.: Inver-over operator for the TSP. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, p. 803. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, S., Zhu, L., Zhang, F., He, Y., Xue, H. (2009). Distributed Evolutionary Algorithms to TSP with Ring Topology. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2009. Communications in Computer and Information Science, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04962-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04962-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04961-3

  • Online ISBN: 978-3-642-04962-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics