{"id":"https://openalex.org/W7154611529","doi":"https://doi.org/10.1109/access.2026.3684303","title":"Comparison of Evolutionary and Traditional Algorithms for Flight Route Optimization","display_name":"Comparison of Evolutionary and Traditional Algorithms for Flight Route Optimization","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7154611529","doi":"https://doi.org/10.1109/access.2026.3684303"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3684303","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3684303","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3684303","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115613831","display_name":"Emina Salkanovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I51716468","display_name":"International Burch University","ror":"https://ror.org/040cm8d21","country_code":"BA","type":"education","lineage":["https://openalex.org/I51716468"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Emina Salkanovi\u0107","raw_affiliation_strings":["Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina"],"raw_orcid":"https://orcid.org/0009-0003-0264-1178","affiliations":[{"raw_affiliation_string":"Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I51716468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052064905","display_name":"Dino \u041a\u0435\u010do","orcid":"https://orcid.org/0000-0002-1583-242X"},"institutions":[{"id":"https://openalex.org/I51716468","display_name":"International Burch University","ror":"https://ror.org/040cm8d21","country_code":"BA","type":"education","lineage":["https://openalex.org/I51716468"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Dino Ke\u010do","raw_affiliation_strings":["Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I51716468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133746370","display_name":"Fatima Ma\u0161i\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I51716468","display_name":"International Burch University","ror":"https://ror.org/040cm8d21","country_code":"BA","type":"education","lineage":["https://openalex.org/I51716468"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Fatima Ma\u0161i\u0107","raw_affiliation_strings":["Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina"],"raw_orcid":"https://orcid.org/0009-0003-3858-016X","affiliations":[{"raw_affiliation_string":"Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I51716468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5117141127","display_name":"Amila \u010cau\u0161evi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I51716468","display_name":"International Burch University","ror":"https://ror.org/040cm8d21","country_code":"BA","type":"education","lineage":["https://openalex.org/I51716468"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Amila \u010cau\u0161evi\u0107","raw_affiliation_strings":["Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, International Burch University, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I51716468"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I51716468"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7808058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"61048","last_page":"61062"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.31690001487731934,"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"}},"topics":[{"id":"https://openalex.org/T11489","display_name":"Air Traffic Management and Optimization","score":0.31690001487731934,"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"}},{"id":"https://openalex.org/T11082","display_name":"Spacecraft Dynamics and Control","score":0.10090000182390213,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.09109999984502792,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.49059998989105225},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4422000050544739},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4122999906539917},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.357699990272522},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.3517000079154968}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7287999987602234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5044999718666077},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.49059998989105225},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4422000050544739},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4122999906539917},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34529998898506165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33219999074935913},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2597000002861023}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3684303","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3684303","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c120f1b6f9624986b76e424a369684fa","is_oa":true,"landing_page_url":"https://doaj.org/article/c120f1b6f9624986b76e424a369684fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 14, Pp 61048-61062 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3684303","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3684303","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"study":[1],"investigated":[2],"flight":[3],"route":[4,84],"optimization":[5],"in":[6,104],"a":[7,24,40],"large":[8],"airline":[9,172],"network":[10],"by":[11,156],"comparing":[12],"traditional":[13],"path-finding":[14],"algorithms":[15,165,176],"with":[16,36,125],"an":[17,56],"evolutionary":[18,164],"approach":[19],"under":[20,110],"realistic":[21],"constraints.":[22],"Using":[23],"real-world":[25],"dataset":[26],"of":[27,59,96,141],"6,817":[28],"routes,":[29],"Dijkstra\u2019s":[30,77],"algorithm,":[31],"the":[32,81,94,102,139],"A*":[33,100],"search":[34],"algorithm":[35,78],"precomputed":[37],"heuristics,":[38],"and":[39,61,132],"Genetic":[41],"Algorithm":[42],"(GA)":[43],"were":[44,48,67],"implemented.":[45],"All":[46],"methods":[47],"evaluated":[49],"on":[50,62],"identical":[51],"origin\u2013destination":[52],"pairs":[53,152],"while":[54],"enforcing":[55],"exact":[57],"number":[58,95],"layovers,":[60],"scenarios":[63],"where":[64],"direct":[65,147],"flights":[66,148],"removed":[68],"or":[69],"newly":[70],"introduced.":[71],"The":[72],"results":[73],"show":[74],"that,":[75],"although":[76],"always":[79],"returns":[80],"optimal":[82],"shortest-time":[83],"when":[85],"one":[86],"exists,":[87],"its":[88],"computation":[89],"time":[90],"increases":[91],"rapidly":[92],"as":[93],"required":[97],"layovers":[98],"increases.":[99],"improved":[101],"efficiency":[103],"dense":[105],"subgraphs":[106],"but":[107],"sometimes":[108],"failed":[109],"strict":[111],"layover":[112],"constraints":[113],"owing":[114],"to":[115],"heuristic":[116],"misalignment.":[117],"In":[118],"contrast,":[119],"GA":[120],"consistently":[121],"produced":[122],"near-optimal":[123],"routes":[124],"stable":[126],"runtimes":[127],"across":[128],"varying":[129],"connectivity":[130],"levels":[131],"constraint":[133],"settings.":[134],"Route":[135],"removal":[136],"experiments":[137],"highlighted":[138],"vulnerability":[140],"sparsely":[142],"connected":[143],"regions,":[144],"whereas":[145,174],"adding":[146],"mainly":[149],"benefited":[150],"airport":[151],"previously":[153],"linked":[154],"only":[155],"long":[157],"multi-stop":[158],"paths.":[159],"These":[160],"findings":[161],"indicate":[162],"that":[163],"are":[166],"well-suited":[167],"for":[168,179],"large-scale,":[169],"dynamically":[170],"changing":[171],"networks,":[173],"classical":[175],"remain":[177],"preferable":[178],"smaller,":[180],"well-structured":[181],"subproblems.":[182]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2026-04-17T00:00:00"}