Correction to the Paper "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows"

被引:0
|
作者
Dabia, Said [1 ]
Ropke, Stefan [2 ]
van Woensel, Tom [3 ]
机构
[1] Vrije Univ Amsterdam, Dept Operat Analyt, NL-1081 HV Amsterdam, Netherlands
[2] Tech Univ Denmark, Dept Management Engn, DK-2800 Lyngby, Denmark
[3] Eindhoven Univ Technol, Sch Ind Engn, NL-5600 MB Eindhoven, Netherlands
关键词
vehicle routing problem; column generation; time-dependent travel times; branch and price;
D O I
10.1287/trsc.2024.erratum.v58.n5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The aim of this erratum is to correct an error in the computer implementation of the algorithm proposed by Dabia, Ropke, and van Woensel [Dabia S, Ropke S, van Woensel T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Sci. 47(3):295-454]. Section 6, "Computational Results," from the original paper is rewritten to reflect the corrected implementation, the new computational setup, and the updated results.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
    Dabia, Said
    Ropke, Stefan
    van Woensel, Tom
    De Kok, Ton
    [J]. TRANSPORTATION SCIENCE, 2013, 47 (03) : 380 - 396
  • [2] Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows
    Liu, Yiming
    Yu, Yang
    Zhang, Yu
    Baldacci, Roberto
    Tang, Jiafu
    Luo, Xinggang
    Sun, Wei
    [J]. INFORMS JOURNAL ON COMPUTING, 2022, 35 (01) : 14 - 30
  • [3] A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
    Lera-Romero, Gonzalo
    Bront, Juan Jose Miranda
    Soulignac, Francisco J.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 312 (03) : 978 - 995
  • [4] A Branch and Price Heuristic Algorithm for the Vehicle Routing Problem with Time Windows
    Qian, Shu
    Hu, Rong
    Qian, Bin
    Yu, Naikang
    Shang, Qingxia
    [J]. ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT I, ICIC 2024, 2024, 14862 : 467 - 476
  • [5] A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
    Wei, Jiachen
    Poon, Mark
    Zhang, Zhenzhen
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 172
  • [6] A hybrid algorithm for time-dependent vehicle routing problem with time windows
    Pan, Binbin
    Zhang, Zhenzhen
    Lim, Andrew
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 128
  • [7] Branch and price for the vehicle routing problem with discrete split deliveries and time windows
    Salani, Matteo
    Vacca, Ilaria
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (03) : 470 - 477
  • [8] The robust vehicle routing problem with time windows: Solution by branch and price and cut
    Lu, Da
    Gzara, Fatma
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (03) : 925 - 938
  • [9] A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows
    Soler, David
    Albiach, Jose
    Martinez, Eulalia
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (01) : 37 - 42
  • [10] Multi-trip time-dependent vehicle routing problem with time windows
    Pan, Binbin
    Zhang, Zhenzhen
    Lim, Andrew
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (01) : 218 - 231