An improved artificial bee colony (ABC) algorithm is proposed which is structured specifically to address the capacitated vehicle routing problem (CVRP), a significant challenge in combinatorial optimization.
Abstract
The vehicle routing problem is one of the most often studied optimization problems. In this study, an improved artificial bee colony (ABC) algorithm is proposed which is structured specifically to address the capacitated vehicle routing problem (CVRP), a significant challenge in combinatorial optimization. The proposed algorithm integrates several novel features to improve its performance on CVRP instances. These include a unique initialization strategy that spreads non-repeated customers during initialization, an innovative dual group strategy in the employed bee phase, and an improved scout bee phase with perturbation techniques. Additionally, the proposed algorithm effectively handles infeasible solutions using a novel penalty function formula. The Chebyshev Minkowski’s distance is utilized for route evaluation, enhancing spatial relationship representation over traditional Euclidean distances. Moreover, the classical CVRP model is extended by introducing new variables and constraints to capture changing demand at each customer location within a route. The algorithm’s efficiency was extensively evaluated using benchmark data sets comprising 73 instances from data sets A, B, and P sourced from the VRP instances library site. This rigorous testing enables comprehensive assessments and meaningful comparisons with other algorithms. Overall, the proposed ABC algorithm offers a promising solution for addressing CVRP challenges, providing advancements in solution quality, robustness, and adaptability. Finally, the optimal results are compared in terms of their statistical significance using Friedman and Wilcoxon rank tests with three well-known optimizer algorithms in the literature.
This paper introduces an advanced ant colony system approach that seamlessly integrates four heuristic techniques, and incorporates a no-improvement counter into the algorithm for solution selection to counter stagnation and enhance solution diversity.
Ambulance routing is essential for effective emergency medical service and timely patient transportation within a short period. The ambulance routing problem (ARP) is considered to be one of the challenging fields in the vehicle routing problem with some unique characteristics, such as emergency response, heterogeneous...
Marissa Marcella Daulip Lakkui, J. Chew· 2026 7th International Confe...· 0 citations
This paper addresses the multi-depot multiple traveling salesman problem (MDMTSP), a complex combinatorial optimization problem with significant real-world applications in logistics and transportation. A permutation-based representation is proposed to encode candidate solutions, where salesman routes are generated by p...
Kallol Bera, Somnath Mukhopadhay, M. Maiti· 2026 International Conferenc...· 0 citations
A cooperative co-evolution algorithm, containing novel problem decomposition and charging scheduling strategies, that successfully updated the majority of best-known solutions to the large instances of the capacitated electric vehicle routing problem.
Yu-Zhou Zhang, Yi Mei, Wen-Jie Xiao et al.· Memetic Computing· 0 citations
A hybrid metaheuristic is proposed, termed SPSOM-CVRP, which integrates an improved set-based particle swarm optimization (SPSO) with a self-organizing map (SOM), which is responsible for constructing feasible CVRP solutions and performs route-level refinement to improve solution quality.
Lei Tong, Si-Yang Chen, Xue-Wen Xia· Algorithms· 0 citations
Introduction. Vehicle routing is aproblem in transportlogistics that boils down to finding optimal movement trajectories for afleet of vehicles from asingle depot. It belongs to the NP-hard class of problems, which makes exactalgorithms inapplicableas the number of customers grows. The goal of this study is to conducta...
Anton I. Abramov, E. A. Kaledina· Ogarëv-online· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.