铁路集装箱中心站多轨道吊柔性协同调度优化

针对铁路集装箱中心站轨道吊协同装卸调度(RMGCS)问题,考虑多轨道吊间的作业干涉和安全距离约束,建立目标函数为最小化集装箱完工时间的混合整数规划数学模型。结合RMGCS问题特性,提出一种考虑多轨道吊柔性协同作业的改进麻雀搜索算法(ISSA),首先,提出能够解决多轨道吊间作业冲突的任务分配策略和干涉判断方法;其次,设计自适应非线性动态安全值,平衡全局和局部搜索;再次,改进加入者更新移动方式,使其在全维度上靠近最优解;最后,引入LOV(largest-order-value)规则,将个体从实数向量映射到集装箱整数序列。为了验证问题和算法的有效性,分别利用ISSA与其他算法求解不同样本规模的算例,结果表明：ISSA在不同样本规模的RMGCS问题求解上,均具有更好的寻优效果。此外,所提出的柔性协同调度模式相比现有的固定范围顺序装卸调度模式,使样本量为45的装卸作业总完工时间缩短了15.5%。

Flexible Cooperative Scheduling Optimization of Multiple Rail Mounted Gantry Cranes in Railway Container Terminals

This paper proposes a mathematical model of mixed integer programming for Rail Mounted Gantry CraneCollaborative Scheduling (RMGCS) in railway container terminals. The objective of the model is minimizing thecompletion time and the operation interference and safety distance constraints between multiple RMGs are consideredin the modeling. Based on the characteristics of the RMGCS problem, an Improved Sparrow Search Algorithm (ISSA)is proposed considering the flexible cooperative operation of multiple RMGs. A task allocation strategy and aninterference judgment method are used to solve the conflicts between multiple RMGs. An adaptive nonlinearitydynamic safety value is designed to balance global and local search. The joiner's update movement method is improvedto make it closer to the optimal solution in all dimensions. The largest-order-value (LOV) rule was introduced to mapindividuals from the real number vector to the container operation sequence. To verify the effectiveness of the problemand algorithm, the ISSA and other algorithms are used to solve container task examples with different sample sizes.The results show that the ISSA has better optimization effect in solving RMGCS problems with different sample sizes.In addition, the proposed flexible collaborative scheduling mode reduces the total completion time of loading andunloading operations with a sample size of 45 by 15.5% compared to the existing fixed- range sequential loading andunloading scheduling mode.