IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v49y2019i5p371-383.html
   My bibliography  Save this article

Collaborative Human–UAV Search and Rescue for Missing Tourists in Nature Reserves

Author

Listed:
  • Yu-Jun Zheng

    (Institute of Service Engineering, Hangzhou Normal University, Hangzhou 311121, China;)

  • Yi-Chen Du

    (College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310058, China;)

  • Wei-Guo Sheng

    (Institute of Service Engineering, Hangzhou Normal University, Hangzhou 311121, China;)

  • Hai-Feng Ling

    (College of Field Engineering, Army Engineering University, XRC7+95 Jiangning, Nanjing, China)

Abstract

The use of unmanned aerial vehicles (UAVs) is becoming commonplace in search-and-rescue tasks in complex terrains. In the literature, there are a number of studies on UAV search with the objective of minimizing search time and/or maximizing detection probability. However, little effort has been devoted to collaborative human and UAV search, which is necessary in many applications in which humans must ultimately reach the target. In this paper, we present a collaborative human–UAV search-planning problem, the objective of which is to minimize the expected time for human rescuers to reach the target. For this highly complex problem, traditional exact algorithms would be very time-consuming or even impractical for solving even relatively small instances. We propose an evolutionary algorithm that uses biogeography-inspired operators to efficiently evolve a population of candidate solutions to the optimal or near-optimal solution within an acceptable time. Computational experiments demonstrate the advantages of our algorithm over many popular algorithms. The proposed method has been successfully applied to two real-world search-and-rescue operations to find missing tourists in a nature reserve in China. Compared with the old method used by the rescue department, our method shortened the time required for reaching the targets by approximately 79 and 147 minutes in the two cases, respectively, providing a great improvement in the life-critical operations.

Suggested Citation

  • Yu-Jun Zheng & Yi-Chen Du & Wei-Guo Sheng & Hai-Feng Ling, 2019. "Collaborative Human–UAV Search and Rescue for Missing Tourists in Nature Reserves," Interfaces, INFORMS, vol. 49(5), pages 371-383, September.
  • Handle: RePEc:inm:orinte:v:49:y:2019:i:5:p:371-383
    DOI: 10.1287/inte.2019.1000
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/inte.2019.1000
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.2019.1000?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
    ---><---

    References listed on IDEAS

    as
    1. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    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. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.
    2. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    3. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    4. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    5. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    6. Wang, Chao & Lim, Ming K & Zhao, Longfeng & Tseng, Ming-Lang & Chien, Chen-Fu & Lev, Benjamin, 2020. "The evolution of Omega-The International Journal of Management Science over the past 40 years: A bibliometric overview," Omega, Elsevier, vol. 93(C).
    7. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    8. S Afshin Mansouri & Emel Aktas, 2016. "Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1382-1394, November.
    9. J E C Arroyo & V A Armentano, 2004. "A partial enumeration heuristic for multi-objective flowshop scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 1000-1007, September.
    10. Chen, Chuen-Lung & Vempati, Venkateswara S. & Aljaber, Nasser, 1995. "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, Elsevier, vol. 80(2), pages 389-396, January.
    11. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
    12. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    13. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    14. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    15. Framinan, Jose M. & Perez-Gonzalez, Paz, 2015. "On heuristic solutions for the stochastic flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 413-420.
    16. Laha, Dipak & Sarin, Subhash C., 2009. "A heuristic to minimize total flow time in permutation flow shop," Omega, Elsevier, vol. 37(3), pages 734-739, June.
    17. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    18. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    19. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    20. X Wang & L Tang, 2011. "Scheduling a single machine with multiple job processing ability to minimize makespan," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1555-1565, August.

    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:inm:orinte:v:49:y:2019:i:5:p:371-383. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.