{"id":"https://openalex.org/W4313477428","doi":"https://doi.org/10.1109/access.2022.3233786","title":"Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing","display_name":"Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4313477428","doi":"https://doi.org/10.1109/access.2022.3233786"},"language":"en","primary_location":{"id":"doi:10.1109/access.2022.3233786","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3233786","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/10005208/10004949.pdf","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://ieeexplore.ieee.org/ielx7/6287639/10005208/10004949.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011283509","display_name":"Esraa Alhenawi","orcid":"https://orcid.org/0009-0002-9747-4642"},"institutions":[{"id":"https://openalex.org/I104941359","display_name":"Al-Ahliyya Amman University","ror":"https://ror.org/00xddhq60","country_code":"JO","type":"education","lineage":["https://openalex.org/I104941359"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Esra'a Alhenawi","raw_affiliation_strings":["Department of Software Engineering, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Software Engineering, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan","institution_ids":["https://openalex.org/I104941359"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006845149","display_name":"Ruba Abu Khurma","orcid":"https://orcid.org/0000-0002-8234-9374"},"institutions":[{"id":"https://openalex.org/I104941359","display_name":"Al-Ahliyya Amman University","ror":"https://ror.org/00xddhq60","country_code":"JO","type":"education","lineage":["https://openalex.org/I104941359"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Ruba Abu Khurma","raw_affiliation_strings":["Department of Computer Science, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan"],"raw_orcid":"https://orcid.org/0000-0002-8234-9374","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan","institution_ids":["https://openalex.org/I104941359"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075718696","display_name":"Ahmad Sharieh","orcid":"https://orcid.org/0000-0002-0290-2468"},"institutions":[{"id":"https://openalex.org/I114972647","display_name":"University of Jordan","ror":"https://ror.org/05k89ew48","country_code":"JO","type":"education","lineage":["https://openalex.org/I114972647"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Ahmad A. Sharieh","raw_affiliation_strings":["Department of Computer Science, The University of Jordan, Amman, Jordan"],"raw_orcid":"https://orcid.org/0000-0002-0290-2468","affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I114972647"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087648541","display_name":"Omar Adwan","orcid":"https://orcid.org/0000-0003-3967-2456"},"institutions":[{"id":"https://openalex.org/I104941359","display_name":"Al-Ahliyya Amman University","ror":"https://ror.org/00xddhq60","country_code":"JO","type":"education","lineage":["https://openalex.org/I104941359"]},{"id":"https://openalex.org/I114972647","display_name":"University of Jordan","ror":"https://ror.org/05k89ew48","country_code":"JO","type":"education","lineage":["https://openalex.org/I114972647"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Omar Al-Adwan","raw_affiliation_strings":["Department of Computer Science, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan","Department of Computer Science, The University of Jordan, Amman, Jordan"],"raw_orcid":"https://orcid.org/0000-0003-3967-2456","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Information Technology, Al-Ahliyya Amman University, Amman, Jordan","institution_ids":["https://openalex.org/I104941359"]},{"raw_affiliation_string":"Department of Computer Science, The University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I114972647"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065996400","display_name":"Areej Al Shorman","orcid":null},"institutions":[{"id":"https://openalex.org/I114972647","display_name":"University of Jordan","ror":"https://ror.org/05k89ew48","country_code":"JO","type":"education","lineage":["https://openalex.org/I114972647"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Areej Al Shorman","raw_affiliation_strings":["Department of Computer Science, The University of Jordan, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Jordan, Amman, Jordan","institution_ids":["https://openalex.org/I114972647"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003059238","display_name":"Fatima Shannaq","orcid":null},"institutions":[{"id":"https://openalex.org/I145380033","display_name":"Amman Arab University","ror":"https://ror.org/039xekb14","country_code":"JO","type":"education","lineage":["https://openalex.org/I145380033"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Fatima Shannaq","raw_affiliation_strings":["Faculty of Computer Science and Informatics, Amman Arab University, Amman, Jordan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Informatics, Amman Arab University, Amman, Jordan","institution_ids":["https://openalex.org/I145380033"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":2.8987,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.9257667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"11","issue":null,"first_page":"6185","last_page":"6196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9972000122070312,"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.9972000122070312,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9832000136375427,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8112208843231201},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6872146129608154},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6544671654701233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6478664875030518},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5790622234344482},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5682436227798462},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5616165995597839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5337731838226318},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5292902588844299},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49182701110839844},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.4762844443321228},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.42246460914611816},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3895649015903473},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29338890314102173},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2838948369026184},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2454472780227661},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.19663918018341064}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8112208843231201},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6872146129608154},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6544671654701233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478664875030518},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5790622234344482},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5682436227798462},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5616165995597839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5337731838226318},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5292902588844299},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49182701110839844},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.4762844443321228},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42246460914611816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3895649015903473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29338890314102173},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2838948369026184},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2454472780227661},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.19663918018341064},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2022.3233786","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3233786","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/10005208/10004949.pdf","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:72b92584a4dd482c806681f2c2b8f412","is_oa":true,"landing_page_url":"https://doaj.org/article/72b92584a4dd482c806681f2c2b8f412","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 11, Pp 6185-6196 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2022.3233786","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2022.3233786","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/10005208/10004949.pdf","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":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313477428.pdf","grobid_xml":"https://content.openalex.org/works/W4313477428.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W263933163","https://openalex.org/W410850256","https://openalex.org/W978997059","https://openalex.org/W1508799992","https://openalex.org/W1912426016","https://openalex.org/W1972638210","https://openalex.org/W1978580424","https://openalex.org/W1993561093","https://openalex.org/W1993885071","https://openalex.org/W2013205100","https://openalex.org/W2030295525","https://openalex.org/W2039595530","https://openalex.org/W2041749499","https://openalex.org/W2057398816","https://openalex.org/W2070756367","https://openalex.org/W2089688797","https://openalex.org/W2093094460","https://openalex.org/W2097377813","https://openalex.org/W2143945515","https://openalex.org/W2144643443","https://openalex.org/W2144828726","https://openalex.org/W2150898004","https://openalex.org/W2168009894","https://openalex.org/W2199861156","https://openalex.org/W2240526870","https://openalex.org/W2241985215","https://openalex.org/W2389923764","https://openalex.org/W2460998784","https://openalex.org/W2554679694","https://openalex.org/W2761296247","https://openalex.org/W2780688515","https://openalex.org/W2793412195","https://openalex.org/W2793719179","https://openalex.org/W2891991066","https://openalex.org/W2909565627","https://openalex.org/W2938380935","https://openalex.org/W2955799101","https://openalex.org/W2968118396","https://openalex.org/W2977202358","https://openalex.org/W3027718472","https://openalex.org/W3045974612","https://openalex.org/W3046855204","https://openalex.org/W3089650620","https://openalex.org/W3099174910","https://openalex.org/W3122326267","https://openalex.org/W3136447998","https://openalex.org/W3136602734","https://openalex.org/W3138952546","https://openalex.org/W3157599146","https://openalex.org/W3183789766","https://openalex.org/W3184078521","https://openalex.org/W3187965806","https://openalex.org/W3199145913","https://openalex.org/W3203583990","https://openalex.org/W3216978859","https://openalex.org/W3217778767","https://openalex.org/W6614148910","https://openalex.org/W6678080963","https://openalex.org/W6789326913"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2523719706","https://openalex.org/W2368964068","https://openalex.org/W2030169809","https://openalex.org/W2161960576","https://openalex.org/W2360981904","https://openalex.org/W2366342492","https://openalex.org/W2767202586"],"abstract_inverted_index":{"The":[0,141,187,247],"problem":[1,13,45,137],"of":[2,34,51,65,147,181,222],"finding":[3,78,231],"the":[4,60,79,83,87,91,130,134,145,148,159,164,176,192,206,211,214,223,228,232,240,255],"shortest":[5,80,131],"path":[6,62,81,132,150,234],"between":[7],"two":[8],"nodes":[9],"is":[10,94,172,218],"a":[11,16,31,49,95,115,122],"common":[12],"that":[14,46,110,155,191],"requires":[15],"solution":[17],"in":[18,63,107,114,133,179],"many":[19],"applications":[20],"like":[21],"games,":[22],"robotics,":[23],"and":[24,56,69,98,185],"real-life":[25],"problems.":[26],"Since":[27],"its":[28],"deals":[29],"with":[30,169,220,244,251],"large":[32],"number":[33],"possibilities.":[35],"Therefore,":[36],"parallel":[37,123,193,215,241,248,256],"algorithms":[38],"are":[39,100],"suitable":[40],"to":[41,58,72,89,104,128,174],"solve":[42],"this":[43],"optimization":[44],"has":[47],"attracted":[48],"lot":[50],"researchers":[52],"from":[53,82,227],"both":[54],"industry":[55],"academia":[57],"find":[59,129],"optimal":[61],"terms":[64,180],"runtime,":[66,182],"speedup,":[67,183],"efficiency,":[68,184],"cost":[70],"compared":[71,219],"sequential":[73,208],"algorithms.":[74],"In":[75],"mountain":[76,88,108,135,236],"climbing,":[77],"start":[84],"node":[85,93],"under":[86],"reach":[90],"destination":[92],"fundamental":[96],"operator,":[97],"there":[99],"some":[101,153],"interesting":[102],"issues":[103],"be":[105,112],"studied":[106],"climbing":[109,136,237],"cannot":[111],"found":[113],"traditional":[116],"two-dimensional":[117],"space":[118],"search.":[119],"We":[120],"present":[121],"Ant":[124],"Colony":[125],"Optimization":[126],"(ACO)":[127],"using":[138,239],"Apache":[139,245],"Spark.":[140,246],"proposed":[142,177],"algorithm":[143,178,195,217,243,250],"guarantees":[144],"security":[146],"selected":[149],"by":[151],"applying":[152],"constraints":[154],"take":[156],"into":[157],"account":[158],"secure":[160],"slope":[161],"angle":[162],"for":[163,230,235],"path.":[165],"A":[166],"generated":[167],"dataset":[168],"variable":[170],"sizes":[171],"used":[173],"evaluate":[175],"cost.":[186],"experimental":[188],"results":[189],"show":[190],"ACO":[194,216,249],"significantly":[196,253],"<inline-formula":[197],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[198],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[199],"<tex-math":[200],"notation=\"LaTeX\">$(p":[201],"&lt;":[202],"0.05)$":[203],"</tex-math></inline-formula>":[204],"outperformed":[205,254],"best":[207,233],"ACO.":[209],"On":[210],"other":[212],"hand,":[213],"one":[221],"most":[224],"recent":[225],"research":[226],"literature":[229],"problems":[238],"A*":[242,257],"Spark":[252],"algorithm.":[258]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":3}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}