期刊文献+

考虑动态度和时间窗的两级车辆路径问题 被引量:3

Two-echelon vehicle routing problem with time window considering dynamic degree
下载PDF
导出
摘要 为应对由客户的动态需求、大型货车的限行政策及配送时间窗的限制给供应商制定科学配送计划带来的严峻挑战,设计考虑动态度和时间窗的两级车辆路径优化方法。该方法基于客户动态增量概率阈值及动态度构建响应增量需求的车辆路径更新策略;将连续两级车辆路径优化问题映射为由配送中心到中转站和由中转站到客户的两个子网络的带时间窗的车辆路径问题(VRPTW),并在并行模拟退火算法框架下融合Or-opt,2-opt,2-opt*,Swap/shift 4种邻域搜索策略求解VRPTW。用数据案例对模型及算法进行验证,表明所提策略及方法能较好地满足供应商对客户动态需求的响应,且具有良好的鲁棒性。 Considering the dynamic characteristics of manufacturing unit needs,the line-limiting policy of large trucks and the exact constraint of delivery time,a two-echelon vehicle routing optimization method with time window considering dynamic degree was designed.Based on the customer dynamic incremental probability threshold and dynamic degree,an optimized routing update strategy in response to incremental demand was constructed.The continuous dual network optimization was innovatively mapped to the Vehicle Routing Problem with Time Windows(VRPTW)optimization of two sub-networks,including from the suburban delivery centre to the city delivery centre and from the city delivery centre to the customer.The four neighborhood search strategies of Or-opt,2-opt,2-opt*and Swap/shift were merged to improve the parallel simulated annealing algorithm.Company case was used to verify the model and method,and the results show that the proposed method could better meet the agility response of suppliers to the dynamic needs of customers,and had good robustness.
作者 林明锦 王建新 王超 LIM Ming Kim;WANG Jianxin;WANG Chao(College of Mechanical and Vehicle Engineering, Chongqing University, Chongqing 400044, China;College of Economics and Management, Taiyuan University of Technology, Taiyuan 030002, China;College of Economics and Management, Beijing University of Technology, Beijing 100124, China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2022年第6期1870-1887,共18页 Computer Integrated Manufacturing Systems
基金 重庆市科学技术局资助项目(cstc2019jscx-msxmX0189) 国家自然科学基金资助项目(72071006,62073007)。
关键词 动态度 需求不确定 两级车辆路径 并行算法 模拟退火算法 dynamic degree uncertain demand two-echelon vehicle routing parallel algorithm simulated annealing algorithm
  • 相关文献

参考文献5

二级参考文献36

  • 1王正国,刘振元,王红卫.适应性禁忌搜索算法求解带回程的时变速度车辆路径问题[J].计算机集成制造系统,2006,12(9):1453-1458. 被引量:4
  • 2DANTZIG G B, RAMSER J H. The truck dispatching prob- lem[J]. Management Science, 1959,6 (1) : 80-91.
  • 3BEASLEY J E. Adapting the savings algorithm for varying in- ter-customer travel times[J]. Omega, 1981,9(6) : 658-659.
  • 4SOLOMON M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Opera- tions Research, 1987,5(2) : 254-265.
  • 5FIGLIOZZI M A. The time dependent vehicle routing problem with time windows.. Benchmark problems, an efficient solution algorithm, and solution characteristics[J]. Transportation Re- search Part E: Logistics and Transportation Review, 2012, 48 (3) : 616-636.
  • 6MALANDRAKI C, DASKIN M S. Time dependent vehicle routing problems: Formulations, properties and heuristic algo- rithms[J]. Transportation Science,1992,26(3):185-200.
  • 7PARK Y B, SONG S H. Vehicle scheduling problems with time-varying speed[J]. Computers Industrial Engineering, 1997,33(3) :853-856.
  • 8PARK Y B. A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds [J]. Computers & Industrial Engineering, 2000,38 (1) : 173-187.
  • 9HILL A V, BENTON W, Modelling intra-city time-dependent travel speeds for vehicle scheduling problems[J]. Journal of the Operational Research Society, 1992,43 (3) : 343-851.
  • 10ICHOUA S, GENDREAU M, POTVIN J Y. Vehicle dispatc hing with time-dependent travel times[J]. European Journal of Operational Research, 2003,144(2) : 379-396.

共引文献105

同被引文献28

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部