Computational bounds for elevator control policies by large scale linear programming

DOI10.1007/s00186-013-0454-5zbMath1288.90120OpenAlexW2014398354MaRDI QIDQ2441574

Andreas Tuchscherer, Stefan Heinz, Jörg Rambau

Publication date: 25 March 2014

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://epub.uni-bayreuth.de/109/1/Heinz%20Rambau%20Tuchscherer_PolicyEvaluationElevator.pdf

zbMATH Keywords

column generationapproximationboundslarge scaleMarkov decision problemperformance guarantee

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized polynomial approximations in Markovian decision processes
• Elevator group control using multiple reinforcement learning agents
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• Relaxations of Weakly Coupled Stochastic Dynamic Programs
• The Linear Programming Approach to Approximate Dynamic Programming
• Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
• Approximate Dynamic Programming
• A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees
• Real-Time Destination-Call Elevator Group Control on Embedded Microcontrollers
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Handbook of Markov decision processes. Methods and applications