SCHEDULING METHOD OF CAR FOR ELEVATOR SYSTEM

摘要

PROBLEM TO BE SOLVED: To provide a scheduling method, especially for operating according to a reassignment policy in scheduling of a car of an elevator system.

SOLUTION: Each possible assignment of a set of landing calls to a set of cars is represented by solution vector 201 maintained as a node in a search tree 100. Each solution vector is evaluated using ESA-DP process 210 according to an immediate policy to determine initially a best solution 202. A branch-and-bound process 220 is applied to each solution vector using the initial best solution and the search tree to determine a globally optimum solution 203 for scheduling the cars according to a reassignment policy is.

COPYRIGHT: (C)2008,JPO&INPIT