Open Vehicle Routing Problem with Time Windows in a Real Case Application

The vehicle routing problem is a complex yet crucial issue for companies' logistical optimization. Commonly, it is one of the most interesting problem as it is encountred frequently in real life while subjecting to different constraints to optimize various criteria. In this paper, we are intere...

Full description

Saved in:
Bibliographic Details
Published in2024 International Conference on Decision Aid Sciences and Applications (DASA) pp. 1 - 5
Main Authors Nouir, Rihem, Hamdi, Imen
Format Conference Proceeding
LanguageEnglish
Published IEEE 11.12.2024
Subjects
Artificial intelligence
Companies
Dispatching
K-means based-algorithm
MILP formulation
Mixed integer linear programming
Optimization
OVRP
Testing
Time factors
Time windows
Vehicle routing
Online AccessGet full text
DOI10.1109/DASA63652.2024.10836484

Cover

More Information
Summary:The vehicle routing problem is a complex yet crucial issue for companies' logistical optimization. Commonly, it is one of the most interesting problem as it is encountred frequently in real life while subjecting to different constraints to optimize various criteria. In this paper, we are interested in the Open Vehicle Routing Problem (OVRP) with a homogeneous fleet of vehicles and time windows constraints. It is proved to be strongly NP-hard. We propose a Mixed Integer Linear Programming (MILP) which is runned by CPLEX solver to obtain optimal solution for small sized problems. However, for large sized instances, we develop an innovative K-means based-algorithm. Then, the computational results prove its performance by testing real world instances.
DOI:10.1109/DASA63652.2024.10836484