Development of optimization algorithms to vehicle routing problem
Saved in:
| Title: | Development of optimization algorithms to vehicle routing problem |
|---|---|
| Authors: | Muhammad Amin, Syahril Efendi, Mahyuddin K. M. Nasution, Marischa Elveny |
| Source: | Eastern-European Journal of Enterprise Technologies; Vol. 3 No. 3 (135) (2025): Control processes; 67-77 Eastern-European Journal of Enterprise Technologies; Том 3 № 3 (135) (2025): Процеси управління; 67-77 |
| Publisher Information: | Private Company Technology Center, 2025. |
| Publication Year: | 2025 |
| Subject Terms: | machine learning, cost, вартість, оптимізація, покриття множини, проблема маршрутизації транспортних засобів, машинне навчання, CVRP, optimization, set cover |
| Description: | The Capacitated Vehicle Routing Problem with Time-Dependent Demands (CVRPTD) is a significant optimization challenge in the logistics and transportation domain, characterized by dynamic customer demands, strict time windows, and heterogeneous vehicle fleets. This study focuses on urban parcel delivery operations as the primary object of research. The problem addressed involves the inefficiency of conventional vehicle routing strategies in adapting to time-varying customer demands and operational constraints, which often lead to increased costs and service delays. This study aims to minimize total operational costs while ensuring compliance with capacity constraints, service continuity, and demand fluctuations. A comprehensive mathematical model is developed based on a fully connected, directed acyclic graph G=(V, A), incorporating decision variables that represent vehicle routing sequences, timing, and vehicle type assignments. This study addresses the Capacitated Vehicle Routing Problem with Time-Dependent Demands (CVRPTD) in urban parcel delivery, where traditional routing methods struggle with dynamic demands and operational constraints. A mathematical model using a directed acyclic graph is developed, optimized via a gradient-based method with Hessian approximation, LU decomposition, and quasi-Newton techniques. Experiments on datasets with up to 200 customers and 20 vehicles with reductions ranging from 1.79% to 12.75%. The most significant improvement was observed in Sidorame Timur, where the optimization distance decreased by 12.75%, indicating high accuracy in route optimization. For the SCP, the proposed algorithm achieved a 6.46% improvement in solution quality over traditional greedy algorithms |
| Document Type: | Article |
| File Description: | application/pdf |
| ISSN: | 1729-4061 1729-3774 |
| DOI: | 10.15587/1729-4061.2025.326135 |
| Access URL: | https://journals.uran.ua/eejet/article/view/326135 |
| Rights: | CC BY |
| Accession Number: | edsair.doi.dedup.....673a96b07c47090d7de855d8a5758a94 |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | The Capacitated Vehicle Routing Problem with Time-Dependent Demands (CVRPTD) is a significant optimization challenge in the logistics and transportation domain, characterized by dynamic customer demands, strict time windows, and heterogeneous vehicle fleets. This study focuses on urban parcel delivery operations as the primary object of research. The problem addressed involves the inefficiency of conventional vehicle routing strategies in adapting to time-varying customer demands and operational constraints, which often lead to increased costs and service delays. This study aims to minimize total operational costs while ensuring compliance with capacity constraints, service continuity, and demand fluctuations. A comprehensive mathematical model is developed based on a fully connected, directed acyclic graph G=(V, A), incorporating decision variables that represent vehicle routing sequences, timing, and vehicle type assignments. This study addresses the Capacitated Vehicle Routing Problem with Time-Dependent Demands (CVRPTD) in urban parcel delivery, where traditional routing methods struggle with dynamic demands and operational constraints. A mathematical model using a directed acyclic graph is developed, optimized via a gradient-based method with Hessian approximation, LU decomposition, and quasi-Newton techniques. Experiments on datasets with up to 200 customers and 20 vehicles with reductions ranging from 1.79% to 12.75%. The most significant improvement was observed in Sidorame Timur, where the optimization distance decreased by 12.75%, indicating high accuracy in route optimization. For the SCP, the proposed algorithm achieved a 6.46% improvement in solution quality over traditional greedy algorithms |
|---|---|
| ISSN: | 17294061 17293774 |
| DOI: | 10.15587/1729-4061.2025.326135 |