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 条
  • [31] The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers
    Yu, Vincent F.
    Susanto, Hadi
    Yeh, Yu-Hsuan
    Lin, Shih-Wei
    Huang, Yu-Tsung
    MATHEMATICS, 2022, 10 (06)
  • [32] A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
    Subramanian, A.
    Drummond, L. M. A.
    Bentes, C.
    Ochi, L. S.
    Farias, R.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1899 - 1911
  • [33] The vehicle routing problem with simultaneous pickup and delivery and handling costs
    Hornstra, Richard P.
    Silva, Allyson
    Roodbergen, Kees Jan
    Coelho, Leandro C.
    COMPUTERS & OPERATIONS RESEARCH, 2020, 115
  • [34] A Practical Split Vehicle Routing Problem with Simultaneous Pickup and Delivery
    Tang, Guochun
    Ning, Aibing
    Wang, Kefeng
    Qi, Xiangtong
    2009 IEEE 16TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2009, : 26 - +
  • [35] A branch-and-cut algorithm for pickup-and-delivery traveling salesman problem with handling costs
    Krishnan, Devaraj Radha
    Liu, Tieming
    NETWORKS, 2022, 80 (03) : 297 - 313
  • [36] A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
    Hessler, Katrin
    Irnich, Stefan
    DISCRETE APPLIED MATHEMATICS, 2021, 288 : 218 - 234
  • [37] A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm
    Kohar, Amit
    Jakhar, Suresh Kumar
    ANNALS OF OPERATIONS RESEARCH, 2021,
  • [38] New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
    Sampaio, Afonso H.
    Urrutia, Sebastian
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 77 - 98
  • [39] A branch-and-cut algorithm for the routing and spectrum allocation problem
    Bianchetti, Marcelo
    Marenco, Javier
    DISCRETE APPLIED MATHEMATICS, 2023, 339 : 107 - 126
  • [40] Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
    Pereira, Armando Honorio
    Mateus, Geraldo Robson
    Urrutia, Sebastian Alberto
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (01) : 207 - 220
12345