APPLICATION TABU SEARCH ALGORITHM FOR SOLVER VEHILCE ROUTING PROBLEM

Abstract

The main objective of this research is to find a solution to the Vehicle Routing Problem using genetic algorithms. Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem of class NP-complete. The Vehicle Routing Problem is a math problem, and the original problem of this problem is encapsulated in the question: “How to create an optimal route for a fleet of vehicles to deliver to an existing customer?". The article studies genetic algorithms and search techniques to find the correct or approximate solutions to optimization and search problems to solve vehicle routing problems.