An ACO-Based Algorithm for Solving Path Planning Problem of Cyclic Goods-Taking

DOI

10.2991/icicci-15.2015.11How to use a DOI?

Keywords

Keywords-ant colony optimization; algorithm; path planning problem; cyclic goods-taking

Abstract

Abstract—Based on the analysis of the path planning under the cyclic goods-taking model, the mathematical model of path planning is established. After comparison and analysis of the commonly-used optimization algorithms, the Ant Colony Optimization (ACO) is adopted to solve the path planning model under the situation of cyclic goods-taking model. An auto manufacturing plant is adopted as a case, with its cyclic goods-taking path of its parts entering the plant being planned. Research finds that a satisfying transportation path under the cyclic goods-taking model with reduced transportation costs can be obtained through the ACO-based path planning.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yikui Mo
AU  - Cheng Gong
AU  - Shen Lv
PY  - 2015/09
DA  - 2015/09
TI  - An ACO-Based Algorithm for Solving Path Planning Problem of Cyclic Goods-Taking
BT  - Proceedings of the 2nd International Conference on Intelligent Computing and Cognitive Informatics
PB  - Atlantis Press
SP  - 47
EP  - 50
SN  - 1951-6851
UR  - https://doi.org/10.2991/icicci-15.2015.11
DO  - 10.2991/icicci-15.2015.11
ID  - Mo2015/09
ER  -