Simulated annealing-based ant colony algorithm for traveling salesman problems

MaRDI QIDQ3054723zbMATH OpenFDO

Authors Bo Liu, Pei-Sheng Meng

Publication date 5 November 2010

zbMATH Keywords

ant colony algorithmconvergencehybrid algorithmsimulated annealingtraveling salesman problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved ant colony algorithm for traveling salesman problems
• Solution of TSP based on an improved ant colony algorithm and its simulations
• An improved ant colony algorithm based on pheromone and applications in the TSP
• Adaptive temperature rising simulated annealing algorithm for traveling salesman problem
• Research of ant colony algorithm on TSP problems

Cited in

(10)

• An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
• A new simulated annealing approach for travelling salesman problem
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
• Ant colony optimization for the traveling purchaser problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• scientific article; zbMATH DE number 1390344 (Why is no real title available?)
• Adaptive temperature rising simulated annealing algorithm for traveling salesman problem
• Solution of TSP based on an improved ant colony algorithm and its simulations
• scientific article; zbMATH DE number 5205609 (Why is no real title available?)

This page was built for publication: Simulated annealing-based ant colony algorithm for traveling salesman problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3054723)