Analisis Model dan Harga Optimal pada Sistem Antrean Tipe GI/M/1 Menggunakan Metode Geometrik Matriks
Najwa Mufida Al Arif, Dr. Irwan Endrayanto Aluicius, S.Si., M.Sc.
2026 | Skripsi | MATEMATIKA
Car/Ride-Share (CRS) diusulkan sebagai solusi atas keterbatasan kapasitas bus umum dan ketidakmerataan distribusi car sharing. Operasional CRS bersifat bergantung pada kondisi, yakni kendaraan hanya berangkat jika batas minimum m pelanggan di lokasi pertama terpenuhi dan terdapat permintaan di lokasi kedua. Mekanisme serah-terima langsung di lokasi kedua ini secara langsung mengurangi kebutuhan fasilitas parkir. Dalam skripsi ini, sistem CRS dimodelkan sebagai Rantai Markov Waktu Kontinu dua dimensi yang matriks generatornya memiliki struktur tipe GI/M/1. Berdasarkan pemodelan tersebut, sistem dikatakan stabil ketika laju kedatangan pelanggan lebih kecil dari total laju pelayanan (lambda kurang dari l mu + n sigma Ped). Dengan terpenuhinya kondisi kestabilan tersebut, matriks laju R dapat diselesaikan secara numerik menggunakan metode successive substitution dalam kerangka Metode Geometrik Matriks dan distribusi steady state diperoleh secara analitik. Lebih lanjut, diperoleh nilai optimal m yang meminimalkan biaya operasional sekaligus mempertahankan rata-rata waktu tunggu pelanggan. Evaluasi mekanisme harga menunjukkan bahwa CRS memberikan solusi saling menguntungkan bagi pelanggan dan pemilik kendaraan CRS, sekaligus mengoptimalkan pendapatan pemilik saat permintaan melampaui kapasitas bus.
Car/Ride-Share (CRS) is proposed as a solution to the limited capacity of public buses and the uneven vehicle distribution in conventional car sharing systems. The operation of CRS is state-dependent, meaning that the vehicle departs only if a minimum threshold of m customers at the first location is met and there is existing demand at the second location. This direct handover mechanism at the second location directly reduces the need for parking facilities. In this thesis, the CRS system is modeled as a two-dimensional Continuous-Time Markov Chain (CTMC) with a GI/M/1-type generator matrix. Based on this model, the system is stable when the customer arrival rate is less than the total service rate (lambda less than l mu + n sigma Ped). Under this stability condition, the rate matrix R is solved numerically using the successive substitution algorithm within the framework of the Matrix-Geometric Method, while the steady-state distribution is obtained analytically. Furthermore, the optimal value of m is determined to minimize the operating cost while maintaining the average passenger waiting time. Finally, an evaluation of the pricing mechanism indicates that CRS provides a win-win solution for both passengers and CRS vehicle owners, while optimizing net revenue when demand exceeds bus capacity.
Kata Kunci : Car/Ride-Share (CRS), Rantai Markov Waktu Kontinu, Metode Geometrik Matriks, GI/M/1