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

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2025-01-01 DOI:10.1016/j.orl.2024.107209

Artur Pessoa, Daniel de Araujo, Eduardo Uchoa

引用次数: 0

Abstract

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.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.