EP1735229B1 - Methode pour commander un systeme d'ascenseur - Google Patents
Methode pour commander un systeme d'ascenseur Download PDFInfo
- Publication number
- EP1735229B1 EP1735229B1 EP05730844A EP05730844A EP1735229B1 EP 1735229 B1 EP1735229 B1 EP 1735229B1 EP 05730844 A EP05730844 A EP 05730844A EP 05730844 A EP05730844 A EP 05730844A EP 1735229 B1 EP1735229 B1 EP 1735229B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- elevator
- call
- time
- floor
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B1/00—Control systems of elevators in general
- B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
- B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
- B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/10—Details with respect to the type of call input
- B66B2201/103—Destination call input before entering the elevator car
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/214—Total time, i.e. arrival time
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B66—HOISTING; LIFTING; HAULING
- B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
- B66B2201/00—Aspects of control systems of elevators
- B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
- B66B2201/235—Taking into account predicted future events, e.g. predicted future call inputs
Definitions
- the present invention relates to control of an elevator group.
- An elevator system can be controlled by two different principal methods, of which the more traditional and more widely used method is up-down call buttons at the elevator landing floors and a car call panel inside the elevator car.
- This traditional call system requires that the elevator passenger give two successive calls: a landing call (ordering an elevator to the particular departure floor) and a car call (indicating the target floor to the elevator system).
- the elevator to serve the call can be announced either immediately after the elevator control system has allocated the call (decided which elevator is to serve the call), or e.g. only after an arriving elevator starts braking to stop at the departure floor of the person having issued the call.
- the other call system is so-called destination control, in which the elevator customer gives only one call.
- the call is given like a car call at the elevator landing floor by inputting destination floor information via a floor button panel or e.g. using a numeric keypad.
- the allocation of elevators can be accomplished in a more sensible way because the system learns the information relating to each passenger (departure floor and destination floor) at an earlier stage and the passengers' destination floors can already be taken into account when a suitable elevator is being allocated. In the case of large elevator systems and large numbers of passengers, it is thus possible e.g. to assign the same elevator to customers traveling to the same floor.
- the cost function may comprise summed passenger waiting times, traveling times, electric energy consumption of the system, numbers of times the elevator car has stopped at different floors, or the aforesaid or other desired quantities may be weighted with desired weighting coefficients.
- the most optimal elevator is found e.g. by the ESP method (Enhanced Spacing Principle).
- ESP Enhanced Spacing Principle
- the issued calls are observed and the passenger waiting times are optimized.
- the number of passengers associated with each landing call and waiting on the floor in question is estimated as far as possible on the basis of statistical data. Those landing calls that the system assumes to be associated with the largest number of elevator customers are served fastest.
- Another method for allocating elevators on the basis of calls is to use genetic algorithms, especially in large elevator systems. Genetic algorithms are described e.g. in patent specification FI112856B . Genetic algorithms do not guarantee that the absolutely most optimal value is found, but the results obtained in practical applications are quite close to it.
- the routes of the elevators in the system can be encoded in different chromosomes, in which one gene defines an elevator customer and the elevator to serve him/her. The system starts the process e.g. from a randomly selected route alternative and applies to it various genetic procedures, such as proliferation, crossbreeding and mutation.
- a number of new chromosomes are generated via these genetic procedures and at the same time the chromosomes thus obtained are examined to determine whether they are viable for further processing. Viability may mean e.g. that the waiting time falls below a given value.
- Crossbreeding means that two route alternatives are combined at random to create one new route alternative.
- the values of the genes of the chromosome are changed arbitrarily. The chromosome results given by the algorithm converge at some stage, and from the last processed set of chromosomes the one having the best viability is selected. The passengers are allocated to elevators according to the genes of the best chromosome.
- the starting point is optimization of total journey time.
- an allocation principle is described in patent specification FI82917C .
- Internal service costs here refer to the waste time spent by passengers in the elevator car due to intermediate stops, and external service costs refer to the waiting time spent by passengers in an elevator lobby.
- the cost function optimizes the waiting time, which is obtained as the sum of the waiting time spent in the lobby and the waste time spent in the elevator car due to stops.
- Coincident calls (which here means that an active landing call addressed to the elevator is simultaneously a destination floor given as an active car call) are taken into account in the method.
- Patent specification US4991694 deals with immediate allocation of destination calls.
- the costs are optimized on the basis of passenger waiting times. As stated above, waiting time is accumulated from waiting in the elevator lobby and from intermediate stops due to landing calls and car calls.
- the US 2002/0112922 discloses a method for assigning hall calls in an elevator group.
- a call cost value for a hall call is calculated as a function of the estimated time to the desired destination of the passenger requesting the new hall call an of the delay that other passengers who are using the elevator car will experience. This method provides the option of using destination call allocation.
- the WO 2004/031062 discloses a method for allocating calls in an elevator group. This document discloses the possibility of optimising the waiting time for the passengers in low traffic intensity conditions while in a more intensive traffic situation the travelling time for the passengers is optimised.
- the object of the present invention is to overcome some of the above-mentioned problems in elevator control.
- the aim is to create a control method in which both the waiting time and the traveling time of passengers are optimized.
- the present invention deals with a method for allocating elevators on the basis of call data, and the method is especially intended for use in a destination call system, wherein both the source floor and the destination floor of the customer are already known after the customer has given a call in an elevator lobby.
- Source floor refers to the floor where the customer gives a landing call or destination call and where the customer en-ters the elevator. The source floor is thus the same as the customer's departure floor. Based on active calls and the location and operational condition of the elevators at the instant under consideration, all possible elevator route alternatives are calculated.
- a cost function is calculated wherein passenger-specific average total traveling time, i.e. the time from the instant the person gives a destination floor call to the instant he/she leaves the elevator at the destination call floor, is minimized.
- the procedure takes into account the waiting time spent at the elevator landing floor, besides the traveling time spent in the elevator car as well as the delays caused by intermediate stops that, as far as known, are to be made during the journey. Intermediate stops may be due to active destination floor calls or source floor calls given by new passengers along the route of the elevator. Further delays arise in consequence of destination floor calls given by new customers boarding at intermediate stops.
- DOP panel Device for inputting a destination floor call
- the method of the present invention can be combined with the use genetic algorithms to determine the most advantageous route alternative.
- the route alternatives processed by the algorithm can also be created in other ways.
- a feature characteristic of the method of the present invention is that it employs passenger-specific calculation instead of call-specific calculation.
- the capacity of the elevator system can be better utilized as compared to the control algorithms used in the traditional up-down call system.
- Another significant advantage of the present invention is that the same control system can be used to control both systems using destination calls and systems using traditional up-down calls.
- the traveling times are optimized and the serving elevator is immediately signaled to the customer.
- the number of intermediate stops can be effectively reduced and the elevator capacity can be more efficiently utilized.
- Immediate signaling can also be used in a system comprising up-down call buttons. The signaling can be given automatically or it can be set manually to a suitable value with respect to usability.
- the control system also permits the destination operating mode to be set into an active state e.g. only during peak traffic hours while at other times traditional call buttons are in operation. As anoth er alternative, the destination operating mode may be continuously in use.
- Fig. 1 presents the components of a cost function generated in elevator control according to the present invention.
- Fig. 2 presents the components of an elevator system associated with the present invention.
- the present invention is applied in so-called destination call control, wherein the elevator system control receives the information regarding the customer's source and target floors at an early stage.
- the present invention is also applicable for use i n a traditional elevator system provided with up-down call buttons.
- Fig. 1 presents in a simple form the time terms needed in the generation of the cost function.
- the object of optimization 11 is the passenger's average traveling time.
- the traveling time contains the passenger's waiting time on his/her source floor 10, which means the time interval from the input of a landing call to the arrival of the elevator car. Further, the traveling time contains the ride time in the elevator car 12.
- the car calls 14 given by new passengers boarding the elevator car have to be taken into account in the traveling time (provided that the system already knows of these calls as destination calls), because they have a similar effect of increasing the traveling time of the passengers already in the car.
- JT f_enter,lift is the sum of passenger waiting times associated with a given destination floor or, in the case of a destination call, the traveling time of the person having input the call.
- JT inc,lift is the length of the waste time that, for different reasons, is summed in the traveling time of the passengers riding in the car.
- the call data is available immediately in connection with the input of the landing call (in the case of a destination call)
- optimization 11 can be performed immediately and the most advantageous elevator obtained as a final result 15 of the optimization can be notified to the elevator customer.
- the elevator is originally located at floor 'liftpos' (which is different from the elevator customer's source floor)
- the sum term represents the extra time resulting from stops due to landing and car calls, which is spent during the trip before floor x 2 is reached.
- N i,in,lift and N i,out,lift are the numbers of passengers entering and leaving the elevator, respectively.
- T pass is the average time required for a passenger to step into or out of the elevator.
- T door,lift is the additional time consumed by the door opening and closing operations, and T acc,dec represents the delay resulting from the acceleration and braking of the elevator as compared to travel at an even travel speed.
- the traveling time of the elevator customers already riding in the elevator car is increased by new elevator customers giving new landing calls (destination calls) on their entry floor and by the stops required to drop these new customers off at their destination floors when the destination floor is between x 1 ... x 2 .
- Y i,lift 0 if the elevator would have stopped at floor i without the new passenger giving a call, otherwise Y i,
- the average traveling time can be determined from the statistics when the time of the day and the source floor are known. In this way, the calculation can be executed efficiently immediately upon input of a landing call in a traditional system provided with up-down call buttons and it is not strictly necessary to await a destination call given by the customer in the elevator car.
- P f_enter,lift is the number of new passengers entering the elevator from a given floor
- P i,lift is the number of passengers leaving the elevator from the number that boarded the elevator at floor f_enter.
- K i,lift 0.
- the cost function (3) has now been defined for both the destination call system and the traditional call system.
- the cost function minimizes the average passenger-specific traveling time, which comprises the time spent while waiting for an elevator, the actual ride time and additionally the delays caused by passengers subsequently entering the elevator. Once the minimum has been found, each passenger is directed to his/her right elevator according to the elevator allocation consistent with the shortest traveling time.
- the elevator system control naturally performs calculations continuously so that new calls entered and the continually changing positions of the elevators in the system are properly taken into account in the control of the elevators. Since the total traveling time is the object of optimization in the case of intensive traffic, the elevator capacity can be effectively reused after the customer's elevator trip.
- the algorithm minimizes passenger-specific average waiting time.
- the elevator arrives quickly to the call input floor, but the elevator is allowed to make even several intermediate stops if necessary.
- the car loads are balanced by the algorithm so that the given car load limits are not exceeded.
- the control method allows the cars to be filled to the upper limit of the number of persons if people enter the elevator from the same source floor. In practice, this limit is only reached when a special peak traffic condition prevails in the system. Peak traffic again can be identified e.g. from measured statistical traffic data or from traffic forecasts made.
- Fig. 2 presents an example of an actual elevator system employing the above-described method, showing the essential parts of the system.
- the building is provided with an elevator system comprising elevators 20.
- the call input equipment 21 includes both traditional up-down call buttons and a car call panel placed in the car. Furthermore, the call input equipment 21 contains the buttons required in a destination call system on each floor.
- the intelligence of the system is located in a control system 22 comprising a microprocessor (not shown in the figures) as an essential part of it.
- the microprocessor contains a memory, in which a computer program capable of executing the method of the present invention (or a part of it) is stored. The memory may also be implemented as an external part connected to the computer.
- the microprocessor runs the program code comprised in the computer program, thus executing the various stages of the method of the present invention (or part of them).
- the traveling time is calculated by a time counter 23.
- the control system 22 performs the required optimization operations by using the input data and method of the present invention.
- Previously measured traffic statistics 24 can be utilized when an optimization algorithm is used.
- the traffic statistics 24 may be stored in a separate memory block.
- the control system 22 calculates the optimal elevator route alternative that minimizes the average traveling time.
Landscapes
- Engineering & Computer Science (AREA)
- Automation & Control Theory (AREA)
- Elevator Control (AREA)
Claims (14)
- Procédé d'attribution d'ascenseurs à des passagers dans un système d'ascenseurs, dans lequel procédé les étages de départ et de destination de chaque passager sont reconnus par le système d'ascenseurs par l'intermédiaire d'un équipement d'entrées d'appel, le procédé comprenant les étapes de formation d'itinéraires alternatifs possibles des ascenseurs sur la base d'appels actifs et de l'état des ascenseurs à l'instant considéré ; de détermination pour les itinéraires alternatifs des ascenseurs d'un temps d'attente à partir de l'entrée de l'appel à l'étage de départ jusqu'à l'arrivée de l'ascenseur à l'étage d'entrée de l'appel et d'une durée de trajet dans la cabine d'ascenseur de l'étage de départ à l'étage de destination ; de détermination pour les itinéraires alternatifs des ascenseurs d'un premier retard causé par les arrêts intermédiaires devant être effectués entre les étages de départ et de destination des passagers ; de détermination pour les itinéraires alternatifs des ascenseurs d'un second retard causé par les arrêts intermédiaires devant être effectués en raison des appels entrés par les clients étant montés à bord de l'ascenseur entre les étages de départ et de destination des passagers ; de détermination pour les itinéraires alternatifs des ascenseurs d'une durée de transport des passagers basée sur le temps d'attente, la durée de trajet, les premier et second retards ; et d'attribution des ascenseurs au passager en fonction de conditions de transport intenses selon l'itinéraire alternatif offrant les plus courts temps d'attente et de transport, caractérisé par le fait que ledit système d'ascenseurs dispose d'un système de commande pour les appels de destination et les appels bidirectionnels classiques, la durée de transport moyen des passagers étant optimisée et le mode de fonctionnement de la destination étant activé dans des conditions de transport intenses et le temps d'attente moyen des passagers étant optimisé et le système d'appels bidirectionnels classique étant utilisé dans des conditions de transport calmes.
- Procédé selon la revendication 1, caractérisé par le fait que le premier retard susmentionné résulte d'appels paliers attribués aux appels d'ascenseur et de cabine effectués dans la cabine d'ascenseur.
- Procédé selon l'une quelconque des revendications précédentes 1 à 2, caractérisé par le fait que le procédé comporte en outre l'étape de : détermination des premier et second retards susmentionnés en additionnant le temps moyen nécessaire à chaque passager d'ascenseur pour se déplacer de l'étage à l'ascenseur ou vice versa, le temps perdu à cause de l'ouverture et de la fermeture de la porte d'ascenseur, le temps perdu à cause du freinage et de l'accélération de l'ascenseur et le temps perdu à cause du fonctionnement du système.
- Procédé selon l'une quelconque des revendications précédentes 1 à 3, caractérisé par le fait que des algorithmes génétiques sont utilisés dans l'attribution des ascenseurs.
- Procédé selon l'une quelconque des revendications précédentes 1 à 4, caractérisé par le fait que les données des étages de départ et de destination susmentionnées sont transmises au système par l'intermédiaire d'un système d'appel de destination (DOP).
- Procédé selon l'une quelconque des revendications précédentes 1 à 5, caractérisé par le fait que les données de l'étage de départ susmentionnées sont transmises au système par l'intermédiaire des boutons d'appel de palier et les données de l'étage de destination par l'intermédiaire d'un tableau d'appel de cabine.
- Procédé selon la revendication 6, caractérisé par le fait que le procédé comporte en outre les étapes : de calcul de la durée de transport associée à un appel palier en multipliant la durée de transport par un nombre prévu de passagers associé à un appel palier ; et de prévision des étages de destination des passagers sur la base des statistiques de transport.
- Système destiné à l'attribution d'ascenseurs dans un système d'ascenseurs, ledit système comprenant au moins un ascenseur (20) ; un équipement d'entrée d'appel (21) comprenant les boutons nécessaires dans un système d'appel de destination à chaque étage pour communiquer les étages de départ et de destination de chaque passager au système d'ascenseurs ainsi que des boutons d'appel bidirectionnels classiques et un tableau d'appel de cabine placé dans la cabine ; un système de commande d'ascenseurs (22) destiné à former les itinéraires alternatifs possibles des ascenseurs sur la base des appels actifs et de l'état des ascenseurs à l'instant considéré, lequel système de commande étant constitué pour traiter un système d'appel de destination ainsi qu'un système d'appel bidirectionnel classique ; un compteur de temps (23) destiné à déterminer pour les itinéraires alternatifs des ascenseurs un temps d'attente s'écoulant de l'entrée de l'appel à l'étage de départ jusqu'à l'arrivée de l'ascenseur à l'étage d'entrée de l'appel et une durée de trajet s'écoulant dans la cabine d'ascenseur de l'étage de départ jusqu'à l'étage de destination ; un compteur de temps (23) destiné à déterminer pour les itinéraires alternatifs des ascenseurs un premier retard causé par les arrêts intermédiaires devant être faits entre les étages de départ et de destination des passagers ; un compteur de temps (23) destiné à déterminer pour les itinéraires alternatifs des ascenseurs un second retard causé par les arrêts intermédiaires devant être faits en raison des appels entrés par les clients étant montés à bord de l'ascenseur entre les étages de départ et de destination des passagers ; un compteur de temps (23) destiné à déterminer pour les itinéraires alternatifs des ascenseurs une durée de transport des passagers basée sur le temps d'attente, la durée de trajet, les premier et second retards ; et un système de commande d'ascenseurs (22) destiné à attribuer les ascenseurs aux passagers en fonction des conditions de transport selon l'itinéraire alternatif offrant le temps d'attente et de transport le plus court, le système étant conçu pour optimiser la durée de transport moyenne des passagers et un mode de fonctionnement de la destination étant activé dans des conditions de transport intenses et le temps d'attente moyen des passagers et les boutons d'appel classiques étant en fonctionnement dans des conditions de transport calmes.
- Système selon la revendication 8, caractérisé par le fait que dans le compteur de temps (23) le premier retard susmentionné résulte des appels paliers attribués aux appels d'ascenseur et de cabine effectués dans la cabine d'ascenseur.
- Système selon l'une quelconque des revendications précédentes 8 à 9, caractérisé par le fait que le système comprend en outre : un compteur de temps (23) destiné à additionner la durée moyenne nécessaire à chaque passager d'ascenseur pour se déplacer de l'étage à l'ascenseur ou vice versa, le temps perdu à cause de l'ouverture et la fermeture de la porte d'ascenseur, le temps perdu à cause du freinage et de l'accélération de l'ascenseur et le temps perdu à cause du fonctionnement du système, déterminant les premier et second retards.
- Système selon l'une quelconque des revendications précédentes 8 à 10, caractérisé par le fait que des algorithmes génétiques sont utilisés dans le système de commande d'ascenseurs (22) pour l'attribution des ascenseurs.
- Système selon l'une quelconque des revendications précédentes 8 à 11, caractérisé par le fait que l'équipement d'entrée d'appel (21) est un équipement d'appel de destination (DOP) pour l'entrée des données des étages de départ et de destination dans le système.
- Système selon l'une quelconque des revendications précédentes 8 à 12, caractérisé par le fait que l'équipement d'entrée d'appel (21) est constitué de boutons d'appel palier et de boutons d'appel de cabine pour l'entrée de données d'étage de départ et de destination dans le système.
- Système selon la revendication 13, caractérisé par le fait que le système comprend en outre : un compteur de temps (23) destiné à calculer la durée de transport associée à un appel palier en multipliant la durée de transport par un nombre prévu de passagers associé à un appel palier ; et des statistiques de transport (24) destinées à prévoir les étages de destination des passagers.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FI20040544A FI115396B (fi) | 2004-04-15 | 2004-04-15 | Hissijärjestelmän ohjausmenetelmä |
PCT/FI2005/000181 WO2005100223A2 (fr) | 2004-04-15 | 2005-04-12 | Methode pour commander un systeme d'ascenseur |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1735229A2 EP1735229A2 (fr) | 2006-12-27 |
EP1735229B1 true EP1735229B1 (fr) | 2010-03-10 |
Family
ID=32104188
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP05730844A Expired - Fee Related EP1735229B1 (fr) | 2004-04-15 | 2005-04-12 | Methode pour commander un systeme d'ascenseur |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP1735229B1 (fr) |
DE (1) | DE602005019866D1 (fr) |
ES (1) | ES2340689T3 (fr) |
FI (1) | FI115396B (fr) |
WO (1) | WO2005100223A2 (fr) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
BRPI0816080A2 (pt) | 2007-08-28 | 2017-06-06 | Thyssenkrupp Elevator Capital Corp | método e aparelho para reduzir os tempos de espera para sistemas de despacho baseado em destino |
AU2013316924B2 (en) | 2012-09-11 | 2018-02-22 | Kone Corporation | Elevator system |
WO2017085352A1 (fr) * | 2015-11-16 | 2017-05-26 | Kone Corporation | Procédé et appareil pour déterminer une décision d'affectation pour au moins un ascenseur |
CN110171753B (zh) * | 2019-06-03 | 2021-09-21 | 日立楼宇技术(广州)有限公司 | 一种电梯调度策略处理方法、装置、设备和存储介质 |
CN112441481A (zh) * | 2019-08-28 | 2021-03-05 | 崇友实业股份有限公司 | 电梯的智能控制***与方法 |
CN114104887B (zh) * | 2021-11-23 | 2023-06-06 | 上海三菱电梯有限公司 | 电梯目的层建议***与方法以及电梯***和建筑物管理*** |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA1315900C (fr) * | 1988-09-01 | 1993-04-06 | Paul Friedli | Systeme centralise de commande d'ascenseurs avec attribution immediate de cabines-cibles |
FI113467B (fi) * | 2002-11-29 | 2004-04-30 | Kone Corp | Allokointimenetelmä |
FI98720C (fi) * | 1992-05-07 | 1997-08-11 | Kone Oy | Menetelmä hissiryhmän ohjaamiseksi |
FI107379B (fi) * | 1997-12-23 | 2001-07-31 | Kone Corp | Geneettinen menetelmä hissiryhmän ulkokutsujen allokoimiseksi |
US6439349B1 (en) * | 2000-12-21 | 2002-08-27 | Thyssen Elevator Capital Corp. | Method and apparatus for assigning new hall calls to one of a plurality of elevator cars |
FI113163B (fi) * | 2002-10-01 | 2004-03-15 | Kone Corp | Hissiryhmän ohjausmenetelmä |
-
2004
- 2004-04-15 FI FI20040544A patent/FI115396B/fi not_active IP Right Cessation
-
2005
- 2005-04-12 EP EP05730844A patent/EP1735229B1/fr not_active Expired - Fee Related
- 2005-04-12 ES ES05730844T patent/ES2340689T3/es active Active
- 2005-04-12 WO PCT/FI2005/000181 patent/WO2005100223A2/fr not_active Application Discontinuation
- 2005-04-12 DE DE602005019866T patent/DE602005019866D1/de active Active
Also Published As
Publication number | Publication date |
---|---|
DE602005019866D1 (fr) | 2010-04-22 |
EP1735229A2 (fr) | 2006-12-27 |
WO2005100223A3 (fr) | 2006-03-02 |
FI115396B (fi) | 2005-04-29 |
WO2005100223A2 (fr) | 2005-10-27 |
FI20040544A0 (fi) | 2004-04-15 |
ES2340689T3 (es) | 2010-06-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0895506B1 (fr) | Procede de commande d'un groupe d'ascenseurs constitue de deux ascenseurs a cabines superposees, aux fins d'optimisation de la duree de transport des passagers | |
EP2029466B1 (fr) | Système d'ascenseur | |
JP5351510B2 (ja) | 乗り場行先階予約式群管理エレベーターの制御装置 | |
EP1021368B1 (fr) | Procede de commande d'un groupe d'ascenseurs generant un trafic de passagers virtuel | |
US20100219025A1 (en) | Elevator system | |
JP5705704B2 (ja) | エレベータ群管理システムおよびその制御方法 | |
US10183836B2 (en) | Allocating destination calls using genetic algorithm employing chromosomes | |
JP2011190058A (ja) | エレベータの制御装置 | |
EP2621847B1 (fr) | Système d'ascenseur | |
EP1735229B1 (fr) | Methode pour commander un systeme d'ascenseur | |
GB2555747A (en) | Group-control elevator device, and method for assigning boarding car numbers using group control | |
US9580271B2 (en) | Elevator system configured to decentralize allocation of hall calls | |
US10071879B2 (en) | Method for controlling an elevator system | |
JP2020019611A (ja) | マルチカーエレベーター及びマルチカーエレベーター制御方法 | |
WO2005121002A1 (fr) | Contrôleur de groupe d'ascenseurs | |
CN105263840B (zh) | 电梯控制*** | |
KR20070088519A (ko) | 엘리베이터 그룹 관리 제어 장치 | |
JP4357248B2 (ja) | エレベータの群管理制御装置 | |
JP4569197B2 (ja) | エレベータの群管理装置 | |
JPS6247787B2 (fr) | ||
JP6420217B2 (ja) | エレベータ装置及びエレベータ装置の制御方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20060929 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE ES FR GB IT |
|
DAX | Request for extension of the european patent (deleted) | ||
RBV | Designated contracting states (corrected) |
Designated state(s): DE ES FR GB IT |
|
17Q | First examination report despatched |
Effective date: 20070824 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE ES FR GB IT |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 602005019866 Country of ref document: DE Date of ref document: 20100422 Kind code of ref document: P |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2340689 Country of ref document: ES Kind code of ref document: T3 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20101213 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: ES Payment date: 20120425 Year of fee payment: 8 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20130424 Year of fee payment: 9 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20140412 |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FD2A Effective date: 20150527 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20140413 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 12 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 13 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 14 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20190418 Year of fee payment: 15 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20190418 Year of fee payment: 15 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20190418 Year of fee payment: 15 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602005019866 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200430 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20201103 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20200412 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200412 |