A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

被引：6
|
作者：
Damiao, Caio Marinho [1 ]
Pereira Silva, Joao Marcos [1 ]
Uchoa, Eduardo [1 ]
机构：
[1] Univ Fed Fluminense, Dept Engn Prod, Rua Passo de Patria,156,Bloco E Sala 440, BR-24210240 Niteroi, RJ, Brazil
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2023年 / 21卷 / 01期
关键词：
Routing; Column generation; Integer programming; Modeling; VARIABLE NEIGHBORHOOD SEARCH; TRAVELING SALESMAN PROBLEM; RELAXATION;
D O I：
10.1007/s10288-021-00498-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The Cumulative Capacitated Vehicle Routing Problem is a variant of the classic routing problem in which the objective function is to minimize the sum of arrival times to customers. This article proposes a model for the problem that uses position indexes in order to calculate the contribution of the travel time of an edge to the arrival times of the remaining customers on a route. The model is implemented and solved by the branch-cut-and-price (BCP) algorithm in the VRPSolver package. Computational experiments indicate that the proposed BCP model is superior to the literature, being able to solve many open instances. Good results were also obtained for the Multi-Depot variant of the problem.
引用
收藏
页码：47 / 71
页数：25
相关论文
共 50 条
  • [1] A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
    Caio Marinho Damião
    João Marcos Pereira Silva
    Eduardo Uchoa
    [J]. 4OR, 2023, 21 : 47 - 71
  • [2] A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem
    Martinelli, Rafael
    Pecin, Diego
    Poggi, Marcus
    Longo, Humberto
    [J]. EXPERIMENTAL ALGORITHMS, 2011, 6630 : 315 - +
  • [3] Improved branch-cut-and-price for capacitated vehicle routing
    Pecin D.
    Pessoa A.
    Poggi M.
    Uchoa E.
    [J]. Mathematical Programming Computation, 2017, 9 (01) : 61 - 100
  • [4] A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
    Lysgaard, Jens
    Wohlk, Sanne
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (03) : 800 - 810
  • [5] An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
    Marques, Guillaume
    Sadykov, Ruslan
    Deschamps, Jean-Christophe
    Dupas, Remy
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 114
  • [6] Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty
    Pessoa, Artur Alves
    Poss, Michael
    Sadykov, Ruslan
    Vanderbeck, Francois
    [J]. OPERATIONS RESEARCH, 2021, 69 (03) : 739 - 754
  • [7] A branch-cut-and-price algorithm for the generalized vehicle routing problem
    Reihaneh, Mohammad
    Ghoniem, Ahmed
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (02) : 307 - 318
  • [8] A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem
    Fukasawa, Ricardo
    He, Qie
    Song, Yongjia
    [J]. TRANSPORTATION SCIENCE, 2016, 50 (01) : 23 - 34
  • [9] A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
    Gauvin, Charles
    Desaulniers, Guy
    Gendreau, Michel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 50 : 141 - 153
  • [10] A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
    Pessoa, Artur
    de Aragao, Marcus Poggi
    Uchoa, Eduardo
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2007, 4525 : 150 - +
12345