{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:43:25Z","timestamp":1777995805495,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:00:00Z","timestamp":1711756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:00:00Z","timestamp":1711756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005711","name":"Universit\u00e4t Hamburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005711","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>The Production Routing Problem under demand uncertainty is an integrated problem containing production, inventory, and distribution decisions. At the planning level, the aim is to meet retailers demand, when only the demand distribution is known in advance, while minimizing the corresponding costs. In this study, a two-stage formulation is presented in which the routing can be adjusted at short notice. In the first stage, only production decisions are made, while delivery and inventory quantities and retailer visit schedules are determined in the second stage. To handle a large number of scenarios, two solution methods based on Sample Average Approximation are introduced. Furthermore, the impact of the routing quality is explored by applying a simple heuristic and an effective metaheuristic on the routing part. It is shown that, on average, the simple heuristic within an adjustable Sample Average Approximation approach provides better objective function values than the metaheuristic within a non-adjustable approach. Also all solution approaches outperform an expected value based approach in terms of runtime and objective function value.<\/jats:p>","DOI":"10.1007\/s10100-024-00913-4","type":"journal-article","created":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T07:02:24Z","timestamp":1711782144000},"page":"121-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A sample average approximation-based heuristic for the stochastic production routing problem"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6573-0553","authenticated-orcid":false,"given":"Andreas","family":"Geiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,30]]},"reference":[{"issue":"4","key":"913_CR1","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1287\/trsc.2014.0523","volume":"49","author":"N Absi","year":"2015","unstructured":"Absi N, Archetti C, Dauz\u00e8re-P\u00e9r\u00e8s S et al (2015) A two-phase iterative heuristic approach for the production routing problem. Transport Sci 49(4):784\u2013795. https:\/\/doi.org\/10.1287\/trsc.2014.0523","journal-title":"Transport Sci"},{"issue":"1","key":"913_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/ijoc.2013.0550","volume":"26","author":"Y Adulyasak","year":"2014","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2014) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J Comput 26(1):103\u2013120. https:\/\/doi.org\/10.1287\/ijoc.2013.0550","journal-title":"INFORMS J Comput"},{"issue":"1","key":"913_CR3","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/trsc.1120.0443","volume":"48","author":"Y Adulyasak","year":"2014","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2014) Optimization-based adaptive large neighborhood search for the production routing problem. Transport Sci 48(1):20\u201345. https:\/\/doi.org\/10.1287\/trsc.1120.0443","journal-title":"Transport Sci"},{"issue":"4","key":"913_CR4","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/opre.2015.1401","volume":"63","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper Res 63(4):851\u2013867. https:\/\/doi.org\/10.1287\/opre.2015.1401","journal-title":"Oper Res"},{"key":"913_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2014.01.011","volume":"55","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2015) The production routing problem: a review of formulations and solution algorithms. Comput Oper Res 55:141\u2013152. https:\/\/doi.org\/10.1016\/j.cor.2014.01.011","journal-title":"Comput Oper Res"},{"issue":"1","key":"913_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/net.21796","volume":"72","author":"A Agra","year":"2018","unstructured":"Agra A, Requejo C, Rodrigues F (2018) An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Networks 72(1):5\u201324. https:\/\/doi.org\/10.1002\/net.21796","journal-title":"Networks"},{"key":"913_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.endm.2018.02.009","volume":"64","author":"A Agra","year":"2018","unstructured":"Agra A, Requejo C, Rodrigues F (2018) A hybrid heuristic for a stochastic production-inventory-routing problem. Electron Notes Discr Math 64:345\u2013354. https:\/\/doi.org\/10.1016\/j.endm.2018.02.009","journal-title":"Electron Notes Discr Math"},{"issue":"12","key":"913_CR8","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1016\/j.cor.2011.03.002","volume":"38","author":"C Archetti","year":"2011","unstructured":"Archetti C, Bertazzi L, Paletta G et al (2011) Analysis of the maximum level policy in a production-distribution system. Comput Oper Res 38(12):1731\u20131746. https:\/\/doi.org\/10.1016\/j.cor.2011.03.002","journal-title":"Comput Oper Res"},{"key":"913_CR9","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.cie.2015.06.010","volume":"88","author":"M D\u00edaz-Madro\u00f1ero","year":"2015","unstructured":"D\u00edaz-Madro\u00f1ero M, Peidro D, Mula J (2015) A review of tactical optimization models for integrated production and transport routing planning decisions. Comput Ind Eng 88:518\u2013535. https:\/\/doi.org\/10.1016\/j.cie.2015.06.010","journal-title":"Comput Ind Eng"},{"issue":"6","key":"913_CR10","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1287\/opre.1040.0150","volume":"52","author":"V Gaur","year":"2004","unstructured":"Gaur V, Fisher ML (2004) A periodic inventory routing problem at a supermarket chain. Oper Res 52(6):813\u2013822. https:\/\/doi.org\/10.1287\/opre.1040.0150","journal-title":"Oper Res"},{"key":"913_CR11","unstructured":"Geiger A (2024) The stochastic production routing problem: an analysis of different decision sequences. PhD thesis: stochastic production routing problem under demand uncertainty, Universit\u00e4t Hamburg, Hamburg"},{"key":"913_CR12","doi-asserted-by":"publisher","unstructured":"Ghasemkhani A, Tavakkoli-Moghaddam R, Rahimi Y, et\u00a0al (2021) Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms. Int J Prod Res pp 1\u201321. https:\/\/doi.org\/10.1080\/00207543.2021.1902013","DOI":"10.1080\/00207543.2021.1902013"},{"issue":"8\u20139","key":"913_CR13","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/S0098-1354(03)00048-6","volume":"27","author":"A Gupta","year":"2003","unstructured":"Gupta A, Maranas CD (2003) Managing demand uncertainty in supply chain planning. Comput Chem Eng 27(8\u20139):1219\u20131227. https:\/\/doi.org\/10.1016\/S0098-1354(03)00048-6","journal-title":"Comput Chem Eng"},{"key":"913_CR14","volume-title":"Factory Physics","author":"W Hopp","year":"2008","unstructured":"Hopp W, Spearman M (2008) Factory Physics, 3rd edn. McGraw-Hill\/Irwin, New York, NY and London","edition":"3"},{"issue":"2","key":"913_CR15","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt AJ, Shapiro A, Homem-de Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12(2):479\u2013502. https:\/\/doi.org\/10.1137\/S1052623499363220","journal-title":"SIAM J Optim"},{"key":"913_CR16","doi-asserted-by":"publisher","unstructured":"Laporte G, Ropke S, Vidal T (2014) Chapter 4: heuristics for the vehicle routing problem. In: Toth P, Vigo D (eds) Vehicle routing. Soc Ind Appl Math, Philadelphia, PA, pp 87\u2013116, https:\/\/doi.org\/10.1137\/1.9781611973594.ch4","DOI":"10.1137\/1.9781611973594.ch4"},{"issue":"3","key":"913_CR17","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s40747-020-00264-y","volume":"7","author":"P Liu","year":"2021","unstructured":"Liu P, Hendalianpour A, Razmi J et al (2021) A solution algorithm for integrated production-inventory-routing of perishable goods with transshipment and uncertain demand. Complex Intell Syst 7(3):1349\u20131365. https:\/\/doi.org\/10.1007\/s40747-020-00264-y","journal-title":"Complex Intell Syst"},{"issue":"4","key":"913_CR18","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J ACM"},{"key":"913_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.05.004","volume":"98","author":"PL Miranda","year":"2018","unstructured":"Miranda PL, Cordeau JF, Ferreira D et al (2018) A decomposition heuristic for a rich production routing problem. Comput Oper Res 98:211\u2013230. https:\/\/doi.org\/10.1016\/j.cor.2018.05.004","journal-title":"Comput Oper Res"},{"key":"913_CR20","doi-asserted-by":"publisher","unstructured":"Peya ZJ, A. M, Sultana T, et\u00a0al (2019) Distance based sweep nearest algorithm to solve capacitated vehicle routing problem. Int J Adv Comput Sci Appl https:\/\/doi.org\/10.14569\/IJACSA.2019.0101036","DOI":"10.14569\/IJACSA.2019.0101036"},{"key":"913_CR21","doi-asserted-by":"publisher","unstructured":"Prins C (2009) A grasp $$\\times$$ algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, vol 161. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 35\u201353, https:\/\/doi.org\/10.1007\/978-3-540-85152-3_2","DOI":"10.1007\/978-3-540-85152-3_2"},{"key":"913_CR22","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.asoc.2018.02.032","volume":"66","author":"Y Qiu","year":"2018","unstructured":"Qiu Y, Wang L, Xu X et al (2018) A variable neighborhood search heuristic algorithm for production routing problems. Appl Soft Comput 66:311\u2013318. https:\/\/doi.org\/10.1016\/j.asoc.2018.02.032","journal-title":"Appl Soft Comput"},{"issue":"12","key":"913_CR23","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1057\/jors.1990.180","volume":"41","author":"E Saliby","year":"1990","unstructured":"Saliby E (1990) Descriptive sampling: A better approach to monte Carlo simulation. J Oper Res Soc 41(12):1133\u20131142. https:\/\/doi.org\/10.1057\/jors.1990.180","journal-title":"J Oper Res Soc"},{"issue":"2","key":"913_CR24","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.ejor.2020.05.054","volume":"288","author":"CM Schenekemberg","year":"2021","unstructured":"Schenekemberg CM, Scarpin CT, P\u00e9cora JE et al (2021) The two-echelon production-routing problem. Eur J Oper Res 288(2):436\u2013449. https:\/\/doi.org\/10.1016\/j.ejor.2020.05.054","journal-title":"Eur J Oper Res"},{"issue":"2\/3","key":"913_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij B, Ahmed S, Kleywegt AJ et al (2003) The sample average approximation method applied to stochastic routing problems: a computational study. Comput Optim Appl 24(2\/3):289\u2013333. https:\/\/doi.org\/10.1023\/A:1021814225969","journal-title":"Comput Optim Appl"},{"issue":"15","key":"913_CR26","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/ACCESS.2021.3053046","volume":"9","author":"C Wang","year":"2021","unstructured":"Wang C, Ni Y, Yang X (2021) The production routing problem under uncertain environment. IEEE Access 9(15):375\u201315,387. https:\/\/doi.org\/10.1109\/ACCESS.2021.3053046","journal-title":"IEEE Access"},{"key":"913_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.10.011","volume":"103","author":"D Wang","year":"2019","unstructured":"Wang D, Zhu J, Wei X et al (2019) Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. Comput Oper Res 103:1\u201312. https:\/\/doi.org\/10.1016\/j.cor.2018.10.011","journal-title":"Comput Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00913-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00913-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00913-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T16:33:55Z","timestamp":1737218035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00913-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,30]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["913"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00913-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,30]]},"assertion":[{"value":"8 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 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 author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The author declares compliance with the Ethical Standards required by this journal.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}