考虑路段行驶时间不确定的集装箱堆场集卡最短路径优化

Optimization of truck route in container yard against the indeterminacy of driving time

摘要: 集装箱卡车(以下简称为“集卡”)在堆场内的作业是集装箱港口中影响作业效率的重要一环。由于堆场内经常性发生拥堵，集卡在堆场内的行驶时间是不确定的。从以下两个角度来研究该不确定性：第一，集卡在单一路段受到的干扰；第二，相邻路段之间的相关性。综合这两种情况，建立考虑拥堵和路段相关性的可靠最短路径的表示方法，最后提出一个混合整数规划模型对集卡路径进行优化，并使用智能求解算法提高求解效率。结果表明，通过考虑路段拥堵及路段间的相关性而求得的可靠最短路径能够有效减少集卡在堆场内的行驶时间，提高作业效率。

Abstract: The time needed for a truck to drive through a passage is hard to predict because of traffic jam, which happens quite often. The indeterminacy is investigated for two situations: the truck to be blocked by an obstacle on a passage and the traffic in adjoin passages to interfere the movement of the truck. The way of define a reliable shortest route is explored and a mixed integer programming model is built to optimize the truck route. An intelligent method is used to solve the problem. Tests show that the method can effectively improve the efficiency of yard operation.