On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables

被引：0
|
作者：
de Araujo, Daniel [1 ]
de Araujo, Daniel [1 ]
Uchoa, Eduardo [1 ]
机构：
[1] Univ Fed Fluminense, Rua Passo Patria 156, BR-24210240 Niteroi, RJ, Brazil
来源：
OPERATIONS RESEARCH LETTERS | 2025年 / 58卷
关键词：
Split delivery; Vehicle routing; Polynomial algorithm; Edge formulation;
D O I：
10.1016/j.orl.2024.107209
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Mixed integer programming formulations for the Split Delivery Vehicle Routing Problem (SDVRP) typically use edge decision variables. It was believed that feasibility couldn't be verified in polynomial time. We show that this recognition problem depends on the formulation's constraints and prove that it's strongly NP-hard for a recent formulation. With subtour elimination constraints, we provide an O(n log n)-time recognition algorithm. This challenges assumptions about edge-based formulations and provides new insights into SDVRP solution verification complexity.
引用
收藏
页数：7
相关论文
共 50 条
  • [21] A tabu search algorithm for the split delivery vehicle routing problem
    Archetti, C
    Speranza, MG
    Hertz, A
    TRANSPORTATION SCIENCE, 2006, 40 (01) : 64 - 73
  • [22] Improved lower bounds for the Split Delivery Vehicle Routing Problem
    Moreno, Lorenza
    de Aragao, Marcus Poggi
    Uchoa, Eduardo
    OPERATIONS RESEARCH LETTERS, 2010, 38 (04) : 302 - 306
  • [23] Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery
    Ren, Teng
    Luo, Tianyu
    Jia, Binbin
    Yang, Bihao
    Wang, Ling
    Xing, Lining
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 77
  • [24] Split delivery vehicle routing problem with time windows: a case study
    Latiffianti, E.
    Siswanto, N.
    Firmandani, R. A.
    INTERNATIONAL CONFERENCE ON INDUSTRIAL AND SYSTEMS ENGINEERING (ICONISE) 2017, 2018, 337
  • [25] Tabu search algorithm for the discrete split delivery vehicle routing problem
    Qiu M.
    Fu Z.
    Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2019, 40 (03): : 525 - 533
  • [26] 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
  • [27] Multi-Depot Split-Delivery Vehicle Routing Problem
    Lim, Hyunpae
    Lee, Gyu M.
    Singgih, Ivan Kristianto
    IEEE ACCESS, 2021, 9 (09): : 112206 - 112220
  • [28] Improved Ant Colony Algorithm for the Split Delivery Vehicle Routing Problem
    Ma, Xiaoxuan
    Liu, Chao
    APPLIED SCIENCES-BASEL, 2024, 14 (12):
  • [29] New exact solution approaches for the split delivery vehicle routing problem
    Ozbaygin, Gizem
    Karasan, Oya
    Yaman, Hande
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2018, 6 (01) : 85 - 115
  • [30] An optimization-based heuristic for the split delivery vehicle routing problem
    Archetti, Claudia
    Speranza, M. Grazia
    Savelsbergh, Martin W. P.
    TRANSPORTATION SCIENCE, 2008, 42 (01) : 22 - 31
12345