Ant colony algorithm with semi-dynamic candidates list

MaRDI QIDQ3054510zbMATH OpenFDO

Authors

Publication date 5 November 2010

zbMATH Keywords

ant colony algorithmant systemsemi-dynamic candidates listtraveling salesman problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An improved ant colony algorithm for traveling salesman problems
• Solution of TSP problem by using algorithm of reactive ant colony with restricted candidate list
• An ant colony algorithm based on clustering and partition optimization
• An improved ant colony algorithm based on pheromone and applications in the TSP
• An improved ant colony algorithm for solving TSP problems

Cited in

(1)

• Solution of TSP problem by using algorithm of reactive ant colony with restricted candidate list

This page was built for publication: Ant colony algorithm with semi-dynamic candidates list

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