单向航道船舶进港次序与泊位分配协同优化

One-way Channel Ship Inbound Order and Berth Allocation Collaborative Optimization

为提高单向航道离散泊位港口的服务水平,研究船舶进港次序和泊位分配的协同优化。考虑船舶进出港及泊位作业的实际约束,以计划期内所有船舶的锚地、泊位等待成本、滞期成本和偏离成本之和最小为目标,构建了一个混合整数规划模型,结合问题特征设计了引入禁忌搜索算法的和声搜索算法进行求解。算例结果给出了计划期内每艘船舶的进港次序和靠泊泊位,并通过与单独优化方案的对比和不同规模算例求解效果的分析,验证了模型和算法的有效性;分析进出港时段变动对船舶作业成本的影响,确定不同船舶抵港规模下的最佳进出港时段长度,为单向航道港口时长设置提供借鉴。

In order to improve the service level of the one-way channel discrete berth port, this paper studies the ship inbound order and berth allocation collaborative optimization. In the planning period, considering the practical constraints of ships entering port and berth operation, a mixed integer programming model is proposed to minimize the sum of all ships anchorage and berthing waiting cost, the demurrage cost and deviation berth cost. Then the harmony algorithm embedded Taboo Search Algorithm is designed to solve the problem. The results from numerical experiments show each ship arrival order and berthing spaces, and furthermore, the effectiveness of the model and algorithm is verified by contrast with an individual optimization scheme and the solution effect analysis of numerical changes in the size of cases. The influence of the change of the time setting on the operating cost is analyzed, determining the optimal length of time setting under different vessels scales, which can provide the reference for the time setting of the one - way channel port.