{"id":"https://openalex.org/W4308453111","doi":"https://doi.org/10.3390/a15110412","title":"Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows","display_name":"Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows","publication_year":2022,"publication_date":"2022-11-04","ids":{"openalex":"https://openalex.org/W4308453111","doi":"https://doi.org/10.3390/a15110412"},"language":"en","primary_location":{"id":"doi:10.3390/a15110412","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110412","pdf_url":"https://www.mdpi.com/1999-4893/15/11/412/pdf?version=1667808934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/11/412/pdf?version=1667808934","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020586225","display_name":"Leila Karimi","orcid":"https://orcid.org/0000-0002-1478-2248"},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Leila Karimi","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada","institution_ids":["https://openalex.org/I107949126"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048319449","display_name":"Chowdhury Nawrin Ferdous","orcid":null},"institutions":[{"id":"https://openalex.org/I107949126","display_name":"University of Lethbridge","ror":"https://ror.org/044j76961","country_code":"CA","type":"education","lineage":["https://openalex.org/I107949126"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Chowdhury Nawrin Ferdous","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada","institution_ids":["https://openalex.org/I107949126"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020586225"],"corresponding_institution_ids":["https://openalex.org/I107949126"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.6669,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7444822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"11","first_page":"412","last_page":"412"},"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.9959999918937683,"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.9922000169754028,"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/column-generation","display_name":"Column generation","score":0.8567721843719482},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.8333994150161743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6823120713233948},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6167830228805542},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.590217649936676},{"id":"https://openalex.org/keywords/truck","display_name":"Truck","score":0.5890858173370361},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5266639590263367},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.5036336779594421},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5033592581748962},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.46358299255371094},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.4254900813102722},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.284795880317688},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2633247971534729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19918018579483032},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.11571592092514038},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08906805515289307},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07902243733406067},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06286641955375671}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.8567721843719482},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.8333994150161743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6823120713233948},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6167830228805542},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.590217649936676},{"id":"https://openalex.org/C52121051","wikidata":"https://www.wikidata.org/wiki/Q43193","display_name":"Truck","level":2,"score":0.5890858173370361},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5266639590263367},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5036336779594421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5033592581748962},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.46358299255371094},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.4254900813102722},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.284795880317688},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2633247971534729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19918018579483032},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.11571592092514038},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08906805515289307},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07902243733406067},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06286641955375671},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15110412","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110412","pdf_url":"https://www.mdpi.com/1999-4893/15/11/412/pdf?version=1667808934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3c9879d04c724b558fd3c75b24930d1e","is_oa":true,"landing_page_url":"https://doaj.org/article/3c9879d04c724b558fd3c75b24930d1e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 11, p 412 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/11/412/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15110412","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 11; Pages: 412","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15110412","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110412","pdf_url":"https://www.mdpi.com/1999-4893/15/11/412/pdf?version=1667808934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308453111.pdf","grobid_xml":"https://content.openalex.org/works/W4308453111.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1966716113","https://openalex.org/W1973565128","https://openalex.org/W1979700544","https://openalex.org/W1982862520","https://openalex.org/W1999161039","https://openalex.org/W2017387414","https://openalex.org/W2019339947","https://openalex.org/W2029341065","https://openalex.org/W2039082933","https://openalex.org/W2039617902","https://openalex.org/W2040678783","https://openalex.org/W2044172974","https://openalex.org/W2051181280","https://openalex.org/W2088221540","https://openalex.org/W2096305430","https://openalex.org/W2099860183","https://openalex.org/W2104361976","https://openalex.org/W2111563176","https://openalex.org/W2136963152","https://openalex.org/W2163258608","https://openalex.org/W2231755997","https://openalex.org/W2397513326","https://openalex.org/W2465563035","https://openalex.org/W2610038721","https://openalex.org/W2619724822","https://openalex.org/W2767119104","https://openalex.org/W2802476378","https://openalex.org/W2803443944","https://openalex.org/W2912155195","https://openalex.org/W2954633348","https://openalex.org/W2964015168","https://openalex.org/W2998423674","https://openalex.org/W3006380536","https://openalex.org/W3010877158","https://openalex.org/W3091551797","https://openalex.org/W3129685771","https://openalex.org/W3171180456","https://openalex.org/W4241051765","https://openalex.org/W6657795391","https://openalex.org/W6736944503","https://openalex.org/W6783714936"],"related_works":["https://openalex.org/W2158354221","https://openalex.org/W2499699449","https://openalex.org/W2372463611","https://openalex.org/W3089606439","https://openalex.org/W2595691866","https://openalex.org/W2333308323","https://openalex.org/W2474040433","https://openalex.org/W2040678783","https://openalex.org/W2911906655","https://openalex.org/W2291407899"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,13,48,62,74,93,98,106,122],"transportation":[3],"needs":[4],"of":[5,12,79],"modern-day":[6],"retailers,":[7],"we":[8],"consider":[9],"a":[10,25,57,65],"variant":[11],"vehicle":[14,32],"routing":[15],"problem":[16,107],"with":[17],"time":[18,45],"windows":[19],"in":[20,126],"which":[21],"each":[22,31,77],"truck":[23],"has":[24],"variable":[26],"capacity.":[27],"In":[28,76],"our":[29,115,118],"model,":[30],"can":[33,50],"bring":[34],"one":[35],"or":[36],"more":[37],"wagons.":[38],"The":[39],"clients":[40],"are":[41,89],"visited":[42],"within":[43],"specified":[44],"windows,":[46],"and":[47,64,67,81,109],"vehicles":[49],"also":[51],"make":[52],"multiple":[53],"trips.":[54],"We":[55,101],"give":[56],"mathematical":[58],"programming":[59],"formulation":[60],"for":[61],"problem,":[63],"branch":[66,80],"price":[68],"algorithm":[69],"is":[70,85,121],"developed":[71],"to":[72,96,104,113],"solve":[73,105],"model.":[75],"iteration":[78],"price,":[82],"column":[83],"generation":[84],"used.":[86],"Different":[87],"subproblems":[88],"created":[90],"based":[91],"on":[92],"different":[94],"capacities":[95],"find":[97],"best":[99],"column.":[100],"use":[102],"CPLEX":[103],"computationally":[108],"extend":[110],"Solomon\u2019s":[111],"instances":[112],"evaluate":[114],"approach.":[116],"To":[117],"knowledge,":[119],"ours":[120],"first":[123],"such":[124],"study":[125],"this":[127],"field.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}