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

发布时间：2018-03-29 07:09

本文选题：集装箱堆场　切入点：车辆调度　出处：《系统工程理论与实践》2014年01期

【摘要】：论文研究卸载集装箱堆场空间分配与车辆调度的集成作业问题.在该问题中,卸载集装箱动态到达,车辆循环使用,需要同时决策集装箱堆放位置及车辆的分配和路线.对此问题建立整数规划数学模型,考虑车辆调度约束以及堆场吊机操作等实际约束,目标函数为最小化makespan.根据问题的特点设计两阶段禁忌搜索算法来求解此问题.在实验中,通过将禁忌搜索算法的结果同标准优化软件CPLEX所求得的最优解或下界比较,算法求得了其中7组算例的最优解且剩余算例平均偏差小于5%,说明所设计的算法可以有效地解决该集成问题.
[Abstract]:In this paper, the integrated operation of space allocation and vehicle scheduling in unloading container yard is studied. In this problem, the dynamic arrival of unloading container and the recycling of vehicle are discussed. It is necessary to make decision on container stacking position and vehicle assignment and route simultaneously. An integer programming mathematical model is established to solve this problem, which takes into account vehicle scheduling constraints and actual constraints such as yard crane operation and so on. The objective function is to minimize makespan.According to the characteristics of the problem, a two-stage Tabu search algorithm is designed to solve the problem. In experiments, the results of the Tabu search algorithm are compared with the optimal solution or lower bound obtained by the standard optimization software CPLEX. The optimal solution of 7 examples is obtained and the average deviation of the remaining examples is less than 5, which shows that the proposed algorithm can effectively solve the integration problem.
【作者单位】：天津工业大学管理学院;东北大学物流优化与控制研究所;天津工业大学电气工程与自动化学院;
【基金】：国家自然科学基金(71032004)
【分类号】：U695.22;U691.3

【共引文献】