Optimizing patient transportation in large hospitals
- Authors
-
-
Ruan Myller Magalhães de Oliveira
Instituto de Matemática e Tecnologia, Universidade Federal de Catalão, Brasil
Author
-
Layane Rodrigues de Souza Queiroz
Instituto de Matemática e Estatística, Universidade Federal de Goiás, Brasil
Author
-
Thiago Alves de Queiroz
Instituto de Matemática e Tecnologia, Universidade Federal de Catalão, Brasil
Author
-
- Keywords:
- Patient Transportation, Pickup and delivery problem, Reoptimization heuristic, Tabu search
- Abstract
-
This work handles the problem of picking up and delivering patients among the distinct units of a hospital. This problem arises in hospitals that occupy a large geographic area and, hence, they have several units with different services from each other. The problem assumes a fleet of vehicles, each with a limited transport capacity. Requests for patients' transportation are received over the day and are completely unknown once released. The problem's objective is to determine routes, updated dynamically, for each vehicle so that the total weighted tardiness associated with servicing the requests is minimal. The proposal of this work relies on a re-optimization heuristic based on policies that use characteristics from the patients and the hospital, besides a tabu search metaheuristic. The heuristic approach can provide satisfactory solutions to the problem, considering instances of different sizes.
- Author Biographies
- References
-
André, M. V. de C., Silva, H. L. R. da, & Silva, Y. L. T. V. (2024). A local search heuristic for nurse assignment problems with personal preferences. Brazilian Journal of Production Engineering, 10(2), 70–81. https://doi.org/10.47456/bjpe.v10i2.44130
Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR Spectrum, 32, 77-107. https://doi.org/10.1007/s00291-008-0135-6
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1), 8-15. https://doi.org/10.1016/j.ejor.2009.04.024
Bolsi, B., Queiroz, T. A., Lima, V. de, Kramer, A., & Iori, M. (2024). Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach. Computers & Operations Research, 169, 106719. https://doi.org/10.1016/j.cor.2024.106719
Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of Operations Research, 153, 29-46. https://doi.org/10.1007/s10479-007-0170-8
Cordeau, J.-F., & Laporte, G. (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride Problem. Transportation Research Part B: Methodological, 37(6), 579-594. https://doi.org/10.1016/S0191-2615(02)00045-0
Côté, J.-F., Queiroz, T. A., Iori, M., & Vignoli, M. (2020). Transporte dinâmico de pacientes dentro de um Hospital. Anais do Simpósio Brasileiro de Pesquisa Operacional, João Pessoa, PB, Brasil, 1-12. https://doi.org/10.59254/sbpo-2020-122524
Creswell, J. (2023). Projeto de pesquisa: métodos qualitativo, quantitativo e mistos. Porto Alegre: Artmed.
Fonseca, G. S. (2023). Heurísticas para o transporte dinâmico de pacientes dentro de hospitais. (Dissertação de Mestrado). Instituto de Matemática e Tecnologia, Universidade Federal de Catalão. Catalão, GO, Brasil, 113p.
Glover, F. Tabu Search - Part I. (1989) ORSA Journal on Computing, 1(3), 190-206. https://doi.org/10.1287/ijoc.1.3.190
Landry, S., & Philippe, R. (2004). How logistics can service healthcare. Supply Chain Forum: An International Journal, 5(2), 24-30. https://doi.org/10.1080/16258312.2004.11517130
Luo, Z., Liu, M., & Lim, A. (2019). A two-phase branch-and-price-and-cut for a dial-a-ride problem in patient transportation. Transportation Science, Informs, 53(1), 113-130. https://doi.org/10.1287/trsc.2017.0772
Queiroz, T. A., Iori, M.; Kramer, A., & Kuo, Y.-H. (2023). Dynamic Scheduling of Patients in Emergency Departments. European Journal of Operational Research, 310, 100-116. https://doi.org/10.1016/j.ejor.2023.03.004
Talbi, E.-G. (2009). Metaheuristics: from design to implementation. New Jersey: John Wiley & Sons.
Toth, P., & Vigo, D. (2014). Vehicle Routing: Problems, methods, and applications. 2ª ed. Philadelphia: SIAM.
Vidal, T., Laporte, G., & Matl, P. (2020). A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research, 286(2), 401-416. https://doi.org/10.1016/j.ejor.2019.10.010
Zhao, J., Poon, M., Zhang, Z., & Gu, R. (2022). Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem. Computers & Operations Research, 147, 105938. https://doi.org/10.1016/j.cor.2022.105938
- Cover Image
-
- Downloads
- Published
- 2024-12-06
- Section
- Special Edition "VI Symposium on Production Engineering (SIENPRO)"
- License
-
Copyright (c) 2024 Ruan Myller Magalhães de Oliveira, Layane Rodrigues de Souza Queiroz, Thiago Alves de Queiroz (Autor)

This work is licensed under a Creative Commons Attribution 4.0 International License.
All works published in the Brazilian Journal of Production Engineering (BJPE) are licensed under Creative Commons Attribution 4.0 International (CC BY 4.0). This means that: Anyone can copy, distribute, display, adapt, remix, and even commercially use the content published in the journal; Provided that due credit is given to the authors and to BJPE as the original source; No additional permission is required for reuse, as long as the license terms are respected. This policy complies with the principles of open access, promoting the broad dissemination of scientific knowledge. 🔗 Click here to access the full license


2.png)







































