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

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 o...

Full description

Saved in:
Bibliographic Details
Published in:Scientific programming Vol. 2022; pp. 1 - 8
Main Author: Zhu, Ji
Format: Journal Article
Language:English
Published: New York Hindawi 18.02.2022
John Wiley & Sons, Inc
Subjects:
Clustering
Genetic algorithms
Local optimization
Optimization algorithms
Population
Route planning
Search process
Vehicle routing
ISSN:1058-9244, 1875-919X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1058-9244
1875-919X
DOI:10.1155/2022/8514660