An Novel Estimation of Distribution Algorithm for TSP

Fa Hong Yu; Wei Zhi Liao; Mei Jia Chen

doi:10.4028/www.scientific.net/AMM.373-375.1089

Paper Titles

Optimization Design of Gear Train Based on Particle Swarm Optimization Algorithm
p.1072

Algorithm of Frequent Item Sets Mining Based on Index Table
p.1076

Study on Accessing to Hardware Resources in the MATLAB/Simulink Environment
p.1080

A New Optimal Binary Tree SVM Multi-Class Classification Algorithm
p.1085

An Novel Estimation of Distribution Algorithm for TSP
p.1089

An Improved Estimation of Distribution Algorithms Based on the Minimal Free Energy
p.1093

Application of Business Intelligence in Hospital Information Management
p.1098

Fault Diagnosis on Transmission System of Wind Turbines Based on Wavelet Packet Transform and RBF Neural Networks
p.1102

Applied Research of ADSHPSO Algorithm in Multi-UAV Cooperative Mission Planning
p.1106

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 373-375An Novel Estimation of Distribution Algorithm for...

An Novel Estimation of Distribution Algorithm for TSP

Abstract:

Estimation of distribution algorithms (EDAs) is a method for solving NP-hard problem. But it is hard to find global optimization quickly for some problems, especially for traveling salesman problem (TSP) that is a classical NP-hard combinatorial optimization problem. To solve TSP effectively, a novel estimation of distribution algorithm (NEDA ) is provided, which can solve the conflict between population diversity and algorithm convergence. The experimental results show that the performance of NEDA is effective.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 373-375)

Pages:

1089-1092

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.373-375.1089

Citation:

Cite this paper

Online since:

August 2013

Authors:

Fa Hong Yu, Wei Zhi Liao, Mei Jia Chen

Keywords:

Estimation of Distribution Algorithms, Probabilistic Model, Traveling Salesman Problem (TSP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Rafal Salustowicz: Probabilistic Incremental Program Evolution: Stochastic Search Through Program Space, Evolutionary Computation. Vol. 5 (1997). p.123.

DOI: 10.1162/evco.1997.5.2.123

Google Scholar

[2] David Wallin and Conor Ryan: Maintaining Diversity in EDAs for Real-Valued Optimisation Problems, In Proceedings of Frontiers in the Convergence of Bioscience and Information Technologies. Vol. 3 (2008). p.795.

DOI: 10.1109/fbit.2007.132

Google Scholar

[3] Ruan Huai-zhong and Zhang Jian-zhong: Solving TSP based on an improved genetic algorithm. Journal of Anhui Institute of Architecture & Industry, Vol. 11 (2004). p.53.

Google Scholar

[4] T. Baeck, D. Fogel, and Z. Michalewicz: Evolutionary Computation: Advanced Algorithms and Operators, Institute of Physics, London (2000).

Google Scholar

[5] De Bonet J S and Isbell C L, Viola P. Finding optima by estimating probability densities. Advances in Neural Information Processing Systems. Cambridge: MIT Press, (1997). pp.424-430.

Google Scholar

[6] Whitley D, Stark Weather T and Fuquay D.A. Scheduling problems and traveling salesman: The generic edge recombination operator[C]. Proceedings of the Third International Conference on Genetic Algorithms. SanMateo, CA: Morgan Kaufmann Publishers. (1989).

Google Scholar

[7] Information on http: /nhse. cs. rice. edu/softlib/catalog/tsplib. html.

Google Scholar