IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i2p218-d1315736.html
   My bibliography  Save this article

A Lattice Boltzmann Method-like Algorithm for the Maximal Covering Location Problem on the Complex Network: Application to Location of Railway Emergency-Rescue Spot

Author

Listed:
  • Huizhu Wang

    (School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China)

  • Jianqin Zhou

    (School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China)

  • Ling Zhou

    (Materials Management Department, China State Railway Group Co., Ltd., Beijing 100844, China)

Abstract

Inspired by the core idea of the lattice Boltzmann method (LBM), which is successfully used in complex and nonlinear processes, we developed a lattice Boltzmann method-like (LBM-like) algorithm to effectively solve the maximal covering location problem with continuous- and inhomogeneous-edge demand on the complex network. The LBM-like algorithm developed has three key components, including the basic map, transfer function and effect function. The basic map is responsible for reasonably mapping complex networks with multiple branches and circles. Transfer functions are used to describe the complex covering process of the facility on the network, by splitting the entire covering process into several single-step covering processes, while the effect function is responsible for recording and processing the coverage effect of each covering process, based upon the requirement of an objective function. This LBM-like algorithm has good applicability to a complex network, intuitiveness, relatively low computational complexity, and open developability. Furthermore, the idea of the greedy algorithm was coupled with the LBM-like algorithm, to form two types of hybrid algorithms for improving the computational efficiency for the location problem, with multiple facilities, on a large-scale network. Finally, we successfully applied the LBM-like algorithm to the location problem of an emergency rescue spot on a real railway network, to underline the practicality of the proposed algorithm.

Suggested Citation

  • Huizhu Wang & Jianqin Zhou & Ling Zhou, 2024. "A Lattice Boltzmann Method-like Algorithm for the Maximal Covering Location Problem on the Complex Network: Application to Location of Railway Emergency-Rescue Spot," Mathematics, MDPI, vol. 12(2), pages 1-20, January.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:2:p:218-:d:1315736
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/2/218/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/2/218/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bababeik, Mostafa & Khademi, Navid & Chen, Anthony, 2018. "Increasing the resilience level of a vulnerable rail network: The strategy of location and allocation of emergency relief trains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 110-128.
    2. 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.
    3. Yi Feng & Shaoze Cui, 2021. "A review of emergency response in disasters: present and future perspectives," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 105(1), pages 1109-1138, January.
    4. Cheng, Yung-Hsiang & Liang, Zheng-Xian, 2014. "A strategic planning model for the railway system accident rescue problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 75-96.
    5. Blanquero, Rafael & Carrizosa, Emilio & G.-Tóth, Boglárka, 2016. "Maximal Covering Location Problems on networks with regional demand," Omega, Elsevier, vol. 64(C), pages 77-85.
    6. Caunhye, Aakil M. & Nie, Xiaofeng & Pokharel, Shaligram, 2012. "Optimization models in emergency logistics: A literature review," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 4-13.
    7. Richard Church & Charles R. Velle, 1974. "The Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 32(1), pages 101-118, January.
    8. Brotcorne, Luce & Laporte, Gilbert & Semet, Frederic, 2003. "Ambulance location and relocation models," European Journal of Operational Research, Elsevier, vol. 147(3), pages 451-463, June.
    9. Blanco, Víctor & Gázquez, Ricardo & Saldanha-da-Gama, Francisco, 2023. "Multi-type maximal covering location problems: Hybridizing discrete and continuous problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1040-1054.
    10. Baldomero-Naranjo, Marta & Kalcsics, Jörg & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2022. "Upgrading edges in the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 14-36.
    11. N C Simpson & P G Hancock, 2009. "Fifty years of operational research and emergency response," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 126-139, May.
    12. David J. Eaton & Mark S. Daskin & Dennis Simmons & Bill Bulloch & Glen Jansma, 1985. "Determining Emergency Medical Service Vehicle Deployment in Austin, Texas," Interfaces, INFORMS, vol. 15(1), pages 96-108, February.
    Full references (including those not matched with items on IDEAS)

    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. Huizhu Wang & Jianqin Zhou, 2023. "Location of Railway Emergency Rescue Spots Based on a Near-Full Covering Problem: From a Perspective of Diverse Scenarios," Sustainability, MDPI, vol. 15(8), pages 1-16, April.
    2. Wang, Wei & Wu, Shining & Wang, Shuaian & Zhen, Lu & Qu, Xiaobo, 2021. "Emergency facility location problems in logistics: Status and perspectives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    3. 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.
    4. Mohri, Seyed Sina & Akbarzadeh, Meisam & Sayed Matin, Seyed Hamed, 2020. "A Hybrid model for locating new emergency facilities to improve the coverage of the road crashes," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    5. Wajid, Shayesta & Nezamuddin, N., 2023. "Capturing delays in response of emergency services in Delhi," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    6. Carvalho, A.S. & Captivo, M.E. & Marques, I., 2020. "Integrating the ambulance dispatching and relocation problems to maximize system’s preparedness," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1064-1080.
    7. Wajid, Shayesta & Nezamuddin, N., 2022. "A robust survival model for emergency medical services in Delhi, India," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    8. Bélanger, V. & Lanzarone, E. & Nicoletta, V. & Ruiz, A. & Soriano, P., 2020. "A recursive simulation-optimization framework for the ambulance location and dispatching problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 713-725.
    9. Saint-Guillain, Michael & Paquay, Célia & Limbourg, Sabine, 2021. "Time-dependent stochastic vehicle routing problem with random requests: Application to online police patrol management in Brussels," European Journal of Operational Research, Elsevier, vol. 292(3), pages 869-885.
    10. Bertsimas, Dimitris & Ng, Yeesian, 2019. "Robust and stochastic formulations for ambulance deployment and dispatch," European Journal of Operational Research, Elsevier, vol. 279(2), pages 557-571.
    11. Jian Wang & Yin Wang & Mingzhu Yu, 2022. "A multi-period ambulance location and allocation problem in the disaster," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 909-932, July.
    12. Nadide Caglayan & Sule Itir Satoglu, 2021. "Multi-Objective Two-Stage Stochastic Programming Model for a Proposed Casualty Transportation System in Large-Scale Disasters: A Case Study," Mathematics, MDPI, vol. 9(4), pages 1-22, February.
    13. Ridler, Samuel & Mason, Andrew J. & Raith, Andrea, 2022. "A simulation and optimisation package for emergency medical services," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1101-1113.
    14. Shayesta Wajid & N. Nezamuddin, 2023. "Optimizing emergency services for road safety using a decomposition method: a case study of Delhi," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 155-173, March.
    15. Jian Wang & Yin Wang & Mingzhu Yu, 0. "A multi-period ambulance location and allocation problem in the disaster," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    16. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    17. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.
    18. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    19. Lu, Chung-Cheng & Ying, Kuo-Ching & Chen, Hui-Ju, 2016. "Real-time relief distribution in the aftermath of disasters – A rolling horizon approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 1-20.
    20. Gabriel Zayas‐Cabán & Emmett J. Lodree & David L. Kaufman, 2020. "Optimal Control of Parallel Queues for Managing Volunteer Convergence," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2268-2288, October.

    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:gam:jmathe:v:12:y:2024:i:2:p:218-:d:1315736. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.