{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T04:51:37Z","timestamp":1771563097281,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T00:00:00Z","timestamp":1719187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T00:00:00Z","timestamp":1719187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004252","name":"Qatar University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004252","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Logistics related costs constitute a major part in total cost of a product in general. Considering a company that delivers goods to its customers using its owned fleet, fleet ownership and operational costs together with the inventory costs compose the total logistics costs. In this study, we suggest an approximate Dynamic Programming algorithm, with a look ahead strategy, that uses the fix and optimize method as the imbedded heuristic for solving integrated fleet composition and replenishment planning problem. The total annual distribution cost factors considered in the problem are vehicle ownership costs, approximate routing costs, and inventory related costs. In this problem, we aim to minimize the total logistic cost by optimizing the fleet composition, replenishment patterns, and customers assigned to each vehicle in the fleet. We produced a set of reasonably large instances randomly and showed the efficacy of the suggested solution method.<\/jats:p>","DOI":"10.1007\/s10100-024-00911-6","type":"journal-article","created":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T13:02:44Z","timestamp":1719234164000},"page":"91-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A fix and optimize method based approximate dynamic programming approach for the strategic fleet sizing and delivery planning problem"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7218-3975","authenticated-orcid":false,"given":"Duygu","family":"Aghazadeh","sequence":"first","affiliation":[]},{"given":"Kadir","family":"Ertogral","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,24]]},"reference":[{"key":"911_CR1","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2023107","author":"D Aghazadeh","year":"2023","unstructured":"Aghazadeh D, Ertogral K (2023) Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem. J Ind Manag Optim. https:\/\/doi.org\/10.3934\/jimo.2023107","journal-title":"J Ind Manag Optim"},{"issue":"1","key":"911_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejor.2015.02.032","volume":"245","author":"D Astaraky","year":"2015","unstructured":"Astaraky D, Patrick J (2015) A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling. Eur J Oper Res 245(1):309\u2013319","journal-title":"Eur J Oper Res"},{"key":"911_CR3","doi-asserted-by":"publisher","first-page":"102679","DOI":"10.1016\/j.tre.2022.102679","volume":"161","author":"I Aziez","year":"2022","unstructured":"Aziez I, C\u00f4t\u00e9 J-F, Coelho LC (2022) Fleet sizing and routing of healthcare automated guided vehicles. Transp Res Part E Logist Transp Rev 161:102679","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"911_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10100-007-0036-9","volume":"15","author":"PP Belfiore","year":"2007","unstructured":"Belfiore PP, F\u00e1vero LPL (2007) Scatter search for the fleet size and mix vehicle routing problem with time windows. CEJOR 15:351\u2013368","journal-title":"CEJOR"},{"issue":"8","key":"911_CR5","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1073\/pnas.43.8.749","volume":"43","author":"R Bellman","year":"1957","unstructured":"Bellman R, Kalaba R (1957) Dynamic programming and statistical communication theory. Proc Natl Acad Sci 43(8):749\u2013751","journal-title":"Proc Natl Acad Sci"},{"issue":"1\u20133","key":"911_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0925-5273(98)00235-7","volume":"59","author":"L Bertazzi","year":"1999","unstructured":"Bertazzi L, Speranza MG (1999) Inventory control on sequences of links with given transportation frequencies. Int J Prod Econ 59(1\u20133):261\u2013270","journal-title":"Int J Prod Econ"},{"issue":"4","key":"911_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0191-2615(96)00029-X","volume":"31","author":"L Bertazzi","year":"1997","unstructured":"Bertazzi L, Speranza MG, Ukovich W (1997) Minimization of logistic costs with given frequencies. Transp Res Part B Methodol 31(4):327\u2013340","journal-title":"Transp Res Part B Methodol"},{"issue":"7","key":"911_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1287\/mnsc.46.7.973.12032","volume":"46","author":"L Bertazzi","year":"2000","unstructured":"Bertazzi L, Speranza MG, Ukovich W (2000) Exact and heuristic solutions for a shipment problem with given frequencies. Manag Sci 46(7):973\u2013988","journal-title":"Manag Sci"},{"issue":"5\u20136","key":"911_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10732-005-0616-6","volume":"11","author":"L Bertazzi","year":"2005","unstructured":"Bertazzi L, Paletta G, Speranza MG (2005) Minimizing the total cost in an integrated vendor-Managed inventory system. J Heuristics 11(5\u20136):393\u2013419","journal-title":"J Heuristics"},{"issue":"4","key":"911_CR10","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.48.4.550.208","volume":"48","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Manag Sci 48(4):550\u2013565","journal-title":"Manag Sci"},{"key":"911_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.omega.2015.03.002","volume":"56","author":"H Chen","year":"2015","unstructured":"Chen H (2015) Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems. Omega 56:25\u201336","journal-title":"Omega"},{"key":"911_CR12","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.cie.2018.11.014","volume":"127","author":"NK Dastjerd","year":"2019","unstructured":"Dastjerd NK, Ertogral K (2019) A fix-and-optimize heuristic for the integrated fleet sizing and replenishment planning problem with predetermined delivery frequencies. Comput Ind Eng 127:778\u2013787","journal-title":"Comput Ind Eng"},{"issue":"3","key":"911_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0305-0548(91)90028-P","volume":"18","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Verhoog T (1991) A new heuristic for the fleet size and mix vehicle routing problem. Comput Oper Res 18(3):263\u2013274","journal-title":"Comput Oper Res"},{"key":"911_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","volume":"52","author":"\u00c1P Dorneles","year":"2014","unstructured":"Dorneles \u00c1P, de Ara\u00fajo OCB, Buriol LS (2014) A fix-and-optimize heuristic for the high school timetabling problem. Comput Oper Res 52:29\u201338","journal-title":"Comput Oper Res"},{"issue":"9","key":"911_CR15","doi-asserted-by":"publisher","first-page":"2643","DOI":"10.1080\/00207543.2010.532933","volume":"49","author":"J Drechsel","year":"2011","unstructured":"Drechsel J, Kimms A (2011) Cooperative lot sizing with transshipments and scarce capacities: solutions and fair cost allocations. Int J Prod Res 49(9):2643\u20132668","journal-title":"Int J Prod Res"},{"issue":"3","key":"911_CR16","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1287\/opre.1070.0392","volume":"55","author":"A Federgruen","year":"2007","unstructured":"Federgruen A, Meissner J, Tzur M (2007) Progressive interval heuristics for multi-item capacitated lot-sizing problems. Oper Res 55(3):490\u2013502. https:\/\/doi.org\/10.1287\/opre.1070.0392","journal-title":"Oper Res"},{"issue":"4","key":"911_CR17","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00291-005-0207-9","volume":"27","author":"V Gintner","year":"2005","unstructured":"Gintner V, Kliewer N, Suhl L (2005) Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice. Or Spectrum 27(4):507\u2013523. https:\/\/doi.org\/10.1007\/s00291-005-0207-9","journal-title":"Or Spectrum"},{"issue":"6","key":"911_CR18","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1080\/00207543.2011.559486","volume":"50","author":"HG Goren","year":"2012","unstructured":"Goren HG, Tunali S, Jans R (2012) A hybrid approach for the capacitated lot sizing problem with setup carryover. Int J Prod Res 50(6):1582\u20131597","journal-title":"Int J Prod Res"},{"issue":"4","key":"911_CR19","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10489-014-0626-x","volume":"42","author":"HG G\u00f6ren","year":"2015","unstructured":"G\u00f6ren HG, Tunal\u0131 S (2015) Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl Intell 42(4):805\u2013816","journal-title":"Appl Intell"},{"issue":"1","key":"911_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10100-023-00849-1","volume":"32","author":"T Hajba","year":"2023","unstructured":"Hajba T, Horv\u00e1th Z, Heitz D, Psen\u00e1k B (2023) A MILP approach combined with clustering to solve a special petrol station replenishment problem. Central Eur J Oper Res 32(1):95\u2013107","journal-title":"Central Eur J Oper Res"},{"issue":"2","key":"911_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber S, Sahling F (2010) A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int J Prod Econ 123(2):247\u2013256","journal-title":"Int J Prod Econ"},{"issue":"1","key":"911_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00291-012-0283-6","volume":"35","author":"S Helber","year":"2013","unstructured":"Helber S, Sahling F, Schimmelpfeng K (2013) Dynamic capacitated lot sizing with random demand and dynamic safety stocks. Or Spectrum 35(1):75\u2013105","journal-title":"Or Spectrum"},{"issue":"3","key":"911_CR23","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.cor.2004.07.012","volume":"33","author":"Z Hua","year":"2006","unstructured":"Hua Z, Zhang B, Liang L (2006) An approximate dynamic programming approach to convex quadratic knapsack problems. Comput Oper Res 33(3):660\u2013673","journal-title":"Comput Oper Res"},{"issue":"1\u20132","key":"911_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s10696-015-9219-1","volume":"28","author":"PJ Hulshof","year":"2016","unstructured":"Hulshof PJ, Mes MR, Boucherie RJ, Hans EW (2016) Patient admission planning using approximate dynamic programming. Flex Serv Manuf J 28(1\u20132):30\u201361","journal-title":"Flex Serv Manuf J"},{"key":"911_CR25","volume-title":"Production Planning and Inventory Control","author":"FM John","year":"1958","unstructured":"John FM (1958) Production Planning and Inventory Control. McGraw-Hill, Nova Iorque"},{"issue":"3","key":"911_CR26","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.tre.2008.10.003","volume":"45","author":"S Liu","year":"2009","unstructured":"Liu S, Huang W, Ma H (2009) An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transp Res Part E Logist Transp Rev 45(3):434\u2013445","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"911_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tre.2018.03.004","volume":"116","author":"F Neves-Moreira","year":"2018","unstructured":"Neves-Moreira F, Da Silva DP, Guimar\u00e3es L, Amorim P, Almada-Lobo B (2018) The time window assignment vehicle routing problem with product dependent deliveries. Transp Res Part E Logist Transp Rev 116:163\u2013183","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"911_CR28","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1111\/j.1475-3995.2008.00679.x","volume":"16","author":"TC Perry","year":"2009","unstructured":"Perry TC, Hartman JC (2009) An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem. Int Trans Oper Res 16(3):347\u2013359","journal-title":"Int Trans Oper Res"},{"key":"911_CR29","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet Y, Wolsey LA (2006) Production Planning by Mixed Integer Programming. Springer"},{"issue":"6","key":"911_CR30","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10951-009-0160-6","volume":"13","author":"DP Ronconi","year":"2010","unstructured":"Ronconi DP, Powell WB (2010) Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming. J Sched 13(6):597\u2013607","journal-title":"J Sched"},{"issue":"6","key":"911_CR31","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1016\/j.cor.2008.05.004","volume":"36","author":"HR Sayarshad","year":"2009","unstructured":"Sayarshad HR, Ghoseiri K (2009) A simulated annealing approach for the multi-periodic rail-car fleet sizing problem. Comput Oper Res 36(6):1789\u20131799","journal-title":"Comput Oper Res"},{"key":"911_CR32","doi-asserted-by":"publisher","first-page":"102066","DOI":"10.1016\/j.omega.2019.05.002","volume":"95","author":"TA Silva","year":"2020","unstructured":"Silva TA, de Souza MC (2020) Surgical scheduling under uncertainty by approximate dynamic programming. Omega 95:102066","journal-title":"Omega"},{"issue":"2","key":"911_CR33","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/trsc.1080.0238","volume":"43","author":"HP Simao","year":"2009","unstructured":"Simao HP, Day J, George AP, Gifford T, Nienow J, Powell WB (2009) An approximate dynamic programming algorithm for large-scale fleet management: a case application. Transp Sci 43(2):178\u2013197","journal-title":"Transp Sci"},{"issue":"5","key":"911_CR34","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.42.5.879","volume":"42","author":"MG Speranza","year":"1994","unstructured":"Speranza MG, Ukovich W (1994) Minimizing transportation and inventory costs for several products on a single link. Oper Res 42(5):879\u2013894","journal-title":"Oper Res"},{"issue":"5","key":"911_CR35","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<655::AID-NAV4>3.0.CO;2-4","volume":"43","author":"M Speranza","year":"1996","unstructured":"Speranza M, Ukovich W (1996) An algorithm for optimal shipments with given frequencies. Naval Res Logist (NRL) 43(5):655\u2013671","journal-title":"Naval Res Logist (NRL)"},{"key":"911_CR36","doi-asserted-by":"publisher","first-page":"102223","DOI":"10.1016\/j.tre.2021.102223","volume":"147","author":"L Sun","year":"2021","unstructured":"Sun L, Zhang Y, Hu X (2021) Economical-traveling-distance-based fleet composition with fuel costs: an application in petrol distribution. Transp Res Part E Logist Transp Rev 147:102223","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"911_CR37","doi-asserted-by":"publisher","first-page":"102137","DOI":"10.1016\/j.jretconser.2020.102137","volume":"55","author":"AA Taleizadeh","year":"2020","unstructured":"Taleizadeh AA, Shokr I, Konstantaras I, VafaeiNejad M (2020) Stock replenishment policies for a vendor-managed inventory in a retailing system. J Retail Consum Serv 55:102137","journal-title":"J Retail Consum Serv"},{"issue":"3","key":"911_CR38","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1051\/ro\/2019025","volume":"54","author":"A Tanksale","year":"2020","unstructured":"Tanksale A, Jha JK (2020) A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain. RAIRO-Oper Res 54(3):749\u2013782","journal-title":"RAIRO-Oper Res"},{"issue":"8","key":"911_CR39","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1080\/07408170590918083","volume":"37","author":"H Topaloglu","year":"2005","unstructured":"Topaloglu H (2005) An approximate dynamic programming approach for a product distribution problem. IIE Trans 37(8):697\u2013710","journal-title":"IIE Trans"},{"issue":"4","key":"911_CR40","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/atr.111","volume":"45","author":"J \u017bak","year":"2011","unstructured":"\u017bak J, Redmer A, Sawicki P (2011) Multiple objective optimization of the fleet sizing problem for road freight transportation. J Adv Transp 45(4):321\u2013347","journal-title":"J Adv Transp"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00911-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T16:33:51Z","timestamp":1737218031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00911-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,24]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["911"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00911-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,24]]},"assertion":[{"value":"2 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose and have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}