{"id":"https://openalex.org/W2103997570","doi":"https://doi.org/10.1109/cipls.2013.6595194","title":"Balancing tour durations in routing a vehicle fleet","display_name":"Balancing tour durations in routing a vehicle fleet","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2103997570","doi":"https://doi.org/10.1109/cipls.2013.6595194","mag":"2103997570"},"language":"en","primary_location":{"id":"doi:10.1109/cipls.2013.6595194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2013.6595194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","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/A5021959924","display_name":"Tolga Bekta\u015f","orcid":"https://orcid.org/0000-0003-0634-144X"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Tolga Bektas","raw_affiliation_strings":["Southampton Management School, Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, Highfield, UK","[Southampton Management School Centre for Operational Research, Management Science and Information Systems (CORMSIS) University of Southampton Southampton, Highfield, UK, S017 1BJ]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southampton Management School, Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, Highfield, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"[Southampton Management School Centre for Operational Research, Management Science and Information Systems (CORMSIS) University of Southampton Southampton, Highfield, UK, S017 1BJ]","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021959924"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":3.0374,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.91400173,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9908000230789185,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9904000163078308,"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/solver","display_name":"Solver","score":0.7719712853431702},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7494942545890808},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6667149066925049},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6409936547279358},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6407225728034973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.638645589351654},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5684247016906738},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5534239411354065},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5447914600372314},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5157046914100647},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43914711475372314},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4227035939693451},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2443142533302307},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07204025983810425}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7719712853431702},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7494942545890808},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6667149066925049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6409936547279358},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6407225728034973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.638645589351654},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5684247016906738},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5534239411354065},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5447914600372314},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5157046914100647},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43914711475372314},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4227035939693451},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2443142533302307},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07204025983810425},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cipls.2013.6595194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2013.6595194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1208385249","https://openalex.org/W1571087346","https://openalex.org/W1965038839","https://openalex.org/W1967113490","https://openalex.org/W1972663275","https://openalex.org/W2037932849","https://openalex.org/W2044121814","https://openalex.org/W2049287714","https://openalex.org/W2050819731","https://openalex.org/W2058937865","https://openalex.org/W2060922563","https://openalex.org/W2074136911","https://openalex.org/W2074666289","https://openalex.org/W2084418824","https://openalex.org/W2127577732","https://openalex.org/W2129360191","https://openalex.org/W2142801633","https://openalex.org/W2160312794","https://openalex.org/W2399100674","https://openalex.org/W4248839979"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2953793234","https://openalex.org/W2263874601","https://openalex.org/W2734758384","https://openalex.org/W2941986668","https://openalex.org/W3116484972"],"abstract_inverted_index":{"This":[0],"paper":[1,21,37,86],"is":[2,60],"concerned":[3],"with":[4,11],"the":[5,30,57,64,76,101],"multiple":[6],"Traveling":[7],"Salesman":[8],"Problem":[9],"(mTSP)":[10],"lower":[12],"and":[13,32,82,99],"upper":[14],"bound":[15],"constraints":[16],"on":[17,45],"tour":[18,105],"durations.":[19,106],"The":[20,36,85],"presents":[22,88],"a":[23,40,67,93],"flow-based":[24],"integer":[25],"linear":[26],"programming":[27],"formulation":[28],"of":[29,66,75,103],"problem":[31,77,98],"some":[33,89],"valid":[34],"inequalities.":[35],"also":[38,87],"describes":[39],"Benders":[41],"decomposition":[42,58],"algorithm":[43,59],"based":[44],"this":[46],"model":[47],"as":[48],"an":[49],"exact":[50],"solution":[51],"approach.":[52],"Computational":[53],"experimentation":[54],"shows":[55],"that":[56],"able":[61],"to":[62,79],"improve":[63],"performance":[65],"standard":[68],"off-the-shelf":[69],"solver":[70],"in":[71,91],"solving":[72,92],"medium-scale":[73],"instances":[74],"up":[78],"71":[80],"nodes":[81],"two":[83],"salesmen.":[84],"results":[90],"practical":[94],"mobile":[95],"library":[96],"routing":[97],"discusses":[100],"implications":[102],"balancing":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}