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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Xu, C., Chang, H.-Y., Xu, J.: Novel Ant Colony Optimization Algorithm with Estimation of Distribution. Computer Science 32 (2010)
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)
Hu, Z., Zhao, M.: Simulation on Traveling Salesman Problem (TSP) Based on Artificial Bees Colony Algorithm. Transactions of Beijing Institute of Technology 29 (2009)
Huang, B.-Z., Xiao, J.: Solving traveling salesman problem with improved MIMIC algorithm. Computer Engineering and Design 31 (2010)
Zhou, S.-D., Sun, Z.-Q.: A Survey on Estimation of Distribution Algorithms. Acta Automatica Sinica (2007)
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)
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)
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)
Wang, L., Wang, S.-Y., Xu, Y.: An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Systems with Applications 39 (2012)
Wang, X., Li, Y.-X.: A Solution to Traveling Salesman Problem by Using Local Evolutionary Algorithm. Computer Engineering 32 (2006)
He, X.-J., Zeng, J.-C.: Solving TSP Problems with Estimation of Distribution Algorithm Based on Superiority Pattern Junction. PTA&ATÂ 24 (2011)
Sheng, J., Xie, S.-Q.: Probability and mathematical statistics. Higher Education Press, BeiJing (2008)
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)
Hauschild, M., Pelikan, M.: An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation 1 (2011)
Hao, C.-W., Gao, H.-M.: Modified Decimal MIMIC Algorithm for TSP. Computer Science 39 (2012)
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)
Hauschild, M., Pelikan, M.: An introduction and survey of estimation of dis-tribution algorithms. Swarm and Evolutionary Computation 1, 111–128 (2011)
Cheng-Wei, H., Hui-Min, G.: Modified Decimal MIMIC Algorithm for TSP. Computer Science 39, 233–236 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)