Abstract:
The nullSEEDSnull assignment process shall address directly the equalization of service and use of all cars and will specifically control the demand/assignment process to minimize round trip times. SEEDS will create zones consisting of contiguous or near contiguous demands. SEEDS shall specifically evaluate the best potential assignment for each demand based on its overall effect on the system. Each demand (Origin and Destination) will be assigned, not on the basis of the best solution for the individual demand, but on the basis of its effect on the total system. The primary target is the equalization of service to all calls rather than the best response to each individual demand. Assignments, which increase the total number of system stops made or those, which increase the relative round trip beyond the mean round trip time of all cars will be avoided. All nullElevator Group Systemsnull (conventional or destination type) of recent invention have been based on nullCost of Servicenull algorithms (e.g.: Shortest waiting times) using as few elevators in the group as possible, with no direct means of controlling equalization of service characteristics or equipment use, or creating contiguous demand assignment.
Abstract:
In an elevator system in which two cars operate in each shaft, there is obtained an elevator group control apparatus which is capable of providing efficient services while preventing collisions of cars in each shaft as much as possible. The elevator group control apparatus includes: a traffic detection part (1B) which detects data of car traffic generated in a building; a zone setting part (1C) which sets a dedicated zone and a common zone for each of upper and lower cars in accordance with the results of detection of the traffic detection part; an assignment decision part (1D) which decides a car to be assigned to a call generated at a hall in accordance with a call generation floor, a direction of the call, and a zone set by the zone setting part; an entry determination part (1E) which, when one of two cars in each shaft is coming into the common zone from its dedicated zone, determines, based on the position, the direction of movement, and the state of the other car in the same shaft, whether the one car in each shaft is permitted to enter the common zone; a passing-by instruction part (1F) which gives a passing-by instruction to a prescribed floor in the dedicated zone so as to make each car exit from the common zone to its dedicated zone after each car has entered the common zone; and an operation control part (1G) which controls operation of each car based on the results from the assignment decision part, the entry determination part and the passing-by instruction part.
Abstract:
A procedure for controlling an elevator group consisting of double deck elevators consists of allocating landing calls to elevators and elevator decks in such a way that passenger journey time is optimized. The time of the call and the estimated time of arrival to destination floor are taken into account. Passenger flow and elevator status within the elevator group are monitored and passenger wait time and arrive time estimated based thereon. The best elevator is selected to minimize passenger wait and ride time. The best deck is further selected based on the estimated wait time and ride time to minimize passenger journey time.
Abstract:
An optimal control method and system of a group of elevator cars is provided. A matrix of origin halls and destination halls is used. In this matrix, each element is referred to as a mission unit. Also, mission groups are defined. Each of the mission groups has one or more mission units and is serviceable by one of the elevator cars. Further, a mission group set is defined as a set of the mission groups provided for the group of elevator cars. Then, the mission groups are dynamically allocated to the group of elevator cars, which produces effective traffic control of the elevator cars.
Abstract:
The invention relates to a procedure for controlling an elevator group consisting of double-deck elevators. According to the invention, landing calls are allocated to the elevators and after that to the elevator decks in such a way that the passenger journey time is optimised. The procedure of the invention takes into account the time the call has been on and the estimated time of arrival to the destination floor.
Abstract:
Elevator group supervisory control method and system for group supervisory control of a plurality of elevators serving a plurality of floors. The method and apparatus of the invention permits the inputting of qualitative requests (guidance), from the user, concerning elevator operation into the group supervisory control system. Qualitative requests concerning elevator operation are set in the form of guidance (or request) targets. The thus set request targets are converted into control targets for the elevators. Actual group supervisory control is executed using the control targets.
Abstract:
In a group of elevators with double cars, the assignment of such double cars to floor calls takes place at scanner positions .alpha. in two procedural steps, according to two parameters: primarily by assignment of the individual cars of all double cars by logical decision, according to a criteria chain (KK), and subsidiarily by assignment of the double cars according to the minimal loss time of all involved passengers. The individual elevators each have a microcomputer system with a calculating device and are connected with each other by way of a comparator circuit to form a group control. The optimal individual cars are assigned for each elevator by floor in the associated individual car/call assignment memories. The optimal double car is selected by comparison of the loss times of all elevators calculated as the total operating costs K.sub.g (.alpha.) and is assigned to the respective floor in the associated double car/call assignment memory. For the total servicing costs K.sub.g (.alpha.), a special cost calculating algorithm is provided. With the separate assignment of individual cars and double cars, this group control renders possible a complete utilization of the double car functions as well as a good matching to different operating and traffic conditions. At the same time, the minimal waiting time of the passengers is optimized.