Computational bounds for elevator control policies by large scale linear programming

DOI10.1007/S00186-013-0454-5MaRDI QIDQ2441574zbMATH OpenOpenAlexFDO

Authors Stefan Heinz, Andreas Tuchscherer, 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

approximationboundscolumn generationlarge scaleMarkov decision problemperformance guarantee

Mathematics Subject Classification ID

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

Recommendations

• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• The Linear Programming Approach to Approximate Dynamic Programming
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
• Optimal parking of idle elevators under myopic and state-dependent policies
• Optimal control of polling models for transportation applications

Cites work

• A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees
• Approximate Dynamic Programming
• Dynamic programming and optimal control. Vol. 2.
• Elevator group control using multiple reinforcement learning agents
• Generalized polynomial approximations in Markovian decision processes
• Handbook of Markov decision processes. Methods and applications
• scientific article; zbMATH DE number 1629830 (Why is no real title available?)
• scientific article; zbMATH DE number 1629851 (Why is no real title available?)
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 5685899 (Why is no real title available?)
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• Real-time destination-call elevator group control on embedded microcontrollers
• Relaxations of Weakly Coupled Stochastic Dynamic Programs
• Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
• The Linear Programming Approach to Approximate Dynamic Programming

Cited in

(4)

• Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
• Dynamic optimization of the operation of single-car elevator systems with destination hall call registration. II: The solution algorithm
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• Optimal parking of idle elevators under myopic and state-dependent policies

This page was built for publication: Computational bounds for elevator control policies by large scale linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441574)