Masalah Vehicle Routing Problem Pada Pengiriman Barang di kota Bandung utara dengan menggunakan Kluster K-Means dan Algoritma Nearest Neighbor

Autor:	Debby Agustine, Ibnu Hadi Hadi, null Devi Eka Wardani Meganingtyas
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	VRP Nearest Neighbor Klustering Kmeans General Agricultural and Biological Sciences
Zdroj:	JMT : Jurnal Matematika dan Terapan; Vol 4 No 2 (2022): JMT (Jurnal Matematika dan Terapan); 1-8
ISSN:	2615-6792
DOI:	10.21009/jmt.4.2
Popis:	The Vehiscle Routing Problem is an optimization problem in determining the route of packet distribution with limited vehicle capacity. Routing in the distribution of packets is important so that the shortest route will be sought so that the package arrives on time. One of the algorithms that discusses the search for vehicle routes with VRP problems is the Nearest Neighbor Algorithm, as for the stages in finding the best route by enumerating all possible sequences of existing routes and selecting the best set of routes in order to find the shortest route from one node to all other nodes. so it becomes a connected route.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fc903059e9041727349b2e29106c6dd http://journal.unj.ac.id/unj/index.php/jmt/article/view/28853 Zobrazit plný text záznamu