山东科学2012，Vol.25Issue(5)：92-97,108,7.
基于改进蚁群算法的集装箱装卸顺序优化研究
Research on improved Ant Colony Algorithm based optimization of container handling sequence problem
董升伟 1贾元华 1赵雪静2
作者信息
- 1. 北京交通大学交通运输学院,北京100044
- 2. 大连海事大学交通运输管理学院,辽宁大连116026
- 折叠
摘要
Abstract
We apply improved Ant Colony Algorithm to combinatorial optimization problem in order to shorten port waiting time and improve port efficiency. We initially constructed a mathematical model based on flexible job shop scheduling theory and the real situation of the ship and container crane. We then updated the pheromone of every-path based on new updating rule to jump out of its local optimism through dynamically improving pheromone volatility and pheromone intensity. We eventually performed simulation and steps analysis with C#. NET to verify its effectiveness. Experimental results show that it can optimize the sequence of container loading and unloading and shorten operation time关键词
改进蚁群算法/集装箱装卸顺序/FJSP/组合优化问题Key words
improved Ant Colony Algorithm/container handling sequence/FJSP combinatorial optimization problem分类
交通工程引用本文复制引用
董升伟,贾元华,赵雪静..基于改进蚁群算法的集装箱装卸顺序优化研究[J].山东科学,2012,25(5):92-97,108,7.
