多集装箱堆场空间分配与车辆调度集成问题的建模与优化  

Modeling and optimizing for the integrated problem with container storage allocation and truck scheduling

作　　者：李坤[1] 唐立新[2] 陈树发[3] 

机构地区：[1]天津工业大学管理学院,天津300387 [2]东北大学物流优化与控制研究所,沈阳110004 [3]天津工业大学电气工程与自动化学院,天津300387

出　　处：《系统工程理论与实践》2014年第1期115-121,共7页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(71032004)

摘　　要：论文研究卸载集装箱堆场空间分配与车辆调度的集成作业问题.在该问题中,卸载集装箱动态到达,车辆循环使用,需要同时决策集装箱堆放位置及车辆的分配和路线.对此问题建立整数规划数学模型,考虑车辆调度约束以及堆场吊机操作等实际约束,目标函数为最小化makespan.根据问题的特点设计两阶段禁忌搜索算法来求解此问题.在实验中,通过将禁忌搜索算法的结果同标准优化软件CPLEX所求得的最优解或下界比较,算法求得了其中7组算例的最优解且剩余算例平均偏差小于5%,说明所设计的算法可以有效地解决该集成问题.The integrated problem with truck scheduling and storage allocation was researched in this paper. Here, the container＇s arrival was dynamic and truck was used circularly, so the containers stacking position and truck scheduling had to be decided simultaneously. It was formulated as an integer program- ming model to minimize makespan of the whole discharging course. In the model, the truck scheduling constraints and stack crane operation constraints were also considered. Two stages tabu search algorithm was designed for solving above problem. The new method was compared with software CPLEX 11.0. The experiment demonstrates that the two stages tabu search obtains optimal,solution for seven cases of total cases and the average gap of left cases is less than 570. The experimental results show that this algorithm can solve this integrated problem effectively.

关 键 词：集装箱堆场 车辆调度 Tabu SEARCH MAKESPAN 

分 类 号：F253[经济管理—国民经济]