Skip to main content Skip to main navigation menu Skip to site footer
Bulletin of Abai KazNPU. Series of Physical and mathematical sciences

ROUTING OF VEHICLES USING THE METAHEURISTIC ALGORITHM

Published December 2020

190

120

D. Nurserik +
Al-Farabi Kazakh National University, Almaty
F.R. Gusmanova +
Al-Farabi Kazakh National University, Almaty
G.А. Abdulkarimova +
Abai Kazakh National Pedagogical University, Almaty
Қ.S. Dalbekova +
University of international business, Almaty
Al-Farabi Kazakh National University, Almaty
Al-Farabi Kazakh National University, Almaty
Abai Kazakh National Pedagogical University, Almaty
University of international business, Almaty
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.

.pdf (Қазақ)
Language

Қазақ

How to Cite

[1]
Nurserik Д. , Gusmanova Ф. , Abdulkarimova Г. and Dalbekova Қ. 2020. ROUTING OF VEHICLES USING THE METAHEURISTIC ALGORITHM . Bulletin of Abai KazNPU. Series of Physical and mathematical sciences. 72, 4 (Dec. 2020), 225–230. DOI:https://doi.org/10.51889/2020-4.1728-7901.35.