{"id":"https://openalex.org/W1971970984","doi":"https://doi.org/10.1109/rivf.2013.6719892","title":"A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem","display_name":"A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1971970984","doi":"https://doi.org/10.1109/rivf.2013.6719892","mag":"1971970984"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2013.6719892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"},"type":"conference-paper","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":false,"raw_author_name":"Bang Ban Ha","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","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":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.7594,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64088159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"37","issue":null,"first_page":"192","last_page":"197"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9983999729156494,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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/tabu-search","display_name":"Tabu search","score":0.8965330123901367},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.8129613399505615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6604363322257996},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6508188843727112},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5898836255073547},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5573121905326843},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5203335285186768},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.496098130941391},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48484814167022705},{"id":"https://openalex.org/keywords/meta-heuristic","display_name":"Meta heuristic","score":0.4835900664329529},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.44657886028289795},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.43567031621932983},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.42712485790252686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42712390422821045},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3695550262928009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25632280111312866}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8965330123901367},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.8129613399505615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6604363322257996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6508188843727112},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5898836255073547},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5573121905326843},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5203335285186768},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.496098130941391},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48484814167022705},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.4835900664329529},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.44657886028289795},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.43567031621932983},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.42712485790252686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42712390422821045},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3695550262928009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25632280111312866},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2013.6719892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W187767610","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/W2087852198","https://openalex.org/W2090275183","https://openalex.org/W2093376706","https://openalex.org/W2104670598","https://openalex.org/W2115556222","https://openalex.org/W2129522056","https://openalex.org/W2149621837","https://openalex.org/W2153278891","https://openalex.org/W2339500526","https://openalex.org/W2600961830","https://openalex.org/W2997776631","https://openalex.org/W6607571859","https://openalex.org/W6661766311","https://openalex.org/W6682203896"],"related_works":["https://openalex.org/W2359164233","https://openalex.org/W2125033394","https://openalex.org/W2494989913","https://openalex.org/W3022707108","https://openalex.org/W1537780499","https://openalex.org/W1990372046","https://openalex.org/W2377790262","https://openalex.org/W2139177468","https://openalex.org/W2181360821","https://openalex.org/W4247343174"],"abstract_inverted_index":{"Minimum":[0],"Latency":[1],"Problem":[2],"(MLP)":[3],"is":[4,44,69,148],"a":[5,22,64,80,89,117],"class":[6],"of":[7,111,126],"NP-hard":[8],"combinatorial":[9],"optimization":[10],"problems":[11],"which":[12,25],"has":[13],"many":[14],"practical":[15],"applications.":[16],"In":[17,38,63,104],"this":[18],"paper,":[19],"we":[20,114],"propose":[21,116],"meta-heuristic":[23,137],"algorithm":[24,120,147],"combines":[26],"Tabu":[27],"search":[28,49],"(TS)":[29],"and":[30,55,87,133],"Variable":[31],"Neigh-borhood":[32],"Search":[33],"(VNS)":[34],"for":[35,75,84,121,155],"the":[36,39,42,48,57,67,76,85,98,108,123,141,145],"MLP.":[37],"proposed":[40,139,146],"algorithm,":[41],"TS":[43],"used":[45],"to":[46,59,71,92,106],"prevent":[47],"from":[50],"getting":[51],"trapped":[52],"into":[53],"cycles,":[54],"guide":[56],"VNS":[58,68,99],"escape":[60],"local":[61],"optima.":[62],"cooperative":[65],"way,":[66],"employed":[70],"generate":[72],"diverse":[73],"neighborhoods":[74,95],"TS.":[77],"We":[78],"introduce":[79],"novel":[81],"neighborhoods'":[82],"structure":[83],"VNS,":[86],"indicate":[88],"sequential":[90],"order":[91,105],"explore":[93],"these":[94],"such":[96],"that":[97,144],"can":[100],"give":[101],"best":[102,136,153],"solutions.":[103],"reduce":[107],"time":[109,119],"complexity":[110],"neighborhood":[112],"search,":[113],"also":[115],"constant":[118],"calculating":[122],"latency":[124],"cost":[125],"each":[127],"neighboring":[128],"solution.":[129],"Extensive":[130],"numerical":[131],"experiments":[132],"comparisons":[134],"with":[135],"algorithms":[138],"in":[140],"literature":[142],"show":[143],"highly":[149],"competitive,":[150],"providing":[151],"new":[152],"solutions":[154],"some":[156],"instances.":[157]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}