JPH03288776A - Group management device for elevator - Google Patents

Group management device for elevator

Info

Publication number
JPH03288776A
JPH03288776A JP2089550A JP8955090A JPH03288776A JP H03288776 A JPH03288776 A JP H03288776A JP 2089550 A JP2089550 A JP 2089550A JP 8955090 A JP8955090 A JP 8955090A JP H03288776 A JPH03288776 A JP H03288776A
Authority
JP
Japan
Prior art keywords
car
arrival interval
cage
time
standard floor
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
JP2089550A
Other languages
Japanese (ja)
Other versions
JPH07106846B2 (en
Inventor
Kenji Sasaki
佐々木 建次
Hiroshi Hattori
宏 服部
Nobuyuki Sata
信幸 左田
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.)
Fujitec Co Ltd
Original Assignee
Fujitec Co Ltd
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 Fujitec Co Ltd filed Critical Fujitec Co Ltd
Priority to JP2089550A priority Critical patent/JPH07106846B2/en
Publication of JPH03288776A publication Critical patent/JPH03288776A/en
Publication of JPH07106846B2 publication Critical patent/JPH07106846B2/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Landscapes

  • Elevator Control (AREA)

Abstract

PURPOSE:To prevent the dumpling drive by calculating the max. average arrival time interval of each cage which arrives a standard floor subsequently to a called-back candidature cage and immediately outputting a standard floor calling-back instruction to a called-back candidature cage when the time is larger than the max. average arrival interval. CONSTITUTION:In a group management device 10, if the up-peak time is detected by a means 10C from the calling generation situation and the number of waiting users on a standard floor, and cage which completes service is selected as a candidature cage for the calling back to the standard floor by a means 10D. Then, the arrival interval of the cage at an expected arrival time in the case where the candidature cage is called back to the standard floor is calculated by a means 10E, and the max. average arrival interval among the average arrival interval at each arrival time point of each cage which arrives afterwards is calculated by a means 10F. A means 10G compares the both time, and when the former is larger, the candidature cage is immediately called back to the standard floor, while if the latter is larger, the cage is put into waiting, and at the time point when the former becomes larger than the latter, the candidature cage is called back to the standard floor. Accordingly, the arrival interval of each cage to the standard floor can be set nearly uniform.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 この発明はエレベータの群管理装置の改良に関し、特に
オフィスビルの朝の出動時間・:i)などに見られるア
ップピーク時に有効なものである。
[Detailed Description of the Invention] [Industrial Application Field] This invention relates to an improvement of a group control device for elevators, and is particularly effective during up-peak hours such as the morning dispatch time of office buildings. .

〔従来の技術〕[Conventional technology]

朝の出動時等のアンプピーク時には、基準階(入口階)
で多くの乗客か発生ずるため、通常の割当て制御を行っ
ていると、基準階では積残しが発生しているのに、上方
階ではすべての呼びにサービスを終了して乗捨てられた
かごが遊んでいるといった状態となり、基準階での乗客
の待時間が著しく悪化する。
During peak amplifier times such as when dispatched in the morning, the standard floor (entrance floor)
Therefore, if normal allocation control is performed, there will be a backlog of cars on the standard floor, but on the upper floors, there will be a large number of unloaded cars that are out of service and left unloaded for all calls. This creates a situation where passengers are playing around, and the waiting time for passengers on the standard floor becomes significantly worse.

このため、従来は例えば所定の時間になるとアンプピー
ク時の運転パターンに切り換え、すべての呼びに応答し
サービスを終了したかごを強制的に基準階へ呼戻す方法
がとられている。
For this reason, a conventional method has been adopted in which, for example, at a predetermined time, the operation pattern is switched to the peak amplifier operation pattern, and the cars that have responded to all calls and finished their service are forcibly called back to the standard floor.

〔発明が解決すべき課題〕[Problem to be solved by the invention]

しかし、すべての呼びにサービスを終了したかごを単に
基準階へ呼戻すだけでは、第7図に示すようにかごが団
子状態となる。第7図は10階床のビルに4台のかごが
就役している場合の各かごの運行線図の一例である。こ
の第7図に示すように、サービスを終了したかごを単に
基準階に呼戻すだけでは、次々にかごが到着して乗客が
乗込み、それらのかごが出発した後、次のかごがなかな
かやってこないという団子状態が生しる。この団子状態
では、多くの乗客を乗せたかごとあまり乗客の乗ってい
ないかごとが生し、またかごの到着間隔のばらつきも大
きくなるので、アップピーク時全体でみると乗客の待時
間の改善にあまり効果が見られない。第7図の例では、
4号機のかごが出発した直後にホールに到着した乗客は
、かなり長い時間待たされ、いらいらすることになる。
However, if a car that has been serviced for all calls is simply called back to the standard floor, the car will be left in a pile as shown in FIG. FIG. 7 is an example of the operation diagram of each car when four cars are in service in a building with 10 floors. As shown in Figure 7, if the cars that have finished their service are simply called back to the standard floor, cars will arrive one after another and passengers will board, and after those cars have departed, it will be difficult for the next car to arrive. This creates a situation where there is no such thing. In this situation, there will be cars with many passengers and cars with few passengers, and the disparity in the arrival interval of the cars will also increase, which will improve the waiting time for passengers during up-peak hours as a whole. I don't see much effect. In the example in Figure 7,
Passengers who arrive at the hall just after car No. 4 departs will be left waiting for quite a long time, which can be frustrating.

このように、サービスを終了したかごを直ちに基準階へ
呼戻す方法は、−見効率のよさそうな方法に思えるが、
必ずしも最善の方法とはいえなかった。
This method of immediately recalling a car that has finished its service to the standard floor seems to be an efficient method; however,
It wasn't necessarily the best way.

また、アンプピーク時間帯を予め定め、その時間帯にな
ると運転パターンを切換える方式では、出動時間帯が何
らかの原因でたまたま変動したりすると、基準階に乗客
があまり発生していないにも拘わらず無駄にかごを呼戻
すことになり、その結果、他の階のサービスが悪化する
ことにもなる。
In addition, with the method of predetermining the amplifier peak time period and switching the driving pattern when the time period arrives, if the dispatch time period happens to change for some reason, it will be wasted even though there are not many passengers on the standard floor. The cars will have to be recalled, and as a result, the service on other floors will deteriorate.

〔課題を解決するための手段〕[Means to solve the problem]

この発明は上記問題点を解決するためになされたもので
、その特徴とするところは、交通需要の状況からアップ
ピークを検出する手段と、かご呼びと乗場呼びのすべて
に応答しサービスを終了したかごを呼戻し候補かごとし
て選択する手段と、前記呼戻し候補かごを基準階へ呼戻
したときの予想到着時点における、所定時点以後のかご
の到着間隔を算出する手段と、前記呼戻し候補かごより
後に基準階に到着する各かごの各予想到着時点における
、所定時点以後の各平均到着間隔のうち最大平均到着間
隔を算出する手段と、前記到着間隔が前記最大平均到着
間隔より大きいときは前記呼戻し候補かごに直ちに基準
階呼戻し指令を出力し、前記到着間隔が前記最大平均到
着間隔より小さいときは、前記到着間隔が前記最大平均
到着間隔と等しいか或いはそれより大きくなった時点で
、前記呼戻し候補かごに基準階呼戻し指令を出力する手
段とを備えた点にある。
This invention was made to solve the above-mentioned problems, and its features include a means to detect up-peak from the traffic demand situation, and a means to respond to all car calls and hall calls and terminate the service. means for selecting a car as a recall candidate car; means for calculating an arrival interval of the car after a predetermined time point at an expected arrival time when the recall candidate car is called back to a reference floor; means for calculating a maximum average arrival interval among each average arrival interval after a predetermined time point at each expected arrival time of each car that arrives at the reference floor later than the standard floor; and when the arrival interval is larger than the maximum average arrival interval, Immediately output a reference floor callback command to the callback candidate car, and when the arrival interval is smaller than the maximum average arrival interval, when the arrival interval becomes equal to or larger than the maximum average arrival interval, and means for outputting a reference floor recall command to the recall candidate car.

〔作用〕[Effect]

このような構成において、基準階における呼びの発生状
況や待客数などからアンプピーク時になったことを検出
すると、まず自号機が受は持っているかご呼びと乗場呼
びのすべてに応答しサービスを終了したかごを、基準階
への呼戻し候補かごとして選択する。次にこの呼戻し候
補かごをいま基準階へ呼戻した場合の予想到着時点にお
けるかごの到着間隔(過去最も最近に基準階にかごが到
着した時点以後の)を算出するとともに、この呼戻し候
補かごより後に到着する各かごのそれぞれの到着時点に
おける平均到着間隔のうち最大平均到着間隔を算出する
。そしてこの呼戻し候補かごを呼戻したときのかごの到
着間隔と、前記最大平均到着間隔とを比較し、前者の方
が大きい場合は直ちに呼戻し候補かごを基準階に呼戻し
、後者の方が大きい場合は、呼戻し候補かごをそのまま
待機させ、前者が後者と等しいか或いは後者より大きく
なった時点で呼戻し候補かごを基準階へ呼戻す。このよ
うにして上記の手順を繰り返すことにより、各かごの基
準階への到着間隔がほぼ均一化されるようになる。
In such a configuration, when it is detected that the peak time has arrived based on the number of calls and the number of customers waiting on the standard floor, the own car first responds to all the car calls and hall calls it has and provides service. The completed car is selected as a candidate car for recall to the standard floor. Next, if this recall candidate car is now called back to the standard floor, the arrival interval of the car at the expected arrival time (after the most recent time when the car arrived at the standard floor in the past) is calculated, and this recall candidate car is The maximum average interarrival interval among the average interarrival intervals at the time of arrival of each car arriving after the car is calculated. Then, compare the arrival interval of the car when this recall candidate car is recalled with the maximum average arrival interval, and if the former is larger, immediately recall the recall candidate car to the standard floor, and the latter If is large, the recall candidate car is left on standby, and when the former is equal to or larger than the latter, the recall candidate car is called back to the standard floor. By repeating the above procedure in this way, the intervals at which each car arrives at the reference floor can be made approximately equal.

〔実施例〕 以下、本発明の一実施例を図面に基づいて説明する。な
おここでは便宜上、1号機〜4号機のエレベータが10
階床のビルに就役している場合について説明するが、勿
論エレベータの台数や階床数に拘わらず本発明を適用で
きることは言うまでもない。
[Example] Hereinafter, an example of the present invention will be described based on the drawings. For convenience, the number of elevators for Units 1 to 4 is 10.
Although the case where the elevator is in service in a building with multiple floors will be described, it goes without saying that the present invention can be applied regardless of the number of elevators or the number of floors.

第1図は本発明の全体構成図で、群管理装置10とこれ
によって制御される■号機〜4号機用の運行制御装置1
1〜14 (一部図示省略〉とから構成されている。第
1図において、IOAは各階の乗場呼びを登録する乗場
呼び登録手段、IOBは新たに発生した乗場呼びに対し
て複数台のかごの中から最適なかごを選択し割当てる割
当て手段、IOCは例えば基準階における呼びの発生状
況や或いは待客の発生状況、基準階出発時のかごの負荷
状況等の推移からアップピークを検出する手段、10D
は自号機の受は持っているかご呼びと乗場呼びのすべて
にサービスを終了し待機状態となっているかごを呼戻し
候補かごとして選択する呼戻し候補かご選択手段、10
Eは呼戻し候補かごを基準階へ呼戻したときの予想到着
時点における、所定時点(例えば過去最も最近に基準階
にかごが到着した時点)以後のかごの到着間隔を算出す
る手段、10Fは前記呼戻し候補かごより後に基準階に
到着する各かごの各予想到着時点のそれぞれにおける、
所定時点以後の各平均到着間隔のうち最大平均到着間隔
を算出する手段、LOGは前記到着間隔と前記最大平均
到着間隔とを比較し、前者の方が大きい場合は直ちに基
準階呼戻し指令を出力し、後者の方が大きい場合は、前
者が後者と等しいか或いは後者より大きくなった時点で
基準階呼戻し指令を出力する基準階呼戻し指令出力手段
である。
FIG. 1 is an overall configuration diagram of the present invention, showing a group management device 10 and an operation control device 1 for No.
1 to 14 (partially not shown). In Fig. 1, IOA is a hall call registration means for registering hall calls for each floor, and IOB is a means for registering multiple cars in response to newly generated hall calls. The IOC is an allocation means for selecting and allocating the most suitable car from among the cars, and an IOC is a means for detecting an up-peak from changes in the occurrence of calls or waiting customers on the standard floor, the load status of the car at the time of departure from the standard floor, etc. , 10D
(10) call-back candidate car selection means for selecting a car that has completed service for all car calls and hall calls and is in a standby state as a call-back candidate car;
E is a means for calculating the arrival interval of the car after a predetermined time (for example, the most recent time in the past when the car arrived at the reference floor) at the expected arrival time when the recall candidate car is called back to the reference floor; At each expected arrival time of each car that arrives at the reference floor after the recall candidate car,
Means for calculating the maximum average arrival interval among each average arrival interval after a predetermined time point, LOG compares the arrival interval and the maximum average arrival interval, and if the former is larger, immediately outputs a reference floor recall command. However, when the latter is larger, the reference floor recall command output means outputs a reference floor recall command when the former becomes equal to or larger than the latter.

11Aは1号機に割当てられた乗場呼びを登録する割当
乗場呼び登録手段、IIBばかご呼びを登録するかご呼
び登録手段、IICは各階の乗場に設&Jられたホール
ランタンの点灯などの制御を行う報知装置制御手段、1
1Dはかご呼びゃ割当てられた乗場呼び或いは呼戻し指
令などに応答させるために、かご位置に応してかごの走
行、停止、運転方向等の基本動作を制御する運転制御手
段、lIEは戸の開閉を制御する戸制御手段で、これら
の運行制御装置11内の各手段はいずれも周知のもので
ある。なお、2号機用〜4号機用の運行制御装置12〜
14(図示省略)も1号機用と同様に構成されている。
11A is an assigned hall call registration means for registering the hall call assigned to car No. 1, IIB is a car call registration means for registering a car call, and IIC is for controlling the lighting of the hall lanterns installed at the landings on each floor. Notification device control means, 1
1D is an operation control means that controls basic operations such as running, stopping, and driving direction of the car according to the car position in order to respond to a car call, an assigned hall call, or a call-back command. Each of the door control means in the operation control device 11 that controls opening and closing is well known. In addition, the operation control device 12 for Units 2 to 4
14 (not shown) is also configured in the same manner as for the No. 1 machine.

第2図は群管理装置10のブロック回路図で、群管理装
置10はマイクロコンピュータで構成され、CPU21
.R,0M22.RAM23.入力回路24及び出力回
路25を備えている。入力回路24には各階の乗場呼び
釦(図示せず)からの乗場呼び信号26、及び運行制御
装置11〜14からの各号機の状態信号(かご位置や運
転方向、かご呼びの有無等)が入力され、出力回路25
からは各乗場呼ひ釦に内蔵された乗場呼び登録灯への応
答信号27、及び運行制御装置11〜14への割当信号
や基準階への呼戻し指令信号等が出力される。
FIG. 2 is a block circuit diagram of the group management device 10. The group management device 10 is composed of a microcomputer, and has a CPU 21.
.. R,0M22. RAM23. It includes an input circuit 24 and an output circuit 25. The input circuit 24 receives hall call signals 26 from hall call buttons (not shown) on each floor, and status signals for each car (car position, driving direction, presence or absence of car calls, etc.) from the operation control devices 11 to 14. input and output circuit 25
A response signal 27 to the hall call registration light built into each hall call button, an assignment signal to the operation control devices 11 to 14, a callback command signal to the reference floor, etc. are outputted from the terminal.

以上の構成において、次に本発明の詳細な説明する。With the above configuration, the present invention will now be described in detail.

第3図は、群管理制御のメインプログラム中、本発明に
よる基準階への呼戻しに関する処理の部分を記載したフ
ローチャートである。
FIG. 3 is a flowchart illustrating a part of the main program for group management control that describes a process related to callback to the standard floor according to the present invention.

まず手順M1でアップピークか否かを判断する。First, in step M1, it is determined whether or not there is an up peak.

これは例えば、所定時間毎の基準階における乗場呼びの
発生数を検出することにより、或いは基準階の乗場に待
客数検出装置を設け、待客数の発生の状況から、或いは
各かごの基準階からの出発時におけるかご内負荷状況等
から容易に判断することができる。この結果、アップピ
ーク時でない場合にはリターンへと進み、通常の群管理
運転が行われる。アンプピークの場合は、自号機の受は
持つすべての呼びにサービスを終了し待機中であるかご
を、呼戻し候補かごとして選択し、呼戻し候補かごの有
無を判断する(手順M2.M3)。すべてのかごが呼び
に対してサービス運転中であり、呼戻しかごが存在しな
い場合は再びリターンへと進み、通常の群管理制御を行
うが、呼戻し候補かごが存在する場合は手順4へと進む
。手順M4では呼戻し候補かごを今すくに基準階に呼戻
したとしても積残し客が発生しそうか否かを判断し、積
残し客が発生しそうであれば呼戻し候補かごに呼戻し指
令を与え、直ちに呼戻し候補かごを基準階へ呼戻す(手
順M7)。このように基準階に積残し客が発生しそうな
場合には、今すくに呼戻し候補かごを基準階に呼戻した
としても、基準階からはほ満員の状態で出発させること
かできるので、直ちに呼戻し指令を与えて基準階に呼戻
す。なお、積残し客が発生しそうか否かの検出は、乗場
の待客数を直接検出するようにしてもよいし、或いは乗
場呼びか登録されてからの経過時間等を用いて推測する
ようにしてもよい。
This can be done, for example, by detecting the number of hall calls that occur on the standard floor at each predetermined time, or by installing a waiting passenger number detection device at the standard floor landing, or by checking the number of waiting passengers, or by checking the number of waiting passengers. This can be easily determined from the load situation inside the car at the time of departure from the floor. As a result, if it is not the up-peak period, the process proceeds to return and normal group management operation is performed. In the case of amplifier peak, the receiver of the own car has finished serving all calls and selects the car that is on standby as a callback candidate car, and determines whether there is a callback candidate car (steps M2 and M3). . If all cars are in service operation for a call and there is no callback car, the process goes to return again and normal group management control is performed, but if there is a callback candidate car, the process goes to step 4. move on. In step M4, it is determined whether or not there will be unloaded passengers even if the recall candidate car is called back to the reference floor as soon as possible, and if it is likely that unloaded passengers will occur, a recall command is issued to the recall candidate car. and immediately recalls the recall candidate car to the standard floor (step M7). In this way, if there are likely to be unloaded passengers on the standard floor, even if the candidate car is called back to the standard floor now, it is still possible to have the car depart from the standard floor when it is almost full. Immediately give a recall command and call back to the standard floor. Note that the detection of whether there is likely to be a backlog of passengers may be done by directly detecting the number of waiting passengers at the landing, or by estimating it using the elapsed time since the landing call was registered. It's okay.

基準階に積残し客が発生しそうな状態でない場合にば手
順M4からM5へと進み、sitとmaxiを計算する
。ここでsitとは、現時点で呼戻し候補かごを基準階
へ呼戻したときの予想到着時点における、所定時点以後
のかごの到着間隔を表わし、一方、maxtは前記呼戻
し候補かごまり後に基準階に到着する各かごの各予想到
着時点におiJる、所定時点以後の各平均到着間隔のう
ち最大平均到着間隔のことであり、これらを第6図を用
いて説明する。
If it is not likely that there will be a backlog of passengers on the standard floor, the process proceeds from step M4 to step M5, and sit and maxi are calculated. Here, sit represents the arrival interval of the car after a predetermined time at the expected arrival time when the recall candidate car is called back to the reference floor at the present time, and maxt is the arrival interval at the reference floor after the recall candidate car is called back to the reference floor. This refers to the maximum average arrival interval among the average arrival intervals after a predetermined time point at each expected arrival time of each car arriving at , and these will be explained using FIG.

第6図は各かごの運行線の一例を示した図で、現時点で
はすてに4号機が基準階に到着しており、一方呼戻し候
補かごとして1号機が選択されており、その後に2号機
、3号機が基準階に到着するものとする。第6図におい
て、wt。は上記の所定時点であり、ここでは現時点を
基準として過去最も最近に基準階にかこが到着した時点
を所定時点として考えると、この例では4号機が到着し
た時点が所定時点wt。となる。wt、は、呼戻し候補
かごすなわち1号機を現時点で呼戻した場合の基準階へ
の予想到着時点を示し、WLz〜wt4はそれぞれ2号
機〜4号機の基準階への予想到着時点を示している。
Figure 6 is a diagram showing an example of the operation line of each car. At present, car No. 4 has already arrived at the standard floor, while car No. 1 has been selected as a recall candidate car, and after that car No. 2 has arrived at the standard floor. It is assumed that Units 1 and 3 arrive at the standard floor. In FIG. 6, wt. is the above-mentioned predetermined time point, and here, if we consider the time when the car arrived at the reference floor most recently in the past with the present time as a reference, the predetermined time point wt is the time when the No. 4 car arrived in this example. becomes. wt indicates the expected time of arrival at the standard floor when the recall candidate car, that is, car No. 1, is called back at the present time, and WLz to wt4 indicate the expected arrival times to the standard floor of cars No. 2 to No. 4, respectively. There is.

従って第6図の例では、前述のsitずなわち1FJi
戻し候補かご(1号機)を基準階へ呼戻したときの予想
到着時点旧、における、所定時点旧。以後のかごの到着
間隔は、 5it= wt、−囚t。
Therefore, in the example of FIG. 6, the above-mentioned sit is 1FJi
A predetermined time point old in the expected arrival time old when the return candidate car (car No. 1) is called back to the reference floor. The arrival interval of subsequent cars is: 5it = wt, - prisoner t.

で表わされる。It is expressed as

第6図の例でば、時点−t。と時点−りとの間に到着す
る他のかごは存在しないが、もし現時点で既に基準階に
向かって走行中であり時点wt、より前に基準階へ到着
するかごがn台存在する場合には、上記sitは、 11 2 wt、−囚t。
In the example of FIG. 6, time -t. There are no other cars that arrive between and time t, but if there are n cars that are already traveling towards the reference floor at the moment and arrive at the reference floor before time wt, then The above sit is 11 2 wt, - prisoner t.

s+t= n(−1 となる。s+t= n(-1 becomes.

−・方、前述のmaxtを剖算するには、まず呼戻し候
補かごより後に基準階に到着する各かごの各予想到着時
点における、所定時点以後の各平均到着間隔を求める。
- On the other hand, in order to calculate the above-mentioned maxt, first calculate the average arrival interval after a predetermined time at each expected arrival time of each car that arrives at the reference floor after the recall candidate car.

例えば2号機の予想到着時点岨2における、所定時点w
t。以後のかごの平均到着間隔は Wjz   wt。
For example, a predetermined time w at the expected arrival time point 2 of Unit 2
t. The average arrival interval of subsequent cars is Wjz wt.

で表わされる。It is expressed as

同様にして、3号機の予想到着時点11t3及び4号機
の予想到着時点wt、における、所定時点れ。
Similarly, the predetermined times at the expected arrival time 11t3 of the No. 3 car and the expected arrival time wt of the No. 4 car.

以後のかごの平均到着間隔は、それぞれ、wL+   
wto       wLa   wt。
The average arrival interval of each subsequent car is wL+
wto wLa wt.

4 で表わされる。そしてこれらの平均到着間隔のうち、最
大値をmaX Lとする。
It is expressed as 4. Then, among these average arrival intervals, the maximum value is set as maXL.

なお、ここで各号機の基準階への予想到着時点は、各号
機が受は持っている乗場呼びとかご呼びのすべてに順次
応答した後、直ちに基準階へ復帰するとして容易に計算
することができ、更に学習により発生の予想される呼び
を含めて計算するようにしてもよい。
Note that the expected arrival time of each car at the standard floor can be easily calculated by assuming that each car returns to the standard floor immediately after responding to all the hall calls and car calls it has in sequence. Furthermore, the calculation may include calls that are expected to occur through learning.

また、第6図の例ではmaxtを求めるに当たり、呼戻
し候補かごを除くすべての号機の予想到着時点における
平均到着間隔を計算するようにしているが、必ずしもす
べての号機について計算する必要はなく、例えば現時点
でまだ4号機の予想到着時点−t4の予想が困難な場合
は、wt2と−13のそれぞれの時点における平均到着
間隔からmaxtを求めるようにしてもよい。
In addition, in the example shown in Fig. 6, when calculating maxt, the average arrival interval at the expected arrival time of all cars except for recall candidate cars is calculated, but it is not necessary to calculate it for all cars. For example, if it is difficult to predict the expected arrival time -t4 of the No. 4 car at this point in time, maxt may be calculated from the average arrival interval at each time point wt2 and -13.

第3図に戻り、手順M6では上記で求めたsitとma
x tとを比較し、既にsitの方が大きい場合には、
呼戻し候補かごの到着時点におけるかごの到着間隔がそ
れ以後に到着するかごの平均到着間隔より既に大きいの
で、手順M7へと進み、直ちに呼戻し指令を呼戻し候補
かごに与え、基準階に呼戻す。もしsitの方が小さい
場合はリターンへと進め、呼戻し候補かごは待機したま
ま以後手順Ml−M6を繰り返し、sitがmaxtに
等しくなると手順M7へと進め呼戻し候補かこに呼戻し
指令を与える。
Returning to FIG. 3, in step M6, sit and ma obtained above are
Compare x t and if sit is already larger,
Since the arrival interval of the car at the time of arrival of the recall candidate car is already larger than the average arrival interval of cars arriving after that, the process advances to step M7, where a recall command is immediately given to the recall candidate car, and the call is made to the standard floor. return. If sit is smaller, proceed to return, and repeat steps M1-M6 while the callback candidate car is on standby. When sit is equal to maxt, proceed to step M7 and give a callback command to the callback candidate car. .

このように、sitがmaxtに等しくなった時点で呼
戻し指令を与えるのは、例えば第6図の状態でmaにt
は時点wt3におけるかごの平均到着間隔であったとす
ると、時点wt。〜時点wt3の期間が他の期間にJヒ
ベてかごの平均到着間隔が大きいということであり、こ
のときの平均到着間隔にsitが一致するようにし、更
にその後2号機が呼戻し候補かごとして選択されたとき
にも同様の手順を繰返していくと、かごの平均到着間隔
の大きな期間のかごの到着間隔が均一化されていくこと
になり、この結果かごの到着間隔が極端に大きくなるこ
とが回避でき、全体的にもかごの到着間隔が均一化され
ていくことになる。
In this way, when sit becomes equal to maxt, a recall command is given, for example, when ma is set to t in the state shown in FIG.
Assuming that is the average arrival interval of the car at time wt3, then time wt. The average arrival interval of the J-hibete car is larger than other periods during ~time point wt3, so sit is made to match the average arrival interval at this time, and after that, car No. 2 is selected as a recall candidate car. If the same procedure is repeated when the average car arrival interval is large, the car arrival interval will become uniform, and as a result, the car arrival interval will become extremely large. This can be avoided, and the arrival intervals of cars will be made more uniform overall.

なお、手順M6におけるδは調整用のパラメタであり、
現場の仕様や機種等に応して適切な値に設定することが
できる。
Note that δ in step M6 is an adjustment parameter,
It can be set to an appropriate value according to the site specifications, model, etc.

例えばδとして所定の範囲内で十の値を与えると、かご
はその分だL)早く基準階へ戻ることになり、遊んでい
るかごを少なくすると共に待時間を凍らし、待客の不満
を解消する方向に作用することになる。また、δとして
所定の範囲内で−の値を与えると、かごはその分だの遅
く基準階へ復(Mすることになり、団子運転を確実に防
止する方向に作用することになる。
For example, if δ is given a value of 10 within a predetermined range, the car will return to the standard floor as soon as possible (L), which will reduce the number of idle cars, freeze waiting time, and reduce customer dissatisfaction. This will work towards eliminating the problem. Furthermore, if a negative value is given as δ within a predetermined range, the car will return to the standard floor that much later (M), which will work in the direction of reliably preventing dumpling operation.

次に上記sitとmaxtの算出手順について第4図と
第5図により説明する。
Next, the procedure for calculating sit and maxt will be explained with reference to FIGS. 4 and 5.

第4図は上記sitを算出する手順を示すフローチャー
1−である。第4図において、jはかごの号機番号、N
は群管理制御の対象となるかごの全台数、nkは所定時
点wto以後で呼戻し候補かごより先に基準階に到着す
るかごの数、nは呼戻し候補かごの号機番号、wt(j
)及びw t fn)はそれぞれj号機或いはn号機の
基準階への予想到着時点である。
FIG. 4 is a flowchart 1- showing the procedure for calculating the above sit. In Figure 4, j is the car number, N
is the total number of cars subject to group management control, nk is the number of cars that arrive at the reference floor before the recall candidate car after the predetermined time wto, n is the car number of the recall candidate car, wt(j
) and w t fn) are the expected arrival times of the j-th or n-th car at the reference floor, respectively.

まず手順Mllでjとnkを初期値にセットし、手順M
12で全号機についてのチエツクが終ったか否かを確認
する。手順M13では呼戻し候補かご以5 外の各かごについて、IIJ戻し候補かごより基準階に
先に到着するか否かを1号機から順にチエツクし、先に
到着する場合はnkに1を加える(手順M14)。上記
の手順をすべての号機についてチエツク (手順M15
.  M12) L終えると手順M16へと進め、呼戻
し候補かごの予想到着時点における、所定時点wt。以
後のかごの到着間隔が求められる。
First, in step Mll, set j and nk to their initial values, and then in step M
At step 12, it is confirmed whether the check for all machines has been completed. In step M13, for each car other than the recall candidate car 5, it is checked in order from car No. 1 whether or not it arrives at the standard floor earlier than the IIJ return candidate car, and if it arrives earlier, 1 is added to nk ( Step M14). Check the above procedure for all machines (Step M15)
.. M12) When L is completed, the process advances to step M16, and a predetermined time wt is determined at the expected arrival time of the callback candidate car. The arrival interval of subsequent cars is determined.

第5図は、上記maxtを算出する手順を示すフロチャ
ートである。
FIG. 5 is a flowchart showing the procedure for calculating the above maxt.

第5図において、jはかごの号機番号、kは所定時点w
to以後でi号機より先に基準階に到着するかごの数(
同時到着を含む) 、wt(11はi号機の基準階への
予想到着時点、その他第4図と同一の記号は第4図の場
合と同一のものを示している。
In Figure 5, j is the car number and k is the predetermined time w.
The number of cars that arrive at the standard floor before car i after to (
(including simultaneous arrivals), wt (11 is the expected arrival time of the i-th car at the standard floor, and other symbols that are the same as in FIG. 4 indicate the same things as in FIG. 4.

まず手順M21でlとmaxtを初期値にセットし、手
順M22で全月機についてのチエツクが終ったが否かを
確認する。手順M23ではi号機の予想到着時点か呼戻
し候補かごの予想到着時点より後(同時含む)か否かを
チエツクし、後であれば手順M24でjとkを初期値に
セットし、次に手順M256 〜M29で時点wto =wt(1)の間のかごの平均
到着間隔を求める。すなわち手順M25〜M28を繰返
すことによりi号機より先に基準階に到着するかごを全
号機についてチエツクし終えると、その台数が求まり、
手順M29で時点wt。−wt(ilの間のかごの平均
到着間隔を計算してmax tと比較し、もしmax 
tより大きければその値をmaxtとして保持する(手
順M30)。次にiに1を加え(手順M31) 、同様
の手順を繰り返し、もし呼戻し候補かごより後に到着す
るかごがあれば再び手順M25〜M29によりその時点
におけるかごの平均到着間隔を算出し、保持されている
maxtと比較する。そしてすべての号機についてチエ
・ツクを終了すると、最終的に呼戻し候補かごより後に
基準階に到着する各かごの予想到着時点のそれぞれにお
ける、平均到着間隔のうち最大平均間隔がmaxtとし
て求まることになる。
First, in step M21, l and maxt are set to initial values, and in step M22, it is confirmed whether or not the check for all monthly machines has been completed. In step M23, it is checked whether the expected arrival time of car number i or the expected arrival time of the recall candidate car is later (including simultaneously). If it is later, j and k are set to initial values in step M24, and then In steps M256 to M29, the average interarrival interval of the cars during the time point wto = wt(1) is determined. In other words, by repeating steps M25 to M28, when all cars are checked for cars that arrive at the reference floor before car number i, the number of cars is determined.
In step M29, time wt. −wt(il) and compare it with max t, if max
If it is larger than t, that value is held as maxt (step M30). Next, add 1 to i (step M31), repeat the same procedure, and if there is a car that arrives later than the recall candidate car, calculate the average arrival interval of the car at that point again by steps M25 to M29, and hold it. maxt. When checking is completed for all cars, the maximum average interval among the average arrival intervals at each expected arrival time of each car that will arrive at the standard floor after the recall candidate car is finally determined as maxt. Become.

なお上記の実施例では、所定時点として現時点を基準階
として過去最も最近にかごが到着した時点を考えたが、
これに限らず、例えば呼戻し候補かごの予想到着時点を
基準としてその直前に基準階に到着した(する)かごの
到着時点としてもよい。
In the above embodiment, the current time is considered as the reference floor, and the most recent time in the past when the car arrived is considered as the predetermined time.
The present invention is not limited to this, and, for example, the expected arrival time of the recall candidate car may be used as the arrival time of a car that has (will) arrive at the reference floor immediately before the expected arrival time.

〔発明の効果〕〔Effect of the invention〕

本発明によれば、常に適正な間隔でかごを基準階に呼戻
すことができ、団子運転を防止するとともに、輸送能力
を最大限に高め、特に出動時の乗客のいらいらを緩和さ
せることができる。
According to the present invention, it is possible to always call the cars back to the standard floor at appropriate intervals, thereby preventing dumping, maximizing transport capacity, and alleviating passenger irritation, especially when dispatched. .

また、出動時間帯が変動する建物の場合でも、自動的に
出動時の交通流を検出してこれに対応することができ、
より柔軟なサービスを行うことができる。
In addition, even in the case of buildings where dispatch time varies, it is possible to automatically detect traffic flow at the time of dispatch and respond accordingly.
More flexible services can be provided.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の−・実施例を示す全体構成図、第2図
は群管理装置のブロック回路図、第3図は本発明による
基準階への呼戻し処理の手順を示すフローチャート、第
4図は本発明に係るかごの到着間隔を算出する手順を示
すフローチャート、第5図は本発明に係る最大平均到着
間隔を算出する手順を示すフローチャート、第6図は本
発明を説明するための各かごの運行線の一例を示す図、
第7図は従来の群管理制御による各かごの運行線の一例
を示す図である。 10・・・群管理装置 10A・・・乗場呼び登録手段 10B・・・割当手段 10C・・・アップビーク検出手段 100・・・呼戻し候補かご選択手段 10B・・・かごの到着間隔算出手段
FIG. 1 is an overall configuration diagram showing an embodiment of the present invention, FIG. 2 is a block circuit diagram of a group management device, FIG. FIG. 4 is a flowchart showing the procedure for calculating the car arrival interval according to the present invention, FIG. 5 is a flowchart showing the procedure for calculating the maximum average arrival interval according to the invention, and FIG. 6 is a flowchart for explaining the present invention. A diagram showing an example of the operation line of each car,
FIG. 7 is a diagram showing an example of the operation line of each car under conventional group management control. 10... Group management device 10A... Hall call registration means 10B... Allocation means 10C... Up-beak detection means 100... Call-back candidate car selection means 10B... Car arrival interval calculation means

Claims (2)

【特許請求の範囲】[Claims] (1)複数の階床に対し複数台のエレベータを就役させ
、これら複数台のエレベータに共通のホール呼びに対し
て、最適なかごを割当てるなどの制御を行うと共に、か
ご呼びと乗場呼びのすべてに応答しサービスを終了した
かごを基準階に呼戻すようにしたエレベータの群管理装
置において、交通需要の状況からアップピークを検出す
る手段と、かご呼びと乗場呼びのすべてに応答しサービ
スを終了したかごを呼戻し候補かごとして選択する手段
と、前記呼戻し候補かごを基準階へ呼戻したときの予想
到着時点における、所定時点以後のかごの到着間隔を算
出する手段と、前記呼戻し候補かごより後に基準階に到
着する各かごの各予想到着時点における、所定時点以後
の各平均到着間隔のうち最大平均到着間隔を算出する手
段と、前記到着間隔が前記最大平均到着間隔より大きい
ときは前記呼戻し候補かごに直ちに基準階呼戻し指令を
出力し、前記到着間隔が前記最大平均到着間隔より小さ
いときは、前記到着間隔が前記最大平均到着間隔と等し
いか或いはそれより大きくなった時点で、前記呼戻し候
補かごに基準階呼戻し指令を出力する手段とを備えたこ
とを特徴とするエレベータの群管理装置。
(1) Multiple elevators are put into service for multiple floors, and control is performed such as assigning the optimal car to hall calls common to these multiple elevators, and all car calls and hall calls are controlled. In an elevator group control device that responds to calls and returns cars that have finished service to the standard floor, there is a means for detecting an up-peak from the traffic demand situation, and a means to respond to all car calls and hall calls and terminate service. means for selecting a car that has been recalled as a recall candidate car; means for calculating an arrival interval of cars after a predetermined time point at an expected arrival time when the recall candidate car is called back to a reference floor; and said recall candidate car. means for calculating a maximum average arrival interval among each average arrival interval after a predetermined time point at each expected arrival time of each car that arrives at a reference floor after the car, and when the arrival interval is larger than the maximum average arrival interval; Immediately output a reference floor recall command to the callback candidate car, and when the arrival interval is smaller than the maximum average arrival interval, when the arrival interval becomes equal to or larger than the maximum average arrival interval. , means for outputting a standard floor recall command to the recall candidate car.
(2)基準階に過去最も最近にかごが到着した時点を所
定時点とする請求項1記載のエレベータの群管理装置。
(2) The elevator group management system according to claim 1, wherein the predetermined time is the most recent arrival of a car at the reference floor.
JP2089550A 1990-04-03 1990-04-03 Elevator group management device Expired - Fee Related JPH07106846B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2089550A JPH07106846B2 (en) 1990-04-03 1990-04-03 Elevator group management device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2089550A JPH07106846B2 (en) 1990-04-03 1990-04-03 Elevator group management device

Publications (2)

Publication Number Publication Date
JPH03288776A true JPH03288776A (en) 1991-12-18
JPH07106846B2 JPH07106846B2 (en) 1995-11-15

Family

ID=13973933

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2089550A Expired - Fee Related JPH07106846B2 (en) 1990-04-03 1990-04-03 Elevator group management device

Country Status (1)

Country Link
JP (1) JPH07106846B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0789678A (en) * 1993-09-22 1995-04-04 Fujitec Co Ltd Group control device for elevator

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3551618B2 (en) * 1996-05-20 2004-08-11 株式会社日立製作所 Elevator group management controller

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5822277A (en) * 1981-07-31 1983-02-09 株式会社東芝 Method of controlling group of elevator
JPS5826780A (en) * 1981-08-05 1983-02-17 株式会社東芝 Method of controlling group of elevator

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5822277A (en) * 1981-07-31 1983-02-09 株式会社東芝 Method of controlling group of elevator
JPS5826780A (en) * 1981-08-05 1983-02-17 株式会社東芝 Method of controlling group of elevator

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0789678A (en) * 1993-09-22 1995-04-04 Fujitec Co Ltd Group control device for elevator

Also Published As

Publication number Publication date
JPH07106846B2 (en) 1995-11-15

Similar Documents

Publication Publication Date Title
US8172043B2 (en) Elevator cross-dispatching system with inter group relative system response (IRSR) dispatching
US6328134B1 (en) Group management and control system for elevators
JP2010150013A (en) Control device for destination floor reservation type group supervisory operation elevator at landing
US4081059A (en) Elevator control system
JPH0597335A (en) Method for informing elevator arrival
US5338904A (en) Early car announcement
US5233138A (en) Elevator control apparatus using evaluation factors and fuzzy logic
KR100294093B1 (en) Group management control device of elevator
JPH03288776A (en) Group management device for elevator
US5411118A (en) Arrival time determination for passengers boarding an elevator car
JPH07309539A (en) Controller for double deck elevator
JP2874533B2 (en) Elevator group management device
JPH0780639B2 (en) Elevator traffic demand forecasting device
JPH08217341A (en) Group supervisory operation control device for elevator
JPH04133981A (en) Controller for elevator
JPH05286652A (en) Elevator operation controlling device
JP2564953B2 (en) Elevator control equipment
JP3449289B2 (en) Elevator control device
KR100295881B1 (en) Elevator group management control apparatus and method
JPH064475B2 (en) Elevator group management device
JPH0672646A (en) Elevator control device
JP2685878B2 (en) Group control elevator system
JPH0192181A (en) Method of predicting number of waiting passenger of elevator
JP2003146544A (en) Group management system for elevators
JPH0656361A (en) Group-control system of elevator

Legal Events

Date Code Title Description
S531 Written request for registration of change of domicile

Free format text: JAPANESE INTERMEDIATE CODE: R313531

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20071115

Year of fee payment: 12

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20091115

Year of fee payment: 14

LAPS Cancellation because of no payment of annual fees