Abstract:
Provided are an elevator charging system, a management server, a moving body, a moving body server, a charging method, and a storage medium storing program that make it possible to charge usage fees reflecting the demand of moving bodies. In a charging system (1), cars (5) transport moving bodies (11) between a plurality of floors. A communication unit (7a) receives usage requests each corresponding to one of the moving bodies (11). Each of the requests includes information about a call requesting assignment to one of the cars (5), and information about a desired price for a usage fee. An assignment unit (8) assigns each call to one of the cars (5) while prioritizing calls in requests having higher priority, based on information including the desired prices. A storage unit (9a) stores therein the fees charged for the requests of which the calls have been assigned.
Abstract:
A method and a system for modernizing an elevator installation including two or more elevators includes an unmodernized elevator, one or more call-giving devices, a new group controller, which is connected to the elevator installation for allocating an elevator call to be given with a call-giving device to be served by an elevator belonging to the elevator installation, and also a measuring device, which is configured to measure an operating parameter of an unmodernized elevator. The aforementioned measuring device is connected to the new group controller for communicating the aforementioned operating parameter to the new group controller.
Abstract:
The invention relates to a method for handling destination calls in an elevator group comprising several elevators using destination call control, which method comprises an allocation procedure for situations where the calls can't be served by all elevators of the elevator group in one round trip, in which situation “n” open calls and “m” fixed calls are present, which fixed calls are already allocated but not served, in which allocation procedure a genetic algorithm (GA) is used in which the following succession of steps is performed:a) chromosomes comprising genes are formed, in which chromosomes: n first genes comprise a correlation of each open call and a corresponding elevator, n second genes comprise a correlation of each open call and the corresponding number of the round trip in which the open call will be served, and m third genes comprise a correlation of each fixed call and the corresponding number of the round trip in which the fixed call will be served, b) for each chromosome round trips are calculated for each elevator of the elevator group according to collective control,c) the round trips of all elevators calculated in step b) are evaluated according to known optimization criteria, as e.g. passenger riding time, passenger waiting time, energy consumption, minimum number of round trips etc.,d) chromosomes which are evaluated in step c) as sufficient are put forward to the forming of a new generation by per se known GA methods, as e.g. cross-breeding, mutation, etc.,e) the steps b) to d) are repeated for each chromosome of each new generation of chromosomes until a stop criterion is achieved,f) the calls are served in collective control according to the best chromosome of the last generation, andg) the destinations of each elevator in its travelling direction in the current round trip according to the best chromosome are shown on a at least one common display shortly before its arrival at said landing. The invention solves the elevator dispatching problem under consideration of more than the current round trip of the elevators in the elevator group.
Abstract:
A solution for the allocation of destination calls in an elevator system includes one or more single-deck elevators and one or more multi-deck elevators, in which system the passenger enters a destination call via a destination call device. The destination call entered by the passenger is received, an elevator type to serve the destination call is selected on the basis of an elevator type selection criterion, and the destination call is allocated to an elevator consistent with the elevator type thus selected.
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:
An exemplary elevator input device includes a passenger interface configured to allow a passenger to place a call to indicate a desired elevator service. The elevator input device includes a controller configured to interpret any passenger input regarding desired elevator service. The controller identifies which of a plurality of elevator cars will be able to provide the desired elevator service according to a predetermined criterion. The plurality of elevator cars considered by the controller includes every elevator car that is capable of serving the call. The controller is also configured to assign the call to the identified elevator car.
Abstract:
System for controlling the elevators in an elevator system, which elevator system comprises a number of elevators (1A . . . 1H). The system comprises first sensor means (2, 2A . . . 2H), which are arranged in the waiting area of each elevator (1A . . . 1H) on each floor (F, F1, F2, F3 . . . Fn), which sensor means (2, 2A . . . 2H) are fitted to give information about the presence and number of passengers waiting for an elevator at least in the waiting area in question; means for controlling the elevators, which means are fitted to receive information from the sensor means (2, 2A . . . 2H) about the presence and number of passengers waiting for an elevator and to control the movement of the elevators of the elevator system utilizing the information received from the sensor means.
Abstract:
An elevator traffic flow control strategy utilizes the advantages of sector assignment channeling and destination entry systems. A controller (30) monitors a handling capacity (62) of the system to determine when it is advisable to override the sector assignments (52) to provide improved passenger service.
Abstract:
The invention concerns a method for solving an optimization task consisting of a plurality of sub-functions in the control of the operation of an apparatus. In the method, a set of a plurality of solution alternatives is generated and, according to the method, each sub-function is normalized. Normalized cost functions of the sub-functions are generated for each solution alternative for solving the optimization task, and based on the normalized cost functions of the sub-functions, a set of solutions to the optimization task is formed. From the set of solutions, the best solution is selected and the apparatus is controlled in accordance with the solution thus selected.
Abstract:
A method and apparatus for the control of the dispatch of elevator cars from the main floor during up peak traffic conditions are implemented in an algorithm performed by a process computer. The algorithm for an elevator group, consisting of at least one elevator, calculates a transport capacity and a nominal time interval. The transport capacity and the nominal time interval are dependent on the nominal departure load and the compound values are stored in a transport capacity field and in an interval field, respectively. From data generated by a sensor, an elevator control and an input/output unit, the algorithm determines the traffic requirement at the main floor and the traffic requirement at an associated car, and the transport capacity is computed dependant on the higher of the two traffic requirements. Subsequently, the algorithm searches in the transport capacity field for the nominal departure load corresponding to this transport capacity. In a similar manner, the field component of the interval field, indexed with the nominal departure load, is addressed and the value of the field component assigned to the nominal time interval. As soon as the condition actual departure load equals nominal departure load or the condition actual time interval equals nominal time interval is satisfied, the associated car is dispatched.