Modeling and Simulation about TSP Based on Simulated Annealing Algorithm

Jian Zhuang Zhi; Gui Bo Yu; Shi Jie Deng; Zhi Ling Chen; Wen Ya Bai

doi:10.4028/www.scientific.net/AMM.380-384.1109

Paper Titles

Research on Localization Principle and Method for Multistation Range-only Target Tracking System
p.1091

Adaptive Resource Allocation Algorithm for OFDMA System Based on Ant Colony Algorithm
p.1096

Inertia Simulation for Aircraft Braking Hardware-in-the-Loop Simulation
p.1101

On-Demand Routing Algorithm Base on Energy Balancing in MANET
p.1105

Modeling and Simulation about TSP Based on Simulated Annealing Algorithm
p.1109

Research on the Prediction of Protein Functional Sites Based on the Dimension Reduction Algorithm
p.1113

Mobile Robot Navigation Using ARTQL Algorithm with Novelty Driven Mechanism
p.1117

Simulating Liquid Dynamics by a Particle-Based Method
p.1121

Information Fusion Algorithm for Electromechanical Equipment Based on DS Evidence Theory
p.1125

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 380-384Modeling and Simulation about TSP Based on...

Modeling and Simulation about TSP Based on Simulated Annealing Algorithm

Abstract:

The simulated annealing algorithm is applied on traveling salesman problem (TSP), which the genetic algorithm solving in while the earliness phenomena appear. Modeling and Simulation about TSP Based on Simulated Annealing Algorithm have been done. The simulation results have proved that the simulated annealing algorithm is better in searching in the global searching than the genetic algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 380-384)

Pages:

1109-1112

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.380-384.1109

Citation:

Cite this paper

Online since:

August 2013

Authors:

Jian Zhuang Zhi, Gui Bo Yu, Shi Jie Deng, Zhi Ling Chen, Wen Ya Bai

Keywords:

Modeling, Simulated Annealing Algorithm, TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] H. Papadimitriou, The Euclidean traveling salesman problem is NP-complete, Theoretical Computer Science, 1977 4(3), pp.237-244.

DOI: 10.1016/0304-3975(77)90012-3

Google Scholar

[2] Liang Yanchun, Ge Hongwei, Zhou Chunguang, et al, Solving traveling salesman problems by genetic algorithms, Progress in Natural Science, 2003, 13(2), pp.135-141.

DOI: 10.1080/10020070312331343280

Google Scholar

[3] K. Savla, E. Frazzoli, F. Bullo, Traveling salesperson problems for the dubins vehicle, IEEE Trans. on Automatic Control, vol. 53, 2008, pp.1378-1391.

DOI: 10.1109/tac.2008.925814

Google Scholar

[4] He Jian, Zhang Hong-jun, Wang Zhi-teng et al, An Improved Evolutionary Algorithm for TSP Based on Nearest Neighbor Strategy, Computer and Modernization, vol. 204, 2001, pp.1-5.

Google Scholar

[5] Jayalakshmi G A, Sathiamoorthy S, Rajaram R, A hybrid genetic algorithm: A new approach to solve traveling salesman problem, International Journal of Computation Engineering Scinece, 2001, 2(2) : 339-355.

DOI: 10.1142/s1465876301000350

Google Scholar

[6] Wei Yingzi, et al, A novel greedy genetic algorithm for traveling salesman problem, Computer Engineering, vol. 30, 2004, pp.19-20.

Google Scholar

[7] Song Wei, Han Song-chen, Airport staff scheduling based on queuing theory and simulated annealing, Information Technology, vol. 8, 2012, pp.148-156.

Google Scholar