Abstract
We study the delivery of mobile medical services and in particular, the optimization of the joint stop location selection and routing of the mobile vehicles over a repetitive schedule consisting of multiple days. Considering the problem from the perspective of a mobile service provider company, we aim to provide the most revenue to the company by bringing the services closer to potential customers. Each customer location is associated with a score, which can be fully or partially covered based on the proximity of the mobile facility during the planning horizon. The problem is a variant of the team orienteering problem with prizes coming from covered scores. In addition to maximizing total covered score, a secondary criterion involves minimizing total travel distance/cost. We propose a data-driven optimization approach for this problem in which data analyses feed a mathematical programming model. We utilize a year-long transaction data originating from the customer banking activities of a major bank in Turkey. We analyze this dataset to first determine the potential service and customer locations in Istanbul by an unsupervised learning approach. We assign a score to each representative potential customer location based on the distances that the residents have taken for their past medical expenses. We set the coverage parameters by a spatial analysis. We formulate a mixed integer linear programming model and solve it to near-optimality using Cplex. We quantify the trade-off between capacity and service level. We also compare the results of several models differing in their coverage parameters to demonstrate the flexibility of our model and show the impact of accounting for full and partial coverage.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allahyari, S., Salari, M., & Vigo, D. (2015). A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. European Journal of Operational Research, 242(3), 756–768.
Archetti, C., Speranza, M. G., & Vigo, D. (2014). Vehicle routing: Problems, methods, and applications (2nd ed., pp. 273–297). Philadelphia: SIAM. (Chapter 10).
Berman, O., Krass, D., & Drezner, Z. (2003). The gradual covering decay location problem on a network. European Journal of Operational Research, 151(3), 474–480.
Choi, T.-M., Wallace, S. W., & Wang, Y. (2018). Big data analytics in operations management. Production and Operations Management,. https://doi.org/10.1111/poms.12838.
Crouse, H. L., Macias, C. G., Cruz, A. T., Wilson, K. A., & Torrey, S. B. (2010). Utilization of a mobile medical van for delivering pediatric care in the bateys of the dominican republic. International Journal of Emergency Medicine, 3(4), 227–232.
Current, J. R., & Schilling, D. A. (1989). The covering salesman problem. Transportation Science, 23(3), 208–213.
Current, J. R., & Schilling, D. A. (1994). The median tour and maximal covering tour problems: Formulations and heuristics. European Journal of Operational Research, 73(1), 114–126.
Doerner, K. F., Focke, A., & Gutjahr, W. J. (2007). Multicriteria tour planning for mobile healthcare facilities in a developing country. European Journal of Operational Research, 179(3), 1078–1096.
Doerner, K. F., & Hartl, R. F. (2008). The vehicle routing: Problem: Latest advances and new challenges, chapter health care logistics, emergency preparedness and disaster relief (pp. 527–550). Berlin: Springer.
Drezner, Z., Wesolowsky, G. O., & Drezner, T. (2004). The gradual covering problem. Naval Research Logistics (NRL), 51(6), 841–855.
Erdoğan, G., Cordeau, J.-F., & Laporte, G. (2010). The attractive traveling salesman problem. European Journal of Operational Research, 203(1), 59–69.
Gendreau, M., Laporte, G., & Semet, F. (1997). The covering tour problem. Operations Research, 45(4), 568–576.
Govindan, K., Cheng, T. C. E., Mishra, N., & Shukla, N. (2018). Big data analytics and application for logistics and supply chain management. Transportation Research Part E: Logistics and Transportation Review, 114, 343–349.
Gunawan, A., Lau, H. C., & Vansteenwegen, P. (2016). Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research, 255(2), 315–332.
Gunpinar, S., & Centeno, G. (2016). An integer programming approach to the bloodmobile routing problem. Transportation Research Part E: Logistics and Transportation Review, 86, 94–115.
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2013). An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. European Journal of Operational Research, 226(2), 211–220.
Hachicha, M., Hodgson, M. J., Laporte, G., & Semet, F. (2000). Heuristics for the multi-vehicle covering tour problem. Computers and Operations Research, 27(1), 29–42.
Hill, C. F., Powers, B. W., Jain, S. H., Bennet, J., Vavasis, A., & Oriol, N. E. (2014). Mobile health clinics in the era of reform. The American Journal of Managed Care, 20(3), 261–264.
Hodgson, M. J., Laporte, G., & Semet, F. (1998). A covering tour model for planning mobile health care facilities in Suhum District, Ghana. Journal of Regional Science, 38(4), 621–638.
Jozefowiez, N. (2014). A branch-and-price algorithm for the multivehicle covering tour problem. Networks, 64(3), 160–168.
Karasakal, O., & Karasakal, E. K. (2004). A maximal covering location model in the presence of partial coverage. Computers and Operations Research, 31(9), 1515–1526.
Ozbaygin, G., Yaman, H., & Karasan, O. E. (2016). Time constrained maximal covering salesman problem with weighted demands and partial coverage. Computers and Operations Research, 76, 226–237.
Pham, T. A., Ha, M. H., & Nguyen, X. H. (2017). Solving the multi-vehicle multi-covering tour problem. Computers and Operations Research, 88, 258–278.
Rabbani, M., Aghabegloo, M., & Farrokhi-Asl, H. (2017). Solving a bi-objective mathematical programming model for bloodmobiles location routing problem. International Journal of Industrial Engineering Computations, 8(1), 19–32.
Şahinyazan, F. G., Kara, B. Y., & Taner, M. R. (2015). Selective vehicle routing for a mobile blood donation system. European Journal of Operational Research, 245(1), 22–34.
Tricoire, F., Graf, A., & Gutjahr, W. J. (2012). The bi-objective stochastic covering tour problem. Computers and Operations Research, 39(7), 1582–1592.
Vargas, L., Jozefowiez, N., & Ngueveu, S. U. (2017). A dynamic programming operator for tour location problems applied to the covering tour problem. Journal of Heuristics, 23(1), 53–80.
Vidal, T., Maculan, N., Ochi, L. S., & Penna, P. H. V. (2016). Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transportation Science, 50(2), 720–734.
Wang, G., Gunasekaran, A., Ngai, E. W. T., & Papadopoulos, T. (2016). Big data analytics in logistics and supply chain management: Certain investigations for research and applications. International Journal of Production Economics, 176, 98–110.
Zhong, R. Y., Newman, S. T., Huang, G. Q., & Lan, S. (2016). Big data for supply chain management in the service and manufacturing sectors: Challenges, opportunities, and future perspectives. Computers and Industrial Engineering, 101, 572–591.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yücel, E., Salman, F.S., Bozkaya, B. et al. A data-driven optimization framework for routing mobile medical facilities. Ann Oper Res 291, 1077–1102 (2020). https://doi.org/10.1007/s10479-018-3058-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-3058-x