{"id":"https://openalex.org/W2606216486","doi":"https://doi.org/10.1109/icoin.2017.7899563","title":"A novel traffic routing method using hybrid Ant Colony System based on genetic algorithm","display_name":"A novel traffic routing method using hybrid Ant Colony System based on genetic algorithm","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2606216486","doi":"https://doi.org/10.1109/icoin.2017.7899563","mag":"2606216486"},"language":"en","primary_location":{"id":"doi:10.1109/icoin.2017.7899563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2017.7899563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Information Networking (ICOIN)","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/A5033804526","display_name":"Dang-Nhac Lu","orcid":"https://orcid.org/0000-0001-6080-4527"},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Dang-Nhac Lu","raw_affiliation_strings":["University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044178581","display_name":"Thi-Hau Nguyen","orcid":"https://orcid.org/0000-0002-8599-2998"},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thi-Hau Nguyen","raw_affiliation_strings":["University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090984602","display_name":"Thi-Thu-Trang Ngo","orcid":null},"institutions":[{"id":"https://openalex.org/I4400600977","display_name":"Posts and Telecommunications Institute of Technology","ror":"https://ror.org/0363rtq22","country_code":null,"type":"education","lineage":["https://openalex.org/I4400600977"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thi-Thu-Trang Ngo","raw_affiliation_strings":["Posts and Telecommunications Institute of Technology in Hanoi, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Posts and Telecommunications Institute of Technology in Hanoi, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4400600977"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058058761","display_name":"Duc-Nhan Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I4400600977","display_name":"Posts and Telecommunications Institute of Technology","ror":"https://ror.org/0363rtq22","country_code":null,"type":"education","lineage":["https://openalex.org/I4400600977"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duc-Nhan Nguyen","raw_affiliation_strings":["Posts and Telecommunications Institute of Technology in Hanoi, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Posts and Telecommunications Institute of Technology in Hanoi, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4400600977"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015273816","display_name":"Ha-Nam Nguyen","orcid":"https://orcid.org/0000-0001-8714-7483"},"institutions":[{"id":"https://openalex.org/I177233841","display_name":"Vietnam National University, Hanoi","ror":"https://ror.org/02jmfj006","country_code":"VN","type":"education","lineage":["https://openalex.org/I177233841"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Ha-Nam Nguyen","raw_affiliation_strings":["University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"University of Engineering and Technology, Vietnam National University in Hanoi, Hanoi, Vietnam","institution_ids":["https://openalex.org/I177233841"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5033804526"],"corresponding_institution_ids":["https://openalex.org/I177233841"],"apc_list":null,"apc_paid":null,"fwci":0.6192,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74835845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"584","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9901999831199646,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9901999831199646,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9887999892234802,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.984499990940094,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8155316114425659},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7397555708885193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6991460919380188},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6038902997970581},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5903982520103455},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5292565226554871},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4987649917602539},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49603185057640076},{"id":"https://openalex.org/keywords/visualization","display_name":"Visualization","score":0.48736387491226196},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4550822675228119},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4150053560733795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41393956542015076},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3317287564277649},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29874885082244873},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.19286352396011353},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14999914169311523},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14764168858528137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10647588968276978}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8155316114425659},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7397555708885193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6991460919380188},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6038902997970581},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5903982520103455},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5292565226554871},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4987649917602539},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49603185057640076},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.48736387491226196},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4550822675228119},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4150053560733795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41393956542015076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3317287564277649},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29874885082244873},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.19286352396011353},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14999914169311523},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14764168858528137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10647588968276978},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icoin.2017.7899563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2017.7899563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 International Conference on Information Networking (ICOIN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1072516","https://openalex.org/W2107941094","https://openalex.org/W2142807677","https://openalex.org/W2154929945","https://openalex.org/W2162316547","https://openalex.org/W2312480046","https://openalex.org/W2474026513","https://openalex.org/W2485468739","https://openalex.org/W2535458143","https://openalex.org/W2547332721","https://openalex.org/W2584991913","https://openalex.org/W2928352678"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4245157707","https://openalex.org/W1547053391","https://openalex.org/W2908391583","https://openalex.org/W2017411971","https://openalex.org/W2369428395","https://openalex.org/W2172069777","https://openalex.org/W1997193297","https://openalex.org/W2462483068"],"abstract_inverted_index":{"The":[0,21],"Ant":[1,9],"Colony":[2],"System":[3],"(ACS)":[4,88],"is":[5,14,62,99,167],"a":[6,56,70,75],"variant":[7],"of":[8,23,40],"colony":[10,86],"optimization":[11],"algorithm.":[12,165],"It":[13,166],"very":[15],"famous":[16],"with":[17,120,133,138],"Traveling":[18],"Salesman":[19],"Problem.":[20],"parameters":[22,112],"ACS":[24,111,164],"in":[25,136],"tour":[26,61],"construction,":[27],"global":[28,127],"and":[29,118,128,149,162],"local":[30,129],"updating":[31,150],"pheromone":[32],"direct":[33],"effort":[34],"to":[35,54,78,114,125],"get":[36],"the":[37,51,103],"best":[38],"result":[39],"this":[41,67],"but":[42,172],"they":[43],"are":[44],"often":[45],"manually":[46],"setting":[47],"up.":[48],"Beside,":[49],"building":[50],"heuristic":[52],"function":[53],"decide":[55],"choice":[57],"next":[58],"node":[59],"on":[60,90],"potential":[63],"research":[64],"approach.":[65],"Therefore,":[66],"paper":[68],"present":[69],"foundation":[71],"framework":[72,156],"that":[73],"propose":[74],"novel":[76],"method":[77],"solve":[79],"traffic":[80,96,151],"routing":[81],"problem":[82],"by":[83],"hybrid":[84],"ant":[85],"system":[87],"based":[89],"genetic":[91,107],"algorithm,":[92],"visualization":[93],"online":[94],"changing":[95],"light,":[97],"it":[98],"called":[100],"(GACSS).":[101],"In":[102],"GACSS,":[104],"We":[105],"use":[106],"algorithm":[108],"(GA)":[109],"optimize":[110],"aim":[113],"attain":[115],"shortest":[116],"trips":[117],"time":[119,175],"new":[121],"functions":[122],"helping":[123],"them":[124],"update":[126],"pheromone.":[130],"Our":[131,155],"experiment":[132],"GACSS":[134],"deploys":[135],"VANETsim":[137],"real":[139],"map":[140,144],"from":[141],"open":[142],"street":[143],"project,":[145],"any":[146],"vehicle":[147],"kind":[148],"light":[152],"real-time":[153],"able.":[154],"gained":[157],"higher":[158],"results":[159],"than":[160],"A-Star":[161],"classical":[163],"not":[168],"only":[169],"shorter":[170],"length":[171],"also":[173],"smaller":[174],"for":[176],"trip.":[177]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}