首页|An evolutionary algorithm for solving Capacitated Vehicle Routing Problems by using local information
An evolutionary algorithm for solving Capacitated Vehicle Routing Problems by using local information
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The Capacitated Vehicle Routing Problem (CVRP) is a widely investigated NP-hard problem, which aims to determine the routes for a fleet of vehicles to serve a group of customers with minimum travel cost. In this paper, a fast evolutionary algorithm is proposed to solve CVRPs. To this end, a relevance matrix storing the probability that two customers are served successively by the same vehicle is calculated according to the local information of customer location and elite individuals in population. Based on the relevance matrix, an evolutionary algorithm called RMEA is proposed, where the relevance matrix is used to guide the crossover operation and accelerate the convergence of algorithm. Moreover, a relevance matrix based diversity preservation strategy is designed to increase the population diversity and solution quality. In the experiments, the proposed RMEA is compared to eight state-of-the-art heuristic methods tailored for CVRPs. Experimental results on three CVRP benchmarks demonstrate that the proposed RMEA is superior over eight compared algorithms and shows fast convergence speed. (C) 2022 Elsevier B.V. All rights reserved.
NSTL
Elsevier
