{"id":"https://openalex.org/W4400131723","doi":"https://doi.org/10.32604/cmc.2024.050612","title":"An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time","display_name":"An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4400131723","doi":"https://doi.org/10.32604/cmc.2024.050612"},"language":"en","primary_location":{"id":"doi:10.32604/cmc.2024.050612","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2024.050612","pdf_url":"https://file.techscience.com/files/cmc/2024/TSP_CMC-80-1/TSP_CMC_50612/TSP_CMC_50612.pdf","source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://file.techscience.com/files/cmc/2024/TSP_CMC-80-1/TSP_CMC_50612/TSP_CMC_50612.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100452962","display_name":"Xiaoqing Wang","orcid":"https://orcid.org/0000-0003-3965-5728"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoqing Wang","raw_affiliation_strings":["School of Computer Science, Liaocheng University, Liaocheng, 252000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Liaocheng University, Liaocheng, 252000, China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009022553","display_name":"Peng Duan","orcid":"https://orcid.org/0000-0002-7396-7592"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Duan","raw_affiliation_strings":["School of Computer Science, Liaocheng University, Liaocheng, 252000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Liaocheng University, Liaocheng, 252000, China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075669304","display_name":"Leilei Meng","orcid":"https://orcid.org/0000-0003-1439-4832"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Leilei Meng","raw_affiliation_strings":["School of Computer Science, Liaocheng University, Liaocheng, 252000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Liaocheng University, Liaocheng, 252000, China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005574719","display_name":"Kaidong Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kaidong Yang","raw_affiliation_strings":["Shandong Key Laboratory of Optical Communication Science and Technology, School of Physics Science and Information Technology, Liaocheng University, Liaocheng, 252059, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shandong Key Laboratory of Optical Communication Science and Technology, School of Physics Science and Information Technology, Liaocheng University, Liaocheng, 252059, China","institution_ids":["https://openalex.org/I196934937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196934937"],"apc_list":null,"apc_paid":null,"fwci":2.1425,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88509903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"80","issue":"1","first_page":"931","last_page":"947"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6562904715538025},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6459888219833374},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5878934264183044},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5611605644226074},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5588052868843079},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5356665849685669},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.46549805998802185},{"id":"https://openalex.org/keywords/rescue-robot","display_name":"Rescue robot","score":0.43250831961631775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42766818404197693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2939831614494324},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2889567017555237},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.23314303159713745},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06380373239517212}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6562904715538025},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6459888219833374},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5878934264183044},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5611605644226074},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5588052868843079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5356665849685669},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.46549805998802185},{"id":"https://openalex.org/C17006198","wikidata":"https://www.wikidata.org/wiki/Q7315030","display_name":"Rescue robot","level":4,"score":0.43250831961631775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42766818404197693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2939831614494324},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2889567017555237},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.23314303159713745},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06380373239517212},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.32604/cmc.2024.050612","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2024.050612","pdf_url":"https://file.techscience.com/files/cmc/2024/TSP_CMC-80-1/TSP_CMC_50612/TSP_CMC_50612.pdf","source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.32604/cmc.2024.050612","is_oa":true,"landing_page_url":"https://doi.org/10.32604/cmc.2024.050612","pdf_url":"https://file.techscience.com/files/cmc/2024/TSP_CMC-80-1/TSP_CMC_50612/TSP_CMC_50612.pdf","source":{"id":"https://openalex.org/S4210191605","display_name":"Computers, materials & continua/Computers, materials & continua (Print)","issn_l":"1546-2218","issn":["1546-2218","1546-2226"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers, Materials & Continua","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400131723.pdf"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1997997016","https://openalex.org/W2006751452","https://openalex.org/W2076836659","https://openalex.org/W2096305430","https://openalex.org/W2118038919","https://openalex.org/W3023508804","https://openalex.org/W3108272015","https://openalex.org/W3118604752","https://openalex.org/W3139219031","https://openalex.org/W3194836578","https://openalex.org/W3206029075","https://openalex.org/W3214034194","https://openalex.org/W4200045450","https://openalex.org/W4206106638","https://openalex.org/W4282556027","https://openalex.org/W4292237905","https://openalex.org/W4302011110","https://openalex.org/W4308981848","https://openalex.org/W4323657416","https://openalex.org/W4384523205","https://openalex.org/W4385353982","https://openalex.org/W4385610417","https://openalex.org/W4386189541","https://openalex.org/W4386417904","https://openalex.org/W4387385653","https://openalex.org/W4393121421","https://openalex.org/W4394990042","https://openalex.org/W6854330943","https://openalex.org/W6862981430"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W4318605735","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612"],"abstract_inverted_index":{"Effective":[0],"path":[1,29],"planning":[2,30],"is":[3],"crucial":[4],"for":[5,147],"mobile":[6],"robots":[7],"to":[8,69,88,101,120,143],"quickly":[9],"reach":[10],"rescue":[11,15,28,200],"destination":[12],"and":[13,32,82,172,202],"complete":[14],"tasks":[16],"in":[17,84,194],"a":[18,37,61,71,76],"post-disaster":[19,27],"scenario.":[20],"In":[21],"this":[22,34,50],"study,":[23],"we":[24,52],"investigated":[25],"the":[26,40,85,90,103,123,132,135,138,150,165,173,191,197,206,209],"problem":[31,35,43],"modeled":[33],"as":[36,116],"variant":[38],"of":[39,134,167,176,196,199,208],"travel":[41],"salesman":[42],"(TSP)":[44],"with":[45,155],"life-strength":[46],"constraints.":[47],"To":[48,130],"address":[49],"problem,":[51],"proposed":[53,136,151,210],"an":[54,108,117],"improved":[55,109],"iterated":[56],"greedy":[57],"(IIG)":[58],"algorithm.":[59,211],"First,":[60],"push-forward":[62],"insertion":[63,78],"heuristic":[64],"(PFIH)":[65],"strategy":[66,79,113],"was":[67,80,114,141,153,162],"employed":[68],"generate":[70,144],"high-quality":[72],"initial":[73],"solution.":[74],"Second,":[75],"greedy-based":[77],"designed":[81],"used":[83,115],"destruction-construction":[86],"stage":[87],"increase":[89],"algorithm\u2019s":[91,104],"exploration":[92],"ability.":[93,106],"Furthermore,":[94],"three":[95],"problem-specific":[96],"swap":[97],"operators":[98],"were":[99],"developed":[100],"improve":[102],"exploitation":[105],"Additionally,":[107],"simulated":[110],"annealing":[111],"(SA)":[112],"acceptance":[118],"criterion":[119],"effectively":[121],"prevent":[122],"algorithm":[124],"from":[125],"falling":[126],"into":[127],"local":[128],"optima.":[129],"verify":[131],"effectiveness":[133,174,207],"algorithm,":[137],"Solomon":[139],"dataset":[140],"extended":[142],"27":[145],"instances":[146],"simulation.":[148],"Finally,":[149],"IIG":[152,189],"compared":[154,192],"five":[156],"state-of-the-art":[157],"algorithms.":[158],"The":[159],"parameter":[160],"analysis":[161,175],"conducted":[163],"using":[164],"design":[166],"experiments":[168],"(DOE)":[169],"Taguchi":[170],"method,":[171],"each":[177],"component":[178],"has":[179],"been":[180],"verified":[181],"one":[182],"by":[183],"one.":[184],"Simulation":[185],"results":[186],"indicate":[187],"that":[188],"outperforms":[190],"algorithms":[193],"terms":[195],"number":[198],"survivors":[201],"convergence":[203],"speed,":[204],"proving":[205]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}