EP1292523A2 - Procede pour l'affectation immediate des appels de palier - Google Patents

Procede pour l'affectation immediate des appels de palier

Info

Publication number
EP1292523A2
EP1292523A2 EP01919467A EP01919467A EP1292523A2 EP 1292523 A2 EP1292523 A2 EP 1292523A2 EP 01919467 A EP01919467 A EP 01919467A EP 01919467 A EP01919467 A EP 01919467A EP 1292523 A2 EP1292523 A2 EP 1292523A2
Authority
EP
European Patent Office
Prior art keywords
call
landing
elevator
landing call
allocation
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.)
Granted
Application number
EP01919467A
Other languages
German (de)
English (en)
Other versions
EP1292523B1 (fr
Inventor
Jari Ylinen
Tapio Tyni
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Kone Corp
Original Assignee
Kone Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Kone Corp filed Critical Kone Corp
Publication of EP1292523A2 publication Critical patent/EP1292523A2/fr
Application granted granted Critical
Publication of EP1292523B1 publication Critical patent/EP1292523B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/02—Control systems without regulation, i.e. without retroactive action
    • B66B1/06—Control systems without regulation, i.e. without retroactive action electric
    • B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
    • B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages
    • B66B1/20—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages and for varying the manner of operation to suit particular traffic conditions, e.g. "one-way rush-hour traffic"

Definitions

  • the present invention relates to a method for allocating calls given via landing call devices of elevators belonging to an elevator group so that all calls will be served.
  • the control system of the elevator group receives the call for an elevator and tries to figure out which one of the elevators in the elevator group will be best able to serve the call.
  • the activity is termed call allocation.
  • the problem to be solved by allocation is how to find the elevators to serve landing calls so as to minimize a preselected cost factor. Allocation may aim at minimizing passengers' waiting time, passengers' traveling time, the number of times the elevator will stop.
  • the reasoning is carried out individually for each case using complicated conditional structures.
  • the final aim of this reasoning is to minimize a cost factor describing the operation of the elevator group, typically e.g. the call time or the average waiting time of the passengers.
  • the conditional structures are also complicated and they cannot cover all possible situations. Thus, there appear situations in which the control is not functioning in an optimal way.
  • a typical example of this is the traditional collective control, in which a landing call is served by the one of the elevators which is trav- eling in the direction toward the call at the closest distance from the calling floor.
  • allocation methods can be classified into at least three approaches when the matter is considered from the passengers' point of view: continuous, immediate and target- oriented allocation methods.
  • continuous allocation of landing calls landing calls are allocated to an elevator car at an instant when the elevator assigned to a given landing call is still able to stop at the floor in question. Until that instant, the distribution of -.active landing calls among the elevator cars can be changed freely.
  • Continuous alloca- tion is typically used e.g. in Europe. However, for example in Asia, elevator systems are designed with the aim of allowing passengers to know immediately upon pressing a landing call which- elevator is going to serve them. In this case, the landing calls issued are allocated immediately to the eleva- tors that are to serve them.
  • an allocation unit finds the best routes for the elevators, in other words, makes the actual decisions as to which one of the elevator cars is to serve each call.
  • a landing call-specific allocation suggestion is transmitted to a call fixation control unit, which registers each landing call as being reserved for the elevator car suggested for it.
  • the landing call data from the al- location unit includes data giving, in addition to the elevator, also an estimated time of arrival (ETA) at the floor of issue of the landing call.
  • ETA estimated time of arrival
  • a landing call is immediately fixed for the elevator car allocated to serve it, but in the proposed method it is also possible to control the instant of fixation so that fixation will take place in a completely stepless manner.
  • a parameter is used which determines how many seconds before the arrival of the elevator the landing call is to be fixed for the elevator car and signaled to passengers.
  • Another alternative is to define the time in seconds after the entry of a landing call within which the call is to be reserved for an elevator car and signaled to passengers. By comparing the time of this parameter in the former case to the ETA time, the system decides whether the landing call is to be reserved for an elevator car or whether it shall be kept free to be allocated to any car in the elevator group. In the latter case, the parameter is compared with the length of time the landing call has been active. The value of both parameters can be varied e.g. according to traffic intensity and/or traffic type or according to time and date or a preliminary plan.
  • the call fixation control unit must also be able to release one or more landing calls already reserved so as to allow the call(s) to be served by any other elevator car.
  • Such situations include cases where an elevator is separated from the elevator group e.g. because of a technical failure, cases of activation of locking of an elevator, cases of an elevator car being loaded to full ca- pacity and consequent possible bypassing of landing calls, cases of landing calls remaining active for an excessively long time, situations illogical from the point of view of the passengers, such as when an elevator (serving a car call) arrives at the floor of a landing call but then goes on travel- ing in the opposite direction relative to the passenger's destination.
  • the call fixation control unit makes an entry in its bookkeeping system to the effect that the landing call may be served by any one of the elevators (not nec- .essarily the one which had been intended for it before) .
  • the control unit also sends to the elevator a sig- « naling command concerning the landing call that will turn off the signal lights.
  • a control decision alternative or chromosome contains landing call-specific genes whose value indicates the elevator car that is to serve the landing call in question.
  • the range of values of each individual gene is the same as the number of possible elevator cars that are able to serve the call. If the elevator group has e.g. eight elevators which are all able to serve the call, then the range of values for the gene will be eight.
  • the allocation unit sends to the call fixation control unit an inquiry for each landing call, asking which elevator cars are able to serve the landing call in question.
  • the landing call is still free (unallocated) , all cars can serve it and the final range of values for the landing call will equal the number of elevator cars, assuming that there are no other limitations, such as locked states.
  • the call fixation control unit has reserved the landing call for one of the elevator cars, then the range of values for the gene will be one, and the only possible value will be the elevator car for which the call has been reserved.
  • the reservation of the landing call limits the range of values of the gene to one possible value, so when an allocation decision is made, the landing call will always end up being allocated to the elevator car for which it has been reserved. If the landing call is free, e.g.
  • the allocation procedure will perform a search according to its own principles to find an optimal elevator car for the call and all other free landing calls. After a final control decision has been made, it is transmitted to the call fixation control unit, which will reserve the free landing calls for elevator cars according to the control decision.
  • the immediate landing call allocation method differs essentially from continuous allocation in that, instead of a single floor, there may be several floors to be signaled at the same time according to the service routes of the elevator cars.
  • the call fixation control unit takes care of reservation and release of landing calls as well as the commands for corresponding signalling.
  • Reservation of landing calls means that the calls may only be served by a single car, and release of calls means that the landing calls may be served by any one of the elevators.
  • An actual allocation decision is made by a genetic allocation method by limiting the range of values of landing call-specific genes in accordance with the status of call reservation, which is obtained from the call fixation control unit. If a landing call is free, then there are no limitations, but if it has been reserved, then the range of values for the gene is limited to one and the only value it can get is the elevator car reserved for it. The allocation decision is taken to the call fixation control unit, which reserves and controls the signaling.
  • An additional feature in the method is its flexibility for implementing a floating signaling time, regarding which there are two principles of approach. Passengers can be informed of the elevator to serve them when a certain length of time will elapse before the arrival of the elevator. On the other hand, passengers can be given an indication of the elevator to serve them within a certain time after the landing call was entered, in which case it will be possible for a person having pressed a landing call button to move to a better position to wait for a while and, when the signaling appears, walk back to the area in front of the elevator to be ready to enter. This approach may be easier for passengers to adopt. Thus, in addition to pure immediate allocation of landing calls, the method also contains a possibility for more flexible implementations.
  • the above-described control method is suited e.g. for buildings where early signaling is required and, on the other hand, where the conception of the service standard of the elevators tends to be associated with the overall service received, e.g. in hotels. In this case, it will be an advantage if passengers can move with their luggage in time and without great haste to the area in front of the elevator to serve them. A corresponding need for early signaling is also encountered in large elevator systems, in which the walking distances to different elevators may be long.
  • Fig. 1 presents the overall architecture of the method, showing an allocation unit, a call fixation control unit and the signaling devices provided on different floors.
  • Fig. 2 illustrates a case where six active landing calls are coded to form a chromosome in an elevator group comprising six elevators and fourteen floors.
  • a control decision is made in an allocation unit, where optimal routes for serving landing calls are formed for the elevator cars in the elevator group.
  • the figure shows funda- mental data used as a basis for the allocation decision.
  • data includes traffic statistics, data indicating active landing calls, and status data for the elevator group, e.g. position and traveling direction of the elevator cars, car loads and car calls.
  • the allocation unit also takes into account any landing call-specific service limitations concerning the elevator cars, depicted above the allocation unit in the figure.
  • the required data are initialized and possible service limitations are taken into account.
  • optimal routes for serving the landing calls are formed for the elevator cars.
  • the allocation decisions are executed in accor- dance with the optimal routes of the elevator cars.
  • the optimal routes are taken to the call fixation control unit, where elevator cars are reserved for free active landing calls and signaling commands are sent to the signaling devices on the floors of origin of the landing calls.
  • the call fixation control unit and the signaling devices on different floors are shown above the allocation unit. If call fixation is implemented in a flexible manner, then the time of arrival of the elevator car at the floor of the landing call to be served is compared with a signaling advance time in the call fixation control unit, on the basis of which the landing call is either fixed for an elevator car or left free for allocation. If the time of arrival of the elevator car according to the allocation decision remains below the signaling advance time set for the floor to be served by the car, then the elevator car will be reserved for the landing call.
  • the fixation sets service limitations for active landing calls because it will not be possible for the other elevator cars in the elevator group to serve a fixed landing call.
  • This piece of information is utilized in the allocation unit during the next rounds of allocation, where each landing call fixed for an elevator car can only be served by the elevator car previously assigned for it.
  • the valid active landing calls all of which are up calls, are indicated on the right-hand side of the elevator group.
  • Each landing call corresponds to a gene, whose value refers to the elevator car which is to serve the call.
  • the genes of the chromosome together with their possible values, i.e. alleles, are depicted in the lower part of the figure.
  • Elevator 4 is to serve a landing call at floor 6 and a
  • Elevator 6 is to serve a landing call at floor 7 and continue to the destination of its car call.
  • an estimated ETA time can be computed in accordance with the route of each elevator, although these times are not shown in the figure.
  • the free landing calls which have just appeared, have been issued from floors 1 and 12. Since these calls have not yet been allocated to any one of the elevator cars, there are no service limitations set by the control unit, so any one of the available elevators may serve these calls. Therefore, the possible alleles of these genes are elevators 1 - 6, in other words, the number of alternative elevators for both of these landing calls is six.
  • there are also active landing calls in the system each of which has already been allocated to one of the elevators and signaled at the appropriate floors. These landing calls reserved by the call fixation control unit are at floors 6, 7, 8 and 11.
  • the range of values of these four landing call genes is limited to one possible al- ternative, which is the elevator car previously allocated for the call.
  • the only alternative for gene number 2, i.e. for the landing call of floor 6, is elevator 4.
  • each one of the other reserved landing calls already allocated is assigned to one elevator: the landing call at floor 7 to elevator 6, the landing call at floor 8 to elevator 2, and the call at floor 11 to elevator 5.
  • allocation can be started. In the present case, allocation is only performed in order to find an optimal elevator car for the landing calls at floors 1 and 12.
  • the landing calls at floors 1 and 12 are allocated immediately to the elevators assigned for them.
  • the point of time of fixation of a landing call can be set by a parameter.
  • the instant of fixation of the landing call is e.g. 30 seconds. If the allocation procedure suggests for this call an elevator whose estimated time of arrival with respect to the landing call is less or the same as the parameter value of 30 seconds, then the call fixation control unit will reserve the landing call for the suggested elevator and send a signaling command. On the other hand, if the ETA time exceeds 30 s., then the call fixation control unit will not yet reserve the elevator for the landing call but keep it freely allocable.
  • the call fixation control unit will reserve the landing call at floor 12 for elevator 5 and leave the landing call at floor 1 free.
  • the landing call at floor 12 is limited to be served by elevator 5, whereas all elevators have a chance to serve the free landing call at floor 1 as the range of values of the gene for this call still includes elevators 1 - 6.
  • the range of values of the gene for the landing call at floor 12 has been reduced to one, elevator 5.
  • the call fixation control unit will be able to reserve this call, too.
  • a landing call for an elevator car is fixed for the landing call when it has been active for
  • ⁇ a given length of time indicated by a parameter. For example, if the parameter has been set to 10 seconds, then an elevator is fixed and signaled after ten seconds upon the entry of the landing call.
  • the active time of the landing call after allocation is compared with the parameter, so the system will know which elevator is going to serve each call. All landing calls whose active time is less than the parameter time are kept free for allocation.
  • the elevator car suggested for the landing call is fixed, which means that in the next round of allocation , it will be the only alternative for the landing call in question. Other landing calls still remain free for allocation.
  • the allocation procedure may suggest for the landing call an elevator that will arrive at the floor of issue of the landing call before the active time of the landing call does not exceed the parameter time. In this case, the landing call will still be fixed and signaled in the normal manner even if the active time of the landing call should be less than the parameter value .
  • the invention is not restricted to the examples of its embodiments described above; instead, many variations are possible within the scope of the inventive idea defined in the claims .

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)

Abstract

La présente invention concerne un procédé d'affectation des appels faits via les dispositifs d'appel de palier d'ascenseurs appartenant à un groupe d'ascenseurs de façon qu'il y ait simultanément au moins un niveau à signaler selon les routes de desserte des ascenseurs. La décision d'affectation se fait selon un procédé d'affectation génétique. La décision d'affectation est introduite dans une unité de contrôle de fixation d'appel, qui prend soin, d'une part de la réservation et de la libération des appels de palier, et d'autre part de la commande de signalisation. Dans le cas d'un appel de palier réservé, la plage de valeur du gène est limitée.
EP01919467A 2000-03-03 2001-03-05 Procede pour l'affectation immediate des appels de palier Expired - Lifetime EP1292523B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
FI20000503 2000-03-03
FI20000503A FI112787B (fi) 2000-03-03 2000-03-03 Välitön ulkokutsujen allokointimenetelmä
PCT/FI2001/000218 WO2001066454A2 (fr) 2000-03-03 2001-03-05 Procede pour l'affectation immediate des appels de palier

Publications (2)

Publication Number Publication Date
EP1292523A2 true EP1292523A2 (fr) 2003-03-19
EP1292523B1 EP1292523B1 (fr) 2012-01-11

Family

ID=8557843

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01919467A Expired - Lifetime EP1292523B1 (fr) 2000-03-03 2001-03-05 Procede pour l'affectation immediate des appels de palier

Country Status (7)

Country Link
EP (1) EP1292523B1 (fr)
KR (1) KR100756979B1 (fr)
CN (1) CN1223502C (fr)
AU (2) AU2001246555B2 (fr)
FI (1) FI112787B (fr)
HK (1) HK1056351A1 (fr)
WO (1) WO2001066454A2 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI113467B (fi) * 2002-11-29 2004-04-30 Kone Corp Allokointimenetelmä
US10231167B2 (en) * 2017-06-30 2019-03-12 Otis Elevator Company Building access zone specification for mobile applications
DE102018213575B4 (de) * 2018-08-13 2020-03-19 Thyssenkrupp Ag Verfahren zum Betreiben einer Aufzuganlage mit Vorgabe einer vorbestimmten Fahrtroute sowie Aufzuganlage und Aufzugsteuerung zur Ausführung eines solchen Verfahrens

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI102268B1 (fi) * 1995-04-21 1998-11-13 Kone Corp Menetelmä hissiryhmän ulkokutsujen allokoimiseksi
KR100202720B1 (ko) * 1996-12-30 1999-06-15 이종수 엘리베이터의 군관리 제어방법
FI107604B (fi) * 1997-08-15 2001-09-14 Kone Corp Geneettinen menetelmä hissiryhmän ulkokutsujen allokoimiseksi
FI107379B (fi) * 1997-12-23 2001-07-31 Kone Corp Geneettinen menetelmä hissiryhmän ulkokutsujen allokoimiseksi

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0166454A2 *

Also Published As

Publication number Publication date
AU2001246555B2 (en) 2004-07-15
FI20000503A0 (fi) 2000-03-03
KR100756979B1 (ko) 2007-09-07
EP1292523B1 (fr) 2012-01-11
FI112787B (fi) 2004-01-15
WO2001066454A2 (fr) 2001-09-13
WO2001066454A3 (fr) 2002-01-03
FI20000503A (fi) 2001-09-04
AU4655501A (en) 2001-09-17
KR20020079937A (ko) 2002-10-19
CN1223502C (zh) 2005-10-19
HK1056351A1 (en) 2004-02-13
CN1454177A (zh) 2003-11-05

Similar Documents

Publication Publication Date Title
US7083027B2 (en) Elevator group control method using destination floor call input
US7140472B2 (en) Genetic allocation method for an elevator group
JP2730788B2 (ja) エレベータの群管理方法及び群管理装置
US4895223A (en) Method for sub-zoning an elevator group
CA2696940C (fr) Maitrise de la saturation pour systemes d'envoi a destination
US6644442B1 (en) Method for immediate allocation of landing calls
US7921968B2 (en) Elevator traffic control including destination grouping
US6601678B2 (en) Method of allocating elevator cars to operating groups of a destination call control
WO2005070804A2 (fr) Systeme d'ascenseurs
US7117980B2 (en) Method and apparatus for controlling an elevator installation with zoning and an interchange floor
US7549517B2 (en) Elevator car dispatching including passenger destination information and a fuzzy logic algorithm
JPH05201628A (ja) エレベータかごをセクタに動的に割当てる方法及び装置
JPH07149480A (ja) 瞬時的なセクタ割り付け方法
EP1549581B1 (fr) Logique de commande de groupe d'ascenseurs
EP1292523B1 (fr) Procede pour l'affectation immediate des appels de palier
JP2001019288A (ja) 群管理エレベーターのリニューアルシステム
US6976560B2 (en) Service/equipment equalization destination system for elevators
JP2001058764A (ja) エレベーターの群管理制御システム
EP2018337B1 (fr) Système d'ascenseurs et procédé de commande d'un système d'ascenseurs
JPH01231780A (ja) エレベーターの制御装置
JPH09156843A (ja) エレベータの群管理制御装置
JPH08119544A (ja) エレベーターの群管理制御装置
JP3428522B2 (ja) ダブルデッキエレベーターの運行制御装置
JPH02132077A (ja) エレベータの群管理制御装置
JPH05132246A (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: 20020927

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

17Q First examination report despatched

Effective date: 20030605

RBV Designated contracting states (corrected)

Designated state(s): DE FR GB NL

17Q First examination report despatched

Effective date: 20030605

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 60145940

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: B66B0001000000

Ipc: B66B0001200000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: B66B 1/20 20060101AFI20110812BHEP

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 FR GB NL

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 60145940

Country of ref document: DE

Effective date: 20120308

REG Reference to a national code

Ref country code: NL

Ref legal event code: 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: 20121012

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 60145940

Country of ref document: DE

Effective date: 20121012

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20130320

Year of fee payment: 13

REG Reference to a national code

Ref country code: NL

Ref legal event code: V1

Effective date: 20141001

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141001

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20170322

Year of fee payment: 17

Ref country code: DE

Payment date: 20170322

Year of fee payment: 17

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20170322

Year of fee payment: 17

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 60145940

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20180305

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20181002

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: 20180305

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: 20180331