{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T16:12:42Z","timestamp":1783527162230,"version":"3.55.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":599,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s13676-016-0096-x","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T03:55:37Z","timestamp":1465790137000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Branch-and-Price algorithm for two multi-compartment vehicle routing problems"],"prefix":"10.1016","volume":"8","author":[{"given":"Samira","family":"Mirzaei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanne","family":"W\u00f8hlk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1007\/s13676-016-0096-x_bib1","doi-asserted-by":"crossref","unstructured":"Archetti C, Bianchessi N, Speranza MG (2015) A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput Oper Res 64:1\u201310","DOI":"10.1016\/j.cor.2015.04.023"},{"issue":"2","key":"10.1007\/s13676-016-0096-x_bib2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/trsc.2014.0528","article-title":"Multicommodity vs. single-commodity routing","volume":"50","author":"Archetti","year":"2014","journal-title":"Transp Sci"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0377-2217(02)00676-8","article-title":"Solving a fuel delivery problem by heuristic and exact approaches","volume":"152","author":"Avella","year":"2004","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-016-0096-x_bib4","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Abdelaziz F, Roucairol C, Bacha C (2002) Deliveries of liquid fuels to sndp gas stations using vehicles with multiple compartments. In: 2002 IEEE International Conference on Systems, Man and Cybernetics, vol 1, pp 478\u2013483","DOI":"10.1109\/ICSMC.2002.1168021"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","article-title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","volume":"34","author":"Boland","year":"2006","journal-title":"Oper Res Lett"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/inte.17.1.107","article-title":"Real-time, wide area dispatch of mobil tank trucks","volume":"17","author":"Brown","year":"1987","journal-title":"Interfaces"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","article-title":"Real-time dispatch of petroleum tank trucks","volume":"27","author":"Brown","year":"1981","journal-title":"Manage Sci"},{"key":"10.1007\/s13676-016-0096-x_bib8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","article-title":"Scheduling deliveries in vehicles with multiple compartments","volume":"26","author":"Chajakis","year":"2003","journal-title":"J Global Optim"},{"issue":"3","key":"10.1007\/s13676-016-0096-x_bib9","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.ejor.2014.10.059","article-title":"Classification, models and exact algorithms for multi-compartment delivery problems","volume":"242","author":"Coelho","year":"2015","journal-title":"Eur J Oper Res"},{"issue":"5","key":"10.1007\/s13676-016-0096-x_bib10","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1057\/palgrave.jors.2602374","article-title":"An exact algorithm for the petrol station replenishment problem","volume":"59","author":"Cornillier","year":"2008","journal-title":"J Oper Res Soc"},{"issue":"2","key":"10.1007\/s13676-016-0096-x_bib11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2007.08.016","article-title":"A heuristic for the multi-period petrol station replenishment problem","volume":"191","author":"Cornillier","year":"2008","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Oper Res"},{"issue":"4","key":"10.1007\/s13676-016-0096-x_bib13","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","article-title":"The decomposition algorithm for linear programs","volume":"29","author":"Dantzig","year":"1961","journal-title":"Econometrica"},{"issue":"4","key":"10.1007\/s13676-016-0096-x_bib14","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","article-title":"Vehicle routing with compartments: applications, modelling and heuristics","volume":"33","author":"Derigs","year":"2011","journal-title":"OR Spectr"},{"key":"10.1007\/s13676-016-0096-x_bib15","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Solomon M (eds.) Column generation. Springer (2005)","DOI":"10.1007\/b135457"},{"key":"10.1007\/s13676-016-0096-x_bib16","doi-asserted-by":"crossref","unstructured":"El Fallahi A, Prins C, Calvo RW (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 35(5):1725\u20131741","DOI":"10.1016\/j.cor.2006.10.006"},{"issue":"3","key":"10.1007\/s13676-016-0096-x_bib17","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.ejor.2015.05.020","article-title":"The multi-compartment vehicle routing problem with flexible compartment sizes","volume":"246","author":"Henke","year":"2015","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-016-0096-x_bib18","doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon M (eds.) Column generation. Springer, pp 33\u201365","DOI":"10.1007\/0-387-25486-2_2"},{"key":"10.1007\/s13676-016-0096-x_bib19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","article-title":"A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia","volume":"51","author":"Lahyani","year":"2015","journal-title":"Omega"},{"issue":"4\u20135","key":"10.1007\/s13676-016-0096-x_bib20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","article-title":"Classical and modern heuristics for the vehicle routing problem","volume":"7","author":"Laporte","year":"2000","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2010.02.020","article-title":"On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm","volume":"206","author":"Muyldermans","year":"2010","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-016-0096-x_bib22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","article-title":"An ant colony algorithm for the multi-compartment vehicle routing problem","volume":"15","author":"Reed","year":"2014","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13676-016-0096-x_bib23","doi-asserted-by":"crossref","unstructured":"Repoussis PP, Tarantilis CD, Ioannou G (2007) A hybrid metaheuristic for a real life vehicle routing problem. In: Numerical Methods and Applications. Springer, pp 247\u2013254","DOI":"10.1007\/978-3-540-70942-8_29"},{"key":"10.1007\/s13676-016-0096-x_bib24","series-title":"Computer scheduling of public transport urban passenger vehicle and crew scheduling","first-page":"269","article-title":"An integer programming approach to scheduling","author":"Ryan","year":"1981"},{"key":"10.1007\/s13676-016-0096-x_bib25","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications. MOS-SIAM Series on optimization","DOI":"10.1137\/1.9781611973594"},{"issue":"1","key":"10.1007\/s13676-016-0096-x_bib26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","article-title":"On Dantzig\u2013Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm","volume":"48","author":"Vanderbeck","year":"2000","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-016-0096-x_bib27","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/0377-2217(94)00189-J","article-title":"Reconsidering the distribution structure of gasoline products for a large oil company","volume":"81","author":"Van der Bruggen","year":"1995","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-016-0096-x_bib28","doi-asserted-by":"crossref","unstructured":"Wang Q, Ji Q, Chiu CH (2014) Optimal routing for heterogeneous fixed fleets of multicompartment vehicles. Math Probl Eng","DOI":"10.1155\/2014\/847630"}],"updated-by":[{"DOI":"10.1007\/s13676-017-0106-7","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000}}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0096-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-016-0096-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300546?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300546?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0096-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-016-0096-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:42:24Z","timestamp":1761882144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["S2192437620300546"],"URL":"https:\/\/doi.org\/10.1007\/s13676-016-0096-x","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Branch-and-Price algorithm for two multi-compartment vehicle routing problems","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-016-0096-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2016 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}