{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T09:36:53Z","timestamp":1725356213657},"reference-count":53,"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\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"publisher","award":["407-13-050"],"id":[{"id":"10.13039\/501100003246","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.070","type":"journal-article","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T20:31:39Z","timestamp":1548966699000},"page":"1013-1033","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-3826-0057","authenticated-orcid":false,"given":"Annelieke C.","family":"Baller","sequence":"first","affiliation":[]},{"given":"Said","family":"Dabia","sequence":"additional","affiliation":[]},{"given":"Wout E.H.","family":"Dullaert","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1499-8452","authenticated-orcid":false,"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0001","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/trsc.2014.0523","article-title":"A two-phase iterative heuristic approach for the production routing problem","volume":"49","author":"Absi","year":"2015","journal-title":"Transportation Science"},{"issue":"9","key":"10.1016\/j.ejor.2019.01.070_bib0002","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","article-title":"Industrial aspects and literature survey: Combined inventory management and routing","volume":"37","author":"Andersson","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0003","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/trsc.1030.0080","article-title":"Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach","volume":"39","author":"Anily","year":"2005","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0004","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/trsc.1060.0188","article-title":"A Branch-and-Cut algorithm for a vendor-managed inventory-routing problem","volume":"41","author":"Archetti","year":"2007","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0005","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/itor.12076","article-title":"Formulations for an inventory routing problem","volume":"21","author":"Archetti","year":"2014","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0006","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","article-title":"Computational complexity of uncapacitated multi-echelon production planning problems","volume":"8","author":"Arkin","year":"1989","journal-title":"Operations Research Letters"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0007","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"13","key":"10.1016\/j.ejor.2019.01.070_bib0008","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1080\/00207540410001671660","article-title":"Models and algorithms for the dynamic-demand joint replenishment problem","volume":"42","author":"Boctor","year":"2004","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0009","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/j.ejor.2014.12.020","article-title":"A distribution-free TSP tour length estimation model for random graphs","volume":"243","author":"\u00c7avdar","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0010","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/0305-0548(92)90002-M","article-title":"Operational estimators for the length of a traveling salesman tour","volume":"19","author":"Chien","year":"1992","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.070_bib0011","unstructured":"Coelho, L. C. (n.d.). Problem instances inventory routing. Accessed: 24 May 2016 http:\/\/www.leandro-coelho.com\/instances\/inventory-routing\/."},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2013.0472","article-title":"Thirty years of inventory routing","volume":"48","author":"Coelho","year":"2014","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.070_bib0013","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.cor.2014.06.007","article-title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","volume":"55","author":"Cordeau","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0014","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10479-015-2073-4","article-title":"On reformulations for the one-warehouse multi-retailer problem","volume":"238","author":"Cunha","year":"2016","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0015","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/trsc.18.4.331","article-title":"The distance traveled to visit N points with a maximum of C stops per vehicle: An analytic model and an application","volume":"18","author":"Daganzo","year":"1984","journal-title":"Transportation science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0016","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0191-2615(84)90027-4","article-title":"The length of tours in zones of different shapes","volume":"18","author":"Daganzo","year":"1984","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0017","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0377-2217(00)00226-5","article-title":"A continuous model for production\u2013distribution system design","volume":"129","author":"Dasci","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.070_bib0018","series-title":"Column generation","first-page":"1","article-title":"A primer in column generation","author":"Desrosiers","year":"2005"},{"key":"10.1016\/j.ejor.2019.01.070_bib0019","series-title":"Distribution management: Mathematical modelling & practical analysis","author":"Eilon","year":"1971"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0020","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/opre.1070.0392","article-title":"Progressive interval heuristics for multi-item capacitated lot-sizing problems","volume":"55","author":"Federgruen","year":"2007","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0021","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2019.01.070_bib0022","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3141\/2089-01","article-title":"Planning approximations to the average length of vehicle routing problems with varying customer demands and routing constraints","volume":"2089","author":"Figliozzi","year":"2008","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0023","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s11750-017-0456-1","article-title":"Continuous approximation models in freight distribution management","volume":"25","author":"Franceschetti","year":"2017","journal-title":"TOP"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0024","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","article-title":"Bounds and heuristics for capacitated routing problems","volume":"10","author":"Haimovich","year":"1985","journal-title":"Mathematics of Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2019.01.070_bib0025","doi-asserted-by":"crossref","first-page":"2138","DOI":"10.1016\/j.cor.2013.03.005","article-title":"A vendor managed inventory model under contractual storage agreement","volume":"40","author":"Hariga","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0026","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s00291-008-0134-7","article-title":"Delivery strategies for blood products supplies","volume":"31","author":"Hemmelmayr","year":"2009","journal-title":"OR Spectrum"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0027","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1057\/palgrave.jors.2601751","article-title":"Models to estimate average route lengths in different geographical environments","volume":"55","author":"Hindle","year":"2004","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0028","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.ejor.2005.06.022","article-title":"An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints","volume":"175","author":"Hoque","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.070_bib0029","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1016\/j.trb.2012.06.004","article-title":"A continuous approximation model for the fleet composition problem","volume":"46","author":"Jabali","year":"2012","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2019.01.070_bib0030","unstructured":"Jacobs, T., & Longo, S. (2014). A new perspective on the windows scheduling problem. arXiv:1410.7237."},{"issue":"4","key":"10.1016\/j.ejor.2019.01.070_bib0031","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1080\/00207543.2016.1218564","article-title":"An efficient method for dynamic-demand joint replenishment problem with multiple suppliers and multiple vehicles","volume":"55","author":"Kang","year":"2017","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0032","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.03.007","article-title":"A review of the joint replenishment problem literature: 1989\u20132005","volume":"186","author":"Khouja","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.070_bib0033","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/0305-0548(94)00093-N","article-title":"Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks","volume":"22","author":"Kwon","year":"1995","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0034","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0191-2615(95)00035-6","article-title":"Continuous approximation models in freight distribution: An overview","volume":"30","author":"Langevin","year":"1996","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0035","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0191-2615(89)90036-2","article-title":"Design of multiple-vehicle delivery tours satisfying time constraints","volume":"23","author":"Langevin","year":"1989","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2019.01.070_bib0036","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cor.2017.03.010","article-title":"A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated teller machines","volume":"85","author":"Larrain","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.070_bib0037","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ijpe.2014.08.001","article-title":"A vendor managed inventory model using continuous approximations for route length estimates and Markov chain modeling for cost estimates","volume":"157","author":"Larsen","year":"2014","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0038","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0039","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/00207540500270562","article-title":"More on \u2018models and algorithms for the dynamic-demand joint replenishment problem\u2019","volume":"44","author":"Narayanan","year":"2006","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0040","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.ejor.2009.08.015","article-title":"Efficient and effective heuristics for the coordinated capacitated lot-size problem","volume":"203","author":"Narayanan","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0041","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(91)90003-8","article-title":"A polyhedral approach to edge coloring","volume":"10","author":"Nemhauser","year":"1991","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0042","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.ijpe.2007.09.004","article-title":"Inventory replenishment with interdependent ordering costs: An evolutionary algorithm solution","volume":"113","author":"Olsen","year":"2008","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2019.01.070_bib0043","series-title":"Proceedings of the international conference on industrial engineering and systems management (IESM)","first-page":"1361","article-title":"Determining the optimal routes in the multi-product multi-site joint delivery problem","author":"Rahmouni","year":"2015"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0044","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1057\/palgrave.jors.2602197","article-title":"Effective heuristics for the dynamic demand joint replenishment problem","volume":"58","author":"Robinson","year":"2007","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0045","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.omega.2006.11.004","article-title":"Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms","volume":"37","author":"Robinson","year":"2009","journal-title":"Omega"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.070_bib0046","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s00170-015-7966-5","article-title":"Modeling and solving a one-supplier multi-vehicle production-inventory-distribution problem with clustered retailers","volume":"85","author":"Senoussi","year":"2016","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0047","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.ejor.2006.03.032","article-title":"Incorporating inventory and routing costs in strategic location models","volume":"179","author":"Shen","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0048","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10479-011-1022-0","article-title":"The one-warehouse multi-retailer problem: Reformulation, classification, and computational results","volume":"196","author":"Solyal\u0131","year":"2012","journal-title":"Annals of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0049","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.ejor.2012.06.008","article-title":"Demand dispersion and logistics costs in one-to-many distribution systems","volume":"223","author":"Turkensteen","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.070_bib0050","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1287\/trsc.2015.0637","article-title":"An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines","volume":"50","author":"Van Anholt","year":"2016","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.070_bib0051","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ejor.2013.03.012","article-title":"A dynamic inventory model with supplier selection in a serial supply chain structure","volume":"230","author":"Ventura","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.070_bib0052","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.ijpe.2011.06.015","article-title":"A novel differential evolution algorithm for joint replenishment problem under interdependence and its application","volume":"135","author":"Wang","year":"2012","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.070_bib0053","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1002\/(SICI)1520-6750(199709)44:6<577::AID-NAV4>3.0.CO;2-0","article-title":"Cyclical schedules for the joint replenishment problem with dynamic demands","volume":"44","author":"Webb","year":"1997","journal-title":"Naval Research Logistics (NRL)"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719301055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719301055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T00:47:58Z","timestamp":1569113278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719301055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["S0377221719301055"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.070","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":"The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs","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.070","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"}]}}