{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:45:46Z","timestamp":1777509946295,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Bus Inf Syst Eng"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s12599-019-00582-7","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T12:36:48Z","timestamp":1548679008000},"page":"261-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive State Space Partitioning for Dynamic Decision Processes"],"prefix":"10.1007","volume":"61","author":[{"given":"Ninja","family":"Soeffker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marlin W.","family":"Ulmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk C.","family":"Mattfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"key":"582_CR1","doi-asserted-by":"crossref","unstructured":"Bellman R (1957) A Markovian decision process. Technical report, DTIC document","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"582_CR2","volume-title":"Neuro-dynamic programming","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas DP, Tsitsiklis JN (1996) Neuro-dynamic programming. Athena Scientific, Belmont"},{"key":"582_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.compchemeng.2016.05.007","volume":"93","author":"E Ikonen","year":"2016","unstructured":"Ikonen E, Selek I, Najim K (2016) Process control using finite Markov chains with iterative clustering. Comput Chem Eng 93:293\u2013308","journal-title":"Comput Chem Eng"},{"issue":"5","key":"582_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s12599-014-0337-1","volume":"6","author":"M Jarke","year":"2014","unstructured":"Jarke M (2014) Interview with Michael Feindt on prescriptive big data analytics. Bus Inf Syst Eng 6(5):301\u2013302","journal-title":"Bus Inf Syst Eng"},{"key":"582_CR5","doi-asserted-by":"crossref","unstructured":"Jin Z, Liu W, Jin J (2009) Partitioning the state space by critical states. In: Fourth international conference on bio-inspired computing, 2009. BIC-TA\u201909. IEEE, pp 1\u20137","DOI":"10.1109\/BICTA.2009.5338123"},{"issue":"1\u20132","key":"582_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10015-013-0092-2","volume":"18","author":"Y Kishima","year":"2013","unstructured":"Kishima Y, Kurashige K (2013) Reduction of state space in reinforcement learning by sensor selection. Artif Life Robot 18(1\u20132):7\u201314","journal-title":"Artif Life Robot"},{"issue":"5","key":"582_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s12599-014-0341-5","volume":"6","author":"M Kowalczyk","year":"2014","unstructured":"Kowalczyk M, Buxmann P (2014) Big data and information processing in organizational decision processes. Bus Inf Syst Eng 6(5):267\u2013278","journal-title":"Bus Inf Syst Eng"},{"issue":"6","key":"582_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1057\/palgrave.jors.2601352","volume":"53","author":"A Larsen","year":"2002","unstructured":"Larsen A, Madsen OBG, Solomon MM (2002) Partially dynamic vehicle routing-models and algorithms. J Oper Res Soc 53(6):637\u2013646","journal-title":"J Oper Res Soc"},{"issue":"6","key":"582_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.engappai.2004.08.005","volume":"17","author":"IS Lee","year":"2004","unstructured":"Lee IS, Lau HY (2004) Adaptive state space partitioning for reinforcement learning. Eng Appl Artif Intell 17(6):577\u2013588","journal-title":"Eng Appl Artif Intell"},{"key":"582_CR10","series-title":"Wiley series in probability and statistics","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, vol 842. Wiley series in probability and statistics. Wiley, New York"},{"key":"582_CR11","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"ML Puterman","year":"2014","unstructured":"Puterman ML (2014) Markov decision processes: discrete stochastic dynamic programming. Wiley, New York"},{"key":"582_CR12","doi-asserted-by":"crossref","unstructured":"Sarkar S, Subramaniam A, Neogi R (2000) Study of methods for model reduction in transition systems. In: 2000 IEEE international conference on systems, man, and cybernetics, vol 1. IEEE, pp 172\u2013176","DOI":"10.1109\/ICSMC.2000.884984"},{"issue":"2","key":"582_CR13","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/trsc.2016.0675","volume":"50","author":"M Savelsbergh","year":"2016","unstructured":"Savelsbergh M, Van Woensel T (2016) 50th anniversary invited article \u2013 city logistics: challenges and opportunities. Transp Sci 50(2):579\u2013590","journal-title":"Transp Sci"},{"key":"582_CR14","unstructured":"Sherstov AA, Stone P (2005) Function approximation via tile coding: automating parameter choice. In: International symposium on abstraction, reformulation, and approximation. Springer, Berlin, pp 194\u2013205"},{"key":"582_CR15","unstructured":"Soeffker N, Ulmer MW, Mattfeld DC (2016) Problem-specific state space partitioning for dynamic vehicle routing problems. In: Nissen V, Stelzer D, Stra\u00dfburger S, Fischer D (eds) Proceedings of Multikonferenz Wirtschaftsinformatik (MKWI) 2016. Universit\u00e4tsverlag Ilmenau, Ilmenau, pp 229\u2013240"},{"issue":"3","key":"582_CR16","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ejor.2016.08.032","volume":"264","author":"MG Speranza","year":"2018","unstructured":"Speranza MG (2018) Trends in transportation and logistics. Eur J Oper Res 264(3):830\u2013836","journal-title":"Eur J Oper Res"},{"key":"582_CR17","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction, vol 1. MIT Press, Cambridge"},{"issue":"3","key":"582_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/trsc.1060.0183","volume":"41","author":"BW Thomas","year":"2007","unstructured":"Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319\u2013331","journal-title":"Transp Sci"},{"key":"582_CR19","doi-asserted-by":"crossref","unstructured":"Ulmer MW, Brinkmann J, Mattfeld DC (2015) Anticipatory planning for courier, express and parcel services. In: Dethloff J, Haasis HD, Kopfer H, Kotzab H, Sch\u00f6nberger J (eds) Logistics management. Springer, Cham, pp 313\u2013324","DOI":"10.1007\/978-3-319-13177-1_25"},{"issue":"1","key":"582_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/trsc.2016.0719","volume":"52","author":"MW Ulmer","year":"2017","unstructured":"Ulmer MW, Mattfeld DC, K\u00f6ster F (2017) Budgeting time for dynamic vehicle routing with stochastic customer requests. Transp Sci 52(1):20\u201337","journal-title":"Transp Sci"},{"issue":"3","key":"582_CR21","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 Oper Res 269(3):883\u2013899","journal-title":"Eur J Oper Res"},{"key":"582_CR22","volume-title":"Adaptive tile coding for value function approximation","author":"S Whiteson","year":"2007","unstructured":"Whiteson S, Taylor ME, Stone P (2007) Adaptive tile coding for value function approximation. Computer Science Department, University of Texas at Austin, Austin"}],"container-title":["Business & Information Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12599-019-00582-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12599-019-00582-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12599-019-00582-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T00:16:20Z","timestamp":1580170580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12599-019-00582-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s12599-019-00582-7","relation":{},"ISSN":["2363-7005","1867-0202"],"issn-type":[{"value":"2363-7005","type":"print"},{"value":"1867-0202","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"28 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}