{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:29:54Z","timestamp":1726849794309},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100011906","name":"Bayerische Forschungsallianz","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011906","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/EEA\/50014\/2013"],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011929","name":"Programa Operacional Tem\u00e1tico Factores de Competitividade","doi-asserted-by":"publisher","award":["POCI-01-0145-FEDER-006961"],"id":[{"id":"10.13039\/501100011929","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100016117","name":"Hanns-Seidel-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100016117","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1016\/j.ejor.2019.01.053","type":"journal-article","created":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T08:26:47Z","timestamp":1548836807000},"page":"893-909","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":43,"title":["Product-oriented time window assignment for a multi-compartment vehicle routing problem"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8320-7346","authenticated-orcid":false,"given":"Sara","family":"Martins","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Ostermeier","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Amorim","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1358-1284","authenticated-orcid":false,"given":"Alexander","family":"H\u00fcbner","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0815-1068","authenticated-orcid":false,"given":"Bernardo","family":"Almada-Lobo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.01.053_bib0001","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.asoc.2015.08.020","article-title":"Hybridized ant colony algorithm for the multi compartment vehicle routing problem","volume":"37","author":"Abdulkader","year":"2015","journal-title":"Applied Soft Computing"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0002","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0003","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","article-title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","volume":"52","author":"Belhaiza","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0004","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":"Journal of Global Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0005","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","article-title":"An algorithm for the vehicle-dispatching problem","volume":"20","author":"Christofides","year":"1969","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0006","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0007","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":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0008","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0009","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 Spectrum"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.053_bib0010","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.cor.2006.10.006","article-title":"A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem","volume":"35","author":"El Fallahi","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0011","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.21538","article-title":"A new consistent vehicle routing problem for the transportation of people with disabilities","volume":"63","author":"Feillet","year":"2014","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0012","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/msom.1080.0243","article-title":"The consistent vehicle routing problem","volume":"11","author":"Gro\u00ebr","year":"2009","journal-title":"Manufacturing & service operations management"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0013","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0014","unstructured":"Henke, T., Speranza, M. G., & W\u00e4scher, G. (2017). A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Working Paper No. 04\/2017, Otto-von-Guericke-University Magdeburg."},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0015","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2015.12.036","article-title":"Delivery pattern and transportation planning in grocery retailing","volume":"252","author":"Holzapfel","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0016","article-title":"A multi-compartment vehicle routing problem with loading and unloading costs","author":"H\u00fcbner","year":"2018","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.053_bib0017","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.ejor.2017.01.039","article-title":"An integrated assortment and shelf-space optimization model with demand substitution and space-elasticity effect","volume":"261","author":"H\u00fcbner","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"10.1016\/j.ejor.2019.01.053_bib0018","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1108\/IJRDM-05-2013-0104","article-title":"Demand and supply chain planning in grocery retail: An operations planning framework","volume":"41","author":"H\u00fcbner","year":"2013","journal-title":"International Journal of Retail & Distribution Management"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0019","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0305-0483(02)00064-6","article-title":"A problem generator-solver heuristic for vehicle routing with soft time windows","volume":"31","author":"Ioannou","year":"2003","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0020","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s00291-013-0348-1","article-title":"Self-imposed time windows in vehicle routing problems","volume":"37","author":"Jabali","year":"2015","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2019.01.053_bib0021","series-title":"Proceedings of the 12th international conference on informatics in control, automation and robotics (ICINCO)","first-page":"324","article-title":"Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit","volume":"1","author":"Kaabi","year":"2015"},{"key":"10.1016\/j.ejor.2019.01.053_bib0022","doi-asserted-by":"crossref","DOI":"10.1155\/2015\/126754","article-title":"Vehicle routing problem for multiple product types, compartments, and trips with soft time windows","volume":"2015","author":"Kabcome","year":"2015","journal-title":"International Journal of Mathematics and Mathematical Sciences"},{"key":"10.1016\/j.ejor.2019.01.053_bib0023","series-title":"End-to-end supply chain management in grocery retailing","author":"Klingler","year":"2016"},{"key":"10.1016\/j.ejor.2019.01.053_bib0024","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, Otto-von-Guericke-University Magdeburg."},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0025","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/net.21565","article-title":"Vehicle routing problems in which consistency considerations are important: A survey","volume":"64","author":"Kovacs","year":"2014","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0026","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/trsc.2014.0529","article-title":"The generalized consistent vehicle routing problem","volume":"49","author":"Kovacs","year":"2015","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.053_bib0027","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","article-title":"Adaptive large neighborhood search for service technician routing and scheduling problems","volume":"15","author":"Kovacs","year":"2012","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0028","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1002\/net.21522","article-title":"A template-based adaptive large neighborhood search for the consistent vehicle routing problem","volume":"63","author":"Kovacs","year":"2014","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0029","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ejor.2015.06.030","article-title":"The multi-objective generalized consistent vehicle routing problem","volume":"247","author":"Kovacs","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2019.01.053_bib0030","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s12063-012-0075-9","article-title":"Integrative retail logistics: An exploratory study","volume":"6","author":"Kuhn","year":"2013","journal-title":"Operations Management Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.053_bib0031","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1080\/0740817X.2016.1167288","article-title":"An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem","volume":"48","author":"Lian","year":"2016","journal-title":"IIE Transactions"},{"key":"10.1016\/j.ejor.2019.01.053_bib0032","first-page":"1","article-title":"Delivery mode planning for distribution to brick-and-mortar retail stores: discussion and literature review","author":"Martins","year":"2017","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.053_bib0033","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0034","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.ejor.2018.01.059","article-title":"Vehicle selection for a multi-compartment vehicle routing problem","volume":"269","author":"Ostermeier","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.053_bib0035","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1108\/IJRDM-01-2016-0004","article-title":"A framework for designing backroom areas in grocery stores","volume":"45","author":"Pires","year":"2017","journal-title":"International Journal of Retail & Distribution Management"},{"issue":"8","key":"10.1016\/j.ejor.2019.01.053_bib0036","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.053_bib0037","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":"Applied Soft Computing"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0038","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.053_bib0039","series-title":"A new local search algorithm providing high quality solutions to vehicle routing problems","author":"Shaw","year":"1997"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0040","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.2016.0705","article-title":"The time window assignment vehicle routing problem with time-dependent travel times","volume":"52","author":"Spliet","year":"2017","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0041","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ejor.2015.01.020","article-title":"The discrete time window assignment vehicle routing problem","volume":"244","author":"Spliet","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0042","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1287\/trsc.2013.0510","article-title":"The time window assignment vehicle routing problem","volume":"49","author":"Spliet","year":"2014","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0043","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.ejor.2015.07.030","article-title":"A branch-and-cut framework for the consistent traveling salesman problem","volume":"248","author":"Subramanyam","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.053_sbref0042","series-title":"Strategic allocation of time windows in vehicle routing problems under uncertainty","author":"Subramanyam","year":"2017"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0045","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/trsc.1090.0303","article-title":"A model and algorithm for the courier delivery problem with uncertainty","volume":"44","author":"Sungur","year":"2010","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.053_bib0046","doi-asserted-by":"crossref","first-page":"4233","DOI":"10.1016\/j.eswa.2011.09.111","article-title":"A template-based tabu search algorithm for the consistent vehicle routing problem","volume":"39","author":"Tarantilis","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2019.01.053_bib0047","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.cor.2017.08.004","article-title":"Data-driven assignment of delivery patterns with handling effort considerations in retail","volume":"100","author":"Taube","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.053_bib0048","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ijpe.2006.06.010","article-title":"Logistics drivers for shelf stacking in grocery retail stores: Potential for efficiency improvement","volume":"121","author":"van Zelst","year":"2009","journal-title":"International Journal of Production Economics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300888?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300888?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T11:10:03Z","timestamp":1656587403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["S0377221719300888"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.053","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Product-oriented time window assignment for a multi-compartment 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.2019.01.053","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}