摘要
为了优选客户提交箱时间不确定条件下的集装箱堆场出口箱箱位,降低作业成本,提出了基于随机交箱序列的堆场箱位优选方法,即两阶段随机规划模型和基于禁忌搜索的启发式算法.模型通过优选贝位和堆栈最小化堆场龙门吊行车成本和翻箱量,探讨了随机交箱序列条件下的翻箱量和龙门吊行车成本求解方法,并针对模型最优解特点开发了基于禁忌搜索的启发式算法.模拟实验表明,该方法能够有效利用不确定集装箱交箱序列信息改善调度效果,算法能够在合理时间内获得满意解.
In order to optimize the slot allocation for export containers in container storage yard under the condition of uncertain container delivery time and reduce the activity-based cost,a slot allocation optimization method based on stochastic delivery sequence was proposed.The method is composed of two-stage stochastic programming model and tabu-search based heuristic algorithm.The bays and stacks were optimized to minimize the gantry crane cost and container reshuffling amount.In addition,the solution method for both container reshuffling amout under stochastic delivery sequence and granty crane cost was discussed.The tabu-search based heuristic algorithm was developed aiming at the characteristics of the optimum solution of the model.The simulation experiments reveal that the proposed method can utilize the uncertain information of container delivery sequence to improve the scheduling effect,and the algorithm can attain the satisfied solution in reasonable time.
出处
《沈阳工业大学学报》
EI
CAS
2011年第6期678-685,共8页
Journal of Shenyang University of Technology
基金
国家自然科学基金资助项目(71101014)
中央高校基本科研业务费专项基金资助项目(DUT10JS10)
辽宁省高等学校科研计划资助项目(2008Z056)
关键词
集装箱运输
堆场箱位优化
两阶段随机规划模型
禁忌搜索算法
随机交箱序列
翻箱率
启发式算法
模拟
container transportation
storage slot optimization
two-stage random programming model
tabu-search algorithm
stochastic delivery sequence
container reshuffling rate
heuristic algorithm
simulation
