Solving Capacitated Vehicle Routing Problem by an Improved Genetic Algorithm with Fuzzy C-Means Clustering

24Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Aiming at solving the vehicle routing problem, an improved genetic algorithm based on fuzzy C-means clustering (FCM) is proposed to solve the vehicle routing problem with capacity constraints. On the basis of genetic algorithm, the FCM algorithm is used to decompose the large-scale vehicle routing optimization problem into small-scale subproblems, which can effectively improve the efficiency of the algorithm. At the same time, a generation method of the initial solution to CVRP problem is designed. The improved algorithm has good robustness and can also reduce the possibility of falling into local optimization in the search process. Finally, a simulation example is provided to verify the efficiency and superiority of the proposed algorithm.

Cite

CITATION STYLE

APA

Zhu, J. (2022). Solving Capacitated Vehicle Routing Problem by an Improved Genetic Algorithm with Fuzzy C-Means Clustering. Scientific Programming, 2022. https://doi.org/10.1155/2022/8514660

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free