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

Humanitarian demining for the clearance of landmine-affected areas

Author

Listed:
  • Camacho-Sanchez, Carolay
  • Yie-Pinedo, Ruben
  • Galindo, Gina

Abstract

Humanitarian demining is the process of removing landmines from contaminated areas. Behind this arduous task lies a high risk of collateral damage to deminers and their equipment. The intrinsic operational cost often forces agents to abandon the task before its completion, making such areas a source of risk, especially for the civilian population and biodiversity. Most of the research to date has revolved around the technological development of devices capable of effectively detecting mines at a selected point within an area, while the search strategy itself to decide where to explore and which route to follow has been understudied. This paper proposes a decision support model (DSM) that produces highly safe and cost-effective mine detection search plans. Since the computational time of the solution increases along with the size of the area explored, exact linear methods are proposed for small and medium instances of the problem, whereas a genetic algorithm (GA) is proposed for large instances. Results show that the GA approach is capable of delivering solutions close to the optimum.

Suggested Citation

  • Camacho-Sanchez, Carolay & Yie-Pinedo, Ruben & Galindo, Gina, 2023. "Humanitarian demining for the clearance of landmine-affected areas," Socio-Economic Planning Sciences, Elsevier, vol. 88(C).
    • Handle: RePEc:eee:soceps:v:88:y:2023:i:c:s0038012123001118
    DOI: 10.1016/j.seps.2023.101611
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0038012123001118
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2023.101611?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. Gelenbe, Erol & Cao, Yonghuan, 1998. "Autonomous search for mines," European Journal of Operational Research, Elsevier, vol. 108(2), pages 319-333, July.
    2. Carlos Otero-Palencia & René Amaya–Mier & Ruben Yie-Pinedo, 2019. "A stochastic joint replenishment problem considering transportation and warehouse constraints with gainsharing by Shapley Value allocation," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3036-3059, May.
    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. Xuefei Shi & Haiyan Wang, 2022. "Design of the cost allocation rule for joint replenishment to an overseas warehouse with a piecewise linear holding cost rate," Operational Research, Springer, vol. 22(5), pages 4905-4929, November.
    2. Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
    3. Huibo Bi, 2014. "Routing Diverse Evacuees with the Cognitive Packet Network Algorithm," Future Internet, MDPI, vol. 6(2), pages 1-20, April.
    4. Erol Gelenbe & Fang-Jing Wu, 2013. "Future Research on Cyber-Physical Emergency Management Systems," Future Internet, MDPI, vol. 5(3), pages 1-19, June.
    5. Erol Gelenbe, 2015. "Synchronising Energy Harvesting and Data Packets in a Wireless Sensor," Energies, MDPI, vol. 8(1), pages 1-14, January.

    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:88:y:2023:i:c:s0038012123001118. 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.