{"id":"https://openalex.org/W4206597951","doi":"https://doi.org/10.1109/smc52423.2021.9658977","title":"Time-Dependent Ant Colony Optimization Algorithm for Solving The Fastest Traffic Path Finding Problem in a Dynamic Environment","display_name":"Time-Dependent Ant Colony Optimization Algorithm for Solving The Fastest Traffic Path Finding Problem in a Dynamic Environment","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W4206597951","doi":"https://doi.org/10.1109/smc52423.2021.9658977"},"language":"en","primary_location":{"id":"doi:10.1109/smc52423.2021.9658977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc52423.2021.9658977","pdf_url":null,"source":{"id":"https://openalex.org/S4363607761","display_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-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/A5002081133","display_name":"W. Elleuch","orcid":"https://orcid.org/0000-0002-8835-6110"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Wiam Elleuch","raw_affiliation_strings":["National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038"],"affiliations":[{"raw_affiliation_string":"National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077387853","display_name":"Ali Wali","orcid":"https://orcid.org/0000-0002-8423-7923"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Ali Wali","raw_affiliation_strings":["National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038"],"affiliations":[{"raw_affiliation_string":"National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053613060","display_name":"Adel M. Alimi","orcid":"https://orcid.org/0000-0002-0642-3384"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Adel M. Alimi","raw_affiliation_strings":["National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038"],"affiliations":[{"raw_affiliation_string":"National Engineering School of Sfax (ENIS),REGIM-Lab: Research Groups in Intelligent Machines,Sfax,Tunisia,3038","institution_ids":["https://openalex.org/I142899784"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002081133"],"corresponding_institution_ids":["https://openalex.org/I142899784"],"apc_list":null,"apc_paid":null,"fwci":0.4827,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65508685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1649","last_page":"1654"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.995199978351593,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7934584617614746},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7916256189346313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7006165981292725},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.658682107925415},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5921130180358887},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5660112500190735},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.47246432304382324},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"Traffic congestion","score":0.4600309133529663},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.43792372941970825},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.4279695749282837},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.42267942428588867},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4173937141895294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40253639221191406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2595048248767853},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.21196523308753967},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1873188614845276},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14829576015472412},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12317922711372375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08774292469024658}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7934584617614746},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7916256189346313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7006165981292725},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.658682107925415},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5921130180358887},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5660112500190735},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.47246432304382324},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.4600309133529663},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.43792372941970825},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.4279695749282837},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.42267942428588867},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4173937141895294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40253639221191406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2595048248767853},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.21196523308753967},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1873188614845276},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14829576015472412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12317922711372375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08774292469024658},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc52423.2021.9658977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc52423.2021.9658977","pdf_url":null,"source":{"id":"https://openalex.org/S4363607761","display_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1503369191","https://openalex.org/W1507163138","https://openalex.org/W1509408113","https://openalex.org/W1519085183","https://openalex.org/W1579891626","https://openalex.org/W1791215375","https://openalex.org/W1803713235","https://openalex.org/W1810046508","https://openalex.org/W1867549856","https://openalex.org/W1905425803","https://openalex.org/W1970526056","https://openalex.org/W1997240729","https://openalex.org/W2015606203","https://openalex.org/W2042986967","https://openalex.org/W2125613881","https://openalex.org/W2154929945","https://openalex.org/W2421912678","https://openalex.org/W2590161490","https://openalex.org/W2620091787","https://openalex.org/W2947457582","https://openalex.org/W3000290977","https://openalex.org/W3024310851","https://openalex.org/W3128252576","https://openalex.org/W6639918947","https://openalex.org/W6733453640"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W1990043277","https://openalex.org/W2375775343","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2018146256","https://openalex.org/W2388051136","https://openalex.org/W2377010080"],"abstract_inverted_index":{"The":[0,186],"goal":[1],"of":[2,102,109,157,193],"our":[3],"project":[4],"is":[5],"to":[6,9,36,39,78,98,130,150,160,171,175],"help":[7],"drivers":[8,153],"preplan":[10],"their":[11,180],"trips":[12],"and":[13,30,63,70,139,178],"overcome":[14],"the":[15,21,26,50,59,67,71,80,100,104,110,134,152,158,162,168,173,191,194],"traffic":[16,106,135],"congestion":[17,177],"on":[18,90,123],"roads.":[19],"Unlike":[20],"traditional":[22],"systems":[23],"which":[24],"provided":[25],"shortest":[27,51,111],"path,":[28],"travellers":[29],"salespersons":[31],"need":[32],"a":[33,75,87,91,117],"reliable":[34],"system":[35,55,88],"guide":[37],"them":[38],"visit":[40,161],"several":[41],"cities":[42],"or":[43],"deliver":[44],"merchandises":[45],"in":[46,49,74,137,198],"different":[47,60],"locations":[48,62,164],"possible":[52],"duration.":[53],"Our":[54],"should":[56],"deal":[57],"with":[58,154],"selected":[61,163],"get":[64,131],"information":[65,132],"about":[66,133],"congested":[68],"roads":[69,138],"travel":[72],"time":[73,170],"dynamic":[76,118,141,200],"environment":[77],"estimate":[79],"fastest":[81,105],"path.In":[82],"this":[83],"paper,":[84],"we":[85,115],"developed":[86,149],"based":[89,122],"time-dependent":[92,196],"Ant":[93],"Colony":[94],"Optimization":[95],"(ACO)":[96],"algorithm":[97],"solve":[99],"problem":[101,142],"finding":[103],"path":[107,159],"instead":[108],"path.":[112],"In":[113],"addition,":[114],"implemented":[116],"real":[119],"tests":[120],"generator":[121],"big":[124],"Global":[125],"Positioning":[126],"System":[127],"(GPS)":[128],"datasets":[129],"states":[136],"generate":[140],"instances.":[143],"A":[144],"mobile":[145],"application":[146],"has":[147],"been":[148],"provide":[151],"accurate":[155],"details":[156],"as":[165,167,182,184],"well":[166],"best":[169],"begin":[172],"trip":[174],"avoid":[176],"reach":[179],"destination":[181],"fast":[183],"possible.":[185],"exhaustive":[187],"experimentations":[188],"have":[189],"shown":[190],"capabilities":[192],"modified":[195],"ACO":[197],"solving":[199],"optimization":[201],"problems.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}