{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T05:59:38Z","timestamp":1759384778771},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,13]],"date-time":"2013-10-13T00:00:00Z","timestamp":1381622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00186-013-0454-5","type":"journal-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T01:54:24Z","timestamp":1381542864000},"page":"87-117","source":"Crossref","is-referenced-by-count":4,"title":["Computational bounds for elevator control policies by large scale linear programming"],"prefix":"10.1007","volume":"79","author":[{"given":"Stefan","family":"Heinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rambau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Tuchscherer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,13]]},"reference":[{"issue":"3","key":"454_CR1","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/opre.1070.0445","volume":"56","author":"D Adelman","year":"2008","unstructured":"Adelman D, Mersereau A (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper Res 56(3):712\u2013727","journal-title":"Oper Res"},{"key":"454_CR2","doi-asserted-by":"crossref","unstructured":"Ascheuer N, Krumke SO, Rambau J (2000) Online dial-a-ride problems: minimizing the completion time. In: Proceedings of the 17th international symposium on theoretical aspects of computer science, vol 1770. Springer, pp 639\u2013650","DOI":"10.1007\/3-540-46541-3_53"},{"key":"454_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"72","author":"AG Barto","year":"1995","unstructured":"Barto AG, Bradtke SJ, Singh SP (1995) Learning to act using real-time dynamic programming. Artif Intell 72:81\u2013138","journal-title":"Artif Intell"},{"key":"454_CR4","volume-title":"Neuro-dynamic programming","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas DP, Tsitsiklis JN (1996) Neuro-dynamic programming, vol 1, 1st edn. Athena Scientific, Belmont","edition":"1"},{"key":"454_CR5","volume-title":"Dynamic programming and optimal control, vol 1 and 2","author":"DP Bertsekas","year":"2001","unstructured":"Bertsekas DP (2001) Dynamic programming and optimal control, vol 1 and 2, 2nd edn. Athena Scientific, Belmont","edition":"2"},{"issue":"2\u20133","key":"454_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1007518724497","volume":"33","author":"RH Crites","year":"1998","unstructured":"Crites RH, Barto AG (1998) Elevator group control using multiple reinforcement learning agents. Mach Learn 33(2\u20133):235\u2013262","journal-title":"Mach Learn"},{"key":"454_CR7","unstructured":"Dean TL, Kaelbling LP, Kirman J, Nicholson AE (1993) Planning with deadlines in stochastic domains. In: AAAI, pp 574\u2013579"},{"issue":"1","key":"454_CR8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.10.1.98","volume":"10","author":"F d\u2019Epenoux","year":"1963","unstructured":"d\u2019Epenoux F (1963) A probabilistic production and inventory problem. Manag Sci 10(1):98\u2013108","journal-title":"Manag Sci"},{"key":"454_CR9","unstructured":"Desai VV, Farias VF, Moallemi CC (2009) Approximate dynamic programming via a smoothed linear program. Graduate school of business, Columnbia University, working paper"},{"key":"454_CR10","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (eds) (2005) Column generation. GERAD 25th anniversary series. Springer","DOI":"10.1007\/b135457"},{"issue":"6","key":"454_CR11","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1287\/opre.51.6.850.24925","volume":"51","author":"DP Farias de","year":"2003","unstructured":"de Farias DP, van Roy B (2003) The linear programming approach to approximate dynamic programming. Oper Res 51(6):850\u2013865","journal-title":"Oper Res"},{"issue":"3","key":"454_CR12","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1040.0094","volume":"29","author":"DP Farias de","year":"2004","unstructured":"de Farias DP, van Roy B (2004) On constraint sampling in the linear programming approach to approximate dynamic programming. Math Oper Res 29(3):462\u2013478","journal-title":"Math Oper Res"},{"issue":"3","key":"454_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1287\/moor.1060.0208","volume":"31","author":"DP Farias de","year":"2006","unstructured":"de Farias DP, van Roy B (2006) A cost-shaping linear program for average-cost approximate dynamic programming with performance guarantees. Math Oper Res 31(3):597\u2013620","journal-title":"Math Oper Res"},{"key":"454_CR14","doi-asserted-by":"crossref","unstructured":"de Farias DP, Weber T (2008) Choosing the cost vector of the linear programming approach to approximate dynamic programming. In: Decision and control, pp 67\u201372","DOI":"10.1109\/CDC.2008.4739452"},{"key":"454_CR15","volume-title":"Handbook of Markov decision processes: methods and applications","year":"2002","unstructured":"Feinberg EA, Shwartz A (eds) (2002) Handbook of Markov decision processes: methods and applications. Kluwer Academic Publishers, Dordrecht"},{"key":"454_CR16","doi-asserted-by":"crossref","unstructured":"Friese P, Rambau J (2006) Online-optimization of a multi-elevator transport system with reoptimization algorithms based on set-partitioning models. Disc Appl Math 154(13):1908\u20131931. Also available as ZIB, Report 05\u201303","DOI":"10.1016\/j.dam.2006.03.034"},{"key":"454_CR17","unstructured":"Gr\u00f6tschel M, Hauptmeier D, Krumke SO, Rambau J (1999) Simulation studies for the online dial-a-ride problem. Report 99\u201309, ZIB"},{"key":"454_CR18","doi-asserted-by":"crossref","unstructured":"Hauptmeier D, Krumke SO, Rambau J (2000a) The online dial-a-ride problem under reasonable load. In: CIAC 2000. Lecture notes in computer science, vol 1767. Springer, pp 125\u2013136","DOI":"10.1007\/3-540-46521-9_11"},{"key":"454_CR19","doi-asserted-by":"crossref","unstructured":"Hauptmeier D, Krumke SO, Rambau J (2000b) The online dial-a-ride problem under reasonable load. In: Proceedings of the 4th Italian conference on algorithms and complexity. Lecture notes in computer science, vol 1767. Springer, pp 137\u2013149","DOI":"10.1007\/3-540-46521-9_11"},{"key":"454_CR20","doi-asserted-by":"crossref","unstructured":"Hiller B, Tuchscherer A (2008) Real-time destination-call elevator group control on embedded microcontrollers. In: Operations research proceedings 2007. Springer","DOI":"10.1007\/978-3-540-77903-2_55"},{"key":"454_CR21","unstructured":"Heinz S, Kaibel V, Peinhardt M, Rambau J, Tuchscherer A (2006) LP-based local approximation for Markov decision problems. Report 06\u201320, ZIB"},{"key":"454_CR22","unstructured":"Hiller B, Klug T, Tuchscherer A (2009) Improving the performance of elevator systems using exact reoptimization algorithms. In: Proceedings of MAPSP"},{"key":"454_CR23","doi-asserted-by":"crossref","unstructured":"Hiller B, Klug T, Tuchscherer A (2010) Improved destination call elevator control algorithms for up peak traffic. In: Operations research proceedings 2011. Springer. To appear","DOI":"10.1007\/978-3-642-20009-0_40"},{"key":"454_CR24","unstructured":"Kearns MJ, Mansour Y, Ng AJ (1999) A sparse sampling algorithm for near-optimal planning in large Markov decision processes. In: International joint conferences on artificial intelligence, pp 1324\u2013 1331"},{"key":"454_CR25","first-page":"387","volume-title":"Distributed decision making and control. Lecture notes in control and information science, vil 417, chap 17","author":"SO Krumke","year":"2012","unstructured":"Krumke SO, Rambau J (2012) Stability with uniform bounds for on-line dial-a-ride problems under reasonable load. In: Johansson R, Rantzer A (eds) Distributed decision making and control. Lecture notes in control and information science, vil 417, chap 17, vol 417. Springer, Berlin, pp 387\u2013412"},{"key":"454_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate dynamic programming: solving the curses of dimensionality","author":"WB Powell","year":"2007","unstructured":"Powell WB (2007) Approximate dynamic programming: solving the curses of dimensionality, 1st edn. Wiley, Hoboken","edition":"1"},{"key":"454_CR27","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"ML Puterman","year":"2005","unstructured":"Puterman ML (2005) Markov decision processes: discrete stochastic dynamic programming, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"454_CR28","unstructured":"Schr\u00f6der J. (1990) Advanced dispatching: destination hall calls + instant car-to-call assignments: M10. Elevator World, pp 40\u201346"},{"key":"454_CR29","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/0022-247X(85)90317-8","volume":"110","author":"PJ Schweitzer","year":"1985","unstructured":"Schweitzer PJ, Seidmann A (1985) Generalized polynomial approximations in Markov decision processes. J Math Anal Appl 110:568\u2013582","journal-title":"J Math Anal Appl"},{"key":"454_CR30","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction, 1st edn. MIT Press, Cambridge","edition":"1"},{"key":"454_CR31","unstructured":"Tuchscherer A (2010) Local evaluation of policies for discounted Markov decision problems. Ph.D. thesis, Technische Universit\u00e4t, Berlin"},{"key":"454_CR32","unstructured":"Veatch MH, Walker N (2008) Approximate linear programming for network control: column generation and subproblems. Working paper, Gordon College"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-013-0454-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-013-0454-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-013-0454-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T15:11:18Z","timestamp":1564499478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-013-0454-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["454"],"URL":"https:\/\/doi.org\/10.1007\/s00186-013-0454-5","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,13]]}}}