Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery

被引：61
|
作者：
Subramanian, Anand [1 ,2 ]
Uchoa, Eduardo [3 ]
Pessoa, Artur Alves [3 ]
Ochi, Luiz Satoru [2 ]
机构：
[1] Univ Fed Paraiba, Dept Prod Engn, Ctr Tecnol, BR-58051970 Joao Pessoa, Paraiba, Brazil
[2] Univ Fed Fluminense, Inst Comp, BR-24220000 Niteroi, RJ, Brazil
[3] Univ Fed Fluminense, Dept Prod Engn, BR-24220000 Niteroi, RJ, Brazil
来源：
OPERATIONS RESEARCH LETTERS | 2011年 / 39卷 / 05期
关键词：
Vehicle routing; Simultaneous pickup and delivery; Branch-and-cut; ALGORITHM;
D O I：
10.1016/j.orl.2011.06.012
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are applied in a lazy fashion. The algorithm was tested in 87 instances with 50-200 customers, finding improved lower bounds and several new optimal solutions. (C) 2011 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码：338 / 341
页数：4
相关论文
共 50 条
  • [1] Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
    Anand Subramanian
    Eduardo Uchoa
    Artur Alves Pessoa
    Luiz Satoru Ochi
    Optimization Letters, 2013, 7 : 1569 - 1581
  • [2] Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
    Subramanian, Anand
    Uchoa, Eduardo
    Pessoa, Artur Alves
    Ochi, Luiz Satoru
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1569 - 1581
  • [3] Branch-and-cut algorithms for the split delivery vehicle routing problem
    Archetti, Claudia
    Bianchessi, Nicola
    Speranza, M. Grazia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (03) : 685 - 698
  • [4] The pickup and delivery problem: Faces and branch-and-cut algorithm
    Ruland, KS
    Rodin, EY
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1997, 33 (12) : 1 - 13
  • [5] Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time windows
    Bianchessi, Nicola
    Irnich, Stefan
    TRANSPORTATION SCIENCE, 2019, 53 (02) : 442 - 462
  • [6] A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
    Dominguez-Martin, Bencomo
    Hernandez-Perez, Hipolito
    Riera-Ledesma, Jorge
    Rodriguez-Martin, Inmaculada
    COMPUTERS & OPERATIONS RESEARCH, 2024, 161
  • [7] A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
    Hernández-Pérez, H
    Salazar-González, JS
    DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) : 126 - 139
  • [8] A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
    Karaoglan, Ismail
    Altiparmak, Fulya
    Kara, Imdat
    Dengiz, Berna
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) : 318 - 332
  • [9] A branch-and-cut algorithm for the vehicle routing problem with drones
    Tamke, Felix
    Buscher, Udo
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 144 : 174 - 203
  • [10] Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
    Cordeau, Jean-Francois
    Dell'Amico, Mauro
    Iori, Manuel
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (05) : 970 - 980
12345