Abstract:
A method controls the distribution of free cars in an elevator system. First, the number of free cars in the elevator system are counted whenever this number changes. At the same time, the arrival/destination rates of passengers at each of the floor is determined. The rates are used to identify up-peak and down-peak traffic patterns. The floors of the building are then assigned to zones. The number of floors in each zone is determined according to the arrival rates, and the free cars are then parked in the zones so that the expected waiting time of the next arriving passenger is minimized.
Abstract:
A method schedules cars of an elevator system. Each possible assignment of a set of hall calls to a set of cars is represented by a solution vector maintained as a node in a search tree. Each solution vector is evaluated using an ESA-DP process according to an immediate policy to determine initially a best solution. A branch-and-bound process is applied to each solution vector using the initial best solution and the search tree to determine a globally optimal solution for scheduling the cars according to a reassignment policy.
Abstract:
A method schedules cars of an elevator system, the elevator system including a set of cars, and a set of hall calls. For each car, a waiting time is determined independently if the hall call is the only hall call assigned to the car. For each car, a mutual delay ” W ( h | g ) is determined for each possible pair of unassigned hall calls h and assigned hall calls g. The waiting time and mutual delays are summed. Then, the assignments are made to the set of cars so that the sum is a minimum.
Abstract:
A method schedules cars of an elevator system in a building. The method begins execution whenever a newly arrived passenger presses an up or down button to generate a call for service. For each car, determine a first waiting time for all existing passengers if the car is assigned to service the call, based on future states of the elevator system. For each car, determine a second waiting time of future passengers if the car is assigned to service the call, based on a landing pattern of the cars. For each car, combine the first and second waiting times to produce an adjusted waiting time, The method ends by assigning a particular car having a lowest adjusted waiting time to service the call and minimize an average waiting time of all passengers.