An Algorithm on Solving Car Sequencing Problem based on ACO
- https://doi.org/10.2991/csic-15.2015.7How to use a DOI?
- Car sequencing problem, Ant colony, Optimization, Pheromone
Car sequencing problem is a auto-production-scheduling problem that meets certain conditions on the production line of cars.In this paper, we propose an algorithm, ACO-sequencing, on solving car sequencing problem based on ACO which introduces the two kinds of structure of pheromone. By comparing the results of two kinds of pheromone structure in the role of problem we combine the two kinds of pheromone to make it better to solve the problem. At the same time the optimization results are improved step by step by changing the parameters. Experiment shows, our algorithm has certain advantages in solving efficiency.
- © 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/).
Cite this article
TY - CONF AU - Yaoyao Bi AU - Chong Gao AU - Zhengyu Lu AU - Yonggang Zhang PY - 2015/07 DA - 2015/07 TI - An Algorithm on Solving Car Sequencing Problem based on ACO BT - Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication PB - Atlantis Press SP - 26 EP - 30 SN - 2352-538X UR - https://doi.org/10.2991/csic-15.2015.7 DO - https://doi.org/10.2991/csic-15.2015.7 ID - Bi2015/07 ER -