JPH02132077A - Group management control device for elevator - Google Patents
Group management control device for elevatorInfo
- Publication number
- JPH02132077A JPH02132077A JP63283266A JP28326688A JPH02132077A JP H02132077 A JPH02132077 A JP H02132077A JP 63283266 A JP63283266 A JP 63283266A JP 28326688 A JP28326688 A JP 28326688A JP H02132077 A JPH02132077 A JP H02132077A
- Authority
- JP
- Japan
- Prior art keywords
- floor
- car
- elevator
- destination floor
- registered
- 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
Links
- 238000001514 detection method Methods 0.000 claims description 6
- SAZUGELZHZOXHB-UHFFFAOYSA-N acecarbromal Chemical compound CCC(Br)(CC)C(=O)NC(=O)NC(C)=O SAZUGELZHZOXHB-UHFFFAOYSA-N 0.000 claims description 2
- 230000008685 targeting Effects 0.000 claims 1
- 238000000034 method Methods 0.000 abstract description 14
- 238000010586 diagram Methods 0.000 description 7
- 230000000694 effects Effects 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002269 spontaneous effect Effects 0.000 description 1
Landscapes
- Elevator Control (AREA)
Abstract
Description
（産業上の利用分野〕
この発明は、乗場からの行先階情報に基づいて最適エレ
ベータかごを選択し応答させる群管理エレベータシステ
ムにおけるエレベータの群管理制御装置に関するもので
ある。
〔従来の技術〕
従来のこの種の群管理制御装置は、例えば特開昭５Ｂ−
１６７３６４号公報に示されるものが知られている。
このような従来の装置では、サービス階不揃いの複数機
のエレベータに対し、共通の乗場からの行先階情報に基
づきこの乗場と行先階とを共にサービス可能なかごを選
択し、その内の最適なかごをサービスかととして提供す
るように構成されている。
登録された行先階と乗場とを共にサービスするかごの中
から最適かごを割当てるためには、所定の手順に従って
評価値を計算しその評価値の高いかごを選択して乗場に
サービスさせる。
このような従来の装置において、特定のかごに対し割当
てを行なった後、その乗場において割当てかごがサービ
ス出来ない行先階が引き続いて登録された場合にはさら
に別のかごを割当てる。
（発明が解決しようとする課題〕
このように従来の制御装置では、乗場と行先階とをサー
ビスするかご“が一坦割当てられた後に、再び同一の乗
場から別の行先階が登録された場合に、先に割当てられ
たエレベータかとが後に登録された行先階をサービス出
来ない場合には、同一乗場において別のエレベータかご
を割当てなければならず、エレベータの運転効率が悪く
なるという課題があった．
この発明は、上記のような課題を解消するためになされ
たもので、同一の乗場において後に登録された行先陶に
対しても可能な限り前に割当てられたエレベータかとが
サービス可能となるように制御を行ない、エレベータの
効率的な運転を実現すると共に省エネルギーを図ったエ
レベータの群管理制御装置を提供することを目的とする
。
（課題を解決するための手段）
この発明に係るエレベータの群管理制御装置は、行先階
情報を得た乗場と登録された行先階とを共にサービス可
能な最適かごを選択して割当てる割当てかご選択手段と
、既に割当てられたかごが同じ乗場から後で登録された
行先階をもサービス出来るか否かを判定するサービス可
否検知手段と、前記判定結果が否であった場合、改めて
同じ乗場から登録された全ての行先階をサービス出来る
かごを選択し、前記割当てかご選択手段に対し変更を指
示する割当てかご変更手段とを設けたものである．(Industrial Application Field) The present invention relates to an elevator group management control device in a group management elevator system that selects and responds to an optimal elevator car based on destination floor information from a landing. [Prior Art] Conventional Art This type of group management control device is known, for example, from Japanese Patent Application Laid-Open No. 5B-1998.
One disclosed in Japanese Patent No. 167364 is known. In such conventional devices, for multiple elevators with uneven service floors, based on destination floor information from a common landing, a car that can service both this landing and the destination floor is selected, and the most suitable car among them is selected. It is configured to provide the basket as a service. In order to allocate the optimal car from among the cars that serve both the registered destination floor and the landing, evaluation values are calculated according to a predetermined procedure, and the car with the highest evaluation value is selected and served at the landing. In such a conventional device, after a specific car is assigned, if a destination floor that cannot be serviced by the assigned car at that landing is subsequently registered, another car is further assigned. (Problem to be Solved by the Invention) In this way, in the conventional control device, after a car serving a landing and a destination floor is assigned, if another destination floor is registered from the same landing, However, if the elevator that was assigned earlier cannot service the destination floor that was registered later, another elevator car must be assigned at the same landing, which causes a problem in that the efficiency of elevator operation deteriorates. ．This invention was made to solve the above-mentioned problem, and it is designed to enable services to be provided by elevators previously assigned as much as possible even for destinations registered later at the same boarding point. It is an object of the present invention to provide an elevator group management control device that performs control to achieve efficient elevator operation and save energy. (Means for Solving the Problems) An elevator group according to the present invention The management control device includes an assigned car selection means that selects and allocates an optimal car that can serve both the landing from which destination floor information has been obtained and the registered destination floor, and an allocation car selection means that selects and allocates an optimal car that can serve both the landing from which destination floor information has been obtained and the registered destination floor, and an allocation car selecting means that selects and allocates an optimal car that can service both the landing from which the destination floor information has been obtained and the registered destination. a service availability detection means for determining whether or not the service can service all the destination floors registered from the same landing; The system is equipped with an assigned car changing means for instructing the car selecting means to change the car.
この発明における割当てかご変更手段は、前に割当てら
れたエレベータかとが後に登録された行先階にサービス
不可能であった場合、いずれの行先階にもサービス出来
るようかごの割当て変更を行なう。
〔実施例〕
以下この発明の一実施例を第１図に基づいて説明する。
第１図はこの発明の一実施例の全体構成を示すブロック
図である．
（１）は乗場に設置されている行先階釦等の乗場呼び釦
、（３）は周知の割当てかご選択手段、（６）は周知の
かご制御装置である．乗場呼び釦（１）が操作され行先
階が指定されると、この乗場呼び釦（１）に接続されて
いる行先階情報取得手段（２）がその行先階を登録し、
その行先階情報を割当てかご選択手段（３）に出力する
．
割当てかご選択手段（３）は、その乗場と登録された行
先階とを共にサービスできるかごの中から最適かごを選
択する。そしてかご制御装置（６）に対し、選択した最
適かごを乗場に向わせるよう指令する。
行先階情報取得手段（２）の出力は、サービス可否検知
手段（４）にも人力されており、サービス可否検知手段
（４）は、既に割当てられたかごが同一乗場において後
に登録された行先階に対し同時にサービスが可能かどう
かを判断する機能を持っている。
先に割当てられたサービスかとが後に入力された行先隋
をサービス出来ない場合、サービス可否検知手段（４）
は割当てかご変更手段（５）に対し、登録されている全
ての行先階をサービスできるかごに割当て変更を指令す
る。この場合新たに割当てしたかごのかご制御装置（６
）に対しては割当て登録指令を割当て、かご選択手段（
３）を介して出力し、割当て変更により割当てキャンセ
ルされるかごの割当てキャンセル指令を出力する。
通常行先階情報取得手段（２）、割当てかご選択手段（
３）、サービス可否検知手段（４）および割当てかご変
更手段（５）はマイクロコンピュータ（ｌＯ）で構成さ
れており、第２図にそのブロック回路図を示す。
マイクロコンピュータ（１０）は、中央処理装者（ＣＰ
Ｕ） （ＩＯＡ）、プログラムおよび固定値のデータを
格納する読出し専用メモリと演算結果等のデータを一時
格納する読み出し専用メモリからなる記憶装置（ＩＯＢ
） 、かご制御装置（６）との間でデータの送受信を行
なう伝送装置（ＩＯＣ）及び行先階釦（１）に接続され
、入出力信号レベルを変換する変換装置（ＩＯＣ）とか
ら構成されている．
第３図は、群６機、サービス階床数１０階床の群管理エ
レベータのサービス可否を示す図で、図中にｘ印の付さ
れた階床に対してはサービスが不可能であることを示し
ている．すなわちＡ−Ｃ号機は、８〜１０階床に対して
はサービス不可能であることを示す．
以下第１図および第２図に示す装置の動作を第４図およ
び第５図に示すフローチャートに基づいて詳細に説明す
る。
なお説明の便宜上、第３図に示すような群管理エレベー
タにおいて、ｌｌ１ｉの乗場で行先階として５階、９階
の順に登録がされた場合を例にとって説明をする．
第４図に示すフローチャートは、割当てかご選択プログ
ラムにより乗場の行先階が登録された時起動する。まず
１階の乗場で５階の行先階が登録されると、ステップ４
０１で割当てかごが選択されていないため、ステップ４
０３に進み、その乗場（１階）と行先階（５階）とを共
にサービス可能なかと（第３図においてＡ−Ｆ機）より
最通なかごが選択され、割当て処理が終了する．次に割
当てかごが到着する前に、同じ乗場（１階）で９階の行
先階が登録されると、ステップ４０１で割当てかごは既
に選択されているため、ステップ４０２に進み、既に割
当てされているかごが新たに登録された行先階（９階）
をサービス可能かどうか判断される．サービス可能なら
ば処理を終了し、サービス不可能ならばその乗場（１階
）と新たに登録された行先階（９階）を共にサービス可
能なかと（Ｄ−Ｆ号機）より最通なかごを選択して割当
てし処理を完了する。
第５図に示すフローチャートは、割当てかご制御プログ
ラムを示し、第４図のフローチャートに従って割当てが
登録された時に起動する．まず５階の行先階が登録され
かごが割当てられた時には、ステップ５０１において割
当てかごは１台と判断されるため、ステップ５０６に進
み割当てかごの制御装置（６）に対し割当て登録して処
理を終了する。
次に９階の行先階が登録され、新たなかごが割当てられ
た時には、割当てかごは２台となっているため、ステッ
プ５０１からステップ５０２へと進み、１台めの割当て
かごに登録されている行先階（５階）を２台めの割当て
かごがサービス可能か否かを判断する。サー゛ビス可能
ならばステップ５０３に進み、最初の呼びのＮ続時間と
２台目の割当てかごの到着予想時間との和が規定値以内
かどうかを判断する。これが規定値以内であれば、ステ
ップ５０４に進み、１台目の割当てかごに登録されてい
る行先階を２台目の割当てかごに割当て変更し、ステッ
プ５０５ 、５０６に進んで割当て変更を該当かどのか
ご制御装置に指令し、処理を完了する。
またステップ５０２で１台目の割当てかごに登録されて
いる行先階を２台目の割当てかごがサービス出来ないと
判断した時や、ステップ５０３において最初の呼びの継
続時間と２台目の割当てかごの到着予測時間との和が規
定値を越えると判断した時には、ステップ５０６に進み
、新たな割当てかごのかご制御装置に対し割当て登録を
行ない処理を終了する．
なお以上説明した実施例では、第３図に示すようなケー
スにおいて、１階での行先階登録を例にとって説明した
が、この発明はサービス階床数やかご台数にはまったく
無関係に全階床において行先階登録を行なう場合につい
て通用出来る．また前述の実施例では、割当て変更を行
なうかどうかの判定条件として最初の呼びの継続時間と
２台目の割当てかごの到着予想時間との和を用いたが、
この発明における判定条件はこれに限定されるものでは
なく、他の条件、即ち割当てされている２台のかごの到
着予想時間の差や最初の呼びが長待ちとなっているかど
うか等を判定条件とすることも出来る．
〔発明の効果〕
以上説明したようにこの発明によれば、既に割当てされ
ているかごが後に登録された行先階をサービス出来ない
と判定された場合、その乗場と既登録の全ての行先階と
をサービス可能なかごを改めて選択し、その選択された
かごに対し、割当て変更をするようにしているため同一
乗場で同一方向に２台以上不必要にかごを割当てするこ
とが無くなり、エレベータの運転効率の悪化を防止する
ことができるという効果がある．The assigned car changing means in this invention changes the assignment of the car so that it can service any destination floor when the previously assigned elevator is unable to service the destination floor registered later. [Embodiment] An embodiment of the present invention will be described below with reference to FIG. FIG. 1 is a block diagram showing the overall configuration of an embodiment of the present invention. (1) is a hall call button such as a destination floor button installed in a hall, (3) is a well-known assigned car selection means, and (6) is a well-known car control device. When the hall call button (1) is operated to specify the destination floor, the destination floor information acquisition means (2) connected to the hall call button (1) registers the destination floor,
The destination floor information is output to the assigned car selection means (3). The allocated car selection means (3) selects the optimum car from among the cars that can serve both the landing and the registered destination floor. Then, it instructs the car control device (6) to direct the selected optimal car to the landing. The output of the destination floor information acquisition means (2) is also manually input to the service availability detection means (4), and the service availability detection means (4) detects the destination floor where the already allocated car was registered later at the same landing. It has a function that simultaneously determines whether or not service is possible. If the previously assigned service cannot service the destination Sui entered later, the service availability detection means (4)
commands the car assignment changing means (5) to change the assignment to a car that can service all the registered destination floors. In this case, the newly assigned car controller (6
), the allocation registration command is assigned to the car selection means (
3), and outputs an allocation cancellation command for the car whose allocation is canceled due to the allocation change. Normal destination floor information acquisition means (2), assigned car selection means (
3), the service availability detecting means (4) and the assigned car changing means (5) are constituted by a microcomputer (IO), the block circuit diagram of which is shown in FIG. The microcomputer (10) is a central processor (CP).
U) (IOA), a storage device (IOB) consisting of a read-only memory that stores programs and fixed value data, and a read-only memory that temporarily stores data such as calculation results.
), a transmission device (IOC) that transmits and receives data with the car control device (6), and a conversion device (IOC) that is connected to the destination floor button (1) and converts the input/output signal level. There is. Figure 3 is a diagram showing the availability of service for a group control elevator with 6 aircraft in a group and 10 service floors.Service is not available for the floors marked with an x in the diagram. It shows. This means that A-C cannot service floors 8-10. The operation of the apparatus shown in FIGS. 1 and 2 will be explained in detail below based on the flowcharts shown in FIGS. 4 and 5. For convenience of explanation, the explanation will be based on an example in which the 5th floor and the 9th floor are registered as destination floors in order at the landing of ll1i in a group control elevator as shown in FIG. 3. The flowchart shown in FIG. 4 is activated when the destination floor of the landing is registered by the assigned car selection program. First, when the destination floor of the 5th floor is registered at the landing on the 1st floor, step 4
Since no allocated car is selected in step 01, step 4
The process proceeds to step 03, and a connecting car is selected based on whether it can service both the landing (first floor) and the destination floor (fifth floor) (aircraft A to F in FIG. 3), and the allocation process ends. Next, if the destination floor of the 9th floor is registered at the same landing (1st floor) before the assigned car arrives, the assigned car has already been selected in step 401, so the process advances to step 402 and the assigned car is registered. Destination floor where the basket was newly registered (9th floor)
It is determined whether the service is possible. If the service is possible, end the process, and if the service is not possible, check if the platform (1st floor) and the newly registered destination floor (9th floor) can be serviced (cars D-F) and send a connecting car. Select and assign to complete the process. The flowchart shown in FIG. 5 shows the allocation car control program, which is activated when the allocation is registered according to the flowchart shown in FIG. First, when the destination floor of the 5th floor is registered and a car is allocated, it is determined in step 501 that there is only one car allocated, so the process proceeds to step 506, where the allocation is registered to the control device (6) of the allocated car and processing is performed. finish. Next, when the destination floor of the 9th floor is registered and a new car is allocated, there are two allocated cars, so the process proceeds from step 501 to step 502, and the first car is registered in the allocated car. It is determined whether the second assigned car can service the destination floor (fifth floor). If the service is possible, the process proceeds to step 503, where it is determined whether the sum of the N duration of the first call and the expected arrival time of the second assigned car is within a specified value. If this is within the specified value, proceed to step 504 and change the destination floor registered in the first allocated car to the second allocated car, and proceed to steps 505 and 506 to check whether the allocation change is applicable or not. Instruct which car control device to complete the process. In addition, when it is determined in step 502 that the second assigned car cannot service the destination floor registered in the first assigned car, or when it is determined in step 503 that the destination floor registered in the first assigned car cannot be serviced, When it is determined that the sum with the predicted arrival time exceeds the specified value, the process proceeds to step 506, where allocation registration is performed to the car control device of the newly allocated car, and the process ends. In the embodiment described above, in the case shown in FIG. 3, the registration of the destination floor on the first floor was explained as an example. This method can be used when registering a destination floor. Furthermore, in the above-mentioned embodiment, the sum of the duration of the first call and the expected arrival time of the second assigned car was used as the condition for determining whether to change the assignment.
The judgment conditions in this invention are not limited to these, but other conditions may also be used, such as the difference in the expected arrival times of the two assigned cars, whether there is a long wait for the first call, etc. It is also possible to do this. [Effects of the Invention] As explained above, according to the present invention, if it is later determined that the already allocated car cannot service the registered destination floor, the car that has already been allocated will be serviced at the landing and all the registered destination floors. Since the car that can be serviced is selected again and the allocation is changed for the selected car, there is no need to unnecessarily allocate two or more cars in the same direction at the same landing, and the elevator operation is improved. This has the effect of preventing deterioration in efficiency.
′ｓ１図はこの発明の一実施例の全体構成を示すブロッ
ク図、′！Ｊ２図はこの発明による各種手段を実現する
マイクロコンピュータの構成を示すブロック回路図、第
３図は群管理エレベータのサービス可否の一例を示す図
、第４図および第５図はこの発明の動作を説明するため
のフローチャートである．
（１ は乗場呼び釦、
（２ は行先階情報取得手段、
（３ は割当てかご選択手段、
（４ はサービス可否検知手段、
（５ は割当てかご変更手段、
（６ はかご制御装置、
（１０》はマイクロコンピュータ．
なお、図中同一符号は同一または相当部分を示す．
第
図
Ａ
Ｂ
Ｃ
Ｄ
Ｅ
Ｆ
手
続
補
正
書（自発）
ｌ．事件の表示
特願昭６３−２８３２６６号
２．発明の名称
エレベータの群管理制御装置
３．補正をする者
代表者
士
Ｉじ１
岐
守
哉
６．補正の内容
明細書第３頁第４行の
「一坦」
という記載を
ｒ一旦」
と補正する。
以
上's1 is a block diagram showing the overall configuration of an embodiment of the present invention, '! Figure J2 is a block circuit diagram showing the configuration of a microcomputer that implements various means according to the present invention, Figure 3 is a diagram showing an example of whether or not a group control elevator can be serviced, and Figures 4 and 5 illustrate the operation of the present invention. This is a flowchart for explanation. (1 is the hall call button, (2 is the destination floor information acquisition means, (3 is the allocated car selection means, (4 is the service availability detection means, (5 is the allocated car change means, (6 is the car control device, (10) is a microcomputer. In addition, the same reference numerals in the figures indicate the same or corresponding parts. Figure A B C D E F Procedural amendment (spontaneous) l. Indication of the case Patent application No. 1983-283266 2. Name of the invention Elevator Group management control device 3. Person making the amendment Representative Iji1 Kimoriya 6. The statement ``Itan'' on page 3, line 4 of the details of the amendment is amended to read ``Once''.
Claims (1)
場からの行先階情報に基づき最適エレベータかごを選択
して応答させるエレベータの群管理制御装置において、
前記行先階情報を得た乗場と登録された行先階とを共に
サービス可能な最適かごを選択して割当てする割当てか
ご選択手段と、既に割当てされたかごが同じ乗場から後
で登録された行先階をもサービス出来るか否かを判定す
るサービス可否検知手段と、前記判定結果が否であった
場合、改めて同じ乗場から登録されたすべての行先階を
サービス出来るかごを選択し前記割当てかご選択手段に
対し変更を指示する割当てかご変更手段とを備えたこと
を特徴とするエレベータの群管理制御装置。In an elevator group management control device that selects and responds to the optimal elevator car based on destination floor information from the landing, targeting multiple elevators with uneven service floors.
an assigned car selection means for selecting and allocating an optimal car that can serve both the landing from which the destination floor information has been obtained and the registered destination floor; and a destination floor to which the already allocated car is later registered from the same landing. a service availability detection means for determining whether or not the service can also be serviced; and, if the determination result is negative, a car that can service all the registered destination floors from the same landing is selected again, and the assigned car selection means 1. A group management control device for an elevator, comprising: means for changing assigned cars.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP63283266A JPH0764487B2 (en) | 1988-11-09 | 1988-11-09 | Elevator group management control device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP63283266A JPH0764487B2 (en) | 1988-11-09 | 1988-11-09 | Elevator group management control device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH02132077A true JPH02132077A (en) | 1990-05-21 |
| JPH0764487B2 JPH0764487B2 (en) | 1995-07-12 |
Family
ID=17663230
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP63283266A Expired - Lifetime JPH0764487B2 (en) | 1988-11-09 | 1988-11-09 | Elevator group management control device |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH0764487B2 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006124053A (en) * | 2004-10-26 | 2006-05-18 | Toshiba Elevator Co Ltd | Group management control device for elevator |
| JP2016055976A (en) * | 2014-09-09 | 2016-04-21 | 東芝エレベータ株式会社 | Group control system of elevator |
| JP2017504542A (en) * | 2014-01-31 | 2017-02-09 | ティッセンクルップ エレベーター アクツィエンゲゼルシャフトＴｈｙｓｓｅｎＫｒｕｐｐ Ｅｌｅｖａｔｏｒ ＡＧ | How to operate an elevator system |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SG134995A1 (en) * | 2002-11-06 | 2007-09-28 | Inventio Ag | Method of and device for controlling a lift installation with zonal control |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5661280A (en) * | 1979-10-17 | 1981-05-26 | Hitachi Ltd | Elevator controller |
| JPS58167364A (en) * | 1982-03-24 | 1983-10-03 | 株式会社東芝 | Method of controlling group of elevator |
| JPS60191974A (en) * | 1984-03-09 | 1985-09-30 | 株式会社東芝 | Controller for group of elevator |
-
1988
- 1988-11-09 JP JP63283266A patent/JPH0764487B2/en not_active Expired - Lifetime
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5661280A (en) * | 1979-10-17 | 1981-05-26 | Hitachi Ltd | Elevator controller |
| JPS58167364A (en) * | 1982-03-24 | 1983-10-03 | 株式会社東芝 | Method of controlling group of elevator |
| JPS60191974A (en) * | 1984-03-09 | 1985-09-30 | 株式会社東芝 | Controller for group of elevator |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006124053A (en) * | 2004-10-26 | 2006-05-18 | Toshiba Elevator Co Ltd | Group management control device for elevator |
| JP4688469B2 (en) * | 2004-10-26 | 2011-05-25 | 東芝エレベータ株式会社 | Elevator group management control device |
| JP2017504542A (en) * | 2014-01-31 | 2017-02-09 | ティッセンクルップ エレベーター アクツィエンゲゼルシャフトＴｈｙｓｓｅｎＫｒｕｐｐ Ｅｌｅｖａｔｏｒ ＡＧ | How to operate an elevator system |
| JP2016055976A (en) * | 2014-09-09 | 2016-04-21 | 東芝エレベータ株式会社 | Group control system of elevator |
Also Published As
| Publication number | Publication date |
|---|---|
| JPH0764487B2 (en) | 1995-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JPH0635266U (en) | Elevator cage controller | |
| US6601678B2 (en) | Method of allocating elevator cars to operating groups of a destination call control | |
| US6439349B1 (en) | Method and apparatus for assigning new hall calls to one of a plurality of elevator cars | |
| US9126806B2 (en) | Elevator system with distributed dispatching | |
| JP3239587B2 (en) | Elevator group management device | |
| JP3650150B2 (en) | Instant sector allocation method | |
| JP2825299B2 (en) | Elevator group controller for immediate assignment of destination floor designation | |
| US4869348A (en) | Group control for elevators with immediate allocation of calls of destination | |
| JP7099504B2 (en) | Elevator controller | |
| JP2633681B2 (en) | Elevator group control device | |
| KR100294093B1 (en) | Group management control device of elevator | |
| JPH02132077A (en) | Group management control device for elevator | |
| JP2022032449A (en) | Group management control device and elevator group management system | |
| WO2020261361A1 (en) | Elevator group management system | |
| JPH08198529A (en) | Control device for double-deck elevator | |
| JP4358650B2 (en) | Elevator group management control device | |
| JPH02132079A (en) | Call registering device for elevator | |
| JPH07157209A (en) | Control device for elevator | |
| US7475757B2 (en) | Elevator dispatching with balanced passenger perception of waiting | |
| JP6759417B1 (en) | Elevator allocation device | |
| JPH03272979A (en) | Group management device of elevator | |
| JPS5948365A (en) | Elevator controller | |
| JPH02270780A (en) | Control device of elevator | |
| WO2005009879A1 (en) | Elevator dispatching with balanced passenger perception of waiting | |
| JPH09194151A (en) | Control device for elevator |