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
- Huijun Sun (ORCID: https://orcid.org/0000-0002-3989-7391)
- Jianjun Wu (ORCID: https://orcid.org/0000-0001-6953-5511)
- Lisheng Ma (ORCID: https://orcid.org/0000-0003-3900-3025)
- Hao Fu (ORCID: https://orcid.org/0000-0002-5199-862X)
Institutions
- Beijing Jiaotong University (CN)
- Dalian University of Technology (CN)
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