{"id":"https://openalex.org/W2996413252","doi":"https://doi.org/10.1145/3368926.3369660","title":"Using Metaheuristic for Solving the Resource-Constrained Deliveryman Problem","display_name":"Using Metaheuristic for Solving the Resource-Constrained Deliveryman Problem","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2996413252","doi":"https://doi.org/10.1145/3368926.3369660","mag":"2996413252"},"language":"en","primary_location":{"id":"doi:10.1145/3368926.3369660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","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, Vietnam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056856406","display_name":"Duc-Nghia Nguyen","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":"Duc-Nghia Nguyen","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","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.2175,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64558678,"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":"63","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.9035155177116394},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.837813138961792},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7193747758865356},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5999352335929871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.588787317276001},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.5358525514602661},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5241715908050537},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4718877077102661},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.45767614245414734},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45306074619293213},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4438294768333435},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.43971094489097595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3336552381515503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3040784001350403},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.07056626677513123}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.9035155177116394},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.837813138961792},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7193747758865356},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5999352335929871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.588787317276001},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.5358525514602661},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5241715908050537},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4718877077102661},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.45767614245414734},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45306074619293213},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4438294768333435},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43971094489097595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3336552381515503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3040784001350403},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.07056626677513123},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3368926.3369660","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368926.3369660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1491097971","https://openalex.org/W1575155528","https://openalex.org/W1966793805","https://openalex.org/W2005117954","https://openalex.org/W2010334716","https://openalex.org/W2020931444","https://openalex.org/W2056425817","https://openalex.org/W2077144156","https://openalex.org/W2078637295","https://openalex.org/W2080484716","https://openalex.org/W2088342306","https://openalex.org/W2090275183","https://openalex.org/W2104670598","https://openalex.org/W2115556222","https://openalex.org/W2153278891","https://openalex.org/W2906863681","https://openalex.org/W2997776631","https://openalex.org/W4253500057","https://openalex.org/W4285719527","https://openalex.org/W6682203896"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2560221187","https://openalex.org/W2054324039","https://openalex.org/W4283765137","https://openalex.org/W1655912143","https://openalex.org/W4285258598","https://openalex.org/W2305572622","https://openalex.org/W2361949641","https://openalex.org/W3174749984","https://openalex.org/W2054195159"],"abstract_inverted_index":{"Deliveryman":[0,28],"Problem":[1,29],"(DMP)":[2],"is":[3,31,61,94,110,167],"a":[4,19,39,83,106,159],"class":[5],"of":[6,22,56,86,92,175],"NP-hard":[7,66],"combinatorial":[8],"optimization":[9],"problems":[10],"which":[11,109],"has":[12],"many":[13],"practical":[14],"applications.":[15],"In":[16,101,163],"this":[17,102],"paper,":[18],"general":[20],"variant":[21],"DMP,":[23],"also":[24],"known":[25],"as":[26],"Resource-Constrained":[27],"(RCDMP)":[30],"introduced.":[32],"The":[33,127],"RCDMP":[34],"problem":[35,152],"deals":[36],"with":[37,41,119,153,169],"finding":[38],"tour":[40],"minimum":[42],"waiting":[43],"time":[44,180],"sum":[45],"so":[46],"that":[47,95,143],"it":[48],"consumes":[49],"not":[50],"more":[51],"than":[52],"the":[53,57,89,125,147,151],"Rmax":[54,60],"unites":[55],"resources,":[58],"where":[59],"some":[62],"constant.":[63],"Due":[64],"to":[65,71,74,123,132,155],"problem,":[67],"metaheuristic":[68,107,171],"approach":[69],"needs":[70],"be":[72],"developed":[73],"provide":[75],"near-optimal":[76],"solutions":[77,149],"for":[78,150,181],"large":[79],"instance":[80],"sizes":[81],"at":[82],"reasonable":[84],"amount":[85],"time.":[87,162],"However,":[88],"main":[90],"issue":[91],"metaheuristics":[93],"they":[96],"fall":[97],"into":[98],"local":[99,134],"optima.":[100],"work,":[103],"we":[104],"propose":[105],"algorithm":[108,131,145,166],"mainly":[111],"based":[112],"on":[113,139],"Randomized":[114],"Variable":[115],"Neighborhood":[116],"Search":[117],"(RVNS)":[118],"using":[120],"Tabu":[121],"list":[122],"solve":[124],"problem.":[126],"combination":[128],"supports":[129],"our":[130,144,165],"escape":[133],"optimal.":[135],"Extensive":[136],"numerical":[137],"experiments":[138],"benchmark":[140],"instances":[141],"show":[142],"reaches":[146],"optimal":[148],"up":[154],"100":[156],"vertices":[157],"within":[158],"short":[160],"computation":[161],"addition,":[164],"comparable":[168],"the-state-of-the-art":[170],"algorithms":[172],"in":[173],"terms":[174],"solution":[176],"quality":[177],"and":[178],"running":[179],"larger":[182],"instances.":[183]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}