{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T17:07:24Z","timestamp":1773335244585,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T00:00:00Z","timestamp":1762214400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.11.003","type":"journal-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T16:35:11Z","timestamp":1762360511000},"page":"144-155","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A branch-And-Cut algorithm for the mixed fleet green vehicle routing problem"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1092-1546","authenticated-orcid":false,"given":"Jesper Bang","family":"Mikkelsen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8989-6015","authenticated-orcid":false,"given":"Sune Lauth","family":"Gadegaard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-136X","authenticated-orcid":false,"given":"Jens","family":"Lysgaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2025.11.003_bib0001","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1287\/trsc.2016.0734","article-title":"An exact algorithm for the green vehicle routing problem","volume":"51","author":"Andelmin","year":"2017","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.11.003_bib0002","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.cor.2019.04.018","article-title":"A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation","volume":"109","author":"Andelmin","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.003_bib0003","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","article-title":"Solving the asymmetric travelling salesman problem with time windows by branch-and-cut","volume":"90","author":"Ascheuer","year":"2001","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.003_bib0004","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/net.21592","article-title":"Optimal vehicle routing with lower and upper bounds on route durations","volume":"65","author":"Bekta\u015f","year":"2015","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.003_bib0005","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.trb.2019.03.004","article-title":"The electric autonomous dial-a-ride problem","volume":"122","author":"Bongiovanni","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.003_bib0006","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/opre.2020.2033","article-title":"Asymmetric multidepot vehicle routing problems: Valid inequalities and a branch-and-cut algorithm","volume":"69","author":"uit het Broek","year":"2021","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.003_bib0007","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-010-0357-7","article-title":"New techniques for cost sharing in combinatorial optimization games","volume":"124","author":"Caprara","year":"2010","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2025.11.003_bib0008","series-title":"Operations research forum","first-page":"1","article-title":"A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies","volume":"vol. 2","author":"Ceselli","year":"2021"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.003_bib0009","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1287\/opre.2016.1535","article-title":"Exact algorithms for electric vehicle-routing problems with time windows","volume":"64","author":"Desaulniers","year":"2016","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.003_bib0010","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1287\/trsc.2020.0988","article-title":"Variable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models","volume":"54","author":"Desaulniers","year":"2020","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.11.003_bib0011","series-title":"Column generation","first-page":"1","article-title":"A primer in column generation","author":"Desrosiers","year":"2005"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.003_bib0012","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","article-title":"A green vehicle routing problem","volume":"48","author":"Erdo\u011fan","year":"2012","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2025.11.003_bib0013","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","article-title":"Robust branch-and-cut-and-price for the capacitated vehicle routing problem","volume":"106","author":"Fukasawa","year":"2006","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.003_bib0014","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ejor.2015.01.049","article-title":"Routing a mixed fleet of electric and conventional vehicles","volume":"245","author":"Goeke","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.003_bib0015","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ejor.2018.06.025","article-title":"Routing a mix of conventional, plug-in hybrid, and electric vehicles","volume":"272","author":"Hiermann","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.003_bib0016","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.ejor.2018.07.002","article-title":"The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology","volume":"272","author":"Jie","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.003_bib0017","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.asoc.2015.10.064","article-title":"The green vehicle routing problem: A heuristic based exact solution approach","volume":"39","author":"Ko\u00e7","year":"2016","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.11.003_bib0018","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.tre.2018.11.003","article-title":"Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations","volume":"122","author":"Koyuncu","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"7","key":"10.1016\/j.ejor.2025.11.003_bib0019","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/01605682.2020.1730250","article-title":"An exact algorithm for the electric-vehicle routing problem with nonlinear charging time","volume":"72","author":"Lee","year":"2021","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2025.11.003_bib0020","unstructured":"Lysgaard, J. (2003). CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. https:\/\/sites.google.com\/view\/jens-lysgaard\/cvrpsep."},{"key":"10.1016\/j.ejor.2025.11.003_bib0021","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","article-title":"A new branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"100","author":"Lysgaard","year":"2004","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.003_bib0022","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/j.ejor.2019.01.067","article-title":"An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows","volume":"276","author":"Macrina","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.003_bib0023","series-title":"The electric vehicle routing problem with partial charging and nonlinear charging function","author":"Montoya","year":"2015"},{"key":"10.1016\/j.ejor.2025.11.003_bib0024","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.trb.2019.06.006","article-title":"The electric vehicle routing problem with energy consumption uncertainty","volume":"126","author":"Pelletier","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2025.11.003_bib0025","doi-asserted-by":"crossref","first-page":"101622","DOI":"10.1109\/ACCESS.2022.3208899","article-title":"Green vehicle routing problem: State of the art and future directions","volume":"10","author":"Sabet","year":"2022","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.003_bib0026","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1287\/trsc.2013.0490","article-title":"The electric vehicle-routing problem with time windows and recharging stations","volume":"48","author":"Schneider","year":"2014","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.11.003_bib0027","series-title":"Variable neighborhood search: 8th international conference, ICVNS 2021, abu dhabi, united arab emirates, march 21\u201325, 2021, proceedings 8","first-page":"14","article-title":"Variable neighborhood descent branching applied to the green electric vehicle routing problem with time window and mixed fleet","author":"Stehling","year":"2021"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.003_bib0028","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1287\/trsc.2016.0697","article-title":"Alternative-fuel vehicle adoption in service fleets: impact evaluation through optimization modeling","volume":"51","author":"Yavuz","year":"2017","journal-title":"Transportation Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008951?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725008951?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T05:30:29Z","timestamp":1773293429000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725008951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725008951"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.003","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch-And-Cut algorithm for the mixed fleet green vehicle routing problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}