{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T19:30:20Z","timestamp":1773862220561,"version":"3.50.1"},"reference-count":55,"publisher":"Elsevier BV","issue":"2","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,12,16]],"date-time":"2025-12-16T00:00:00Z","timestamp":1765843200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["20229ZWC97"],"award-info":[{"award-number":["20229ZWC97"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","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":[[2026,7]]},"DOI":"10.1016\/j.ejor.2025.12.028","type":"journal-article","created":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T16:34:12Z","timestamp":1765989252000},"page":"657-675","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust policies for a multi-period fleet sizing problem with demand uncertainty"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1323-7544","authenticated-orcid":false,"given":"Alice","family":"Raffaele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2618-6715","authenticated-orcid":false,"given":"Demetrio","family":"Lagan\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2987-1593","authenticated-orcid":false,"given":"Roberto","family":"Roberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2025.12.028_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103061","article-title":"A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms","volume":"126","author":"Akbarzadeh","year":"2024","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0002","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2014.02.010","article-title":"The dynamic multiperiod vehicle routing problem with probabilistic information","volume":"48","author":"Albareda-Sambola","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0003","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.trc.2008.02.001","article-title":"Short term strategies for a dynamic multi-period routing problem","volume":"17","author":"Angelelli","year":"2009","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0004","article-title":"Practical Bilevel Optimization: Algorithms and applications","volume":"vol. 30","author":"Bard","year":"2013"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0005","article-title":"Robust optimization","volume":"vol. 28","author":"Ben-Tal","year":"2009"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_sbref0006","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1080\/19427867.2022.2049547","article-title":"Achieving robustness in the capacitated vehicle routing problem with stochastic demands","volume":"15","author":"Bernardo","year":"2023","journal-title":"Transportation Letters"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_bib0007","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1287\/opre.2016.1515","article-title":"Multistage robust mixed-integer optimization with adaptive partitions","volume":"64","author":"Bertsimas","year":"2016","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_bib0008","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1287\/opre.2015.1365","article-title":"Design of near optimal decision rules in multistage adaptive mixed-integer optimization","volume":"63","author":"Bertsimas","year":"2015","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0009","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","article-title":"The price of robustness","volume":"52","author":"Bertsimas","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0010","series-title":"Introduction to stochastic programming","author":"Birge","year":"2011"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0011","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ejor.2022.08.019","article-title":"Distributionally robust resource planning under binomial demand intakes","volume":"306","author":"Black","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0012","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.ejor.2016.02.040","article-title":"Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic","volume":"253","author":"Crainic","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0013","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.ejor.2023.09.003","article-title":"Capacity planning with uncertainty on contract fulfillment","volume":"314","author":"Crainic","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0014","article-title":"Bilevel Optimization: Advances and next challenges","volume":"vol. 161","author":"Dempe","year":"2020"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_sbref0015","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2021.09.019","article-title":"Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization","volume":"299","author":"Deng","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2025.12.028_sbref0016","doi-asserted-by":"crossref","first-page":"4640","DOI":"10.3390\/su14084640","article-title":"Model for reverse logistic problem of recycling under stochastic demand","volume":"14","author":"Desticioglu","year":"2022","journal-title":"Sustainability"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105189","article-title":"A multiperiod drayage problem with customer-dependent service periods","volume":"129","author":"Ghezelsoflu","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.028_bib0018","unstructured":"Global Industry Analysts, I. (2024). Online On-demand home services \u2013 Global strategic business report. https:\/\/www.researchandmarkets.com\/reports\/5140216\/online-on-demand-home-services-global. Accessed: 2024-07-24."},{"issue":"6","key":"10.1016\/j.ejor.2025.12.028_bib0019","doi-asserted-by":"crossref","first-page":"3329","DOI":"10.1111\/itor.13318","article-title":"Cutting and packing problems under uncertainty: Literature review and classification framework","volume":"30","author":"Hadj Salem","year":"2023","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_bib0020","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1287\/opre.2015.1392","article-title":"K-adaptability in two-stage robust binary programming","volume":"63","author":"Hanasusanto","year":"2015","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.dche.2022.100057","article-title":"Quantifying the impact of delivery day flexibility on last-mile delivery costs","volume":"5","author":"Izadkhah","year":"2022","journal-title":"Digital Chemical Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0021","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ejor.2023.02.037","article-title":"Dynamic multi-period vehicle routing with touting","volume":"310","author":"Keskin","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_bib0023","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0962492924000084","article-title":"Distributionally robust optimization","volume":"34","author":"Kuhn","year":"2025","journal-title":"Acta Numerica"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0023","doi-asserted-by":"crossref","first-page":"159","DOI":"10.3934\/naco.2021057","article-title":"Distributionally robust optimization: A review on theory and applications","volume":"12","author":"Lin","year":"2022","journal-title":"Numerical Algebra, Control and Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_sbref0024","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S1366-5545(02)00026-1","article-title":"Robust optimization for fleet planning under uncertainty","volume":"39","author":"List","year":"2003","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_sbref0025","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/trsc.2021.1122","article-title":"Dynamic intra-cell repositioning in free-floating bike-sharing systems using approximate dynamic programming","volume":"56","author":"Luo","year":"2022","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102554","article-title":"Stochastic fleet mix optimization: Evaluating electromobility in urban logistics","volume":"158","author":"Malladi","year":"2022","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_sbref0027","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1287\/trsc.2018.0886","article-title":"The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method","volume":"53","author":"Munari","year":"2019","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0028","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2023.09.023","article-title":"Technician routing and scheduling for the sharing economy","volume":"314","author":"Nowak","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0029","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1287\/trsc.2022.0434","article-title":"Hybrid value function approximation for solving the technician routing problem with stochastic repair requests","volume":"58","author":"Pham","year":"2024","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0030","article-title":"Approximate dynamic programming: Solving the curses of dimensionality","volume":"vol. 703","author":"Powell","year":"2011"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_bib0032","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.ejor.2018.06.014","article-title":"Dynamic job assignment: A column generation approach with an application to surgery allocation","volume":"272","author":"Range","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106510","article-title":"An approximated dynamic programming model for the supply vessel fleet sizing problem","volume":"163","author":"Ribeiro","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0033","series-title":"Stochastic programming, handbook in operations research and management science","author":"Ruszczy\u0144ski","year":"2003"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0034","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.ejor.2018.05.022","article-title":"Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations","volume":"271","author":"Sagnol","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_sbref0035","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.ejor.2021.05.041","article-title":"Solving robust bin-packing problems with a branch-and-price approach","volume":"297","author":"Schepler","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2021.103387","article-title":"Fleet sizing and allocation for on-demand last-mile transportation systems","volume":"132","author":"Shehadeh","year":"2021","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0037","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.ejor.2019.01.024","article-title":"Resource allocation in congested queueing systems with time-varying demand: An application to airport operations","volume":"276","author":"Shone","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2019.05.002","article-title":"Surgical scheduling under uncertainty by approximate dynamic programming","volume":"95","author":"Silva","year":"2020","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2025.12.028_bib0040","unstructured":"Solomon, M. M. (2005). VRPTW Benchmark Problems. http:\/\/web.cba.neu.edu\/~msolomon\/problems.htm. Accessed: 2024-07-24."},{"issue":"11","key":"10.1016\/j.ejor.2025.12.028_sbref0039","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1080\/24725854.2018.1468122","article-title":"The robust machine availability problem \u2013 bin packing under uncertainty","volume":"50","author":"Song","year":"2018","journal-title":"IISE Transactions"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.028_sbref0040","doi-asserted-by":"crossref","first-page":"3059","DOI":"10.1287\/ijoc.2022.1229","article-title":"Parallel machine scheduling under uncertainty: models and exact algorithms","volume":"34","author":"Song","year":"2022","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_bib0043","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1287\/ijoc.2014.0595","article-title":"Chance-constrained binary packing problems","volume":"26","author":"Song","year":"2014","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.028_sbref0042","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","article-title":"Convex programming with set-inclusive constraints and applications to inexact linear programming","volume":"21","author":"Soyster","year":"1973","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_sbref0043","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/trsc.1030.0073","article-title":"The dynamic assignment problem","volume":"38","author":"Spivey","year":"2004","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.028_sbref0044","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.2020.2009","article-title":"Robust multiperiod vehicle routing under customer order uncertainty","volume":"69","author":"Subramanyam","year":"2021","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.028_sbref0045","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.ejor.2018.02.038","article-title":"Value function approximation for dynamic multi-period vehicle routing","volume":"269","author":"Ulmer","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106348","article-title":"Data-driven integrated home service staffing and capacity planning: Stochastic optimization approaches","volume":"159","author":"Wang","year":"2023","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.028_bib0049","first-page":"1661","article-title":"Chance-constrained multiple bin packing problem with an application to operating room planning","volume":"33","author":"Wang","year":"2021","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.028_sbref0048","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2023.10.026","article-title":"Wasserstein distributionally robust surgery scheduling with elective and emergency patients","volume":"314","author":"Wang","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.028_sbref0049","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1111\/poms.13949","article-title":"Feature-driven robust surgery scheduling","volume":"32","author":"Wang","year":"2023","journal-title":"Production and Operations Management"},{"issue":"9","key":"10.1016\/j.ejor.2025.12.028_sbref0050","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1016\/j.cor.2009.12.002","article-title":"The dynamic multi-period vehicle routing problem","volume":"37","author":"Wen","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.028_sbref0051","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/s11518-021-5510-8","article-title":"Robust optimization of municipal solid waste collection and transportation with uncertain waste output: A case study","volume":"31","author":"Zhang","year":"2021","journal-title":"Journal of Systems Science and Systems Engineering"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.028_sbref0052","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1287\/opre.2017.1650","article-title":"A new general-purpose algorithm for mixed-integer bilevel linear programs","volume":"65","author":"Fischetti","year":"2017","journal-title":"Operations Research"},{"issue":"11","key":"10.1016\/j.ejor.2025.12.028_sbref0053","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1016\/j.cor.2013.05.005","article-title":"Exact solution of the robust knapsack problem","volume":"40","author":"Monaci","year":"2013","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009956?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:06:52Z","timestamp":1773835612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["S0377221725009956"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.028","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":"Robust policies for a multi-period fleet sizing problem with demand uncertainty","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.12.028","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"}]}}