{"id":"https://openalex.org/W7155510071","doi":"https://doi.org/10.1016/j.ejor.2026.04.026","title":"A generalized set partitioning model for MinMax vehicle routing","display_name":"A generalized set partitioning model for MinMax vehicle routing","publication_year":2026,"publication_date":"2026-04-24","ids":{"openalex":"https://openalex.org/W7155510071","doi":"https://doi.org/10.1016/j.ejor.2026.04.026"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2026.04.026","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.04.026","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.2026.04.026","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055534896","display_name":"Jens Lysgaard","orcid":"https://orcid.org/0000-0001-7835-136X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Jens Lysgaard","raw_affiliation_strings":["Aarhus University, Department of Economics and Business Economics, Fuglesangs All\u00e9 4, 8210 Aarhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-7835-136X","affiliations":[{"raw_affiliation_string":"Aarhus University, Department of Economics and Business Economics, Fuglesangs All\u00e9 4, 8210 Aarhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011329804","display_name":"Sune Lauth Gadegaard","orcid":"https://orcid.org/0000-0001-8989-6015"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sune Lauth Gadegaard","raw_affiliation_strings":["Aarhus University, Department of Economics and Business Economics, Fuglesangs All\u00e9 4, 8210 Aarhus V, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-8989-6015","affiliations":[{"raw_affiliation_string":"Aarhus University, Department of Economics and Business Economics, Fuglesangs All\u00e9 4, 8210 Aarhus V, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055534896"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.48790055,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"334","issue":"1","first_page":"40","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.5742999911308289,"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.5742999911308289,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.05249999836087227,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10524","display_name":"Traffic control and management","score":0.04780000075697899,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.6255999803543091},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6255000233650208},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.579800009727478},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47909998893737793},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2468000054359436}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633899986743927},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6255999803543091},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6255000233650208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5823000073432922},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.579800009727478},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28999999165534973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2615000009536743},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2468000054359436},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.24619999527931213}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.ejor.2026.04.026","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.04.026","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:pure.atira.dk:openaire/36c65f6b-65bd-4697-ae0c-aee887ddae64","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/36c65f6b-65bd-4697-ae0c-aee887ddae64","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lysgaard, J & Gadegaard, S L 2026, 'A generalized set partitioning model for MinMax vehicle routing', European Journal of Operational Research. https://doi.org/10.1016/j.ejor.2026.04.026","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.ejor.2026.04.026","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.04.026","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1970025200","https://openalex.org/W1972385709","https://openalex.org/W1973451304","https://openalex.org/W1996875951","https://openalex.org/W1997401436","https://openalex.org/W2027678739","https://openalex.org/W2037932849","https://openalex.org/W2049287714","https://openalex.org/W2071701840","https://openalex.org/W2072584679","https://openalex.org/W2075453985","https://openalex.org/W2111563176","https://openalex.org/W2113873983","https://openalex.org/W2138664392","https://openalex.org/W2140596151","https://openalex.org/W2143987816","https://openalex.org/W2144045033","https://openalex.org/W2146822189","https://openalex.org/W2171971243","https://openalex.org/W2208946392","https://openalex.org/W2249534008","https://openalex.org/W2346699423","https://openalex.org/W2399100674","https://openalex.org/W2886778514"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,13,24,43,72,99,107,114,127,140],"new":[4,82,100],"approach":[5,92,102,112],"to":[6,79,156],"modeling":[7,101],"of":[8,19,36,55,75,90],"vehicle":[9,39,104],"routing":[10,40,105,159],"problems":[11],"with":[12,106],"MinMax":[14,57,108,158],"objective.":[15,109],"At":[16],"the":[17,20,37,48,52,56,62,68,81,88,91],"core":[18],"approach,":[21],"we":[22],"formulate":[23],"Generalized":[25,115],"Set":[26,116],"Partitioning":[27,117],"Problem":[28,118],"(GSPP)":[29],"which":[30,67],"is":[31,59,124,151],"used":[32],"for":[33,42,66,103,126],"minimizing":[34],"infeasibility":[35,74],"considered":[38],"problem":[41],"given":[44,128],"upper":[45,64],"bound":[46,65],"on":[47],"objective":[49,58],"value.":[50],"Generally,":[51],"optimal":[53],"value":[54],"obtained":[60],"as":[61],"smallest":[63],"formulated":[69],"GSPP":[70],"obtains":[71],"total":[73],"zero.":[76],"We":[77,97],"propose":[78,98],"solve":[80],"formulation":[83],"using":[84,131],"branch-and-price":[85],"and":[86,153],"demonstrate":[87],"effectiveness":[89],"through":[93],"computational":[94],"results.":[95],"\u2022":[96,110,122,136,147],"The":[111,137,148],"uses":[113],"solved":[119],"by":[120],"branch-and-price.":[121],"Feasibility":[123],"checked":[125],"route":[129],"length":[130],"LP":[132],"or":[133],"ILP":[134],"models.":[135],"method":[138,142],"outperforms":[139],"state-of-the-art":[141],"in":[143],"solving":[144],"benchmark":[145],"instances.":[146],"model":[149],"structure":[150],"general":[152],"can":[154],"apply":[155],"various":[157],"problems.":[160]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2026-04-25T00:00:00"}