Vehicle Routing Problem by Combining Nearest Neighbour and Local Search

  • Kurnia Iswardani Universitas Panca Marga
  • Ira Aprilia Universitas Panca Marga
  • Dwi Putri K Universitas Panca Marga
DOI: https://doi.org/10.52166/ujmc.v9i1.4763
Keywords: Vehicle Routing Problem, Nearest Neighbour, Local Search

Abstract

PT. X is a company tasked with distributing Elpiji Gas to major agents. The problem under study is to find a more optimal distribution route so it can maximize the use of other resources, for example the number of trucks used. This distribution problem will be solved by a combination two methods, Nearest Neighbor and Local Search with the hope of getting the shortest route. The way the Nearest Neighbor method works is selecting the Agent's location based on the shortest distance from the last location and improving the solution using Local Search (intra-route insertion (1-0)) by moving one customer's position in one route so that a good distribution route is produced

References

[1] Abdullah. M., 2015. Metodologi Penelitian Kuantitatif, untuk Ekonomi, Manajemen, Komunikasi, dan Ilmu Sosial Lainnya. Yogyakarta : Aswaja Pressindo.
[2] Anwar. S. N., 2013. Management Rantai Pasokan (Supply Chain Management) : Konsep dan Hakikat.Universitas Stikubank Semarang.
[3] Arinalhaq. F., Imran. A., Fitria. L., 2013. Penentuan Rute Kendaraan Pengangkutan Sampah dengan Menggunakan Metode Nearest Neighbour (Studi Kasus PD Kebersihan Kota Bandung). Jurnal Online Institut Teknologi Nasional Vol.1 : 22-32.
[4] Toth, P., and Vigo.2020. An Overview of Vehicle Routing Problem . Philadelphia: Society for Industrial and Applied Mathematics.
[5] Brandenburg. M., Govindan. K., Sarkis. J., Seuring. S., 2013. Quantitative Models for Sustainable Supply Chain Management : Developments and Directions. European Journal of Operational Research 233 (2013) 299-312.
[6] Koswara. H., Adianto. H., Nughraha. A., 2017 Penentuan Rute Distribusi Produk Kaos Pada Dobujack Inv. Menggunakan Metode Nearest Neighbour dan (1- 0) Insertion Intra Route. Jurnal Rekayasa Sistem & Industri, No.2, Vol.4 : 192-198.
Published
2023-06-30
How to Cite
Iswardani, K., Aprilia, I., & Putri K, D. (2023). Vehicle Routing Problem by Combining Nearest Neighbour and Local Search. UJMC (Unisda Journal of Mathematics and Computer Science), 9(1), 15-20. https://doi.org/https://doi.org/10.52166/ujmc.v9i1.4763
Issue
Vol 9 No 1 (2023): Unisda Journal of Mathematics and Computer science
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:

1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. 

2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.

3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.