{"id":"https://openalex.org/W2044815386","doi":"https://doi.org/10.1145/2676585.2676620","title":"A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem","display_name":"A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2044815386","doi":"https://doi.org/10.1145/2676585.2676620","mag":"2044815386"},"language":"en","primary_location":{"id":"doi:10.1145/2676585.2676620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676585.2676620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14","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/A5037843488","display_name":"Ha-Bang Ban","orcid":"https://orcid.org/0000-0003-2241-5146"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Ha Bang Ban","raw_affiliation_strings":["Hanoi University of Science and Technology","Hanoi university of science and technology#TAB#"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Hanoi university of science and technology#TAB#","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073854745","display_name":"Nghia Nguyen Duc","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nghia Nguyen Duc","raw_affiliation_strings":["Hanoi University of Science and Technology","Hanoi university of science and technology#TAB#"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Hanoi university of science and technology#TAB#","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037843488"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.59452434,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7550383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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/T11106","display_name":"Data Management and Algorithms","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/algorithm","display_name":"Algorithm","score":0.7255149483680725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6513074636459351},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6505697965621948},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.6281196475028992},{"id":"https://openalex.org/keywords/cultural-algorithm","display_name":"Cultural algorithm","score":0.61104816198349},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5427520275115967},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4798819124698639},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.45692941546440125},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.4488784968852997},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4347366690635681},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.43333783745765686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4278649687767029},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41687431931495667},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.34349292516708374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2071143090724945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2014099657535553},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14018386602401733}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7255149483680725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6513074636459351},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6505697965621948},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.6281196475028992},{"id":"https://openalex.org/C5536111","wikidata":"https://www.wikidata.org/wiki/Q5193250","display_name":"Cultural algorithm","level":4,"score":0.61104816198349},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5427520275115967},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4798819124698639},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.45692941546440125},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.4488784968852997},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4347366690635681},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.43333783745765686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4278649687767029},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41687431931495667},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.34349292516708374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2071143090724945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2014099657535553},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14018386602401733},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2676585.2676620","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2676585.2676620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1556283060","https://openalex.org/W1573676079","https://openalex.org/W1966793805","https://openalex.org/W2005117954","https://openalex.org/W2009279347","https://openalex.org/W2010334716","https://openalex.org/W2011595401","https://openalex.org/W2044718761","https://openalex.org/W2078637295","https://openalex.org/W2087852198","https://openalex.org/W2115556222","https://openalex.org/W2129522056","https://openalex.org/W2153278891","https://openalex.org/W2183121821","https://openalex.org/W2267334966","https://openalex.org/W2437492364","https://openalex.org/W2542079133","https://openalex.org/W4253500057","https://openalex.org/W4285719527","https://openalex.org/W4292408555","https://openalex.org/W6682203896"],"related_works":["https://openalex.org/W2349880012","https://openalex.org/W2064754602","https://openalex.org/W4360996914","https://openalex.org/W2998167408","https://openalex.org/W165035591","https://openalex.org/W2353368228","https://openalex.org/W2187398043","https://openalex.org/W2031035514","https://openalex.org/W2369480021","https://openalex.org/W2805869242"],"abstract_inverted_index":{"The":[0,169],"Minimum":[1],"Latency":[2],"Problem":[3],"is":[4,51,70,147,176,207,235],"a":[5,28,37,77,105],"class":[6],"of":[7,45,67,79,99,173,180,187,222],"combinatorial":[8,71],"optimization":[9],"problems":[10],"which":[11,34],"has":[12],"many":[13],"practical":[14],"applications.":[15],"Recently,":[16],"several":[17,244],"meta-heuristic":[18,30,225],"algorithms":[19,23,74,226],"were":[20,24],"proposed.":[21],"These":[22],"developed":[25,131],"in":[26,60,90,132,165,200,227],"either":[27],"trajectory-based":[29],"or":[31],"sequential":[32],"approach,":[33,128],"start":[35],"with":[36,219],"single":[38],"initial":[39],"solution":[40,50,58],"and,":[41],"at":[42],"each":[43,144],"step":[44],"the":[46,48,56,64,68,80,97,100,110,115,141,154,166,185,220,223,228,232,239],"search,":[47],"current":[49,101],"replaced":[52],"by":[53],"another":[54],"(often":[55],"best)":[57],"found":[59],"its":[61,203],"neighborhood.":[62],"Since":[63],"search":[65,81,196,205],"space":[66,206],"problem":[69],"explosion,":[72],"these":[73],"often":[75],"explore":[76],"subset":[78],"space,":[82],"therefore,":[83],"they":[84],"can":[85,194],"fall":[86],"into":[87],"local":[88,212],"optima":[89],"some":[91],"cases.":[92],"In":[93,125,143,189],"order":[94],"to":[95,121,139,149,161,183,209],"overcome":[96],"drawbacks":[98],"algorithms,":[102],"we":[103],"propose":[104],"population-based":[106,192],"algorithm":[107,112,118,234],"that":[108,177,231],"combines":[109],"genetic":[111,155],"(GA)":[113],"and":[114,135,217],"ant":[116,151],"colony":[117],"(ACO)":[119],"according":[120],"island":[122],"parallel":[123,127],"model.":[124],"our":[126,174,191],"subpopulations":[129],"are":[130],"different":[133],"ways":[134],"individual's":[136],"migration":[137],"helps":[138],"maintain":[140],"diversity.":[142],"subpopulation,":[145],"ACO":[146,175],"used":[148],"generate":[150],"populations":[152,164],"while":[153],"information":[156],"from":[157,197,211],"GA":[158],"drives":[159],"ants":[160,181],"create":[162],"better":[163],"next":[167],"iterations.":[168],"most":[170],"important":[171],"feature":[172],"three":[178],"kinds":[179],"coexist":[182],"improve":[184],"efficiency":[186],"search.":[188],"addition,":[190],"approach":[193],"simultaneously":[195],"multiple":[198],"solutions":[199,242],"populations,":[201],"thus,":[202],"exploring":[204],"extended":[208],"escape":[210],"optima.":[213],"Extensive":[214],"numerical":[215],"experiments":[216],"comparisons":[218],"state":[221],"art":[224],"literature":[229],"show":[230],"proposed":[233],"highly":[236],"competitive,":[237],"providing":[238],"new":[240],"best":[241],"for":[243],"instances.":[245]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}