时间窗和时刻表约束的多式联运路径优化

Optimization on the multimodal transport routing problem with time window and timetable constraints

为了更好地指导多式联运路径决策实践,研究了带时间窗和时刻表双重约束的多式联运路径优化问题,建立了以运输成本和中转成本构成的总成本最小化为目标的数学模型,并设计了相应的改进蚁群算法。在原有网络节点编号基础上增加一级编号区分两点间不同的运输方式,以实现蚂蚁对平行边的识别,同时在状态转移概率中加入方向启发因子,以加快算法收敛速度。最后,构建了测试算例,测试结果表明:提出的算法具有较好的稳定性,且在最优解质量方面优于对照的遗传算法和蚁群算法,能够用于此类问题的求解;时间窗和时刻表对多式联运路径决策具有显著影响,在多式联运路径决策中应予以重视。

In order to better guide the practice of multimodal transport path decision,the multimodal transport routing problem with dual constraints of time windows and timetables was studied.A mathematical model was established with the goal of minimizing the total cost of transportation and transit,and designed the corresponding improved ant colony algorithm.Based on the original network node number,a first-level number was added to distinguish between different transportation modes between the two points,so that the ants could identify parallel edges.At the same time,a direction heuristic factor was added to the state transition probability to speed up the algorithm’s convergence.Finally,a test case was constructed.The test results show that the proposed algorithm has better stability and is superior to the control genetic algorithm and ant colony algorithm in terms of optimal solution quality.It can be used to solve similar problems.Time window and timetable have a significant impact on the decision of multimodal transport routes and should be taken seriously in the decision of multimodal transport routes.