Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
