JPS6153976B2 - - Google Patents
Info
- Publication number
- JPS6153976B2 JPS6153976B2 JP55066661A JP6666180A JPS6153976B2 JP S6153976 B2 JPS6153976 B2 JP S6153976B2 JP 55066661 A JP55066661 A JP 55066661A JP 6666180 A JP6666180 A JP 6666180A JP S6153976 B2 JPS6153976 B2 JP S6153976B2
- Authority
- JP
- Japan
- Prior art keywords
- waiting time
- car
- evaluation value
- hall call
- predicted
- 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
Links
Landscapes
- Indicating And Signalling Devices For Elevators (AREA)
- Elevator Control (AREA)
Description
この発明はエレベータを群管理する装置の改良
に関するものである。
近年、エレベータの群管理装置の多くのものに
は、電子計算機が使用されるようになり、どのよ
うな管理方式もプログラム化することにより可能
になつている。
しかし、これらの群管理装置では、新たに乗場
呼びが登録されると、この呼びに最も早く到着す
ると予想されるかご、この呼びの最も近くにいる
かご、または各かごに既に割り当てられている乗
場呼びの中で最も遠い呼び（予測待時間が最長）
の予測待時間が最短になるようなかご等を割り当
てている。すなわち、時々刻々と変化する過去の
交通状態に関係なく、現時点の状況下における割
当てしかしていない。
例えば、新たな乗場呼びが登録されたとき、こ
の乗場呼びを各かごにそれぞれ割り当てたと仮定
したとき、各かごに既に割り当てられている乗場
呼びに対する予測待時間の増加を算出する。そし
て、それぞれの割り当呼びの増加待時間を各かご
ごとに加算し、その加算値が最小となるかごに上
記新たな乗場呼びを割り当てるようにしている。
これを数式で示すと次のように表せる。
ここに、
En：ｎ号機の割当評価値
tio（ｎ）：ｎ号機に乗場呼びioを仮に割り当てた
ときの乗場（io）における予測待時間
ti（ｎ）：ｎ号機に乗場呼びioを仮に割り当てた
とき、ｎ号機に既に割り当てられていた乗場
（ｉ）における予測待時間
Ti：ｎ号機に割り当てられていた乗場（ｉ）に
おける予測待時間
そして、割当評価Enの最小のかごに乗場呼び
ioを割り当てるものである。
例えば、第１図で１〜８は１階〜８階の階床、
１１は１階のかご呼び１ａを持つて下降中の１号
機のかご、１２は４階の乗場下り呼び４ｂが割り
当てられて６階６を下降中の２号機のかごとし、
ここで５階の乗場下り呼び５ｂが登録されたとす
る。
このとき、４階の下り呼び４ｂが登録されてか
らの継続時間を５秒とし、かご１１，１２が１階
床を走行するに要する時間を２秒、１回の停止に
要する時間を10秒とする。そして、５階の乗場下
り呼び５ｂを２号機１２に仮に割り当てたとする
と、式から
tio（２号機）＝t5(2)＝２〔秒〕×１〔階〕＝２秒
ti（２号機）＝t4(2)＝２〔秒〕×１〔階〕
＋10〔秒〕＋２〔秒〕×１〔階〕＋５〔秒〕＝19秒
Ti（２号機）＝T4(2)＝２〔秒〕×２〔階〕＋５秒
＝９秒
となるから、２号機の割当評価値E2は次のよう
に計算される。
E2＝２＋（19−９）＝12秒
同様にして、１号機１１に仮り割り当てたとす
ると、tio及びtiは共に０であるから、割当評価値
E1は、
E1＝２×２＋０＝４秒
となる。
その結果、５階の下り呼び５ｂは評価値Ｅの最
少のかご１号機１１に割り当てられることにな
る。そのため、既にタンゴ運転状態にある１号機
１１と２号機１２はそれぞれ５階５及び４階４に
停止し、やはりタンゴ運転状態は解消されないこ
とになる。したがつて、次に発生する乗場呼びへ
の応答が遅れてしまう。
このような群管理についてシミユレーシヨン及
び交通実測を行うと、待時間の累積分布は第２図
に示すようにかなり広い範囲に分布している。こ
れは待時間の短い待客もいれば、非常に長い待客
もいることを意味し、待客によつてかなりの差が
生じている。すなわち、乗場待客にとつてはどの
程度の時間待たされるか分からないので、その間
不安感と焦燥感を抱いていなければならない。ま
た、個人についてと同様に、各階ごとの平均待時
間も階によつて差が生じ、サービスの良い階に居
住している者は得をし、サービスが建物全体の平
均よりも良くない階に居住している者は損をする
ことになる。
この発明は上記不具合を改良するもので、乗場
呼に対する予測待時間が実測された平均待時間を
越えた場合には、予測待時間と平均待時間との偏
差を考慮に入れて割当てのための評価値を演算
し、また予測待時間が平均待時間以下のときは両
時間の偏差を考慮しないで評価値演算を行なうよ
うにし、もつて待時間の累積分布を平均値に近づ
け、各階各個人について公平なサービスが得られ
る割当てが行われるようにしたエレベータの群管
理装置を提供することを目的とする。
以下、第１図及び第３図〜第５図によりこの発
明の一実施例を説明する。
第３図中、１ｃ〜８ｃはそれぞれ１階〜８階の
乗場呼び（上り呼び及び下り呼びを含む）が登録
されると発せられる乗場呼び信号、１３は乗場呼
び信号１ｃ〜８ｃを入力しその継続時間すなわち
待時間の平均値を常時計算し、過去数分間の平均
値を平均待時間レジスタ１４に設定するデータ収
集装置で、１４ａは平均待時間信号、１５は電子
計算機を用いた群管理の割当装置で、新たに登録
された乗場呼びについて平均待時間信号１４ａを
基準にして最適なかごを割り当て、１号機への割
当信号１５ａまたは２号機への割当信号１５ｂを
発する。この割当装置１５は上述のとおり電子計
算機により構成されており、割当信号１５ａの出
力動作を行なう機能を果たすばかりでなく、次の
ような機能をも兼備している。すなわち、第４図
を用いて後で詳述するように、新たな呼びが登録
されるとこの乗場呼びを各かごに仮に割り当てた
ときの予測待時間と、既割当てのいくつかの乗場
呼びについての予測待時間とをそれぞれ演算する
演算手段として機能するとともに、その演算され
た予測待時間が平均待時間を越えた時には、予測
待時間と平均待時間との差の値（偏差）を考慮に
入れて割当てのための評価値を演算し、逆に予測
待時間が平均待時間以下のときは偏差を零とし
て、つまり偏差を考慮に入れずに評価値を演算す
る評価値演算装置としての機能を果たしている。
１６は１号機の制御回路、１７は２号機の制御回
路である。
次に、この実施例の動作を説明する。
今、新たな乗場呼びが登録されると、割当装置
１５は平均待時間信号１４ａを入力して、第４図
に示す流れ図に従つてかごの割当てが行われる。
すなわち、呼びが登録されると手順２０により
各かごに新たな呼びを仮割当し、手順２１によつ
て下記式による計算をする。これを手順２２に
よつてすべてのかごについて行い、それが終了す
れば、手順２３によつて割当評価値Enの最短の
かごに本割当して、割当終了となる。
手順２１中の評価式は、
This invention relates to an improvement in a device for group management of elevators. In recent years, many elevator group control devices have come to use electronic computers, and any control method can be programmed. However, in these group control devices, when a new hall call is registered, the car that is expected to arrive the earliest for this call, the car that is closest to this call, or the landing that has already been assigned to each car is The farthest call (with the longest predicted wait time)
The cars are assigned so that the expected waiting time for each is the shortest. In other words, the assignment is made only under the current situation, regardless of past traffic conditions that change from moment to moment. For example, when a new hall call is registered, assuming that this hall call is assigned to each car, an increase in predicted waiting time for hall calls already assigned to each car is calculated. Then, the increased waiting time of each allocated call is added for each car, and the new hall call is allocated to the car for which the added value is the smallest.
This can be expressed numerically as follows. Here, En: Allocation evaluation value for car n.tio(n): Predicted waiting time at landing (io) when hall call io is provisionally allocated to car n.ti(n): Landing call io is provisionally allocated to car n. Then, the predicted waiting time at landing (i) that was already assigned to car n is: the predicted waiting time at landing (i) that was already allocated to car n. Then, the car with the lowest allocation evaluation En is called
io is assigned. For example, in Figure 1, 1 to 8 are floors 1 to 8,
11 is the car of No. 1 which is descending with the car call 1a on the 1st floor, 12 is the car of No. 2 which is descending from the 6th floor 6 and has been assigned the down call 4b on the 4th floor.
Here, it is assumed that a call 5b for going down the landing on the 5th floor is registered. At this time, the duration time after the fourth floor down call 4b is registered is 5 seconds, the time required for the cars 11 and 12 to travel on the first floor is 2 seconds, and the time required for one stop is 10 seconds. shall be. Then, if we temporarily assign the 5th floor landing call 5b to the 2nd car 12, then from the formula tio (2nd car) = t 5 (2) = 2 [seconds] x 1 [floor] = 2 seconds ti (2nd car) = t 4 (2) = 2 [seconds] × 1 [floor] + 10 [seconds] + 2 [seconds] × 1 [floor] + 5 [seconds] = 19 seconds Ti (Unit 2) = T 4 (2) = 2 [ seconds] x 2 [floors] + 5 seconds = 9 seconds, so the allocation evaluation value E 2 for the second car is calculated as follows. E 2 = 2 + (19-9) = 12 seconds Similarly, if we temporarily allocate to Unit 1 11, both tio and ti are 0, so the allocation evaluation value
E 1 is E 1 =2×2+0=4 seconds. As a result, the down call 5b on the 5th floor is assigned to car No. 1 11 with the lowest evaluation value E. Therefore, the No. 1 machine 11 and the No. 2 machine 12, which are already in the tango operation state, stop on the 5th floor 5 and the 4th floor 4, respectively, and the tango operation state remains unchanged. Therefore, the response to the next hall call will be delayed. When simulations and actual traffic measurements are conducted regarding such group management, the cumulative distribution of waiting times is distributed over a fairly wide range as shown in FIG. This means that some customers wait for a short time while others wait for a very long time, and there are considerable differences depending on the type of customer. In other words, passengers waiting at the boarding point do not know how long they will have to wait, so they must feel anxious and anxious during that time. In addition, as with individuals, the average waiting time for each floor also differs depending on the floor, with those living on floors with good service benefiting, and those living on floors with poor service compared to the average for the entire building. Residents will suffer losses. This invention improves the above-mentioned problem, and when the predicted waiting time for a hall call exceeds the actually measured average waiting time, the deviation between the predicted waiting time and the average waiting time is taken into consideration. The evaluation value is calculated, and when the predicted waiting time is less than the average waiting time, the evaluation value is calculated without taking into account the deviation between the two times, thereby bringing the cumulative distribution of waiting times closer to the average value and making it easier for each individual on each floor. An object of the present invention is to provide a group management device for elevators that allows allocation to provide fair service for elevators. Hereinafter, one embodiment of the present invention will be described with reference to FIG. 1 and FIGS. 3 to 5. In Fig. 3, 1c to 8c are hall call signals that are issued when hall calls (including up calls and down calls) for the 1st to 8th floors are registered, respectively, and 13 is a hall call signal that is input when the hall call signals 1c to 8c are input. It is a data collection device that constantly calculates the average value of the duration time, that is, the waiting time, and sets the average value for the past several minutes in the average waiting time register 14. 14a is the average waiting time signal, and 15 is the group control using a computer. The allocation device allocates an optimal car to the newly registered hall call based on the average waiting time signal 14a, and issues an allocation signal 15a to the first car or an allocation signal 15b to the second car. This allocation device 15 is constituted by an electronic computer as described above, and not only performs the function of outputting the allocation signal 15a, but also has the following functions. In other words, as will be explained in detail later using FIG. 4, when a new call is registered, the predicted waiting time when this hall call is provisionally assigned to each car, and the estimated waiting time for some hall calls that have already been assigned are calculated. It functions as a calculation means for calculating the predicted waiting time of functions as an evaluation value calculation device that calculates the evaluation value for allocation by inputting the data, and calculates the evaluation value without taking the deviation into account, conversely, when the predicted waiting time is less than the average waiting time, the deviation is set to zero. is fulfilled.
16 is a control circuit for the first machine, and 17 is a control circuit for the second machine. Next, the operation of this embodiment will be explained. Now, when a new hall call is registered, the allocation device 15 inputs the average waiting time signal 14a and allocates the car according to the flowchart shown in FIG. That is, when a call is registered, a new call is tentatively assigned to each car in step 20, and calculation is performed using the following formula in step 21. This is done for all the cars in step 22, and when it is completed, the actual allocation is made to the car with the shortest allocation evaluation value En in step 23, and the allocation is completed. The evaluation formula in step 21 is
【式】
（ただしtiToとなる乗場について）……
ここに、To：データ収集装置１３から送られ
て来る平均待時間の値
であり、式のTiがToに置き換わつている。
さて、現在の平均待時間Toが20秒であるとす
ると、第１図の状態で２号機の割当評価値E2は
式から、
E2＝２×１＋（19−20）→２×１＋０＝２秒
（19＜20であるので（ ）内は「０」とする）
となり、E1は上述と同様４秒であるから、この
場合５階の下り呼び５ｂは２号機１２に割り当て
られることになる。したがつて、１号機１１と２
号機１２のタンゴ運転は解消される。
上記計算でわかるように、既に割り当てられて
いる乗場呼びの中で、予測待時間がti＜Toとなる
ものについては、仮割当て後の予測待時間の増分
は無視される。したがつて、各かごに既に割り当
てられている乗場呼びの予測待時間が仮割当て後
もすべて平均待時間Toよりも短い場合は、式
のtio（ｎ）により、乗場呼びioの登録された乗場
に最も早く到着するかごが割り当てられる。
仮割当てした場合、平均待時間Toよりも長く
なるような割当呼びを持つたかごは、平均待時間
Toよりも増えた分を上積みして評価値Enとす
る。そして、評価値Enが最小のかごに割り当て
ることによつて、すべての待時間を現在の平均時
間に近づけることが可能になる。すなわち、待時
間の累積分布は第５図に示すように、ほとんどの
呼びが平均値に近くなり、かつ最大待時間も著し
く短かくすることがシミユレーシヨンによつて確
認されている。
このように、乗場呼びの待時間は平均待時間に
近い値となれば、待客一人一人の待時間もあまり
差のない平等なものとなる。また、同様に各階ご
との平均待時間も平等となり、階ごとのサービス
も均等なものとなる。
なお、データ収集装置１３は別の装置として説
明したが、割当装置１５と同一の電子計算機を用
いることも可能である。
以上述べたとおり、この発明は既割当て乗場呼
びに対する予測待時間（ti）が平均待時間（To）
よりも大きい場合は、この平均待時間（To）と
の偏差を評価値に算入し、逆に予測待時間（ti）
が平均待時間（To）以下のときは偏差を零、つ
まり偏差を評価値に算入せず、予測待時間
（tio）そのものを評価値としたので、平均待時間
（To）を越えるかごへの割当てを抑えて、上記予
測待時間（ti）を平均待時間（To）に近づけるこ
とができる。
また、平均待時間（To）は、実測値を用いる
ようにしたので、ビルの実情に合つた正確な評価
値を算出でき、この発明の効果を高めることがで
きるものである。[Formula] (For the boarding area tiTo)... Here, To: is the value of the average waiting time sent from the data collection device 13, and Ti in the formula is replaced by To. Now, assuming that the current average waiting time To is 20 seconds, the allocation evaluation value E 2 of the second machine in the condition shown in Figure 1 is calculated from the formula, E 2 = 2 × 1 + (19-20) → 2 × 1 + 0 = 2 seconds (19 < 20, so the numbers in parentheses are "0"), and E 1 is 4 seconds as above, so in this case, the down call 5b on the 5th floor will be assigned to Unit 2 12. Become. Therefore, Unit 1 11 and 2
Tango operation of Unit 12 will be canceled. As can be seen from the above calculation, for hall calls that have already been assigned and for which the predicted waiting time satisfies ti<To, the increase in the predicted waiting time after provisional allocation is ignored. Therefore, if the predicted waiting times of the hall calls already assigned to each car are all shorter than the average waiting time To even after provisional allocation, the registered hall of the hall call io is determined by the formula tio(n). The earliest arriving car will be assigned. If tentatively allocated, a car with an assigned call that will be longer than the average waiting time To will have an average waiting time of
The amount increased from To is added to the evaluation value En. By allocating to the car with the smallest evaluation value En, it becomes possible to bring all waiting times closer to the current average time. That is, as shown in FIG. 5, it has been confirmed through simulation that the cumulative distribution of waiting times is close to the average value for most calls, and the maximum waiting time is also significantly short. In this way, if the waiting time for a hall call becomes a value close to the average waiting time, the waiting time of each waiting customer will be equal without much difference. Similarly, the average waiting time for each floor will be equal, and the services for each floor will also be equal. Although the data collection device 13 has been described as a separate device, it is also possible to use the same computer as the allocation device 15. As described above, the present invention has the advantage that the predicted waiting time (ti) for an already allocated hall call is equal to the average waiting time (To).
If it is larger than the average waiting time (To), the deviation from this average waiting time (To) is included in the evaluation value, and conversely the predicted waiting time (ti)
When is less than the average waiting time (To), the deviation is zero, that is, the deviation is not included in the evaluation value, and the predicted waiting time (tio) itself is used as the evaluation value. By suppressing allocation, the predicted waiting time (ti) can be brought closer to the average waiting time (To). In addition, since the average waiting time (To) uses an actual measured value, it is possible to calculate an accurate evaluation value that matches the actual situation of the building, thereby increasing the effectiveness of the present invention.
第１図はエレベータのかごと呼びの関係説明
図、第２図は従来のエレベータの群管理運転によ
る乗場待時間の累積分布図、第３図はこの発明に
よるエレベータの群管理装置の一実施例を示すブ
ロツク図、第４図は第３図の割当装置の動作の流
れ図、第５図は第３図の運転による乗場待時間の
累積分布図である。
１ｃ〜８ｃ……１階〜８階の乗場呼び信号、１
３……データ収集装置、１４……平均待時間レジ
スタ、１５……割当装置、１６，１７……１号機
及び２号機の制御回路。
FIG. 1 is an explanatory diagram of the relationship between elevator cars and calls, FIG. 2 is a cumulative distribution diagram of landing waiting times due to conventional elevator group management operation, and FIG. 3 is an example of an elevator group management device according to the present invention. FIG. 4 is a flow chart of the operation of the allocating device shown in FIG. 3, and FIG. 5 is a cumulative distribution diagram of the waiting time at the boarding hall due to the operation shown in FIG. 3. 1c to 8c... Hall call signals for 1st to 8th floors, 1
3... Data collection device, 14... Average waiting time register, 15... Allocation device, 16, 17... Control circuit for the first and second machines.
Claims (1)
る複数のかごの一つに割り当てて応答させるよう
にしたものにおいて、上記かごが上記乗場呼びに
応答するまでの待時間を過去の所定時間帯につい
て実測しその平均待時間（To）を計算するデー
タ収集装置、新たな乗場呼びが登録されるとこの
乗場呼びを仮に割り当てたときの予測待時間
（tio）と既割当ての複数の乗場呼びについての予
測待時間（ti）とをそれぞれ演算する演算手段、
上記予測待時間（ti）が上記平均待時間（To）を
越えるときは上記予測待時間（ti）と上記平均待
時間（To）との差値（ti−To）を偏差とし、上
記予測待時間（ti）が上記平均待時間（To）以下
のときは零値を上記偏差として既割当ての乗場呼
びの全てについて上記偏差の総和を求め、更にこ
の総和と上記予測待時間（tio）との和を求めて
評価値とし、この評価値を上記かごごとに演算す
る評価値演算装置、上記評価値が最小となるかご
に上記新たな乗場呼びを割り当てる割当装置を備
えたエレベータの群管理装置。1. When a hall call is registered, it is assigned to one of a plurality of cars managed as a group to respond, and the waiting time for the car to respond to the hall call is determined regarding the predetermined time period in the past. A data collection device that measures the actual waiting time and calculates the average waiting time (To), and when a new hall call is registered, the predicted waiting time (tio) when this hall call is provisionally assigned and the estimated waiting time (tio) for the multiple hall calls that have already been assigned. calculation means for calculating the predicted waiting time (ti), respectively;
When the above predicted waiting time (ti) exceeds the above average waiting time (To), the difference value (ti−To) between the above predicted waiting time (ti) and the above average waiting time (To) is taken as the deviation, and the above predicted waiting time When the time (ti) is less than or equal to the above average waiting time (To), the above deviation is set to zero, and the sum of the above deviations is calculated for all the already allocated hall calls, and then this sum and the above predicted waiting time (tio) are calculated. An elevator group management device comprising: an evaluation value calculation device which calculates the sum as an evaluation value and calculates the evaluation value for each car; and an allocation device which allocates the new hall call to the car with the minimum evaluation value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP6666180A JPS56165672A (en) | 1980-05-20 | 1980-05-20 | Controller for group of elevator |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP6666180A JPS56165672A (en) | 1980-05-20 | 1980-05-20 | Controller for group of elevator |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS56165672A JPS56165672A (en) | 1981-12-19 |
| JPS6153976B2 true JPS6153976B2 (en) | 1986-11-20 |
Family
ID=13322300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP6666180A Granted JPS56165672A (en) | 1980-05-20 | 1980-05-20 | Controller for group of elevator |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS56165672A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02502481A (en) * | 1987-02-26 | 1990-08-09 | ローベルト ボツシュ ゲゼルシャフト ミット ベシュレンクテル ハフツング | measurement receiving device |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5978077A (en) * | 1982-10-28 | 1984-05-04 | 株式会社東芝 | Method of controlling group of elevator |
| JPS60104594A (en) * | 1983-11-07 | 1985-06-08 | 凸版印刷株式会社 | Highly glossy corrugated board paper and its production |
| JPS6181369A (en) * | 1984-09-27 | 1986-04-24 | フジテツク株式会社 | Method of controlling group of elevator |
| JP4710229B2 (en) * | 2004-01-20 | 2011-06-29 | フジテック株式会社 | Elevator system and group management control device thereof |
| JP5879152B2 (en) * | 2012-02-24 | 2016-03-08 | 株式会社日立製作所 | Elevator arrival time estimation device, elevator system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5218655A (en) * | 1975-07-02 | 1977-02-12 | Hitachi Ltd | Elevator control system |
-
1980
- 1980-05-20 JP JP6666180A patent/JPS56165672A/en active Granted
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02502481A (en) * | 1987-02-26 | 1990-08-09 | ローベルト ボツシュ ゲゼルシャフト ミット ベシュレンクテル ハフツング | measurement receiving device |
Also Published As
| Publication number | Publication date |
|---|---|
| JPS56165672A (en) | 1981-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2935854B2 (en) | Elevator control device and elevator control method | |
| JP5464979B2 (en) | Elevator group management system | |
| KR940009411B1 (en) | Elevator control | |
| JP2001519307A (en) | Elevator group control method | |
| JP5951421B2 (en) | Elevator group management system | |
| US6439349B1 (en) | Method and apparatus for assigning new hall calls to one of a plurality of elevator cars | |
| CN104291170B (en) | Elevator set management and control device and eleva-tor bank management control method | |
| JPH04246076A (en) | Compensating method for predicted value for traffic variation for operation control device for elevator | |
| JPH0610069B2 (en) | Elevator group management device | |
| JPS6153976B2 (en) | ||
| JP7169448B2 (en) | Elevator group management system | |
| JPH01275382A (en) | How to assign hall calls to elevator cars | |
| JPS6056784A (en) | Controller for group of elevator | |
| KR102432693B1 (en) | Elevator group control method | |
| JPH0476914B2 (en) | ||
| JPS6124295B2 (en) | ||
| JP7790853B1 (en) | Group management device | |
| JPH04133981A (en) | elevator control device | |
| JPH03272979A (en) | Group management device of elevator | |
| JPS6259032B2 (en) | ||
| JP6420217B2 (en) | Elevator device and control method of elevator device | |
| JPH0662259B2 (en) | Elevator group management control method | |
| JPS6334111B2 (en) | ||
| JPH0656361A (en) | Group-control system of elevator | |
| JPS61130188A (en) | Platform calling generation frequency predicting method of elevator |