Modeling and Simulation about TSP Based on Simulated Annealing Algorithm
Jian Zhuang Zhi, Gui Yu, Shi Jie Deng, Zhi Ling Chen, Wen Ya Bai
Abstract
Jian Zhuang Zhi, Gui Yu, Shi Jie Deng, Zhi Ling Chen, Wen Ya Bai
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Simulated annealing, Travelling salesman problem, Adaptive simulated annealing, Genetic algorithm, Computer science, Algorithm, Mathematical optimization, Mathematics