港口集装箱码头泊位与岸桥的多阶段协作调度仿真研究

Simulation Research on Multi-stage Cooperative Scheduling of Berth and Quay Crane in Container Terminals of Port

港口集装箱码头泊位与岸桥的分配与调度分开运行有局限性,两者的协作调度能有效提高码头的装卸效率。为解决连续型泊位分配中岸桥动态调度的协作优化问题,建立以最小化延迟完工作业量和偏离最佳泊位的惩罚代价为目标的目标函数。为求解最优化目标,将协作调度分阶段进行,提出BA算法对连续泊位分配进行求解;将岸桥分配分两步进行,提出QA_B算法求解船舶泊位时的岸桥分配,QA_D算法进行船舶离港后的岸桥分配;采用粒子群算法对模型进行编解码及求解。

Berths and quay cranes separate allocation and scheduling in container terminal of port has limitations,while the collaboration scheduling between them could effectively improve the efficiency of loading and unloading of ports.To solve the collaboration optimization problem of dynamic quay crane scheduling in continuous berths allocation,an objective function based on minimizing delay completion of tasks and the punishment of deviating from the best berth cost is established.To solve this optimization objective,the collaboration scheduling is conducted in stages.Firstly,BA algorithm is presented to solve the problem of continuous berths allocation.Secondly,the quay cranes allocation is divided into two steps,QA_B algorithm is proposed to solve the quay cranes allocation when the ships enter in port,QA_D algorithm is presented to solve the quay cranes allocation when the ships depart from port.Finally,the particle swarm optimization algorithm is used to code and decode for the model solution.