{"id":"https://openalex.org/W7119506225","doi":"https://doi.org/10.1016/j.swevo.2025.102267","title":"Evolutionary algorithm with domain-specific operators for UAV path planning","display_name":"Evolutionary algorithm with domain-specific operators for UAV path planning","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119506225","doi":"https://doi.org/10.1016/j.swevo.2025.102267"},"language":"en","primary_location":{"id":"doi:10.1016/j.swevo.2025.102267","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.swevo.2025.102267","pdf_url":null,"source":{"id":"https://openalex.org/S2764346689","display_name":"Swarm and Evolutionary Computation","issn_l":"2210-6502","issn":["2210-6502","2210-6510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Swarm and Evolutionary Computation","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/A5068150357","display_name":"Daison Darlan","orcid":"https://orcid.org/0000-0002-9185-9704"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Daison Darlan","raw_affiliation_strings":["Department of Artificial Intelligence, Kyungpook National University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Artificial Intelligence, Kyungpook National University, South Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003133247","display_name":"Oladayo S. Ajani","orcid":"https://orcid.org/0000-0001-5796-3375"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Oladayo S. Ajani","raw_affiliation_strings":["School of Computer Science and Engineering, Kyungpook National University, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-5796-3375","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Kyungpook National University, South Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"last","author":{"id":null,"display_name":"Rammohan Mallipeddi","orcid":"https://orcid.org/0000-0001-9071-1145"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Rammohan Mallipeddi","raw_affiliation_strings":["Department of Artificial Intelligence, Kyungpook National University, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-9071-1145","affiliations":[{"raw_affiliation_string":"Department of Artificial Intelligence, Kyungpook National University, South Korea","institution_ids":["https://openalex.org/I31419693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003133247"],"corresponding_institution_ids":["https://openalex.org/I31419693"],"apc_list":{"value":3700,"currency":"USD","value_usd":3580},"apc_paid":null,"fwci":14.5419,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.97868419,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"101","issue":null,"first_page":"102267","last_page":"102267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9273999929428101,"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.9273999929428101,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.007699999958276749,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/crossover","display_name":"Crossover","score":0.7143999934196472},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6820999979972839},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5741999745368958},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5687999725341797},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5573999881744385},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.526199996471405},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4553000032901764},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.41679999232292175}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7404999732971191},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7143999934196472},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6820999979972839},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5820000171661377},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5741999745368958},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5687999725341797},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5573999881744385},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.526199996471405},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4553000032901764},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.41679999232292175},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.39959999918937683},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.32510000467300415},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25859999656677246},{"id":"https://openalex.org/C91852762","wikidata":"https://www.wikidata.org/wiki/Q3307742","display_name":"Fitness landscape","level":3,"score":0.2565000057220459},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.swevo.2025.102267","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.swevo.2025.102267","pdf_url":null,"source":{"id":"https://openalex.org/S2764346689","display_name":"Swarm and Evolutionary Computation","issn_l":"2210-6502","issn":["2210-6502","2210-6510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Swarm and Evolutionary Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6914798617362976,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G8814046297","display_name":null,"funder_award_id":"RS-2021-NR060127","funder_id":"https://openalex.org/F4320321408","funder_display_name":"Ministry of Education"}],"funders":[{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1997600725","https://openalex.org/W2023685757","https://openalex.org/W2027930526","https://openalex.org/W2108968575","https://openalex.org/W2126105956","https://openalex.org/W2143381319","https://openalex.org/W2170240600","https://openalex.org/W2808807389","https://openalex.org/W2811487153","https://openalex.org/W3174708786","https://openalex.org/W3176167688","https://openalex.org/W4210664127","https://openalex.org/W4214504571","https://openalex.org/W4282935706","https://openalex.org/W4283760409","https://openalex.org/W4297799136","https://openalex.org/W4304689150","https://openalex.org/W4308731068","https://openalex.org/W4322742245","https://openalex.org/W4385304608","https://openalex.org/W4386027815","https://openalex.org/W4386837669","https://openalex.org/W4389349077","https://openalex.org/W4391542888","https://openalex.org/W4392045156","https://openalex.org/W4393164638","https://openalex.org/W4393253095","https://openalex.org/W4401028416","https://openalex.org/W4401927651","https://openalex.org/W4402240062","https://openalex.org/W4403866790","https://openalex.org/W4404917949","https://openalex.org/W4405704036","https://openalex.org/W4410469213"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2026-01-09T00:00:00"}