{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:03:23Z","timestamp":1776783803418,"version":"3.51.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,7]],"date-time":"2018-07-07T00:00:00Z","timestamp":1530921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-018-2938-4","type":"journal-article","created":{"date-parts":[[2018,7,7]],"date-time":"2018-07-07T10:10:10Z","timestamp":1530958210000},"page":"321-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes"],"prefix":"10.1007","volume":"275","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4245-1873","authenticated-orcid":false,"given":"Tino","family":"Henke","sequence":"first","affiliation":[]},{"given":"M. Grazia","family":"Speranza","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"W\u00e4scher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,7]]},"reference":[{"key":"2938_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.asoc.2015.08.020","volume":"37","author":"MMS Abdulkader","year":"2015","unstructured":"Abdulkader, M. M. S., Gajpal, Y., & El Mekkawy, T. Y. (2015). Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Applied Soft Computing,\n                           37, 196\u2013203.","journal-title":"Applied Soft Computing"},{"key":"2938_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/trsc.2014.0528","volume":"50","author":"C Archetti","year":"2016","unstructured":"Archetti, C., Campbell, A., & Speranza, M. G. (2016). Multi-commodity versus single-commodity routing. Transportation Science,\n                           50, 461\u2013472.","journal-title":"Transportation Science"},{"key":"2938_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0377-2217(02)00676-8","volume":"152","author":"P Avella","year":"2004","unstructured":"Avella, P., Boccia, M., & Sforza, A. (2004). Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research,\n                           152, 170\u2013179.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/mnsc.27.1.19","volume":"27","author":"GG Brown","year":"1981","unstructured":"Brown, G. G., & Graves, G. W. (1981). Real-time dispatch of petroleum tank trucks. Management Science,\n                           27, 19\u201332.","journal-title":"Management Science"},{"key":"2938_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/inte.1090.0475","volume":"40","author":"M Caramia","year":"2010","unstructured":"Caramia, M., & Guerriero, F. (2010). A milk collection problem with incompatibility constraints. Interfaces,\n                           40, 130\u2013143.","journal-title":"Interfaces"},{"key":"2938_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"ED Chajakis","year":"2003","unstructured":"Chajakis, E. D., & Guignard, M. (2003). Scheduling deliveries in vehicles with multiple compartments. Journal of Global Optimization,\n                           26, 43\u201378.","journal-title":"Journal of Global Optimization"},{"key":"2938_CR7","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.ejor.2014.10.059","volume":"242","author":"LC Coelho","year":"2015","unstructured":"Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research,\n                           242, 854\u2013864.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2007.08.016","volume":"191","author":"F Cornillier","year":"2008","unstructured":"Cornillier, F., Boctor, F. F., Laporte, G., & Renaud, J. (2008). A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research,\n                           191, 295\u2013305.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G Cornuejols","year":"1993","unstructured":"Cornuejols, G., & Harche, F. (1993). Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming,\n                           60, 21\u201352.","journal-title":"Mathematical Programming"},{"key":"2938_CR10","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","volume":"33","author":"U Derigs","year":"2011","unstructured":"Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., & Vogel, U. (2011). Vehicle routing with compartments: Applications, modelling and heuristics. OR Spectrum,\n                           33, 885\u2013914.","journal-title":"OR Spectrum"},{"key":"2938_CR11","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","volume":"35","author":"A Fallahi El","year":"2008","unstructured":"El Fallahi, A., Prins, C., & Wolfer Calvo, R. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research,\n                           35, 1725\u20131741.","journal-title":"Computers & Operations Research"},{"key":"2938_CR12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2015.08.035","volume":"249","author":"M Elbek","year":"2016","unstructured":"Elbek, M., & W\u00f8hlk, S. (2016). A variable neighborhood search for the multi-period collection of recyclable materials. European Journal of Operational Research,\n                           249, 540\u2013550.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR13","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1057\/palgrave.jors.2600973","volume":"51","author":"K Fagerholt","year":"2000","unstructured":"Fagerholt, K., & Christiansen, M. (2000). A combined ship scheduling and allocation problem. Journal of the Operational Research Society,\n                           51, 834\u2013842.","journal-title":"Journal of the Operational Research Society"},{"key":"2938_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: Latest advances and new challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B. L., Raghavan, S., & Wasil, E. A. (2008). The vehicle routing problem: Latest advances and new challenges. New York: Springer."},{"key":"2938_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.ejor.2014.09.031","volume":"241","author":"JC Goodson","year":"2015","unstructured":"Goodson, J. C. (2015). A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands. European Journal of Operational Research,\n                           241, 361\u2013369.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR16","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.ejor.2015.05.020","volume":"246","author":"T Henke","year":"2015","unstructured":"Henke, T., Speranza, M. G., & W\u00e4scher, G. (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research,\n                           246, 730\u2013746.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR17","unstructured":"Koch, H., Henke, T., W\u00e4scher, G. (2016): A genetic algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Working Paper No. 04\/2016, Fakult\u00e4t f\u00fcr Wirtschaftswissenschaft, Otto-von-Guericke Universit\u00e4t Magdeburg."},{"key":"2938_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","volume":"51","author":"R Lahyani","year":"2015","unstructured":"Lahyani, R., Coelho, L. C., Khemakhem, M., Laporte, G., & Semet, F. (2015). A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. Omega,\n                           51, 1\u201310.","journal-title":"Omega"},{"key":"2938_CR19","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science,\n                           43, 408\u2013416.","journal-title":"Transportation Science"},{"key":"2938_CR20","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1016\/j.cor.2009.06.015","volume":"37","author":"JE Mendoza","year":"2010","unstructured":"Mendoza, J. E., Castanier, B., Gu\u00e9ret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research,\n                           37, 1886\u20131898.","journal-title":"Computers & Operations Research"},{"key":"2938_CR21","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/trsc.1100.0353","volume":"45","author":"JE Mendoza","year":"2011","unstructured":"Mendoza, J. E., Castanier, B., Gu\u00e9ret, C., Medaglia, A. L., & Velasco, N. (2011). Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transportation Science,\n                           45, 346\u2013363.","journal-title":"Transportation Science"},{"key":"2938_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2010.02.020","volume":"206","author":"L Muyldermans","year":"2010","unstructured":"Muyldermans, L., & Pang, G. (2010). On the benefits of co-collection: Experiments with a multi-compartment vehicle routing problem. European Journal of Operational Research,\n                           206, 93\u2013103.","journal-title":"European Journal of Operational Research"},{"key":"2938_CR23","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.3233\/IFS-151893","volume":"30","author":"M Rabbani","year":"2016","unstructured":"Rabbani, M., Farrokhi-asl, H., & Rafiei, H. (2016). A hybrid genetic algorithm for waste collection problem by heterogeneous fleet of vehicles with multiple separated compartments. Journal of Intelligent & Fuzzy Systems,\n                           30, 1817\u20131830.","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"2938_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs, T. K., Kopman, L., Pulleyblank, W. R., & Trotter, L. E. (2003). On the capacitated vehicle routing problem. Mathematical Programming, Series B,\n                           94, 343\u2013359.","journal-title":"Mathematical Programming, Series B"},{"key":"2938_CR25","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing,\n                           15, 169\u2013176.","journal-title":"Applied Soft Computing"},{"key":"2938_CR26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: Problems, methods, and applications","author":"P Toth","year":"2014","unstructured":"Toth, P., & Vigo, D. (2014). Vehicle routing: Problems, methods, and applications (2nd ed.). Philadelphia: Society for Industrial and Applied Mathematics.","edition":"2"},{"key":"2938_CR27","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ijpe.2013.04.034","volume":"147","author":"M Vidovi\u0107","year":"2014","unstructured":"Vidovi\u0107, M., Popovi\u0107, D., & Ratkovi\u0107, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics,\n                           147, 593\u2013604.","journal-title":"International Journal of Production Economics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2938-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2938-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T19:08:16Z","timestamp":1562440096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2938-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2938"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2938-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,7]]},"assertion":[{"value":"7 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}