Computational Bounds for Elevator Control Policies by Large Scale Linear Programming

Titelangaben

Heinz, Stefan ; Rambau, Jörg ; Tuchscherer, Andreas:
Computational Bounds for Elevator Control Policies by Large Scale Linear Programming.
Bayreuth , 2013 . - 29 S.

Volltext

	Format: PDF Name: Heinz Rambau Tuchscherer_PolicyEvaluationElevator.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY-NC-ND 3.0: Namensnennung, nicht kommerziell, keine Bearbeitung
	Download (243kB)

Abstract

We computationally assess policies for the elevator control problem by a new column-generation approach for the linear programming method for discounted infinite-horizon Markov decision problems. By analyzing the optimality of given actions in given states, we were able to provably improve the well-known nearest-neighbor policy. Moreover, with the method we could identify an optimal parking policy. This approach can be used to detect and resolve weaknesses in particular policies for Markov decision problems.