IDEAS home Printed from https://ideas.repec.org/a/eee/soceps/v77y2021ics0038012120308429.html
   My bibliography  Save this article

Modeling mobile health service delivery to Syrian migrant farm workers using call record data

Author

Listed:
  • Salman, F. Sibel
  • Yücel, Eda
  • Kayı, İlker
  • Turper-Alışık, Sedef
  • Coşkun, Abdullah

Abstract

A significant number of Syrian refugees under temporary protection in Turkey work in agriculture seasonally in various rural areas during several months a year. These migrant farm workers and their families are deprived of access to the regular health care system and preventive services due to their remote locations. The government supports the delivery of different types of mobile health care services, such as vaccination for children, reproductive health and screening services. While planning the mobile health care service delivery, it is critical to know where the refugees will work during what time frame; hence the demand for the services. By analyzing the call record data of a major mobile network operator in Turkey, we quantify the increase in the volume of calls made by Syrian refugees in various agricultural areas during the harvesting season of local crops. This information helps us to forecast spatial and temporal distribution of demand for mobile health care services at a fine granularity. Taking demand over multiple periods as input into a mathematical programming model, we optimize the routing of mobile clinics that visit locations close to where refugees are concentrated over the given planning horizon. We consider three hierarchical objectives. Given the availability of a number of mobile clinics at community health centers in the districts, the first objective aims to maximize the percentage of refugees that can benefit from each service type within pre-defined close distances. The second objective minimizes the number of clinics needed while covering the maximum percentage of refugees. The third objective minimizes the total travel distance of the clinics, while keeping the maximum coverage level using a minimum number of clinics to achieve this level. We quantify the benefits of centralized planning (by the province directorate) over decentralized planning (by each district separately). We also show the trade-off between the required number of clinics and coverage of potential patients.

Suggested Citation

  • Salman, F. Sibel & Yücel, Eda & Kayı, İlker & Turper-Alışık, Sedef & Coşkun, Abdullah, 2021. "Modeling mobile health service delivery to Syrian migrant farm workers using call record data," Socio-Economic Planning Sciences, Elsevier, vol. 77(C).
    • Handle: RePEc:eee:soceps:v:77:y:2021:i:c:s0038012120308429
    DOI: 10.1016/j.seps.2020.101005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012120308429
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2020.101005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    2. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    3. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    4. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    5. Lahrichi, Nadia & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter & Crişan, Gloria Cerasela & Vidal, Thibaut, 2015. "An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP," European Journal of Operational Research, Elsevier, vol. 246(2), pages 400-412.
    6. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    7. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    8. Raghavan, S. & Sahin, Mustafa & Salman, F. Sibel, 2019. "The capacitated mobile facility location problem," European Journal of Operational Research, Elsevier, vol. 277(2), pages 507-520.
    9. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    10. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    11. Stefan Nickel & Francisco Saldanha Gama, 2015. "Multi-Period Facility Location," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 289-310, Springer.
    12. Roberto Cantu-Funes & M. Angélica Salazar-Aguilar & Vincent Boyer, 2018. "Multi-depot periodic vehicle routing problem with due dates and time windows," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(2), pages 296-306, February.
    13. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    14. Eda Yücel & F. Sibel Salman & Burçin Bozkaya & Cemre Gökalp, 2020. "A data-driven optimization framework for routing mobile medical facilities," Annals of Operations Research, Springer, vol. 291(1), pages 1077-1102, August.
    15. Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong, 2018. "Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 117-142, June.
    16. Hà, Minh Hoàng & Bostel, Nathalie & Langevin, André & Rousseau, Louis-Martin, 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, Elsevier, vol. 226(2), pages 211-220.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qing Ye & Hong Wu, 2023. "Offline to online: The impacts of offline visit experience on online behaviors and service in an Internet hospital," Electronic Markets, Springer;IIM University of St. Gallen, vol. 33(1), pages 1-21, December.
    2. Pashapour, Amirreza & Günneç, Dilek & Salman, F. Sibel & Yücel, Eda, 2024. "Capacitated Mobile Facility Location Problem with Mobile Demand: Efficient Relief Aid Provision to En Route Refugees," Omega, Elsevier, vol. 129(C).
    3. Bayraktar, O. Baturhan & Günneç, Dilek & Salman, F. Sibel & Yücel, Eda, 2022. "Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand," European Journal of Operational Research, Elsevier, vol. 301(2), pages 708-725.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    2. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    3. Chenmei Teng & Poshan Yu & Liwen Liu, 2024. "A cooperative optimization model and enhanced algorithm for guided strategies in emergency mobile facilities," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-11, December.
    4. Bayraktar, O. Baturhan & Günneç, Dilek & Salman, F. Sibel & Yücel, Eda, 2022. "Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand," European Journal of Operational Research, Elsevier, vol. 301(2), pages 708-725.
    5. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    6. Pashapour, Amirreza & Günneç, Dilek & Salman, F. Sibel & Yücel, Eda, 2024. "Capacitated Mobile Facility Location Problem with Mobile Demand: Efficient Relief Aid Provision to En Route Refugees," Omega, Elsevier, vol. 129(C).
    7. Tang, Lianhua & Li, Yantong & Bai, Danyu & Liu, Tao & Coelho, Leandro C., 2022. "Bi-objective optimization for a multi-period COVID-19 vaccination planning problem," Omega, Elsevier, vol. 110(C).
    8. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    9. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    10. Ahn, Jaemyung & de Weck, Olivier & Geng, Yue & Klabjan, Diego, 2012. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration," European Journal of Operational Research, Elsevier, vol. 223(1), pages 47-59.
    11. Christian Artigues & Nicolas Jozefowiez & Boadu M. Sarpong, 2018. "Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 117-142, June.
    12. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    13. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
    14. Danwen Bao & Shijia Tian & Rui Li & Tianxuan Zhang & Ting Zhu, 2022. "Multi-Objective Decision Method for Airport Landside Rapid Transit Network Design," Networks and Spatial Economics, Springer, vol. 22(4), pages 767-801, December.
    15. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    16. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
    17. Wang, Mengtong & Zhang, Canrong & Bell, Michael G.H. & Miao, Lixin, 2022. "A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1258-1276.
    18. Shahmoradi-Moghadam, Hani & Schönberger, Jörn, 2021. "Joint optimization of production and routing master planning in mobile supply chains," Operations Research Perspectives, Elsevier, vol. 8(C).
    19. Jabbarzadeh, Armin & Azad, Nader & Verma, Manish, 2020. "An optimization approach to planning rail hazmat shipments in the presence of random disruptions," Omega, Elsevier, vol. 96(C).
    20. Barbati, Maria & Corrente, Salvatore & Greco, Salvatore, 2020. "A general space-time model for combinatorial optimization problems (and not only)," Omega, Elsevier, vol. 96(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:soceps:v:77:y:2021:i:c:s0038012120308429. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.