Abstract:
A method schedules elevator cars in a group elevator system in a building by first generating a set of probability distributions for arrivals of future passengers at any floor of the building, wherein the set of probability distributions are characterized by probabilistic variables that specify arrival information of the future passengers, wherein the arrival information includes a probability of service requests by the future passengers and a probability of possible times of the service requests. A schedule for the elevator cars is based on the set of probabilistic distribution. Then, the schedule is provided to a controller of the group elevator system to move the elevator cars according to the schedule.
Abstract:
A car-based running power computing mechanism computes running power values of each car in both cases including cases before and after a newly generated hall call is assigned. A car-based regenerative power computing mechanism computes regenerative power values of each car in the both cases. A car-based future running power computing mechanism computes future running power values of each car in the both cases. A car-based future regenerative power computing mechanism computes future regenerative power values of each car in the both cases. A car-based assigned total evaluation index computing mechanism obtains an in-travel power consumption value and an in-future-travel power consumption value based on the running power values, regenerative power values, future running power values, future regenerative power values and the like, to thereby compute assigned total evaluation indices of each car in the both cases. An assigned car deciding mechanism decides an assigned car based on the assigned total evaluation indices.
Abstract:
A method for assigning an elevator car to respond to a call signal includes a controller that determines which elevator car will respond to the call signal based on certain time metrics. The controller receives a hall call signal, and based on certain time metrics that can include, e.g., an estimated wait time (EWT), and/or estimated travel time (ETT), assigns the call signal to an elevator car. In this example, EWT represents the time a passenger is waiting for an elevator car to arrive, and ETT represents the it takes for a passenger to reach their destination once having boarded an elevator car. In some versions, an estimated time to destination (ETD) is used in determining which elevator car to assign, where ETD represents the sum of EWT and ETT. In some versions, a handling capacity coefficient (HCx), which reflects current traffic conditions, is used in determining which elevator car to assign.
Abstract:
A car-based running power computing mechanism computes running power values of each car in both cases including cases before and after a newly generated hall call is assigned. A car-based regenerative power computing mechanism computes regenerative power values of each car in the both cases. A car-based future running power computing mechanism computes future running power values of each car in the both cases. A car-based future regenerative power computing mechanism computes future regenerative power values of each car in the both cases. A car-based assigned total evaluation index computing mechanism obtains an in-travel power consumption value and an in-future-travel power consumption value based on the running power values, regenerative power values, future running power values, future regenerative power values and the like, to thereby compute assigned total evaluation indices of each car in the both cases. An assigned car deciding mechanism decides an assigned car based on the assigned total evaluation indices.
Abstract:
An exemplary method is useful for handling passenger requests during an elevator system modernization that includes modernizing elevator cars over time. The modernized elevator cars are capable of servicing destination requests placed outside of an elevator car. Such destination requests include an indication of a desired destination. The exemplary method includes assigning an elevator car to respond to a new pending destination request according to a selected criterion for selecting between a modernized elevator car and an elevator car that has not yet been modernized. The method includes automatically updating the selected criterion responsive to a change in a number of modernized elevator cars.
Abstract:
An elevator group control apparatus includes a parameter calculating unit for determining a weighting factor for an item to be evaluated, which is calculated from a running distance estimated by an estimation arithmetic operation unit by taking into consideration a relation between a running distance of an elevator and a passenger average waiting time, and an evaluation arithmetic operation unit for calculating a total evaluated value from an item to be evaluated of a passenger waiting time, an item to be evaluated of the running distance, and the weighting factor determined by the parameter calculating unit. The elevator group control apparatus selects an elevator whose total evaluated value is the best from among the plurality of elevators, and assigns a hall call to the selected elevator.
Abstract:
A method and a display for elevator allocation evaluating are provided. When an elevator allocated to a hall call is selected by employing two different view points such as a real and a future call evaluation index, an elevator allocation reason and a balance between the two view points can be easily grasped. An elevator allocated to a hall call is evaluated on orthogonal coordinates in which the real call evaluation index and the future call evaluation index are defined as an X and a Y coordinate axis. Evaluation indexes of first to fourth elevator cars are evaluated by employing contour lines of a synthetic evaluation function, which is represented as the real and the future call evaluation index. A weight for allocating is displayed visually.
Abstract:
As elevator group including at least two elevator cars is controlled using a group control unit which allocates the calls to different elevators. Based on statistical data and/or statistical forecasts, virtual passenger traffic is generated and used in a simulation that creates events in the virtual passenger traffic, on the basis of which an elevator-specific cost is computed for each call to be allocated. Based on the costs, the best elevator is selected to serve the call. This allocation of a best elevator to answer a specific landing call may be reallocated as the simulation is updated to update the best elevator to answer a specific floor call.
Abstract:
A group control assigns elevator cars to floor calls optimized in such a manner, that minimal waiting times result and the elevating capacity is increased. A computing device provided for each elevator calculates at every floor a sum proportional to the time losses of the waiting passengers from the distance between the floor and the car position as indicated by a selector, the intermediate stops to be expected within the distance and the instantaneous car load. By means of call registering devices in the form of ten key keyboards at the floors, it is possible to enter calls for destination floors, so that at the time of calculation, the floor calls and the car calls are available simultaneously. The calculated lost time sum, also called servicing costs, is stored in a cost memory provided for each elevator. During a cost comparison cycle, the servicing costs of all elevators are compared with each other by way of a cost comparison device where in each case an assignment instruction can be stored in an assignment memory of the elevator with the lowest servicing costs which instruction designates that floor to which the respective car is optimally assigned in time.
Abstract:
In an elevator control system comprising a plurality of cars serving a plurality of floors, hall call register means provided on the landing of each floor, cage call register means provided in each car, and means for detecting the number of passenger in each car;The improvement comprising means for forecasting the number of in-cage passengers for every destination floor by allotting the detected number of in-cage passengers to the cage calls, means for detecting the number of waiting passengers provided on the landing of specified floors, means for setting the number of waiting passengers on other than the landing of the specified floors, means for sequentially adding the detected number of prospective passengers waiting on each of the specified floors that have generated the hall calls to the detected number of in-cage passengers, means for sequentially adding the setting of the number of waiting passengers on each of the floors other than the specified floors that have generated the hall calls to the number of detected passengers, means for subtracting the number of forecast in-cage passengers for every destination floor from the detected number of in-cage passengers, means for setting the limit of in-cage passenger number, and means for detecting serviceable floors by comparing the forecast number of in-cage passengers for each floor obtained by the addition and subtraction with the limit of in-cage passenger number.