摘要
翻箱问题属于NP难问题,基本蚁群算法在求解该问题上收敛困难且寻优能力低。因此,本文提出了一种适合于翻箱模型的改进型蚁群算法,在概率决策机制、解的重构、信息素更新机制三个方面对基本蚁群算法进行改进。最后通过与其他算法的分析比较,验证了该改进算法的可行性与有效性。
When applied to the re-handling problem which is NP-hard problem, the basic ant colony algorithm has the shortcomings of low convergence speed and the poor searching efficiency. To solve this problem, a optimized ant colony algorithm which is adequate for the model of container-re-handling is proposed, and this algo- rithm is improved on the aspects of the decision mechanism of probability, the re-constructing of results and up- dating mechanism of pheromone. Consequently, through comparison with other algorithm, the simulation result proves the validity and practicability of this improved ant colony algorithm.
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2012年第4期249-255,共7页
Operations Research and Management Science
基金
国家自然科学基金资助项目(基于GASD的车间布局重构优化设计基础研究
70801036)
关键词
运筹学
翻箱优化
蚁群算法
集装箱
operational research
container rehandling optimization
ant colony algorithm
container
