APLIKASI PENDEKATAN N-STAGE UNTUK MASALAH PENGRUTEAN DAN PENJADWALAN TRUK-TUNGGAL DI DAERAH KEPULAUAN (STUDI KASUS PADA KOPERASI UNIT BERSAMA NEGERI BOOI, SAPARUA)
Abstract
Abstrak Penelitian ini bertujuan untuk menyelesaikan masalah pengrutean dan penjadwalan kendaraan yang dihadapi oleh Koperasi Unit Bersama Negeri Booi (KUB Booi) sebagai salah satu industri startup di Saparua, Maluku Tengah. Sebagai industri startup, distribusi direncanakan menggunakan truk-tunggal. Distribusi produk dihadapkan pada karakteristik kepulauan yang mengharuskan KUB Booi untuk memanfaatkan jasa transportasi publik feri. Saat ini, KUB Booi memiliki sejumlah pelanggan yang tersebar di dua pasar, yaitu Kota Ambon dan Kota Masohi. Selain itu, terdapat satu supplier dan satu mitra ekspedisi yang berlokasi di Kota Ambon. Untuk menentukan waktu perjalanan atau makespan yang minimum, maka kami menggunakan pendekatan n-stage untuk mengoptimisasi rute dan jadwal truk dan feri di setiap pelabuhan di setiap pulau. Pendekatan ini mengintegrasikan dua metode, yaitu pemrograman integer dan algoritma heuristik. Dengan pendekatan ini, minimum total waktu perjalanan yang diharapkan dapat ditentukan.
Downloads
References
Cömert, S. E., Yazgan, H. R., Sertvuran, Ä°., & Åžengül, H. (2017). A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain. SÄdhanÄ, 42(12), 2067–2080.doi: 10.1007/s12046-017-0754-1.
Desrochers, M., & Laporte, G., (1991).Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints,Operations Research Letters, Vol.10, pp. 27-36.
Dondo, R., & Cerdá, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478–1507.doi:10.1016/j.ejor.2004.07.077.
Gendreau, M., Ghiani, G., Guerriero, E., (2015).Time dependent routing problems: A review. Compute Oper. Res. 64, 189-197.
Ioannou, G., Kritikos, M. N., & Prastacos, G. P.(2008). An assignment-based heuristic for vehicle routing with time windows. Operational Research, 8(3), 219–233. doi:10.1007/s12351-008-0018-2.
Luo, Z., Qin, H., Che, C., & Lim, A. (2015). On service consistency in multi-period vehicle routing. European Journal of Operational Research, 243(3), 731–744.doi:10.1016/j.ejor.2014.12.019.
Malandraki, C., Daskin, M., 1992. Time dependent vehicle routing problems: formulation, properties, and heuristic algorithms. Transportation Science, 26, 185-200.
Miller, C. E., Tucker, A. W., & Zemlin, R. A.(1960). Integer programming formulations and traveling salesman problems. Journal of the ACM, Vol.7, pp.326-329.
Neves-Moreira, F., Pereira da Silva, D., Guimarães, L., Amorim, P., & Almada-Lobo, B. (2018). The time window assignment vehicle routing problem with product dependent deliveries. Transportation Research Part E:Logistics and Transportation Review, 116, 163–183.doi:10.1016/j.tre.2018.03.004._____, (2018). Jadwal keberangkatan feri di lingkup Cabang Ambon. PT. ASDP Indonesia Ferry Cabang Ambon 2018.
An author who publishes in the ALE Proceeding agrees to the following terms:
- Author retains the copyright and grants ALE Proceeding the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-ShareAlike 4.0 License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Author is 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 the acknowledgment of its initial publication in this journal.
- Author is permitted and encouraged to post his/her 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 the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-ShareAlike 4.0 Licence here: https://creativecommons.org/licenses/by-sa/4.0/.