Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.ejor.2004.07.042
DC Field | Value | |
---|---|---|
dc.title | Optimal parking of idle elevators under myopic and state-dependent policies | |
dc.contributor.author | Parlar, M. | |
dc.contributor.author | Sharafali, M. | |
dc.contributor.author | Ou, J. | |
dc.date.accessioned | 2013-10-09T03:23:07Z | |
dc.date.available | 2013-10-09T03:23:07Z | |
dc.date.issued | 2006 | |
dc.identifier.citation | Parlar, M., Sharafali, M., Ou, J. (2006). Optimal parking of idle elevators under myopic and state-dependent policies. European Journal of Operational Research 170 (3) : 863-886. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2004.07.042 | |
dc.identifier.issn | 03772217 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/43954 | |
dc.description.abstract | In this paper we discuss the problem of optimally parking single and multiple idle elevators under light-traffic conditions. The problem is analyzed from the point of view of the elevator owner whose objective is to minimize the expected total cost of parking and dispatching the elevator (which includes the cost incurred for waiting passengers). We first consider the case of a single elevator and analyze a (commonly used but suboptimal) state-independent myopic policy that always positions the idle elevator at the same floor. Building on the results obtained for the myopic policy, we then show that the optimal non-myopic (state-dependent) policy calls for dispatching the idle elevator to the state-dependent median of a weight distribution. Next, we consider the more difficult case of two elevators and develop an expression for the expected dispatching distance function. We show that the objective function for the myopic policy is non-convex. The non-myopic policy is found to be dependent on the state of the two idle elevators. We compute the optimal state-dependent policy for two elevators using the results developed for the myopic policy. Next, we examine the case of multiple elevators and provide a general recursive formula to find the expected dispatching distance functions. Finally, we generalize the previous models by incorporating a fixed cost for parking the idle elevators that results in a two-sided optimal policy with different regions. Every policy that we introduce and analyze is illustrated by an example. The paper concludes with a short summary and suggestions for future research. © 2004 Elsevier B.V. All rights reserved. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.ejor.2004.07.042 | |
dc.source | Scopus | |
dc.subject | Applied probability | |
dc.subject | Location science | |
dc.subject | Nonlinear programming | |
dc.type | Article | |
dc.contributor.department | DECISION SCIENCES | |
dc.description.doi | 10.1016/j.ejor.2004.07.042 | |
dc.description.sourcetitle | European Journal of Operational Research | |
dc.description.volume | 170 | |
dc.description.issue | 3 | |
dc.description.page | 863-886 | |
dc.description.coden | EJORD | |
dc.identifier.isiut | 000233524800010 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.