大宗散货泊位堆场联合调度(数学建模).doc

数学建模竞赛 题 目 大宗散货泊位堆场联合调度 关键词 优化路径成本；混合整数规划模型；蚁群算法； 泊位与岸桥联合调度模型；Memetic算法； 摘 要： 码头作为货物运输的枢纽，是现代物流调度的重要节点提高码头的运营效率，充分利用码头各种装卸设备，对促进码头所在城市或区域经济具有不可替代的作用。因此，本文为实现码头货物移动费用最小化目标，即优化运输车辆路径成本，在面向“作业面”的运输车辆作业模式下，建立了一个混合整数规划模型。针对该模型，设计了一种蚁群算法，有效求解了该问题。其次，本文为了最小化，制定了泊位选择与岸桥分配规则从而提高岸桥资源利用率。最后，基于该规则，本文建立了泊位与岸桥同步分配调度模型，对延迟完工的装卸任务量与岸桥资源调度成本设置不同级别的惩罚费用系数，并根据Memetic算法对模型求解。计算结果表明，调用规则后，离港时间明显提前，很大程度上减少了延迟停泊和离港的损失费用；此外，所需岸桥数量少于规则前，从而可减少岸桥过多移动的成本费。Abstract As the cargo transport hub, Wharf is an important part of modern logistics scheduling. It is vital to improve the efficiency of terminal operations, make full use of the port of loading and unloading equipment to promote the port city or regional economy. Therefore, for the realization of the mobile terminal cargo cost minimization, a mixed integer programming model based on work surface of the operating modes of transport vehicles is established to minimize vehicle routing optimization of transport costs. According to this model, we design a based on ant colony algorithm, and effectively solve the problem. Additionally, to minimize the total time in harbor and make full use of quay crane resources, allocation rules of the berth and quay crane are established. Finally, based on the rules, this paper established the berth and quay crane allocation synchronization scheduling model. And different levels of punishment for the delay completion tasks and quay crane movement deviating from the optimal berthing position are considered. The proposed Memetic algorithm is applied to solve it. And Experiments results show that Memetic algorithm is superior in running time. Key words: Optimize the path cost; Mixed integer programming model; Ant colony algorithm; Berth with gantry cranes scheduling model;Memetic algorithm; 问题的重述 泊位和岸桥联合计划分为船舶到达时间、船舶停靠时间、船舶停泊地点、服务船舶的岸桥数量以及服务船舶上需要装卸的集装箱数量。如下图显示了船舶靠泊过程中所包含的几个阶段，以及各个阶段船舶的周转时间。在这种情况下，涉及到离散和动态随机过程的泊位分配问题(BAP)中。为了提高运作效率，