集装箱码头泊位岸桥堆场分配问题研究

摘要

The optimization problem of berth-quay crane allocation and yard assignment in container terminals, as the research subject,is divided into two sub -problems, which are berth -quay crane allocation optimization problem and yard assignment optimization problem,and addressed in two-stage.In the first stage,we propose berth-quay crane allocation model with the objective to minimize the total stay time of ships,and solve the model by utilizing genetic algorithm.In the second stage, we formulate yard assignment model aimed to minimize the transportation distance between berth and yard, and simulated annealing algorithm is applied to solve it.At last,a numerical experiment is carried out,and the result indicates that the quality of the proposed solution approach is improved significantly compared with construction heuristic method, which validates the effectiveness of the proposed model and algorithm.%文中以集装箱码头泊位－岸桥－堆场分配优化问题为研究对象，将该问题分解为泊位－岸桥分配优化和堆场分配优化这两个子问题，并分两阶段求解。第一阶段以船舶在港时间最小为目标，建立了泊位－岸桥分配优化模型，并用遗传算法求解。第二阶段以船舶到堆场箱区运输距离最小为目标，建立了堆场分配优化模型，并用模拟退火算法求解。最后进行仿真算例实验，结果表明，与构造的启发式算法相比，所采用的算法求解结果有很大改进，证明了模型和算法的有效性。