Abstract:
An elevator operation system and apparatus reduce the round trip time of an elevator, by determining a target floor that corresponds to the destination floor requested by a passenger; and assigning the target floor to one of a plurality of elevators for service exclusively to the target floor.
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:
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:
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:
An elevator group supervisory control system for selecting the most suitable car among a plurality of elevators, when a hall call is made, to assign to the hall call, comprising: temporary assigning means for temporarily assigning the car by a conventional method such as a fuzzy group supervisory control based on group data representing states of the elevator system at the moment when a new hall call is made; and a neural net for receiving numerical values converted from group data including the result of judgment of the temporary assigning means and outputting an assignment fitness of each elevator. It decides the most suitable elevator from the output pattern of the neural net to assign to the hall call.
Abstract:
An elevator control system, an elevator system, and a control method therefor. The elevator control system includes: a data collection unit configured to receive a call request signal from a machine passenger at each landing, and receive information about the machine to ride the elevator sent by the machine passenger; and a control unit configured to determine whether to accept the call request from the machine passenger based on elevator operating condition and the information about the machine to ride the elevator, and send information about the rules of riding the elevator to the machine passenger after accepting its call request.
Abstract:
An illustrative example elevator system includes a plurality of elevator cars. A dispatch controller assigns a first one of the elevator cars to travel to a landing in response to a first request for elevator service at that landing. At least one call button is operative to place a second request while the first one of the elevator cars is situated at the landing in response to the first request. The dispatch controller assigns a second one of the elevator cars to travel to the landing in response to the second request.
Abstract:
An illustrative example elevator system includes a plurality of elevator cars. A dispatch controller assigns a first one of the elevator cars to travel to a landing in response to a first request for elevator service at that landing. At least one call button is operative to place a second request while the first one of the elevator cars is situated at the landing in response to the first request. The dispatch controller assigns a second one of the elevator cars to travel to the landing in response to the second request.
Abstract:
An aspect includes capturing crowd data associated with a lobby area of an elevator system. A dispatching schedule of one or more elevator cars of the elevator system is adjusted based on the crowd data. A notification of the adjustment to the dispatching schedule is output.