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 条
  • [1] SPLIT DELIVERY VEHICLE ROUTING PROBLEM
    Pelikan, Jan
    Fabry, Jan
    MATHEMATICAL METHODS IN ECONOMICS 2009, 2009, : 259 - 262
  • [2] A split delivery vehicle routing problem
    Mohri, H
    Kubo, M
    Mori, M
    Yajima, Y
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996, 39 (03) : 372 - 388
  • [3] The split delivery vehicle routing problem with minimum delivery amounts
    Gulczynski, Damon
    Golden, Bruce
    Wasil, Edward
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (05) : 612 - 626
  • [4] Split delivery vehicle routing problem with minimum delivery amounts
    Pan J.
    Fu Z.
    Chen H.
    Journal Europeen des Systemes Automatises, 2019, 52 (03): : 257 - 265
  • [5] A lower bound for the split delivery vehicle routing problem
    Belenguer, JM
    Martinez, MC
    Mota, E
    OPERATIONS RESEARCH, 2000, 48 (05) : 801 - 810
  • [6] Split Delivery Vehicle Routing Problem with Time Windows
    Cickova, Zuzana
    Reiff, Marian
    Surmanova, Kvetoslava
    MATHEMATICAL METHODS IN ECONOMICS (MME 2014), 2014, : 128 - 132
  • [7] Clustering algorithm for split delivery vehicle routing problem
    Liu, Wang-Sheng
    Yang, Fan
    Li, Mao-Qing
    Chen, Pei-Zhi
    Kongzhi yu Juece/Control and Decision, 2012, 27 (04): : 535 - 541
  • [8] Optimal Solutions for the Vehicle Routing Problem with Split Demands
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    COMPUTATIONAL LOGISTICS, ICCL 2019, 2019, 11756 : 189 - 203
  • [9] Emission Vehicle Routing Problem with Split Delivery and a Heterogeneous Vehicle Fleet
    Vornhusen, Benedikt
    Kopfer, Herbert
    COMPUTATIONAL LOGISTICS (ICCL 2015), 2015, 9335 : 76 - 90
  • [10] An adaptive memory algorithm for the split delivery vehicle routing problem
    Rafael E. Aleman
    Xinhui Zhang
    Raymond R. Hill
    Journal of Heuristics, 2010, 16 : 441 - 473
12345