Results 41 to 50 of about 11,225 (197)
Execution Time Experiments to Solve Capacitated Vehicle Routing Problem
Studies dealing with route optimization have received considerable attention in recent years due to the increased demand for transportation services. For decades, scholars have developed robust algorithms designed to solve various Vehicle Routing Problems (VRP).
Adriano S. Silva +4 more
openaire +2 more sources
The Vehicle Routing Problem with Service Level Constraints
We consider a vehicle routing problem which seeks to minimize cost subject to service level constraints on several groups of deliveries. This problem captures some essential challenges faced by a logistics provider which operates transportation services ...
Bulhões, Teobaldo +3 more
core +1 more source
The success rate of construction projects depends on subcontractors and material suppliers, especially in ensuring the material delivery to avoid delays and cost overruns. The Vehicle Routing Problem (VRP) addresses transportation management to minimize
Ambrosius Matthew Junius Reynaldo +3 more
doaj +1 more source
Cuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 ...
Jon Henly Santillan +3 more
doaj +1 more source
Data driven safe vehicle routing analytics: a differential evolution algorithm to reduce CO2 emissions and hazardous risks [PDF]
Contemporary vehicle routing requires ubiquitous computing and massive data in order to deal with the three aspects of transportation such as operations, planning and safety. Out of the three aspects, safety is the most vital and this study refers safety
Ponnambalam, S G +2 more
core +1 more source
Solving Capacitated Time-Dependent Vehicle Routing Problem
A vehicle routing problem aims to determine a set of vehicle routes to deliver goods to the customers. Most of the variants of the problem consider static traffic conditions, while in the real world, travel times depend on the departure time. In this paper, a capacitated time-dependent vehicle routing problem is observed, which considers time-dependent
Erdelić, Tomislav +2 more
openaire +3 more sources
In this work, we extend the time-dependent vehicle routing problem with time windows on a road network by considering two types of vehicles, large and small, to serve customers.
Fernando O. Guillen Reyes +2 more
doaj +1 more source
Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm
The capacitated vehicle routing problems (CVRP) are NP-hard. Most approaches can solve small-scale case studies to optimality. Furthermore, they are time-consuming.
Zhang Jiashan +3 more
doaj +1 more source
Una comparación de algoritmos basados en trayectoria granular para el problema de localización y ruteo con flota heterogénea (LRPH) [PDF]
Indexación: Scopus.We consider the Location-Routing Problem with Heterogeneous Fleet (LRPH) in which the goal is to determine the depots to be opened, the customers to be assigned to each open depot, and the corresponding routes fulfilling the demand of ...
Bernal-Moyano, J.A. +4 more
core +1 more source
Deep reinforcement learning for dynamic vehicle routing with demand and traffic uncertainty
The capacitated vehicle routing problem with dynamic demand and traffic conditions presents significant challenges in logistics and supply chain optimization.
Shirali Kadyrov +3 more
doaj +1 more source

