ROUTING OF VEHICLES USING THE METAHEURISTIC ALGORITHM

2020

Closed access Metadata (CSL-JSON)
DOI 10.51889/2020-4.1728-7901.35
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The main goal of the proposed research is to solve the problem of vehicle routing using genetic algorithms. Vehicle Routing Problem (VRP) is an NP-complete complex combinatorial problem. With a large amount of input data in a VRP problem, it is very expensive to find the most optimal solution. Genetic algorithms offer the most optimal solution in a short period of time. This article discusses genetic algorithms based on the mechanism of evolution for finding the optimal route by metaheuristic methods. The aim of the work is to minimize the time needed to find the most acceptable optimal solution to the problem, as well as to develop metaheuristic methods.