Research on an improved multi-strategy ant colony algorithm for TSP problem

MaRDI QIDQ5196555zbMATH OpenFDO

Authors Baoping Shang, Jianqiang Jiao, Jie Pei, Kun Zhou, Fuhong Yan

Publication date 2 October 2019

zbMATH Keywords

ant colony algorithmelite strategymean crossover operatortraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved ant colony algorithm for traveling salesman problems
• An improved ant colony algorithm for solving TSP problems
• An improved ant colony algorithm and its application in TSP
• Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
• An ant colony algorithm based on clustering and partition optimization

Cited in

(9)

• A new hybrid heuristic approach for solving large traveling salesman problem
• A solution of TSP based on the ant colony algorithm improved by particle swarm optimization
• Research on multi-objective simulated annealing algorithm for multi-traveling salesman problem
• A new algorithm for traveling salesman problems based on negative feedback ant colony algorithm supervised by 2-optimization
• Multi-colony ant algorithm using pheromone crossover based on multi-optimum for TSP
• An improved ant colony algorithm for solving TSP problems
• scientific article; zbMATH DE number 6452666 (Why is no real title available?)
• An ant colony algorithm based on clustering and partition optimization
• Control parameter optimisation using the evidence framework for the ant colony optimisation algorithm

This page was built for publication: Research on an improved multi-strategy ant colony algorithm for TSP problem

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