Addressing inaccessible customers in the vehicle routing problem

This paper introduces an advanced variant of the Vehicle Routing Problem with Inaccessible Customers (VRP-IC), tailored to address scenarios where customers in specific zones are rendered inaccessible due to road damage or zone controls. Customers are categorized into two segments: those reachable via traditional routes and those necessitating indirect delivery through transfer station, serviced by a distinct vehicle fleet. This paper extends the standard Vehicle Routing Problem (VRP) model to encapsulate these accessibility challenges, offering a realistic portrayal of routing difficulties posed by external constraints like natural disasters and urban restrictions. Methodologically, we employ Gurobi to solve the VRP-IC to efficiently handle the dual delivery mechanism, optimizing both direct and indirect routes while minimizing costs. This approach presents a robust solution to VRPs complicated by access limitations, particularly valuable for logistical planning in disaster-stricken or regulation-heavy areas. Numerical examples are carried out to highlight the practical relevance of our approach, showcasing its potential to revolutionize logistics planning in environments affected by accessibility constraints.

Authors

Institutions

Publication Details

Published
2025-06-16
DOI
https://doi.org/10.1117/12.3059255
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Addressing inaccessible customers in the vehicle routing problem

Huijun Sun, Jianjun Wu, Lisheng Ma, Hao Fu
Vehicle Routing Optimization Methods
article

Addressing inaccessible customers in the vehicle routing problem

Huijun Sun, Jianjun Wu, Lisheng Ma, Hao Fu
article en

Abstract

This paper introduces an advanced variant of the Vehicle Routing Problem with Inaccessible Customers (VRP-IC), tailored to address scenarios where customers in specific zones are rendered inaccessible due to road damage or zone controls. Customers are categorized into two segments: those reachable via traditional routes and those necessitating indirect delivery through transfer station, serviced by a distinct vehicle fleet. This paper extends the standard Vehicle Routing Problem (VRP) model to encapsulate these accessibility challenges, offering a realistic portrayal of routing difficulties posed by external constraints like natural disasters and urban restrictions. Methodologically, we employ Gurobi to solve the VRP-IC to efficiently handle the dual delivery mechanism, optimizing both direct and indirect routes while minimizing costs. This approach presents a robust solution to VRPs complicated by access limitations, particularly valuable for logistical planning in disaster-stricken or regulation-heavy areas. Numerical examples are carried out to highlight the practical relevance of our approach, showcasing its potential to revolutionize logistics planning in environments affected by accessibility constraints.

Beijing Jiaotong University (CN), Dalian University of Technology (CN)
Openalex Percentile: Top 81%
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.