| 摘要 |
A near-optimal scheduling method for a group of elevators uses advance traffic information. More particularly, advance traffic information is used to define a snapshot problem (24) in which the objective is to improve performance for customers. To solve the snapshot problem (24), the objective function is transformed into a form to facilitate the decomposition of the problem into individual car subproblems (26). The subproblems (26) are independently solved using a two-level formulation, with passenger to car assignment (28) at the higher level, and the dispatching of individual cars (30) at the lower level. Near-optimal passenger selection and individual car routing (38) are obtained. The individual cars are then coordinated through an iterative process (40, 42) to arrive at a group control solution that achieves a near-optimal result for passengers.
|
