Ant Colony Optimization for the Stochastic Loader Problem
In 2004, Tang proposed a new NP-hard combinational optimization problem that frequently arises in practice-The Loader Problem. Two special cases of the problem (the restricted loader problem and the equal loader problem) and optimal solution strategy have been considered. In this paper, we extend Tangs model by proposing the stochastic quantity of load and unload at each station that make the model more applicable in practice. An Ant Colony Optimization (ACO) algorithm is designed for solving the stochastic loader problem. Two numerical examples are presented to illustrate the application of the developed model.
ant colony optimization loader problem stochastic.
Peixin Zhao Hong Wang
School of Management Shandong University Jinan, Shandong Province,China College of Finance Shandong Institute of Light Industry Jinan, Shandong Province,China
国际会议
2006 IEEE International Conference on Information Acquisition
山东威海
英文
1052-1056
2006-08-20(万方平台首次上网日期,不代表论文的发表时间)