{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:51Z","timestamp":1740141891168,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["268276815"],"award-info":[{"award-number":["268276815"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10288-023-00539-3","type":"journal-article","created":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T11:52:19Z","timestamp":1680609139000},"page":"145-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A tutorial on value function approximation for stochastic and dynamic transportation"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5460-4235","authenticated-orcid":false,"given":"Arne","family":"Heinold","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"key":"539_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2020.100007","volume":"9","author":"A Alnaggar","year":"2020","unstructured":"Alnaggar A, Gzara F, Bookbinder JH (2020) Distribution planning with random demand and recourse in a transshipment network. EURO J Transp Logist 9:100007","journal-title":"EURO J Transp Logist"},{"key":"539_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.trb.2018.02.017","volume":"111","author":"M Behrend","year":"2018","unstructured":"Behrend M, Meisel F (2018) The integration of item-sharing and crowdshipping: can collaborative consumption be pushed by delivering through the crowd? Transp Res Part B: Methodol 111:227\u2013243","journal-title":"Transp Res Part B: Methodol"},{"key":"539_CR3","doi-asserted-by":"crossref","unstructured":"Behrend M, Meisel F (2019) Heterogeneity of items in an integrated item-sharing and crowdshipping setting. In: Fortz B, Labb\u00e9 M (eds) Operations Research Proceedings 2018. Springer International Publishing, Cham, pp 269\u2013275","DOI":"10.1007\/978-3-030-18500-8_34"},{"key":"539_CR4","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. Princeton University Press, Princeton"},{"key":"539_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s13676-014-0074-0","volume":"6","author":"D Cattaruzza","year":"2017","unstructured":"Cattaruzza D, Absi N, Feillet D, Gonz\u00e1lez-Feliu J (2017) Vehicle routing problems for city logistics. EURO J Transp Logist 6:51\u201379","journal-title":"EURO J Transp Logist"},{"key":"539_CR6","unstructured":"Christopher M (2010). Logistics and supply chain management. Pearson Business"},{"key":"539_CR7","first-page":"2079","volume":"9","author":"A George","year":"2008","unstructured":"George A, Powell WB, Kulkarni SR (2008) Value function approximation using multiple aggregation for multiattribute resource management. J Mach Learn Res 9:2079\u20132111","journal-title":"J Mach Learn Res"},{"key":"539_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10994-006-8365-9","volume":"65","author":"AP George","year":"2006","unstructured":"George AP, Powell WB (2006) Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Mach Learn 65:167\u2013198","journal-title":"Mach Learn"},{"key":"539_CR9","doi-asserted-by":"publisher","unstructured":"Heinold A, Meisel F, Ulmer M.W (2022). Primal-dual value function approximation for stochastic dynamic intermodal transportation with eco-labels. Transp Sci (Ahead of Print). https:\/\/doi.org\/10.1287\/trsc.2022.1164","DOI":"10.1287\/trsc.2022.1164"},{"key":"539_CR10","volume-title":"Encyclopedia of big data","author":"K Hoberg","year":"2020","unstructured":"Hoberg K (2020) Supply chain and big data. In: Schintler LA, McNeely CL (eds) Encyclopedia of big data. Springer International Publishing, Cham"},{"key":"539_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/ijoc.1090.0345","volume":"22","author":"MS Maxwell","year":"2010","unstructured":"Maxwell MS, Restrepo M, Henderson SG, Topaloglu H (2010) Approximate dynamic programming for ambulance redeployment. INFORMS J Comput 22:266\u2013281","journal-title":"INFORMS J Comput"},{"key":"539_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00291-008-0146-3","volume":"32","author":"M Mes","year":"2010","unstructured":"Mes M, van der Heijden M, Schuur P (2010) Look-ahead strategies for dynamic pickup and delivery problems. OR Spectrum 32:395\u2013421","journal-title":"OR Spectrum"},{"key":"539_CR13","volume-title":"Markov decision processes in practice","author":"MRK Mes","year":"2017","unstructured":"Mes MRK, Rivera AP (2017) Approximate dynamic programming by practical examples. In: Boucherie RJ, van Dijk NM (eds) Markov decision processes in practice. Springer International Publishing, Cham"},{"key":"539_CR14","doi-asserted-by":"crossref","unstructured":"Pironet T (2015). Multi-period stochastic optimization problems in transportation management. 4OR 13, 113\u2013114","DOI":"10.1007\/s10288-014-0272-5"},{"key":"539_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/nav.20347","volume":"56","author":"WB Powell","year":"2009","unstructured":"Powell WB (2009) What you should know about approximate dynamic programming. Naval Res Logist 56:239\u2013249","journal-title":"Naval Res Logist"},{"key":"539_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118029176","volume-title":"Approximate dynamic programming: solving the curses of dimensionality","author":"WB Powell","year":"2011","unstructured":"Powell WB (2011) Approximate dynamic programming: solving the curses of dimensionality, 2nd edn. Wiley, New Jersey","edition":"2"},{"key":"539_CR17","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TPWRS.2015.2424974","volume":"31","author":"WB Powell","year":"2015","unstructured":"Powell WB, Meisel S (2015) Tutorial on stochastic optimization in energy-part i: Modeling and policies. IEEE Trans Power Syst 31:1459\u20131467","journal-title":"IEEE Trans Power Syst"},{"key":"539_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.tranpol.2015.10.004","volume":"45","author":"L Rayle","year":"2016","unstructured":"Rayle L, Dai D, Chan N, Cervero R, Shaheen S (2016) Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco. Transp Policy 45:168\u2013178","journal-title":"Transp Policy"},{"key":"539_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.tre.2016.09.002","volume":"105","author":"AEP Rivera","year":"2017","unstructured":"Rivera AEP, Mes MR (2017) Anticipatory freight selection in intermodal long-haul round-trips. Transp Res Part E: Logist Transp Rev 105:176\u2013194","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"539_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/ijoc.1090.0351","volume":"22","author":"A Ruszczy\u0144ski","year":"2010","unstructured":"Ruszczy\u0144ski A (2010) Commentary: post-decision states and separable approximations are powerful tools of approximate dynamic programming. INFORMS J Comput 22:20\u201322","journal-title":"INFORMS J Comput"},{"key":"539_CR21","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde M, Doerner KF, Hartl RF (2011) Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers Op Res 38:1719\u20131730","journal-title":"Computers Op Res"},{"key":"539_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.ejor.2011.10.043","volume":"219","author":"V Schmid","year":"2012","unstructured":"Schmid V (2012) Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming. Eur J Op Res 219:611\u2013621","journal-title":"Eur J Op Res"},{"key":"539_CR23","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/opre.1080.0520","volume":"57","author":"N Secomandi","year":"2009","unstructured":"Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Op Res 57:214\u2013230","journal-title":"Op Res"},{"key":"539_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9781118557426","volume-title":"Markov decision processes in artificial intelligence","author":"O Sigaud","year":"2013","unstructured":"Sigaud O, Buffet O (2013) Markov decision processes in artificial intelligence. Wiley, New Jersey"},{"key":"539_CR25","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:178\u2013197","journal-title":"Transp Sci"},{"key":"539_CR26","doi-asserted-by":"crossref","unstructured":"Soeffker N, Ulmer M.W, Mattfeld D.C (2021). Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review. European Journal of Operational Research . In Press","DOI":"10.1016\/j.ejor.2021.07.014"},{"key":"539_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.bushor.2014.06.004","volume":"57","author":"GC Souza","year":"2014","unstructured":"Souza GC (2014) Supply chain analytics. Business Horizons 57:595\u2013605","journal-title":"Business Horizons"},{"key":"539_CR28","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction, 2nd edn. MIT press, USA","edition":"2"},{"key":"539_CR29","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1287\/trsc.2019.0958","volume":"54","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW (2020) Dynamic pricing and routing for same-day delivery. Transp Sci 54:1016\u20131033","journal-title":"Transp Sci"},{"key":"539_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.2017.0767","volume":"53","author":"MW Ulmer","year":"2019","unstructured":"Ulmer MW, Goodson JC, Mattfeld DC, Hennig M (2019) Offline-online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transp Sci 53:185\u2013202","journal-title":"Transp Sci"},{"key":"539_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2020.100008","volume":"9","author":"MW Ulmer","year":"2020","unstructured":"Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW (2020) On modeling stochastic dynamic vehicle routing problems. EURO J Transp Logist 9:100008","journal-title":"EURO J Transp Logist"},{"key":"539_CR32","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.ejor.2018.02.038","volume":"269","author":"MW Ulmer","year":"2018","unstructured":"Ulmer MW, Soeffker N, Mattfeld DC (2018) Value function approximation for dynamic multi-period vehicle routing. Eur J Op Res 269:883\u2013899","journal-title":"Eur J Op Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00539-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:06:13Z","timestamp":1712059573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00539-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,4]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00539-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2023,4,4]]},"assertion":[{"value":"29 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The research leading to this tutorial received funding from the German Research Foundation (DFG) under reference 268276815. The tutorial is part of my PhD thesis that would not have been possible without the grateful support of my supervisor who gave me the freedom to write this spin-off paper. Finally, I thank the journal\u2019s review team for their valuable comments that helped to improve the manuscript considerably.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}