武汉理工大学学报(交通科学与工程版)2024,Vol.48Issue(6) :1030-1035.DOI:10.3963/j.issn.2095-3844.2024.06.002

运输时效不确定下中缅跨境集装箱接驳运输双边车辆调度鲁棒优化

Robust Optimization of Bilateral Vehicle Scheduling for China-myanmar Container Drayaga Under Uncertain Transportation Time

方之茗 龚健 何杰 叶云涛 张浩 张长健
武汉理工大学学报(交通科学与工程版)2024,Vol.48Issue(6) :1030-1035.DOI:10.3963/j.issn.2095-3844.2024.06.002

运输时效不确定下中缅跨境集装箱接驳运输双边车辆调度鲁棒优化

Robust Optimization of Bilateral Vehicle Scheduling for China-myanmar Container Drayaga Under Uncertain Transportation Time

方之茗 1龚健 1何杰 1叶云涛 1张浩 2张长健1
扫码查看

作者信息

  • 1. 东南大学交通学院 南京 211189
  • 2. 淮阴工学院计算机工程学院 淮安 223003
  • 折叠

摘要

文中以中缅跨境集装箱接驳运输场景下的车辆调度问题为研究对象,在现有研究的基础上,将双边车辆调度与运输时效不确定性纳入考虑,以跨境运输总成本最小化为目标,构建了双边车辆调度鲁棒优化模型;通过引入遗传算法生成初始解,并融入新的邻域变换准则,设计出变邻域禁忌搜索算法;以某物流有限公司的运输数据进行了实例分析,结果表明:相较于传统禁忌搜索算法,改进后的变邻域禁忌搜索算法寻优效率提高了 53.3%,目标函数值优化了 3.2%.

Abstract

Taking the vehicle scheduling problem under the cross-border container connection transpor-tation scenario between China and Myanmar as the research object,on the basis of existing research,the uncertainty of bilateral vehicle scheduling and transportation timeliness was taken into account.Aiming at minimizing the total cost of cross-border transportation,a robust optimization model of bi-lateral vehicle scheduling was constructed.By introducing genetic algorithm to generate initial solution and incorporating new neighborhood transformation criteria,a variable neighborhood tabu search al-gorithm was designed.Taking the transportation data of a logistics company as an example,the re-sults show that compared with the traditional tabu search algorithm,the improved variable neighbor-hood tabu search algorithm improves the optimization efficiency by 53.3%and optimizes the objective function value by 3.2%.

关键词

集装箱接驳运输/双边车辆调度/运输时效不确定性/鲁棒优化/变邻域禁忌搜索算法

Key words

container drayaga/bilateral vehicle scheduling/uncertainty of transportation time/robust optimization/variable-neighborhood taboo search algorithm

引用本文复制引用

出版年

2024
武汉理工大学学报(交通科学与工程版)
武汉理工大学

武汉理工大学学报(交通科学与工程版)

CSTPCD
影响因子:0.462
ISSN:2095-3844
段落导航相关论文