A TSP algorithm based on clustering ensemble ACO and restricted solution space

MaRDI QIDQ5277553zbMATH OpenFDO

Authors Yongming Pang, Caiming Zhong, Kai Cheng

Publication date 14 July 2017

zbMATH Keywords

ant colony optimizationtraveling salesman problemco-association matrixrestricted solution space

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• An improved ant colony algorithm for traveling salesman problems
• An improved ant colony algorithm for solving TSP problems
• scientific article; zbMATH DE number 2158375
• scientific article; zbMATH DE number 6452666
• An ant colony algorithm based on clustering and partition optimization

Cited in

(5)

• Solution of TSP problem by using algorithm of reactive ant colony with restricted candidate list
• Predatory search algorithm with restriction of solution distance
• scientific article; zbMATH DE number 2158375 (Why is no real title available?)
• An ACO\&SS algorithm for traveling salesman problem
• A DSS based on hybrid ant colony optimization algorithm for the TSP

This page was built for publication: A TSP algorithm based on clustering ensemble ACO and restricted solution space

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