Ant colony optimization for navigating complex labyrinths

DOI10.1007/3-540-39205-X_74MaRDI QIDQ4427007zbMATH OpenFDO

Authors Zhong Yan, Chun-Wie Yuan

Publication date 18 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2639/26390445.htm

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) Programming involving graphs or networks (90C35)

Recommendations

• A novel ant colony optimization algorithm for the shortest-path problem in traffic networks
• AI 2005: Advances in Artificial Intelligence
• A novel ant colony optimization algorithm for robot path planning
• Ant Colonies Optimization (ACO) for the solution of the Vehicle Routing Problem (VRP)
• Ant algorithms solve difficult optimization problems

Cited in

(1)

• Path efficiency of ant foraging trails in an artificial network

This page was built for publication: Ant colony optimization for navigating complex labyrinths

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