{"id":"https://openalex.org/W2015045595","doi":"https://doi.org/10.1080/00207160211291","title":"Tabu Search for Vehicle Routing Problems (VRPs)","display_name":"Tabu Search for Vehicle Routing Problems (VRPs)","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2015045595","doi":"https://doi.org/10.1080/00207160211291","mag":"2015045595"},"language":"en","primary_location":{"id":"doi:10.1080/00207160211291","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211291","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-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/A5023776397","display_name":"Deepak K. Gupta","orcid":"https://orcid.org/0000-0001-7493-4787"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"D.K. Gupta","raw_affiliation_strings":["Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India E-mail: dkg@maths.iitkgp.ernet.in"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur, 721302, India E-mail: dkg@maths.iitkgp.ernet.in","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023776397"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.17219661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"79","issue":"6","first_page":"693","last_page":"701"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9991999864578247,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7316886782646179},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.62892746925354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5812411308288574},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5463325381278992},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5303300619125366},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.45986270904541016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4173853397369385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36352288722991943},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.27820414304733276}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7316886782646179},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.62892746925354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5812411308288574},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5463325381278992},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5303300619125366},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.45986270904541016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4173853397369385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36352288722991943},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.27820414304733276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160211291","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211291","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W4326551","https://openalex.org/W177304403","https://openalex.org/W1606581042","https://openalex.org/W2104670598","https://openalex.org/W2127470768","https://openalex.org/W2132250012","https://openalex.org/W2144931885","https://openalex.org/W2166843422","https://openalex.org/W2972294554","https://openalex.org/W3023540311","https://openalex.org/W4246598646","https://openalex.org/W4285719527","https://openalex.org/W4301216918","https://openalex.org/W6607281771"],"related_works":["https://openalex.org/W2476121495","https://openalex.org/W1232705","https://openalex.org/W2991484371","https://openalex.org/W2053571861","https://openalex.org/W2141083629","https://openalex.org/W3159581029","https://openalex.org/W2079721241","https://openalex.org/W2061323558","https://openalex.org/W3140135604","https://openalex.org/W2038822609"],"abstract_inverted_index":{"Vehicle":[0],"Routing":[1],"Problems":[2],"(VRPs)":[3],"considered":[4,126],"in":[5,84,104,156,172,188,247,257],"this":[6],"paper":[7,143],"involve":[8],"a":[9,18,67,200,208],"set":[10,19],"of":[11,20,72,106,109,124,139,148,162,168,174,177,184,190,216,259,261],"engineers":[12,39,76],"operating":[13],"from":[14],"one":[15],"base":[16],"and":[17,35,46,91,112,130,181,219],"geographically":[21],"distributed":[22],"jobs":[23,55,73,80,110,179,218],"or":[24],"services":[25],"to":[26,53,66,98,136,206,233,253],"be":[27,58,82],"performed":[28,59,83],"by":[29,118,194],"them":[30],"under":[31],"the":[32,47,61,70,89,100,114,120,137,146,159,175,182,185,196,213,220,227],"given":[33,62,201],"technological":[34,48,92],"temporal":[36,90],"constraints.":[37],"All":[38],"have":[40],"different":[41,75],"time-windows":[42],"for":[43],"their":[44,51],"working":[45],"constraints":[49,93],"specify":[50],"competence":[52],"do":[54],"which":[56],"can":[57,81],"within":[60],"time-windows.":[63],"A":[64],"solution":[65,186,211],"VRP":[68],"is":[69,97,170,224,251],"scheduling":[71],"among":[74],"so":[77],"that":[78],"these":[79],"minimum":[85,214,221],"cost":[86,183],"with":[87,199,226],"all":[88,119,158,195,239],"satisfied.":[94],"The":[95,166],"objective":[96],"maximize":[99],"work":[101],"done":[102],"measured":[103,171,187],"terms":[105,173,189,258],"total":[107,115,191],"number":[108,176,215,260],"completed":[111],"minimize":[113],"distance":[116,192],"travelled":[117,193],"engineers.":[121,197],"Three":[122],"types":[123,161],"VRPs":[125,134],"are":[127],"under,":[128],"critically":[129],"over":[131],"resourced":[132],"VRPs.":[133,165,236],"belong":[135],"class":[138],"NP-Complete":[140],"problems.":[141],"This":[142],"investigates":[144],"experimentally":[145],"application":[147],"an":[149],"iterative":[150],"method":[151],"Tabu":[152],"Search":[153],"(TS)":[154],"[5]":[155],"solving":[157],"three":[160],"randomly":[163],"generated":[164],"performance":[167],"TS":[169,204,241],"unallocated":[178,217,262],"left":[180],"Starting":[198],"initial":[202],"solution,":[203],"attempts":[205],"obtain":[207],"near":[209],"optimal":[210],"containing":[212],"cost.":[222],"It":[223],"compared":[225],"Hill-Climbing":[228],"(HC)":[229],"algorithm":[230],"also":[231],"used":[232],"solve":[234],"same":[235],"In":[237],"almost":[238],"cases,":[240,249],"performs":[242],"better":[243,255],"than":[244],"HC.":[245],"However,":[246],"some":[248],"HC":[250],"found":[252],"give":[254],"results":[256],"jobs.":[263]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}