返回
An evolutionary algorithm for solving Capacitated Vehicle Routing Problems by using local information
DOI:10.1016/j.asoc.2022.108431.png)
摘要
En 中文
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.
Keyword:
Vehicle routing problem
Evolutionary optimization
Location information
Elite individual
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
IMPROVEMENT HEURISTICS FOR THE VEHICLE-ROUTING PROBLEM-BASED ON SIMULATED ANNEALING基于模拟退火的车辆路径问题改进启发式算法
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications
RSC Adv.
IF0
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the Vehicle routing problem自适应可变邻域搜索和大邻域搜索的混合: 在车辆路径问题中的应用

