基于多目标烟花算法的泊位-岸桥整合调度研究

Research on Berth-Quay Crane Assignment Problem Based on Multi-objective Fireworks Algorithm

泊位和岸桥是集装箱港口的两种相互关联的稀缺资源,也是船舶在港口停泊时间长短的两个决定因素。其合理的分配与调度一直是制约港口发展的重要问题,如何合理地提高泊位与岸桥的使用效率是提高集装箱码头的接纳力,提升集装箱码头生产力和服务水平的前提。本文以集装箱码头泊位-岸桥为研究对象,结合港口的实际运营情况,给出了泊位-岸桥联合调度的一个混合整数非线性规划的多目标优化模型,设计改进的多目标烟花算法对此模型进行求解,通过对爆炸产生的火花进行最优判定、变异操作,并对Pareto前端解应用外部档案机制进行存储。并进一步以国内某港口的某段时间内的实际运营情况为例,检验模型和算法的正确性。

Berth and quay crane are two interrelated scarce resource of the container port,which restrict the berthing time at the port.It is an important problem to properly deal with the berth allocation and quay crane assignment problem.How to improve the use-efficiency of berth and quay crane is the premise to improve the reception capacity of the container terminal and enhance the productivity and service level of the container terminal.In this paper,based on the container port berth and quay crane as the research object,combined the actual operation of the port,gave multi-objective optimization model of mixed integer nonlinear programming with the joint berth and quay crane scheduling,and designed an improved multi-objective fireworks algorithm to solve this model,In this paper,a new fireworks operator is designed,and then the new generated spark is to do the optimal judgment.Part of the new spark will implement mutation operation.And the front Pareto solutions were used external files mechanism to store.Taking the actual operation of a certain port in China as an example,numerical experiments are discussed and analyzed to test the model and algorithm.