JMT (Jurnal Matematika dan Terapan)
Vol 4 No 2 (2022): JMT (Jurnal Matematika dan Terapan)

Masalah Vehicle Routing Problem pada Pengiriman Barang di Kota Bandung Utara dengan menggunakan Kluster K-Means dan Algoritma Nearest Neighbor

Debby Agustine (Universitas Negeri Jakarta)
Ibnu Hadi Hadi (Universitas Negeri Jakarta)
Devi Eka Wardani Meganingtyas (Universitas Negeri Jakarta)

Article Info

Publish Date
30 Aug 2022

Abstract

The Vehicle Routing Problem (VRP) 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.

Copyrights © 2022




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
JMT (Jurnal Matematika dan Terapan)
Website

Abbrev

jmt

Publisher

Universitas Negeri Jakarta

Subject

Decision Sciences, Operations Research & Management Economics, Econometrics & Finance

Description

JMT (Jurnal Matematika dan Terapan) is a journal that publishes about scientific papers containing fields of mathematics such as analysis, geometry, algebra and its application. This mathematics journal contains about the result of student thesis, research lecturer both in mathematics prodi unj and ...