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 条
  • [41] Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic
    Gallart Suarez, Joseph
    Tupia Anticona, Manuel
    ARTIFICIAL INTELLIGENCE IN THEORY AND PRACTICE III, 2010, 331 : 243 - 249
  • [42] An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem
    Lai, Xiaofan
    Xu, Liang
    Xu, Zhou
    Du, Yang
    INFORMS JOURNAL ON COMPUTING, 2023, 35 (05) : 1179 - 1194
  • [43] A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem
    Berbotto, Leonardo
    Garcia, Sergio
    Nogales, Francisco J.
    ANNALS OF OPERATIONS RESEARCH, 2014, 222 (01) : 153 - 173
  • [44] Two objective functions for a real life Split Delivery Vehicle Routing Problem
    Uldry, Marc
    Widmer, Marino
    Hertz, Alain
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 1290 - 1299
  • [45] Research on Collaborative Task Planning Method for Split Delivery Vehicle Routing Problem
    Zhang, Jia
    Hong, Rui
    Dong, Qichen
    2024 IEEE 18TH INTERNATIONAL CONFERENCE ON CONTROL & AUTOMATION, ICCA 2024, 2024, : 785 - 790
  • [46] The Vehicle Routing Problem with Split Delivery and Heterogeneous Trucks and Commodities: A Case Study
    Fahmy, Sherif A.
    2020 IEEE 7TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA 2020), 2020, : 900 - 904
  • [47] Local search-based metaheuristics for the split delivery vehicle routing problem
    Derigs, U.
    Li, B.
    Vogel, U.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (09) : 1356 - 1364
  • [48] An effective memetic algorithm with population management for the split delivery vehicle routing problem
    Boudia, Mourad
    Prins, Christian
    Reghioui, Mohamed
    HYBRID METAHEURISTICS, PROCEEDINGS, 2007, 4771 : 16 - 30
  • [49] A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem
    Leonardo Berbotto
    Sergio García
    Francisco J. Nogales
    Annals of Operations Research, 2014, 222 : 153 - 173
  • [50] The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints
    Bortfeldt, Andreas
    Yi, Junmin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 545 - 558
12345