{"id":"https://openalex.org/W4414208517","doi":"https://doi.org/10.1007/s12293-025-00473-3","title":"A parallel cooperative coevolutionary multi-verse algorithm for large-scale multi-objective UAV path planning problems","display_name":"A parallel cooperative coevolutionary multi-verse algorithm for large-scale multi-objective UAV path planning problems","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4414208517","doi":"https://doi.org/10.1007/s12293-025-00473-3"},"language":"en","primary_location":{"id":"doi:10.1007/s12293-025-00473-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12293-025-00473-3","pdf_url":null,"source":{"id":"https://openalex.org/S125629831","display_name":"Memetic Computing","issn_l":"1865-9284","issn":["1865-9284","1865-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Memetic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053628100","display_name":"Raja Jarray","orcid":"https://orcid.org/0000-0002-3759-1436"},"institutions":[{"id":"https://openalex.org/I68916915","display_name":"University of Gab\u00e8s","ror":"https://ror.org/022efad20","country_code":"TN","type":"education","lineage":["https://openalex.org/I68916915"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Raja Jarray","raw_affiliation_strings":["Research Laboratory in Automatic Control (LARA) of National Engineering School of Tunis (ENIT), High Institute of Industrial Systems of Gab\u00e8s (ISSIG), University of Gab\u00e8s, 6072, Gab\u00e8s, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Laboratory in Automatic Control (LARA) of National Engineering School of Tunis (ENIT), High Institute of Industrial Systems of Gab\u00e8s (ISSIG), University of Gab\u00e8s, 6072, Gab\u00e8s, Tunisia","institution_ids":["https://openalex.org/I68916915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037036654","display_name":"Soufiene Bouall\u00e8gue","orcid":"https://orcid.org/0000-0003-3172-6333"},"institutions":[{"id":"https://openalex.org/I68916915","display_name":"University of Gab\u00e8s","ror":"https://ror.org/022efad20","country_code":"TN","type":"education","lineage":["https://openalex.org/I68916915"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Soufiene Bouall\u00e8gue","raw_affiliation_strings":["Research Laboratory in Automatic Control (LARA) of National Engineering School of Tunis (ENIT), High Institute of Industrial Systems of Gab\u00e8s (ISSIG), University of Gab\u00e8s, 6072, Gab\u00e8s, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Laboratory in Automatic Control (LARA) of National Engineering School of Tunis (ENIT), High Institute of Industrial Systems of Gab\u00e8s (ISSIG), University of Gab\u00e8s, 6072, Gab\u00e8s, Tunisia","institution_ids":["https://openalex.org/I68916915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053628100"],"corresponding_institution_ids":["https://openalex.org/I68916915"],"apc_list":{"value":2690,"currency":"EUR","value_usd":3490},"apc_paid":null,"fwci":2.7618,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.91486968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"17","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7013000249862671},{"id":"https://openalex.org/keywords/waypoint","display_name":"Waypoint","score":0.6589999794960022},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5652999877929688},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44999998807907104},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.42719998955726624},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.40639999508857727},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3779999911785126},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.367900013923645},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.35420000553131104}],"concepts":[{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7013000249862671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6704999804496765},{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.6589999794960022},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6093999743461609},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5652999877929688},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44999998807907104},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.40639999508857727},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3779999911785126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37709999084472656},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3165999948978424},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.28850001096725464},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.25760000944137573},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12293-025-00473-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12293-025-00473-3","pdf_url":null,"source":{"id":"https://openalex.org/S125629831","display_name":"Memetic Computing","issn_l":"1865-9284","issn":["1865-9284","1865-9292"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Memetic Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":70,"referenced_works":["https://openalex.org/W571795634","https://openalex.org/W1555689267","https://openalex.org/W1972032363","https://openalex.org/W1996673440","https://openalex.org/W2031183907","https://openalex.org/W2059700429","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2121429049","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2145418868","https://openalex.org/W2165171393","https://openalex.org/W2174096823","https://openalex.org/W2413634576","https://openalex.org/W2510493362","https://openalex.org/W2529741607","https://openalex.org/W2557254131","https://openalex.org/W2562277660","https://openalex.org/W2594344284","https://openalex.org/W2608705546","https://openalex.org/W2616257225","https://openalex.org/W2622041536","https://openalex.org/W2735292160","https://openalex.org/W2736201531","https://openalex.org/W2738900493","https://openalex.org/W2849751101","https://openalex.org/W2883500449","https://openalex.org/W2892336140","https://openalex.org/W2911840209","https://openalex.org/W2966212582","https://openalex.org/W2975361353","https://openalex.org/W3007644385","https://openalex.org/W3016654117","https://openalex.org/W3096967360","https://openalex.org/W3158324057","https://openalex.org/W3210964419","https://openalex.org/W4210664127","https://openalex.org/W4210866599","https://openalex.org/W4211072359","https://openalex.org/W4214504571","https://openalex.org/W4232923238","https://openalex.org/W4248885725","https://openalex.org/W4281384975","https://openalex.org/W4285167537","https://openalex.org/W4304172762","https://openalex.org/W4308444417","https://openalex.org/W4310074172","https://openalex.org/W4310376366","https://openalex.org/W4312084102","https://openalex.org/W4312608946","https://openalex.org/W4316506832","https://openalex.org/W4321214511","https://openalex.org/W4387521255","https://openalex.org/W4387959242","https://openalex.org/W4391877283","https://openalex.org/W4396747458","https://openalex.org/W4400261051","https://openalex.org/W4401411939","https://openalex.org/W4401519383","https://openalex.org/W4401920080","https://openalex.org/W4402492766","https://openalex.org/W4404737379","https://openalex.org/W4406357110","https://openalex.org/W4406918931","https://openalex.org/W4407024759","https://openalex.org/W4407366457","https://openalex.org/W4407424895","https://openalex.org/W4407561994","https://openalex.org/W4407983529"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}