|
Original research
A HYBRID ALGORITHM FOR TIME-DEPENDENT CAPACITATED VEHICLE ROUTING PROBLEM OPTIMIZATIONPages 7-18
Abstract:
In the realm of logistic services, the Capacitated Vehicle Routing Problem (CVRP) presents a significant challenge. Recent metaheuristic algorithms have shown promising results in minimizing travel distances for hundreds or thousands of demand points. In this study, we introduce a novel approach that combines the Guided Local Search (GLS) metaheuristic with seed solutions obtained from the cheapest arc method, resulting in rapid optimization and remarkable efficiency. Our GLS-based algorithm is not only competitive with other meta-heuristics but consistently nears the Best-Known Solutions (BKS) for various problem instances. Furthermore, our study includes testing of the proposed algorithm on a variety of benchmark problems, and the results are indeed promising, indicating its potential to revolutionize routing optimization in a wide range of applications. Its efficacy is compellingly demonstrated through a successful case study of Water Sanitation Services Peshawar (WSSP), where we have minimized vehicle travel routes and costs, offering a strong, cost-effective solution with the potential for widespread application and impact.
Keywords: Vehicle routing problem, time window constraints, guided local search, cheapest arc heuristic.
|
Muhammad Faizan, 
PDF 