RESEARCH ON COMBINATION OF GA ALGORITHM AND K-MEANS ALGORITHM TO SOLV THE VEHICLE ROUTING PROBLEM

Abstract

The main objective of this research is to find a solution to the Vehicle Routing Problem using genetic algorithms combined with K-Means clustering algorithm. Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem of class NP-complete. Solving the vehicle routing problem is solving a combinatorial optimization problem to find the optimal route for a fleet of vehicles to distribute goods from warehouses to multiple customer locations, so that travel costs are lowest and at the same time. comply with time and vehicle capacity constraints. The article studies genetic algorithms and K-Means clustering technique to find the correct or approximate solutions to optimization and search problems to solve vehicle routing problems.