Back to Search
Start Over
Computational bounds for elevator control policies by large scale linear programming.
- Source :
- Mathematical Methods of Operations Research; Feb2014, Vol. 79 Issue 1, p87-117, 31p, 4 Charts, 2 Graphs
- Publication Year :
- 2014
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14322994
- Volume :
- 79
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Mathematical Methods of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 93871423
- Full Text :
- https://doi.org/10.1007/s00186-013-0454-5