{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:22:37Z","timestamp":1767705757100,"version":"build-2065373602"},"reference-count":40,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T00:00:00Z","timestamp":1727308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["52205529","ZR2021QE195","ZR2021MD090","319462208"],"award-info":[{"award-number":["52205529","ZR2021QE195","ZR2021MD090","319462208"]}]},{"name":"Natural Science Foundation of Shandong Province","award":["52205529","ZR2021QE195","ZR2021MD090","319462208"],"award-info":[{"award-number":["52205529","ZR2021QE195","ZR2021MD090","319462208"]}]},{"name":"Opening Fund of Shandong Provincial Key Laboratory of Network based Intelligent Computing","award":["52205529","ZR2021QE195","ZR2021MD090","319462208"],"award-info":[{"award-number":["52205529","ZR2021QE195","ZR2021MD090","319462208"]}]},{"name":"Discipline with Strong Characteristics of Liaocheng University-Intelligent Science and Technology","award":["52205529","ZR2021QE195","ZR2021MD090","319462208"],"award-info":[{"award-number":["52205529","ZR2021QE195","ZR2021MD090","319462208"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Research on helicopter dispatching has received considerable attention, particularly in relation to post-disaster rescue operations. The survival chances of individuals trapped in emergency situations decrease as time passes, making timely helicopter dispatch crucial for successful rescue missions. Therefore, this study investigates a collaborative helicopter rescue routing problem with time window and limited survival time constraints, solving it using an improved iterative greedy (IIG) algorithm. In the proposed algorithm, a heuristic initialization strategy is designed to generate an efficient and feasible initial solution. Then, a feasible-first destruction-construction strategy is applied to enhance the algorithm\u2019s exploration ability. Next, a problem-specific local search strategy is developed to improve the algorithm\u2019s local search effectiveness. In addition, the simulated annealing (SA) method is integrated as an acceptance criterion to avoid the algorithm from getting trapped in local optima. Finally, to evaluate the efficacy of the proposed IIG, 56 instances were generated based on Solomon instances and used for simulation tests. A comparative analysis was conducted against six efficient algorithms from the existing studies. The experimental results demonstrate that the proposed algorithm performs well in solving the post-disaster rescue helicopter routing problem.<\/jats:p>","DOI":"10.3390\/a17100431","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T11:40:27Z","timestamp":1727350827000},"page":"431","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Iterated Greedy Algorithm for Solving Collaborative Helicopter Rescue Routing Problem with Time Window and Limited Survival Time"],"prefix":"10.3390","volume":"17","author":[{"given":"Xining","family":"Cui","sequence":"first","affiliation":[{"name":"Institute of Robotics and Intelligent Systems, School of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan 430081, China"},{"name":"School of Computer Science, Liaocheng University, Liaocheng 252059, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaidong","family":"Yang","sequence":"additional","affiliation":[{"name":"Shandong Key Laboratory of Optical Communication Science and Technology, Liaocheng University, Liaocheng 252059, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252059, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Duan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252059, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ejor.2020.03.017","article-title":"Decision making on post-disaster rescue routing problems from the rescue efficiency perspective","volume":"286","author":"Liu","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Zhu, J., Zhao, H., Wei, Y., Ma, C., and Lv, Q. (2022). Unmanned aerial vehicle computation task scheduling based on parking resources in post-disaster rescue. Appl. Sci., 13.","DOI":"10.3390\/app13010289"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"101403","DOI":"10.1016\/j.aei.2021.101403","article-title":"Post disaster adaptation management in airport: A coordination of runway and hangar resources for relief cargo transports","volume":"50","author":"Qin","year":"2021","journal-title":"Adv. Eng. Inform."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"106632","DOI":"10.1016\/j.cie.2020.106632","article-title":"An integrated location-routing problem with post-disaster relief distribution","volume":"147","author":"Wei","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Mishra, B.K., Dahal, K., and Pervez, Z. (2022). Dynamic relief items distribution model with sliding time window in the post-disaster environment. Appl. Sci., 12.","DOI":"10.3390\/app12168358"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"3898","DOI":"10.1109\/TIV.2023.3272621","article-title":"GA-LNS optimization for helicopter rescue dispatch","volume":"8","author":"Cheng","year":"2023","journal-title":"IEEE Trans. Intell. Veh."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Xue, Y., Gao, Y., Tian, Y., Liu, H., and Wang, X. (2022). Helicopter rescue for flood disaster: Scheduling, simulation, and evaluation. Aerospace, 9.","DOI":"10.3390\/aerospace9120822"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"107994","DOI":"10.1016\/j.cie.2022.107994","article-title":"Helicopter\u2013UAVs search and rescue task allocation considering UAVs operating environment and performance","volume":"167","author":"Zhang","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"187370","DOI":"10.1155\/2014\/187370","article-title":"PSO-based robot path planning for multisurvivor rescue in limited survival time","volume":"2014","author":"Geng","year":"2014","journal-title":"Math. Prob. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"101320","DOI":"10.1016\/j.swevo.2023.101320","article-title":"A cooperative iterated greedy algorithm for the distributed flowshop group robust scheduling problem with uncertain processing times","volume":"79","author":"Wang","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"108036","DOI":"10.1016\/j.knosys.2021.108036","article-title":"A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion","volume":"239","author":"Li","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, Y., and Han, Y. (2023). A variant iterated greedy algorithm integrating multiple decoding rules for hybrid blocking flow shop scheduling problem. Mathematics, 11.","DOI":"10.3390\/math11112453"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"107791","DOI":"10.1016\/j.cie.2021.107791","article-title":"An effective multi-AGVs dispatching method applied to matrix manufacturing workshop","volume":"163","author":"Zhang","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithm for the vehicle routing and scheduling problem with time windows","volume":"66","author":"Potvin","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1057\/palgrave.jors.2601113","article-title":"A greedy look-ahead heuristic for the vehicle routing problem with time windows","volume":"52","author":"Ioannou","year":"2017","journal-title":"J. Oper. Res. Soc."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"119464","DOI":"10.1016\/j.jclepro.2019.119464","article-title":"Meta-heuristic algorithm for solving vehicle routing problems with time windows and synchronized visit constraints in prefabricated systems","volume":"250","author":"Li","year":"2020","journal-title":"J. Clean. Prod."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","article-title":"Vehicle routing problem with time windows, Part II: Metaheuristics","volume":"39","author":"Michel","year":"2005","journal-title":"Transp. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ins.2022.08.103","article-title":"A hybrid evolutionary multitask algorithm for the multiobjective vehicle routing problem with time windows","volume":"612","author":"Cai","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"126","DOI":"10.5755\/j01.itc.51.1.29924","article-title":"Constraint-aware policy optimization to solve the vehicle routing problem with time windows","volume":"51","author":"Zhang","year":"2022","journal-title":"Inf. Technol. Control"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ejor.2023.02.028","article-title":"Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows","volume":"310","author":"Liu","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Saksuriya, P., and Likasiri, C. (2022). Hybrid heuristic for vehicle routing problem with time windows and compatibility constraints in home healthcare system. Appl. Sci., 12.","DOI":"10.3390\/app12136486"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Xu, R., Li, S., and Wu, J. (2023). Multi-trip vehicle routing problem with time windows and resource synchronization on heterogeneous facilities. Systems, 11, with time windows. Symmetry 2023, 15, 486.","DOI":"10.3390\/sym15020486"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ahmed, Z., and Yousefikhoshbakht, M. (2023). A hybrid algorithm for the heterogeneous fixed fleet open vehicle routing problem with Time Windows. Symmetry, 15.","DOI":"10.3390\/sym15020486"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"106016","DOI":"10.1016\/j.cor.2022.106016","article-title":"A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle fleet reduction","volume":"149","author":"Bezerra","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"121087","DOI":"10.1109\/ACCESS.2023.3328404","article-title":"A hybrid brain storm optimization algorithm for dynamic vehicle routing problem with time windows","volume":"11","author":"Liu","year":"2023","journal-title":"IEEE Access"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"133916","DOI":"10.1016\/j.jclepro.2022.133916","article-title":"An adaptive large neighborhood search for the larger-scale multi depot green vehicle routing problem with time windows","volume":"374","author":"Wen","year":"2022","journal-title":"J. Clean. Prod."},{"key":"ref_29","first-page":"275","article-title":"General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows","volume":"14","year":"2023","journal-title":"Int. J. Ind. Eng. Comp."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Gao, J., Zheng, X., Gao, F., Tong, X., and Han, Q. (2022). Heterogeneous multitype fleet green vehicle path planning of automated guided vehicle with time windows in flexible manufacturing system. Machines, 10.","DOI":"10.3390\/machines10030197"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, W., Zeng, M., Guo, P., and Wen, K. (2022). Variable neighborhood search for multi-cycle medical waste recycling vehicle routing problem with time windows. Int. J. Environ. Res. Public Health, 19.","DOI":"10.3390\/ijerph191912887"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"237","DOI":"10.5755\/j01.itc.49.2.24613","article-title":"A pointer neural network for the vehicle routing problem with task priority and limited resources","volume":"49","author":"Ma","year":"2020","journal-title":"Inf. Technol. Control"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Lee, K., and Chae, J. (2023). Estimation of travel cost between geographic coordinates using artificial neural network: Potential application in vehicle routing problems. ISPRS Int. J. Geo-Inf., 12.","DOI":"10.3390\/ijgi12020057"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"101576","DOI":"10.1016\/j.swevo.2024.101576","article-title":"Solving the multi-objective path planning problem for mobile robot using an improved NSGA-II algorithm","volume":"87","author":"Duan","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"102997","DOI":"10.1016\/j.omega.2023.102997","article-title":"Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times","volume":"123","author":"He","year":"2024","journal-title":"Omega"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"J. Heuristics"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/trsc.1030.0049","article-title":"A two-stage hybrid local search for the vehicle routing problem with time windows","volume":"38","author":"Bent","year":"2004","journal-title":"Transp. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.cor.2017.11.011","article-title":"Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints","volume":"92","author":"Hojabri","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"109502","DOI":"10.1016\/j.asoc.2022.109502","article-title":"An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion","volume":"129","author":"Han","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"119512","DOI":"10.1016\/j.eswa.2023.119512","article-title":"An effective self-adaptive iterated greedy algorithm for a multi-AGVs scheduling problem with charging and maintenance","volume":"216","author":"Zou","year":"2023","journal-title":"Expert Syst. Appl."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/10\/431\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:04:16Z","timestamp":1760112256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/10\/431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,26]]},"references-count":40,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["a17100431"],"URL":"https:\/\/doi.org\/10.3390\/a17100431","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,9,26]]}}}