Transport System Planning For Medication Distribution at Patients' Homes

Document Type : Original Article

Authors

1 Ph.D., School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran.

2 Associate Professor, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran.

3 Professor, School of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran.

Abstract

The vehicle routing problem (VRP) is one of the most well-known optimization problems. It has been the focus of extensive research on transportation systems planning in recent decades. The present aims to investigate the problem of routing vehicles from the pharmacy for the delivery of drugs at patients' homes. The problem of delivery of drugs required by patients is accompanied by a series of operational limitations. It is assumed that each patient receives drugs through a vehicle, and also drugs must reach the patients’ homes before a certain time. To balance the workload of drivers, the maximum number of homes that each vehicle can go to deliver medicines is predetermined. The presented model determines the number of vehicles, the routes of the vehicles and also the time at which drugs are delivered at each patient’ home. To solve the proposed model, in addition to GAMS optimization software, a genetic algorithm is proposed for large-scale instances. The computational results demonstrate that the proposed model can be used to make optimal decisions on the distribution of drugs from pharmacies to patients' homes.

Keywords

Main Subjects


قصیری، ک. و قنادپور، س.ف. (1387). مساله مسیریابی وسایل نقلیه همراه با پنجره زمانی با استفاده از الگوریتم ژنتیک، ششمین کنفرانس بین­المللی مهندسی صنایع، تهران، انجمن مهندسی صنایع ایران، دانشگاه صنعتی شریف.
-Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers & industrial engineering99, 300-313. doi.org/10.1016/j.cie.2015.12.007.
-Cissé, M., Yalçındağ, S., Kergosien, Y., Şahin, E., Lenté, C., & Matta, A. (2017). OR problems related to Home Health Care: A review of relevant routing and scheduling problems. Operations research for health care13, 1-22.                      doi.org/10.1016/j.orhc.2017.06.001
-Di Mascolo, M., Espinouse, M. L., & El Hajri, Z. (2017). Planning in home health care structures: A literature review. IFAC-PapersOnLine50(1), 4654-4659.         doi.org/10.1016/j.ifacol.2017.08.689
-Di Mascolo, M., Martinez, C., & Espinouse, M. L. (2021). Routing and scheduling in home health care: A literature survey and bibliometric analysis. Computers & Industrial Engineering158, 107255. doi.org/10.1016/j.cie.2021.107255
-Elshaer, R., & Awad, H. (2020). A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Computers & IndustrialEngineering140,106242.doi.org/10.1016/j.cie.2019.106242
-Fikar, C., & Hirsch, P. (2017). Home health care routing and scheduling: A review. Computers & Operations Research77, 86-95.doi.org/10.1016/j.cor.2016.07.019
-Laporte, G. (2009). Fifty years of vehicle routing. Transportation science43(4), 408-416.doi.org/10.1287/trsc.1090.0301
-Lin, C., Choy, K. L., Ho, G. T., Chung, S. H., & Lam, H. Y. (2014). Survey of green vehicle routing problem: past and future trends. Expert systems with applications41(4), 1118-1138.doi.org/10.1016/j.eswa.2013.07.107
-World Health Organization. (2021). Decade of healthy ageing: baseline report. World Health Organization.
-Taş, D., Dellaert, N., Van Woensel, T., & De Kok, T. (2013). Vehicle routing problem with stochastic travel times including soft time windows and service costs. Computers & Operations Research40(1), 214-224.doi.org/10.1016/j.cor.2012.06.008
-Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.
Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for industrial and applied mathematics.