{"id":"https://openalex.org/W2945820663","doi":"https://doi.org/10.1109/rivf.2019.8713655","title":"Metaheuristic for the Traveling Repairman Problem with Time Window Constraints","display_name":"Metaheuristic for the Traveling Repairman Problem with Time Window Constraints","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2945820663","doi":"https://doi.org/10.1109/rivf.2019.8713655","mag":"2945820663"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2019.8713655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","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":false,"raw_author_name":"Ha Bang Ban","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074852186","display_name":"\u0110\u1ee9c Ngh\u0129a Nguy\u1ec5n","orcid":"https://orcid.org/0000-0001-7172-0548"},"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":"Duc Nghia Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology","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.221,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60183742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9972000122070312,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9948999881744385,"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/metaheuristic","display_name":"Metaheuristic","score":0.8718222379684448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6920163035392761},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6399012804031372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6043699383735657},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5974592566490173},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5963622331619263},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.5355351567268372},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.528178334236145},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49527445435523987},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4774627983570099},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.4405973553657532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36037540435791016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29147419333457947}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8718222379684448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6920163035392761},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6399012804031372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043699383735657},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5974592566490173},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5963622331619263},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.5355351567268372},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.528178334236145},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49527445435523987},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4774627983570099},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.4405973553657532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36037540435791016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29147419333457947},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2019.8713655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2019.8713655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1966793805","https://openalex.org/W2005117954","https://openalex.org/W2010334716","https://openalex.org/W2044718761","https://openalex.org/W2086918511","https://openalex.org/W2087852198","https://openalex.org/W2115556222","https://openalex.org/W2129522056","https://openalex.org/W2149621837","https://openalex.org/W2153278891","https://openalex.org/W2153565255","https://openalex.org/W2765151454","https://openalex.org/W2997776631","https://openalex.org/W6661766311"],"related_works":["https://openalex.org/W2054195159","https://openalex.org/W2597689725","https://openalex.org/W3205136130","https://openalex.org/W2050711624","https://openalex.org/W89357012","https://openalex.org/W2141585233","https://openalex.org/W4320473438","https://openalex.org/W3110096993","https://openalex.org/W1971493157","https://openalex.org/W2945820663"],"abstract_inverted_index":{"Traveling":[0],"Repairman":[1],"Problem":[2],"(TRP)":[3],"is":[4,29,56,63,96,113,128,147,214],"a":[5,20,37,43,50,64,82,124],"class":[6],"of":[7,23,45,66,94,110,145,170,208,219,226],"NP-hard":[8],"combinatorial":[9,114],"optimization":[10],"problems":[11],"which":[12,127],"has":[13],"many":[14],"practical":[15],"applications.":[16],"In":[17,116,210],"this":[18],"paper,":[19],"general":[21],"variant":[22],"TRP,":[24],"also":[25],"known":[26],"as":[27],"TRPTW":[28,32,55],"introduced.":[30],"The":[31,143,174],"problem":[33,112,199],"deals":[34],"with":[35,200,216],"finding":[36],"tour":[38],"in":[39,103,224],"order":[40,117],"to":[41,69,74,77,118,139,148,162,179,202],"serve":[42],"set":[44],"locations,":[46],"each":[47],"one":[48],"within":[49,81],"specified":[51],"time":[52,85,231],"window.":[53],"Obviously,":[54],"more":[57],"complex":[58],"than":[59],"TRP":[60],"because":[61],"it":[62,161],"generation":[65],"TRP.":[67],"Due":[68],"NPhard":[70],"problem,":[71],"metaheuristic":[72,125,222],"needs":[73],"be":[75],"developed":[76],"provide":[78],"near-optimal":[79],"solutions":[80,196],"short":[83],"computation":[84],"for":[86,197,232],"large":[87],"instance":[88],"sizes.":[89],"However,":[90],"the":[91,107,111,120,141,164,171,194,198,217,220],"main":[92],"issue":[93],"metaheuristics":[95],"that":[97,190],"they":[98],"fall":[99],"into":[100],"local":[101,181],"optima":[102],"some":[104],"cases":[105],"since":[106],"search":[108,165],"space":[109],"explosion.":[115],"overcome":[119],"drawback,":[121],"we":[122],"propose":[123],"algorithm":[126,178,192,213],"mainly":[129],"based":[130],"on":[131,186],"Variable":[132],"Neighborhood":[133],"Search":[134],"(VNS)":[135],"and":[136,229],"Shaking":[137,158],"techniques":[138,159],"solve":[140],"problem.":[142],"aim":[144],"VNS":[146],"generate":[149],"diverse":[150],"neighborhoods":[151],"by":[152],"using":[153],"various":[154],"neighborhood":[155],"searches":[156],"while":[157],"allow":[160],"guide":[163],"towards":[166],"an":[167],"unexplored":[168],"part":[169],"solution":[172,227],"space.":[173],"combination":[175],"supports":[176],"our":[177,191,212],"escape":[180],"optimal.":[182],"Extensive":[183],"numerical":[184],"experiments":[185],"benchmark":[187],"instances":[188],"show":[189],"reaches":[193],"optimal":[195],"up":[201],"50":[203],"vertices":[204],"at":[205],"reasonable":[206],"amount":[207],"time.":[209],"addition,":[211],"comparable":[215],"state":[218],"art":[221],"algorithms":[223],"terms":[225],"quality":[228],"running":[230],"larger":[233],"instances.":[234]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}