Skip to main content

Solving TSP Problems with Hybrid Estimation of Distribution Algorithms

  • Conference paper
Intelligent Computing Theory (ICIC 2014)

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

Included in the following conference series:

  • 2965 Accesses

Abstract

In this paper, a hybrid Estimation of Distribution Algorithms is proposed to solve traveling salesman problem, and a greedy algorithm is used to improve the quality of the initial population. It sets up aBayes probabilistic model of the TSP. The roulette method is adopted to generate the new population. In order to prevent falling into local optimum, the mutation and limit were proposed to enhance the exploitation ability. At the same time, three new neighborhood search strategies and the second element optimization method are presented to enhance the ability of the local search. The simulation results and comparisons based on benchmarks validate the efficiency of the proposed 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 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. Xu, C., Chang, H.-Y., Xu, J.: Novel Ant Colony Optimization Algorithm with Estimation of Distribution. Computer Science 32 (2010)

    Google Scholar 

  2. Liang, Q.J., Shu, J., Fan, X.: TSP Modeling Method Based on Genetic Algorithm. Computer Engineering 37 (2011), Wang, D., Wu, X.-B., Mao, X.-C.: Improved Hybrid Particle Swarm Optimization Algorithm for Solving TSP. Computer Engineering 34 (2008)

    Google Scholar 

  3. Hu, Z., Zhao, M.: Simulation on Traveling Salesman Problem (TSP) Based on Artificial Bees Colony Algorithm. Transactions of Beijing Institute of Technology 29 (2009)

    Google Scholar 

  4. Huang, B.-Z., Xiao, J.: Solving traveling salesman problem with improved MIMIC algorithm. Computer Engineering and Design 31 (2010)

    Google Scholar 

  5. Zhou, S.-D., Sun, Z.-Q.: A Survey on Estimation of Distribution Algorithms. Acta Automatica Sinica (2007)

    Google Scholar 

  6. Simionescu, P.A., Beale, D.G., Dozier, G.V.: Teeth-number synthesis of a multispeed planetary transmission using an estimation of distribution algorithm. Journal of Mechanical Design 128 (2006)

    Google Scholar 

  7. Joaquin, R., Roberto, S.: Improving the discovery component of classifier systems by the application of estimation of distribution algorithms. In: Proceedings of Students Sessions, ACAI 1999, Chania, Greece (1999)

    Google Scholar 

  8. Wang, L., Wang, S., Xu, Y., et al.: A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Computers & Industrial Engineering 62 (2012)

    Google Scholar 

  9. Wang, L., Wang, S.-Y., Xu, Y.: An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Systems with Applications 39 (2012)

    Google Scholar 

  10. Wang, X., Li, Y.-X.: A Solution to Traveling Salesman Problem by Using Local Evolutionary Algorithm. Computer Engineering 32 (2006)

    Google Scholar 

  11. He, X.-J., Zeng, J.-C.: Solving TSP Problems with Estimation of Distribution Algorithm Based on Superiority Pattern Junction. PTA&AT 24 (2011)

    Google Scholar 

  12. Sheng, J., Xie, S.-Q.: Probability and mathematical statistics. Higher Education Press, BeiJing (2008)

    Google Scholar 

  13. He, X.-J., Zeng, J.-C.: Solving flexible job-shop scheduling problems with Bayesian statistical inference-based estimation of distribution algorithm. Systems Engineering Theory & Practice 32 (2012)

    Google Scholar 

  14. Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation 1 (2011)

    Google Scholar 

  15. Hao, C.-W., Gao, H.-M.: Modified Decimal MIMIC Algorithm for TSP. Computer Science 39 (2012)

    Google Scholar 

  16. Xiao-Juan, H., Jian-Chao, Z.: Solving flexible job-shop scheduling problems with Bayesian statistical inference-based estimation of distribution algorithm. Systems Engineering Theory & Practice 32, 380–388 (2012)

    Google Scholar 

  17. Hauschild, M., Pelikan, M.: An introduction and survey of estimation of dis-tribution algorithms. Swarm and Evolutionary Computation 1, 111–128 (2011)

    Article  Google Scholar 

  18. Cheng-Wei, H., Hui-Min, G.: Modified Decimal MIMIC Algorithm for TSP. Computer Science 39, 233–236 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Ma, Y. (2014). Solving TSP Problems with Hybrid Estimation of Distribution Algorithms. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theory. ICIC 2014. Lecture Notes in Computer Science, vol 8588. Springer, Cham. https://doi.org/10.1007/978-3-319-09333-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09333-8_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09332-1

  • Online ISBN: 978-3-319-09333-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics