Research and Analysis of the Algorithms of Vehicle Routing Problem for Agricultural Cargoes

Authors

  • Ս.Ա. Ավուշյան, Դ.Ս. Շալջյան, Վ.Հ. Բայադյան

Keywords:

տրանսպորտային խնդիր (ՏԽ), գյուղատնտեսական մթերք, Դեյկստրայի ալգորիթմ, Ֆլոյդի ալգորիթմ, NP-լրիվ խնդիրներ

Abstract

Solution of travelling salesman problem (TSP) is very actual, since when implementing cargo transportation it is necessary to determine the possibly shortest (therefore, cost-efficient) route. The current article considers the study results of TSP. Besides, algorithms applied for routing the agricultural cargo transportation, classification of the well-known methods and the most applied variants are introduced in the current work

Downloads

Published

2023-08-05

How to Cite

Ս.Ա. Ավուշյան, Դ.Ս. Շալջյան, Վ.Հ. Բայադյան. (2023). Research and Analysis of the Algorithms of Vehicle Routing Problem for Agricultural Cargoes. AgriScience and Technology, 3(67). Retrieved from https://journal.anau.am/index.php/anau/article/view/155

Issue

Vol. 3 No. 67 (2019): “AgriScience and Technology” scientific journal

Section

Agricultural Economics and Agribusiness

License

Creative Commons Attribution-Non-Commercial (CC BY-NC). CC BY-NC allows users to copy and distribute the article, provided this is not done for commercial purposes. The users may adapt – remix, transform, and build upon the material giving appropriate credit, providing a link to the license. The full details of the license are available at https://creativecommons.org/licenses/by-nc/4.0/.