集装箱码头连续泊位-岸桥分配的仿真优化

发布时间：2018-03-15 06:25

本文选题：泊位-岸桥　切入点：偏好泊位　出处：《计算机仿真》2017年04期 　论文类型：期刊论文

【摘要】：泊位和岸桥是集装箱港口非常最要的资源,合理的分派与调度可以有效提高作业效率。集装箱码头连续泊位-岸桥分配的仿真优化研究中,大多以总在港时间最短或总成本最小为优化目标,往往忽略个体船舶的等待时间,没有兼顾服务公平性。在考虑偏好泊位的基础上,加入容忍度约束,以船舶在港总时间成本为目标,建立连续泊位-岸桥分配的非线性数学规划模型。设计求解模型的一种基于嵌套循环进化算法,内循环采用贪心算法生成相应的泊位调度计划;外循环采用遗传算法进一步生成岸桥调度计划。最后,以VC++开发仿真程序进行求解。实验结果表明,该算法能够在可接受的计算时间内获得稳定的满意解,新的泊位岸桥分配策略及算法可以较好的解决容忍度约束下的连续泊位一岸桥分配问题。
[Abstract]:Berth and shore bridge are the most important resources of container port. Reasonable allocation and scheduling can effectively improve the efficiency of operation. Most of them take the shortest total time in port or the minimum total cost as the optimization objective, and often ignore the waiting time of individual ships, and do not take into account the fairness of service. On the basis of considering the preference of berths, the tolerance constraint is added. Taking the total time cost of ship in port as the target, a nonlinear mathematical programming model of continuous berth / shore bridge allocation is established. A nested cyclic evolutionary algorithm is designed to solve the model, and the greedy algorithm is used to generate the corresponding berth scheduling plan. Genetic algorithm (GA) is used to further generate the shore bridge scheduling plan. Finally, the simulation program developed by VC is used to solve the problem. The experimental results show that the proposed algorithm can obtain a stable and satisfactory solution within an acceptable computational time. The new strategy and algorithm of berth allocation can solve the problem of continuous berth allocation under tolerance constraints.
【作者单位】：上海海事大学物流研究中心;
【基金】：国家自然科学基金资助项目(71301101) 交通运输部建设科技项目(2015328810160) 上海自然科学基金(15ZR1420200) 教育部人文社科项目(15YJC630059)
【分类号】：U691.3

【参考文献】