|
"This elevator needs to be fixed!" The content of this page or section needs to be rewritten. Please help the Elevatorpedia by expanding it. |
|
The elevator algorithm is a simple algorithm by which a single elevator can decide where to stop, is summarized as follows:
- Continue traveling in the same direction while there are remaining requests in that same direction.
- If there are no further requests in that direction, then stop and become idle, or change direction if there are requests in the opposite direction.
The elevator algorithm has found an application in computer operating systems as an algorithm for scheduling hard disk requests.
Modern elevators use more complex heuristic algorithms to decide which request to service next. A good example is elevator destination dispatch. It uses an algorithm to decide which car to assign to where and best service times.
Destination dispatch elevator algorithm
Based on information about the trips that passengers wish to make, the controller will dynamically allocate individuals to elevators to avoid excessive intermediate stops. Overall trip-times can be reduced by 25% with capacity up by 30%.
Controllers can also offer different levels of service to passengers based on information contained in their keycards. A high-privilege user may be allocated the nearest available elevator and always be guaranteed a direct service to their floor, and may be allocated an elevator with exclusive use; other users may be provided with extended door opening times.
|
"This elevator only serves two floors." This article is a stub. You can help Elevatorpedia by expanding it. |