Model masalah penjadwalan transporter pasien dengan pendekatan Dial-A-Ride Problem (DARP)

Zahrul Jannah Nur Rochim; Irwan Endrayanto

doi:10.21831/pg.v16i1.36648

Model masalah penjadwalan transporter pasien dengan pendekatan Dial-A-Ride Problem (DARP)

Zahrul Jannah Nur Rochim, Department of Mathematics, Universitas Gadjah Mada, Indonesia
Irwan Endrayanto, Department of Mathematics, Universitas Gadjah Mada, Indonesia

10.21831/pg.v16i1.36648

Abstract

Transportasi intra-hospital merupakan transportasi dalam area suatu rumah sakit, termasuk di dalamnya adalah transportasi pasien. Transportasi pasien dalam area rumah sakit dilakukan oleh transporter pasien yang merupakan staf non-medis rumah sakit. Tugas transporter pasien adalah menjemput dan mengantarkan pasien yang membutuhkan bantuan untuk berpindah lokasi dalam area rumah sakit dikarenakan kondisinya yang tidak dapat berpindah sendiri untuk menjalani perawatan yang telah terjadwal. Penjadwalan transporter pasien harus mempertimbangkan beberapa hal yang di antaranya tidak boleh terlambat dalam mengantarkan pasien sesuai jadwal perawatan, adanya time windows untuk masing-masing lokasi penjemputan dan pengantaran, masing-masing pasien memiliki batas maksimum untuk berada di perjalanan, terbatasnya jumlah transporter pasien serta batasan jam kerja transporter pasien. Permasalahan ini akan dimodelkan dengan pendekatan model Dial-A-Ride Problem (DARP). Fungsi tujuan model ini adalah meminimalkan total waktu tempuh transporter pasien dan jumlah transporter pasien yang ditugaskan. Model diterapkan pada suatu kasus di salah satu rumah sakit di Jakarta. Berdasarkan hasil penyelesaian diperoleh hasil penjadwalan yang optimum menggunakan program LINGO 11.0.

Model of patient transporter scheduling problem with Dial-A-Ride Problem (DARP) approach

Intra-hospital transportation is transportation within the area of a hospital including the patient transportation. Patient transportation within the hospital area is carried out by patient transporters who are non-medical staff of the hospital. The task of the patient transporter is to pick up and deliver patients who need help to switch locations within the hospital area due to their condition that cannot move on their own to undergo scheduled treatment. Scheduling a patient transporter should consider several things including not being late in delivering patients according to the treatment schedule, the existence of time windows for each pickup and drop off location, each patient has a maximum limit on the journey, limited number of patients transporters, and limits on patient transporter working hours. This issue will be modeled with Dial-A-Ride Problem (DARP) model approach. The purpose function of this model is to minimize the total travel time of the patient transporter and the number of patient transporters assigned. The model is applied to a case in one of the hospitals in Jakarta, Indonesia. The results showed optimum scheduling using LINGO 11.0 program.

Keywords

Model matematika; transporter pasien rumah sakit; dial-a-ride problems (DARP)

Full Text:

DOWNLOAD PDF

References

Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. Operation Research Spectrum, 32(1), 77–107. https://doi.org/10.1007/s00291-008-0135-6

Belhaiza, S. (2019). A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem. Algorithms, 12(2), 1–13. https://doi.org/10.3390/a12020039

Coppi, A., Detti, P., & Raffaelli, J. (2013). A planning and routing model for patient transportation in health care. Electronic Notes in Discrete Mathematics, 41(1), 125–132. https://doi.org/10.1016/j.endm.2013.05.084

Cordeau, J. -F. (2006). A branch-and-cut algorithm for the dial-a-ride problem. Operation Research, 54(3), 573–586. https://doi.org/10.1287/opre.1060.0283

Cubillos, C., Urra, E., & Rodriguez, N. (2009). Application of genetic algorithms for the DARPTW problem. International Journal of Computers Communications & Control, 4(2), 127–136. https://doi.org/10.15837/ijccc.2009.2.2420

Feng, L., Miller-Hooks, E., Schonfeld, P., & Mohebbi, M. (2014). Optimizing ridesharing services for airport access. Transportation Research Record: Journal of the Transportation Research Board, 2467(1), 157–167. https://doi.org/10.3141/2467-17

Gopal, K. (2016). Modeling and optimization of hospital transportation systems [Doctoral dissertation, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1481314351566885

Henshaw, C. (2015). Improving patient transportation performance by developing and implementing a generic simulation model [Master’s thesis, University of Toronto]. TSpace. http://hdl.handle.net/1807/70362

Ilani, H., Shufan, E., Grinshpoun, T., Belulu, A., & Fainberg, A. (2014). A Reduction approach to the two-campus transport problem. Journal of Scheduling, 17(6), 587–599. https://doi.org/10.1007/s10951-013-0348-7

Jlassi, J., Euchi, J., & Chabchoub, H. (2012). Dial-a-ride and emergency transportation problems in ambulance services. Computer Science and Engineering, 2(3), 17–23. https://doi.org/10.5923/j.computer.20120203.03

Kulshrestha, A., & Singh, J. (2016). Inter-hospital and intra-hospital patient transfer: Recent concepts. Indian Journal of Anaesthesia, 60(7), 451–457. https://doi.org/10.4103/009-5049.186012

Lim, A., Zhang, Z., & Qin, H. (2016). Pickup and delivery service with manpower planning in Hong Kong public hospitals. Transportation Science, 51(2), 1–18. https://doi.org/10.1287/trsc.2015.0611

Liu, M., Luo, Z., & Lim, A. (2015). A branch and cut algorithm for realistic dial-a-ride problem. Transportation Research Part B: Methodological, 81(1), 267–288. https://doi.org/10.1016/j.trb.2015.05.009

Masmoudi, M. A., Braekers, K., Masmoudi, M., & Dammak, A. (2017). A hybrid generic algorithm for the heterogeneous dial-a-ride problem. Computers & Operations Research, 81(1), 1–13. https://doi.org/10.1016/j.cor.2016.12.008

Masmoudi, M. A., Hosny, M., Braekers, K., & Dammak, A. (2016). Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem. Transportation Research Part E: Logistics and Transportation Review, 96(1), 60–80. https://doi.org/10.1016/j.tre.2016.10.002

McMahon, C. E. (2015). Dynamic assignment heuristics utilizing patient transporter locations in hospitals [Master’s thesis, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1448888411

Melachrinoudis, E., Ilhan, A. B., Min, H. (2007). A dial-a-ride problem for client transportation in a health-care organization. Computers & Operations Research, 34(3), 742–759. https://doi.org/10.1016/j.cor.2005.03.024

Molenbruch, Y., Braekers, K., Caris, A., & Berghe, G. V. (2017). Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Computers & Operations Research, 77(1), 58–71. https://doi.org/10.1016/j.cor.2016.07.020

Painchaud, M., Belanger, V., & Ruiz, A., (2017). Discrete-event simulation of an intrahospital transportation service. In P. Cappanera, J. Li, A. Matta, E. Sahin, N. J. Vandaele & F. Visintin (Eds.), Health Care Systems Engineering, Springer Proceedings in Mathematics & Statistics (vol. 210, pp. 233–244). Springer. https://doi.org/10.1007/978-3-319-66146-9_21

Paquette, J., Cordeau, J. F., Laporte, G., & Pascoal, M. M. B. (2013). Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Research Part B: Methodological, 52(1), 1–16. https://doi.org/10.1016/j.trb.2013.02.007

Parragh, S. N., de Sousa, J. P., & Almada-Lobo, B. (2015). The dial-a-ride problem with split requests and profits. Transportation Science, 49(2), 311–334. https://doi.org/10.1287/trsc.2014.0520

Reinhardt, L. B., Clausen, T., & Pisinger, D. (2013). Synchronized dial-a-ride transportation of disabled passengers at airports. European Journal of Operational Research, 225(1), 106–117. https://doi.org/10.1016/j.ejor.2012.09.008

Savelsbergh, M. W. P., & Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29(1), 17–29. https://doi.org/10.1287/trsc.29.1.17

Schonberger, J. (2017). Scheduling constraints in dial-a-ride problems with transfer: A metaheuristic approach incorporating a cross route scheduling procedure with postponement opportunities. Public Transport, 9(1-2), 243–272. https://doi.org/10.1007/s12469-016-0139-6

Seguin, S., Villeneuve, Y., & Blouin-Delisle, C. H. (2019). Improving patient transportation in hospitals using a mixed-integer programming model. Operations Research for Health Care, 23(1), 1–7. https://doi.org/10.1016/j.orhc.2019.100202

Turan, B., Schmid, V., & Doerner, K. F. (2011). Models for intra-hospital patient routing. The 3rd IEEE International Symposium on Logistics and Industrial Informatics (pp. 51–60). IEEE. https://doi.org/10.1109/LINDI.2011.6031162

Urra, E., Cubillos, C., & Cabrera-Paniagua, D. (2015). A hyperheuristic for the dial-a-ride problem with time windows. Mathematical Problems in Engineering, 2015(1), 1–12. https://doi.org/10.1155/2015/707056

Zhang, Z., Liu, M., & Lim, A. (2015). A memetic algorithm for the patient transportation problem. Omega, 54(1), 60–71. https://doi.org/10.1016/j.omega.2015.01.011

DOI: https://doi.org/10.21831/pg.v16i1.36648