IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v301y2022i2p708-725.html
   My bibliography  Save this article

Relief Aid Provision to En Route Refugees: Multi-Period Mobile Facility Location with Mobile Demand

Author

Listed:
  • Bayraktar, O. Baturhan
  • Günneç, Dilek
  • Salman, F. Sibel
  • Yücel, Eda

Abstract

Many humanitarian organizations aid en route refugee groups who are on their journey to cross borders using mobile facilities and need to decide the number and routes of the facilities. We define a multi-period facility location problem in which both the facilities and demand are mobile on a network. Refugee groups may enter and exit the network in different periods and follow various paths. In each period, a refugee group moves from one node to an adjacent one in their predetermined path. Each facility should be located at a node in each period and provides service to the refugees at that node. Each refugee should be served at least once in a predetermined number of consecutive periods. The problem is to locate the facilities in each period to minimize the total setup and travel costs of the mobile facilities, while ensuring the service requirement. We call this problem the multi-period mobile facility location problem with mobile demand (MM-FLP-MD) and prove its NP-hardness. We formulate a mixed integer linear programming (MILP) model and develop an adaptive large neighborhood search algorithm (ALNS) to solve large-size instances. We tested the computational performance of the MILP and the metaheuristic algorithm by extracting data from the 2018 Honduras Migration Crisis. For instances solved to optimality by the MILP model, the proposed ALNS determines the optimal solutions faster and provides better solutions for the remaining instances. By analyzing the sensitivity to different parameters, we provide insights to decision-makers.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:301:y:2022:i:2:p:708-725
    DOI: 10.1016/j.ejor.2021.11.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721009577
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.11.011?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Sterle, Claudio & Sforza, Antonio & Esposito Amideo, Annunziata, 2016. "Multi-period location of flow intercepting portable facilities of an intelligent transportation system," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 4-13.
    3. 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).
    4. Justo Puerto & Antonio M. Rodríguez-Chía, 1999. "Location of a moving service facility," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(3), pages 373-393, July.
    5. Doerner, Karl & Focke, Axel & Gutjahr, Walter J., 2007. "Multicriteria tour planning for mobile healthcare facilities in a developing country," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1078-1096, June.
    6. Bélanger, V. & Ruiz, A. & Soriano, P., 2019. "Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles," European Journal of Operational Research, Elsevier, vol. 272(1), pages 1-23.
    7. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    8. David Pisinger & Stefan Ropke, 2019. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 99-127, Springer.
    9. 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.
    10. Russell Halper & S. Raghavan, 2011. "The Mobile Facility Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 413-434, August.
    11. John Hodgson, M., 1981. "The location of public facilities intermediate to the journey to work," European Journal of Operational Research, Elsevier, vol. 6(2), pages 199-204, February.
    12. 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.
    13. Oded Berman & Richard C. Larson & Nikoletta Fouska, 1992. "Optimal Location of Discretionary Service Facilities," Transportation Science, INFORMS, vol. 26(3), pages 201-211, August.
    14. Derya Celik Turkoglu & Mujde Erol Genevois, 2020. "A comparative survey of service facility location problems," Annals of Operations Research, Springer, vol. 292(1), pages 399-468, September.
    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. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    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. 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.

    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. 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).
    2. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    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. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    5. 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).
    6. Hamid Mousavi & Soroush Avakh Darestani & Parham Azimi, 2021. "An artificial neural network based mathematical model for a stochastic health care facility location problem," Health Care Management Science, Springer, vol. 24(3), pages 499-514, September.
    7. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
    8. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    9. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
    10. 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.
    11. Ribeiro, Glaydston Mattos & Laporte, Gilbert & Mauri, Geraldo Regis, 2012. "A comparison of three metaheuristics for the workover rig routing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 28-36.
    12. Singh, Nitish & Dang, Quang-Vinh & Akcay, Alp & Adan, Ivo & Martagan, Tugce, 2022. "A matheuristic for AGV scheduling with battery constraints," European Journal of Operational Research, Elsevier, vol. 298(3), pages 855-873.
    13. Canca, David & De-Los-Santos, Alicia & Laporte, Gilbert & Mesa, Juan A., 2019. "Integrated Railway Rapid Transit Network Design and Line Planning problem with maximum profit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 1-30.
    14. Sistig, Hubert Maximilian & Sauer, Dirk Uwe, 2023. "Metaheuristic for the integrated electric vehicle and crew scheduling problem," Applied Energy, Elsevier, vol. 339(C).
    15. Xiaoxu Wei & Zhouru Xiao & Yongsheng Wang, 2024. "Solving the Vehicle Routing Problem with Time Windows Using Modified Rat Swarm Optimization Algorithm Based on Large Neighborhood Search," Mathematics, MDPI, vol. 12(11), pages 1-33, May.
    16. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    17. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    18. Gzara, Fatma & Erkut, Erhan, 2009. "A Lagrangian relaxation approach to large-scale flow interception problems," European Journal of Operational Research, Elsevier, vol. 198(2), pages 405-411, October.
    19. Perumal, S.S.G. & Dollevoet, T.A.B. & Huisman, D. & Lusby, R.M. & Larsen, J. & Riis, M., 2020. "Solution Approaches for Vehicle and Crew Scheduling with Electric Buses," Econometric Institute Research Papers EI-2020-02, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Allahyari, Somayeh & Yaghoubi, Saeed & Van Woensel, Tom, 2021. "A novel risk perspective on location-routing planning: An application in cash transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(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:ejores:v:301:y:2022:i:2:p:708-725. 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/eor .

    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.