TSP METHOD USING NEAREST NEIGHBOR ALGORITHM AT PT. J&T EXPRESS IN BANDUNG
Effectiveness and efficiency are very important for an expedition company in optimizing the delivery of goods by a courier. The Traveling salesman problem (TSP) method using the Nearest Neighbor Algorithm can optimize the delivery of goods to all consumer location points with only one visit in one t...
Main Authors: | Anie Lusiani, Siti Samsiyah Purwaningsih, Euis Sartika |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Bina Bangsa
2023-12-01
|
Series: | Jurnal Lebesgue |
Subjects: | |
Online Access: | https://lebesgue.lppmbinabangsa.id/index.php/home/article/view/449 |
Similar Items
-
DIJKSTRA ALGORITHM IN DETERMINING THE SHORTEST ROUTE FOR DELIVERY SERVICE BY J&T EXPRESS IN BANDUNG
by: Anie Lusiani, et al.
Published: (2023-08-01) -
Dynamic Shortest Paths Methods for the Time-Dependent TSP
by: Christoph Hansknecht, et al.
Published: (2021-01-01) -
Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika
by: Aswandi, et al.
Published: (2021-06-01) -
Converting MST to TSP Path by Branch Elimination
by: Pasi Fränti, et al.
Published: (2020-12-01) -
Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)
by: Rio Guntur Utomo, et al.
Published: (2018-06-01)