Skip to main content Skip to main navigation menu Skip to site footer

Уважаемые пользователи! На нашем хостинге ведутся технические работы, на сайте могут быть ошибки. Приносим свои извинения за временные неудобства.

Bulletin of the Abai KazNPU, the series of "Physical and Mathematical Sciences"

ROUTING OF VEHICLES USING THE METAHEURISTIC ALGORITHM

Published December 2020
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]
Нұрсерік, Д. , Гусманова, Ф. , Абдулкаримова, Г. and Дальбекова, Қ. 2020. ROUTING OF VEHICLES USING THE METAHEURISTIC ALGORITHM . Bulletin of the Abai KazNPU, the series of "Physical and Mathematical Sciences". 72, 4 (Dec. 2020), 225–230. DOI:https://doi.org/10.51889/2020-4.1728-7901.35.