Implementasi Heuristik School Bus Routing Problem untuk Alokasi Armada Antar-Jemput Siswa
DOI:
https://doi.org/10.30865/json.v8i1.9953Keywords:
Alokasi Armada, Antar-Jemput Siswa, Heuristik, School Bus Routing Problem, Sistem InformasiAbstract
Layanan antar-jemput siswa membutuhkan alokasi armada dan penyusunan rute yang terukur serta sesuai dengan aturan operasional. Pada studi kasus sebuah koperasi di wilayah Lembang, pembagian siswa sebelumnya dilakukan melalui rekap data, spreadsheet, komunikasi WhatsApp, dan koordinasi dengan pengemudi. Penelitian ini mengimplementasikan heuristik School Bus Routing Problem pada sistem berbasis web untuk mengotomatisasi alokasi siswa ke rit dan menyusun urutan antar-jemput. Algoritma menggunakan trip-based insertion cost, capacity penalty, outlier penalty, local move improvement, soft rebalance, Nearest Neighbor, dan 2-Opt dengan estimasi jarak Haversine. Pengujian dilakukan menggunakan data operasional periode Maret 2026 yang terdiri atas 348 siswa, 17 armada aktif, 17 rit pagi, dan 32 rit pulang. Pengujian dijalankan pada lingkungan lokal Windows 11, PHP 8.2.12, Laravel 11.48.0, dan RAM 16 GB. Seluruh 155 siswa rute pagi dan 322 siswa rute pulang berhasil dialokasikan tanpa pelanggaran aturan operasional. Waktu generate aplikasi adalah 8,4552 ± 0,8638 detik untuk rute pagi dan 10,2788 ± 0,4206 detik untuk rute pulang. Dibandingkan baseline Sweep–Nearest Neighbor, metode final mengurangi estimasi jarak Haversine sebesar 40,63% pada rute pagi dan 7,58% pada rute pulang. Metode final juga mengonsolidasikan rute pagi dari 17 menjadi 15 rit dengan utilisasi rit yang digunakan sebesar 90,64%. Hasil tersebut menunjukkan bahwa sistem dapat menghasilkan alokasi yang memenuhi aturan operasional dengan estimasi jarak lebih rendah daripada baseline, meskipun jarak yang dihasilkan belum merepresentasikan jaringan jalan aktual.
References
[1] J. Díaz-Ramírez, A. M. Rosas, B. García-Colis, and P. S. Valencia-Torres, “The school bus routing problem: A systematic literature review,” Rev. Fac. Ing. Univ. Antioquia, no. 114, pp. 79–94, 2025, doi: 10.17533/udea.redin.20240518.
[2] N. I. L. Mohd Azmi, A. H. Md Mahdzir, H. Y. Xuan, N. X. Yu, T. M. Tiean, and T. Y. Kun, “The Review of Recent Trend for School Bus Routing Problem,” J. Eng. Technol. Appl. Phys., vol. 6, no. 1, pp. 67–75, 2024, doi: 10.33093/jetap.2024.6.1.9.
[3] M. Sciortino, R. Lewis, and J. Thompson, “A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection,” SN Comput. Sci., vol. 4, p. 74, 2023, doi: 10.1007/s42979-022-01466-6.
[4] Z. Jiang, J. Wang, S. Huang, and H. D. Xu, “A solution to the Single-School school bus routing problem considering accessibility and economy,” Transp. Res. Interdiscip. Perspect., vol. 32, p. 101506, 2024, doi: 10.1016/j.trip.2025.101506.
[5] A. A. Jolfaei, M. Alinaghian, R. Bahrami, and E. B. Tirkolaee, “Generalized vehicle routing problem: Contemporary trends and research directions,” Heliyon, vol. 9, no. 12, p. e22733, 2023, doi: 10.1016/j.heliyon.2023.e22733.
[6] A. Chen and T. Li, “Modeling and Solving the Multi-Objective Vehicle Routing Problem with Soft and Fuzzy Time Windows,” Systems, vol. 12, no. 12, p. 560, 2024, doi: 10.3390/systems12120560.
[7] P. Hegde and V. Vaze, “Rural School Bus Routing and Scheduling,” arXiv Prepr. arXiv2507.19538, 2025, doi: 10.48550/arXiv.2507.19538.
[8] H. Caceres, M. Duran, H. Lespay, J. P. Contreras, and R. Batta, “School Bus Routing Problem with Open Offer Policy: A case study in a New York school district,” Comput. Ind. Eng., vol. 210, p. 111526, 2025, doi: 10.1016/j.cie.2025.111526.
[9] F. Liu, C. Lu, L. Gui, Q. Zhang, X. Tong, and M. Yuan, “Heuristics for Vehicle Routing Problem: A Survey and Recent Advances,” arXiv Prepr. arXiv2303.04147, 2023, doi: 10.48550/arXiv.2303.04147.
[10] D. V Arce-Ortega, F. Alonso-Pecina, M. A. Cruz-Chávez, and J. del C. Peralta-Abarca, “A Simulated Annealing Approach for the Homogeneous Capacitated Vehicle Routing Problem,” Mathematics, vol. 13, no. 19, p. 3209, 2025, doi: 10.3390/math13193209.
[11] E. E. Rosyida, Sugianto, and I. B. Efendi, “Capacitated Vehicle Routing Problem (CVRP) with Sweep and Nearest Neighbor Algorithm,” Sinergi Int. J. Logist., vol. 2, no. 1, pp. 17–29, 2024, doi: 10.61194/sijl.v2i1.187.
[12] A. P. Ying, J. A. Jothi, and N. ARM, “WeRoute: Route Optimization Web-Based System and Driver Mobile Application,” Int. J. Artif. Intell., vol. 8, no. 2, pp. 78–87, 2021, doi: 10.36079/lamintang.ijai-0802.314.
[13] A. Aurelia, Wasino, D. Chandra, and T. B. Jap, “Developing Website-Based Information System Applications to Map PT. XYZ’s Properties Using Next.JS Framework with Haversine Method,” Int. J. Appl. Sci. Technol. Eng., vol. 1, no. 1, pp. 59–64, 2023, doi: 10.24912/ijaste.v1.i1.59-64.
[14] F. Prabowo, A. Imran, and H. Prassetiyo, “Penentuan Rute Distribusi Menggunakan Metode Savings Matrix, Nearest Neighbor, dan 2-Opt pada CV X,” J. Optimasi Tek. Ind., vol. 5, no. 2, pp. 47–52, 2023, doi: 10.30998/joti.v5i2.15620.
[15] D. J. Panjaitan, R. Aprilia, and S. Anjeli, “Vehicle Routing Problem as a Solution for Determining Goods Delivery Routes PT. Kreasi Beton Nusa Persada,” J. Sains dan Teknol., vol. 12, no. 3, pp. 622–632, 2023, doi: 10.23887/jstundiksha.v12i3.67809.
[16] M. Hasanah and A. Suharso, “Algoritma Haversine pada Sistem Informasi Geografis: Tinjauan Literatur Sistematis,” Nuansa Inform., vol. 17, no. 2, pp. 135–143, 2023, doi: 10.25134/ilkom.v17i2.10.
[17] M. D. Mughni and P. A. R. Devi, “Implementation Of Teacher Presence System Using Mobile-Based Geofencing & Haversine Formula Methods,” Appl. Technol. Comput. Sci. J., vol. 6, no. 1, pp. 31–40, 2023, doi: 10.33086/atcsj.v6i1.4119.
[18] V. H. Nabilla, D. Fitria, D. Permana, and F. Fitri, “Comparison of Haversine and Euclidean Distance Formula for Calculating Distance Between Regencies in West Sumatra,” UNP J. Stat. Data Sci., vol. 1, no. 3, pp. 120–125, 2023, doi: 10.24036/ujsds/vol1-iss3/39.
[19] V. Tundjungsari, “Development of Location-Based Emergency Mobile Application during Disaster with Haversine Formula and QGIS,” Technovasia J. Technol. Comput. Res. Innov. Sci. Appl., vol. 1, no. 1, pp. 48–56, 2025.
[20] X. Wang and S. Wang, “Traffic Forecast and Hybrid Optimization-Based Vehicle Route Planning for Cold Chain Logistics,” Appl. Sci., vol. 16, no. 5, p. 2479, 2026, doi: 10.3390/app16052479.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Jurnal Sistem Komputer dan Informatika (JSON)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- 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.
- 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 (Refer to The Effect of Open Access).
