{"id":"https://openalex.org/W4383345612","doi":"https://doi.org/10.1016/j.ejor.2023.07.002","title":"Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems","display_name":"Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems","publication_year":2023,"publication_date":"2023-07-06","ids":{"openalex":"https://openalex.org/W4383345612","doi":"https://doi.org/10.1016/j.ejor.2023.07.002"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2023.07.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2023.07.002","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.ejor.2023.07.002","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068574570","display_name":"Arne Schulz","orcid":"https://orcid.org/0000-0002-3088-2820"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Arne Schulz","raw_affiliation_strings":["Universit\u00e4t Hamburg, Institute of Operations Management, Moorweidenstra\u00dfe 18, Hamburg 20148, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3088-2820","affiliations":[{"raw_affiliation_string":"Universit\u00e4t Hamburg, Institute of Operations Management, Moorweidenstra\u00dfe 18, Hamburg 20148, Germany","institution_ids":["https://openalex.org/I159176309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077633986","display_name":"Christian Pfeiffer","orcid":"https://orcid.org/0000-0002-7294-6984"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Pfeiffer","raw_affiliation_strings":["Universit\u00e4t Hamburg, Institute of Operations Management, Moorweidenstra\u00dfe 18, Hamburg 20148, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Hamburg, Institute of Operations Management, Moorweidenstra\u00dfe 18, Hamburg 20148, Germany","institution_ids":["https://openalex.org/I159176309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068574570"],"corresponding_institution_ids":["https://openalex.org/I159176309"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":1.5545,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.82050076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"312","issue":"2","first_page":"456","last_page":"472"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":1.0,"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/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/T10698","display_name":"Transportation Planning and Optimization","score":0.9987000226974487,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.598585844039917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5929149985313416},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5897781848907471},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5505943894386292},{"id":"https://openalex.org/keywords/fixed-cost","display_name":"Fixed cost","score":0.5232773423194885},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5200438499450684},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5165380835533142},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4945997893810272},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.47999829053878784},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.46793004870414734},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43240439891815186},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.43235477805137634},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4216729998588562},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4149569571018219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3142414391040802}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.598585844039917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5929149985313416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5897781848907471},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5505943894386292},{"id":"https://openalex.org/C42866809","wikidata":"https://www.wikidata.org/wiki/Q466764","display_name":"Fixed cost","level":2,"score":0.5232773423194885},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5200438499450684},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5165380835533142},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4945997893810272},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.47999829053878784},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.46793004870414734},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43240439891815186},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.43235477805137634},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4216729998588562},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4149569571018219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3142414391040802},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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":2,"locations":[{"id":"doi:10.1016/j.ejor.2023.07.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2023.07.002","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:312:y:2024:i:2:p:456-472","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377221723005398","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":{"id":"doi:10.1016/j.ejor.2023.07.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2023.07.002","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W631299103","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1989019664","https://openalex.org/W2000924903","https://openalex.org/W2006538209","https://openalex.org/W2007121053","https://openalex.org/W2017665166","https://openalex.org/W2031736545","https://openalex.org/W2051358678","https://openalex.org/W2053697731","https://openalex.org/W2062788425","https://openalex.org/W2080072716","https://openalex.org/W2082124504","https://openalex.org/W2095535964","https://openalex.org/W2103480272","https://openalex.org/W2105002757","https://openalex.org/W2111563176","https://openalex.org/W2119097848","https://openalex.org/W2123241324","https://openalex.org/W2124947072","https://openalex.org/W2133264981","https://openalex.org/W2150176315","https://openalex.org/W2156117830","https://openalex.org/W2156822338","https://openalex.org/W2163265697","https://openalex.org/W2169528473","https://openalex.org/W2335471126","https://openalex.org/W2399100674","https://openalex.org/W2481715007","https://openalex.org/W2485769505","https://openalex.org/W2599954824","https://openalex.org/W2616463222","https://openalex.org/W2792987450","https://openalex.org/W2793040688","https://openalex.org/W2886308902","https://openalex.org/W2921638490","https://openalex.org/W2963775138","https://openalex.org/W2964290823","https://openalex.org/W2972900558","https://openalex.org/W2973150001","https://openalex.org/W3045470676","https://openalex.org/W3047304744","https://openalex.org/W3116744303","https://openalex.org/W3122956505","https://openalex.org/W3161900926","https://openalex.org/W3185809659","https://openalex.org/W3189417155","https://openalex.org/W3212175929","https://openalex.org/W3215760358","https://openalex.org/W4200294678","https://openalex.org/W4200607477","https://openalex.org/W4213092367","https://openalex.org/W4232385207","https://openalex.org/W4285081856","https://openalex.org/W6839482009"],"related_works":["https://openalex.org/W2953793234","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2161865945","https://openalex.org/W2058742972","https://openalex.org/W2040572217","https://openalex.org/W2388410942"],"abstract_inverted_index":{"The":[0,11,83],"paper":[1],"introduces":[2],"a":[3,17,33,39,101,116,194],"fixed-path":[4,43,84,148,171],"procedure":[5,12,44,85,149],"to":[6,20,26,46,100,115,127,142,160,176,183,186],"solve":[7,128,177],"precedence-constrained":[8],"routing":[9],"problems.":[10],"can":[13,67],"be":[14,143],"applied":[15],"within":[16],"branch-and-cut":[18,40],"framework":[19],"improve":[21,47],"the":[22,42,53,60,93,106,129,132,170],"search":[23],"with":[24,155,158],"respect":[25],"arrival":[27,54],"time":[28,31,55],"variables.":[29],"Every":[30],"when":[32],"new":[34],"variable":[35],"is":[36,86],"fixed":[37],"in":[38,150],"node,":[41],"tries":[45],"lower":[48,64,189],"bounds":[49,192],"on":[50,105],"variables":[51],"picturing":[52],"at":[56],"customer":[57],"locations.":[58],"With":[59,169],"help":[61],"of":[62,72,108,119,121],"these":[63],"bounds,":[65],"we":[66,97,173],"identify":[68],"infeasible":[69],"solutions":[70],"ahead":[71],"time,":[73],"fix":[74],"additional":[75,80,180],"arc":[76],"variables,":[77],"and":[78,137,163,185,190],"add":[79],"valid":[81],"inequalities.":[82],"evaluated":[87],"for":[88,92,134,140,166],"several":[89],"objective":[90],"functions":[91],"dial-a-ride":[94,102],"problem.":[95,168],"Moreover,":[96],"apply":[98],"it":[99],"problem":[103,181],"focusing":[104],"residents":[107],"large":[109],"cities.":[110],"These":[111],"individuals":[112],"have":[113,126],"access":[114],"wide":[117],"range":[118],"means":[120],"transportation.":[122],"Therefore,":[123],"ridepooling":[124],"providers":[125],"trade-off":[130],"between":[131],"costs":[133],"deployed":[135],"vehicles":[136,165],"small":[138],"detours":[139],"customers":[141,162],"competitive.":[144],"We":[145],"evaluate":[146],"our":[147],"an":[151],"extensive":[152],"computational":[153],"study":[154],"4500":[156],"instances":[157,182],"up":[159],"120":[161],"10":[164],"this":[167],"procedure,":[172],"were":[174],"able":[175],"838":[178],"(29.9%)":[179],"optimality":[184],"find":[187],"better":[188],"upper":[191],"than":[193],"standard":[195],"mixed-integer":[196],"programming":[197],"formulation.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}