{"id":"https://openalex.org/W2605902101","doi":"https://doi.org/10.1057/s41274-017-0231-6","title":"A branch-cut-and-price algorithm for the generalized vehicle routing problem","display_name":"A branch-cut-and-price algorithm for the generalized vehicle routing problem","publication_year":2017,"publication_date":"2017-04-12","ids":{"openalex":"https://openalex.org/W2605902101","doi":"https://doi.org/10.1057/s41274-017-0231-6","mag":"2605902101"},"language":"en","primary_location":{"id":"doi:10.1057/s41274-017-0231-6","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0231-6","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5078992730","display_name":"Mohammad Reihaneh","orcid":"https://orcid.org/0000-0002-4982-2692"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Reihaneh","raw_affiliation_strings":["Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003622653","display_name":"Ahmed Ghoniem","orcid":"https://orcid.org/0000-0001-8326-1916"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ahmed Ghoniem","raw_affiliation_strings":["Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003622653"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.3011,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.62418534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"69","issue":"2","first_page":"307","last_page":"318"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9962000250816345,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.7898444533348083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6616658568382263},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5703727006912231},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5560356378555298},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5284851789474487},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5157220959663391},{"id":"https://openalex.org/keywords/decision-maker","display_name":"Decision maker","score":0.5015444755554199},{"id":"https://openalex.org/keywords/purchasing","display_name":"Purchasing","score":0.4812885820865631},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.47009846568107605},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.43674591183662415},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4318588674068451},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42833054065704346},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4116648733615875},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3642268180847168},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.32364892959594727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21176078915596008},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.11745080351829529},{"id":"https://openalex.org/keywords/operations-management","display_name":"Operations management","score":0.0967397689819336}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7898444533348083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6616658568382263},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5703727006912231},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5560356378555298},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5284851789474487},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5157220959663391},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.5015444755554199},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.4812885820865631},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.47009846568107605},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.43674591183662415},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4318588674068451},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42833054065704346},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4116648733615875},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3642268180847168},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.32364892959594727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21176078915596008},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.11745080351829529},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0967397689819336},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/s41274-017-0231-6","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0231-6","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:69:y:2018:i:2:p:307-318","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1057/s41274-017-0231-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1543377438","https://openalex.org/W1965032790","https://openalex.org/W1965566629","https://openalex.org/W1968569114","https://openalex.org/W1973551898","https://openalex.org/W1982419391","https://openalex.org/W1985225156","https://openalex.org/W2017070898","https://openalex.org/W2018269848","https://openalex.org/W2040678783","https://openalex.org/W2070484240","https://openalex.org/W2081508128","https://openalex.org/W2082153300","https://openalex.org/W2088672099","https://openalex.org/W2096171214","https://openalex.org/W2096796578","https://openalex.org/W2121666077","https://openalex.org/W2129360191","https://openalex.org/W2139148132","https://openalex.org/W2168381469","https://openalex.org/W2801463174","https://openalex.org/W2964295186","https://openalex.org/W4246707514"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W1971357083","https://openalex.org/W2084616826","https://openalex.org/W1997215277","https://openalex.org/W1983294952","https://openalex.org/W1968202374","https://openalex.org/W2889871839","https://openalex.org/W2008600006","https://openalex.org/W2024753861","https://openalex.org/W2941986668"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,35,54,70,85],"branch-cut-and-price":[3],"algorithm":[4,81,88],"for":[5],"the":[6,14,79,99],"generalized":[7],"vehicle":[8,15,61],"routing":[9,16],"problem":[10,17],"(GVRP)\u2014a":[11],"variant":[12],"of":[13,38],"where":[18],"customers":[19],"are":[20],"partitioned":[21],"into":[22],"mutually":[23],"exclusive":[24],"clusters.":[25],"The":[26,64],"decision-maker":[27],"seeks":[28],"to":[29,60,91],"determine":[30],"minimum":[31],"cost":[32],"routes":[33],"using":[34,69],"limited":[36],"number":[37],"vehicles":[39],"such":[40],"that":[41,78],"every":[42],"cluster":[43,53],"is":[44,57,67],"visited":[45],"by":[46],"exactly":[47],"one":[48],"route,":[49],"and":[50,89],"within":[51],"any":[52],"single":[55],"customer":[56],"visited,":[58],"subject":[59],"capacity":[62],"constraints.":[63],"pricing":[65],"subproblem":[66],"solved":[68],"specialized":[71],"dynamic":[72],"programming":[73],"algorithm.":[74],"Computational":[75],"results":[76],"show":[77],"proposed":[80],"compares":[82],"favorably":[83],"against":[84],"state-of-the-art":[86],"branch-and-cut":[87],"solves":[90],"optimality":[92],"eight":[93],"previously":[94],"open":[95],"GVRP":[96],"instances":[97],"in":[98],"literature.":[100]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}