JP2023090222A - Group management control device and group management control method for multi-deck elevator - Google Patents

Group management control device and group management control method for multi-deck elevator Download PDF

Info

Publication number
JP2023090222A
JP2023090222A JP2021205084A JP2021205084A JP2023090222A JP 2023090222 A JP2023090222 A JP 2023090222A JP 2021205084 A JP2021205084 A JP 2021205084A JP 2021205084 A JP2021205084 A JP 2021205084A JP 2023090222 A JP2023090222 A JP 2023090222A
Authority
JP
Japan
Prior art keywords
car
candidate
cars
unit
processing
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
JP2021205084A
Other languages
Japanese (ja)
Other versions
JP7322127B2 (en
Inventor
俊雄 杉原
Toshio Sugihara
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.)
Toshiba Elevator and Building Systems Corp
Original Assignee
Toshiba Elevator 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 Toshiba Elevator Co Ltd filed Critical Toshiba Elevator Co Ltd
Priority to JP2021205084A priority Critical patent/JP7322127B2/en
Priority to CN202211602185.4A priority patent/CN116265364A/en
Publication of JP2023090222A publication Critical patent/JP2023090222A/en
Application granted granted Critical
Publication of JP7322127B2 publication Critical patent/JP7322127B2/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/02—Control systems without regulation, i.e. without retroactive action
    • B66B1/06—Control systems without regulation, i.e. without retroactive action electric
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
    • B66B1/3415—Control system configuration and the data transmission or communication within the control system
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/214—Total time, i.e. arrival time

Landscapes

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

Abstract

To achieve both improvement in group performance and reduction in processing time in a double-deck elevator.SOLUTION: A group management control device for collectively controlling a plurality of multi-deck elevators having a plurality of cars in a single unit comprises: a preselection processing unit that evaluates, according to predetermined rules, which car of the unit is allocated to a landing call for each unit in allocation processing for allocating a service car to the landing call generated at landing, and selects any one car for each unit as a candidate car; an operation forecast evaluation unit that executes operation forecast evaluation processing for calculating an index including a prediction value of a time to respond to each call for the case of tentative allocation to the candidate car and the case of non-tentative allocation to the candidate car for each unit; and an allocated car determination unit that determines a car to be allocated using the index, and allocates the landing call to the candidate car of the unit to be allocated.SELECTED DRAWING: Figure 1

Description

本発明の実施形態は、マルチデッキエレベータの群管理制御装置および群管理制御方法に関する。 The embodiments of the present invention relate to a multi-deck elevator group management control device and group management control method.

マルチデッキエレベータの一つであるダブルデッキエレベータの群管理システムを構成する各号機は上かごと下かごとを有する。ダブルデッキエレベータの群管理システムを利用する際、利用者が乗場で乗場呼びを登録すると、群管理システムは、その乗場呼びに対しサービスする号機と、その号機の上かご又は下かごのどちらかを選定し、決めたかごを乗場へ向かわせる「割当処理」を実行する。 Each elevator that constitutes a group management system for a double-deck elevator, which is one of multi-deck elevators, has an upper car and a lower car. When using the double-deck elevator group control system, when a user registers a hall call at the hall, the group management system selects the elevator car to service the hall call and either the upper car or the lower car of the elevator car. Execute the "assignment process" for directing the selected and determined car to the platform.

割当処理では、運行予測評価を伴う。運行予測評価では、各号機が、いつ・どの階に到着するかを予測し、新たに登録された呼びと、既に登録済みの呼びに対し、待ち時間などの予測値を算出する。 Allocation processing involves operation prediction evaluation. In the operation prediction evaluation, it predicts when and to which floor each car will arrive, and calculates predicted values such as waiting time for newly registered calls and already registered calls.

新たに登録された呼びに対しては、どの号機に割当てるかだけでなく、上かご又は下かごのどちらに割当てるかに応じて、異なる想定を行うことができ、その想定ごとに、運行予測評価を繰り返し行う必要がある。実際に割当てる前に、新しい呼びをいずれかのかごに割当てる場合を想定することを、「仮割当」という。 For a newly registered call, different assumptions can be made depending on whether it is assigned to an upper car or a lower car, as well as to which car it is assigned. must be repeated. The assumption that a new call will be assigned to one of the cars before the actual assignment is called "provisional assignment".

従来のダブルデッキエレベータにおける割当アルゴリズムでは、新たに登録された呼びを、各号機の下かごに仮割当する場合、上かごに仮割当する場合、どちらのかごにも仮割当しない場合のそれぞれを対象に、運行を予測して、各呼びに対する待ち時間などの群管理性能指標を評価していた。従って、１台のエレベータに１つのかごのみ有するシングルデッキエレベータによる割当アルゴリズムと比べ、割当てかごを決めるための評価に、多くの時間を要する課題があった。 Allocation algorithms for conventional double-deck elevators target cases in which a newly registered call is temporarily allocated to the lower car of each elevator, temporarily allocated to the upper car, and not temporarily allocated to either car. In addition, the group management performance index such as the waiting time for each call was evaluated by predicting the operation. Therefore, there is a problem that the evaluation for determining the assigned car takes much time compared to the assignment algorithm for a single-deck elevator having only one car per elevator.

従来のダブルデッキエレベータにおける割当アルゴリズムでは、処理時間短縮のため、新しい乗場呼びが登録されたときに、まず、どの号機に割当てるのかを決め、次に、その号機の上かご又は下かごのどちらに割当てるかを最終決定するように改良しているものもある。 In order to shorten the processing time, the allocation algorithm for conventional double-deck elevators first determines which car to allocate to when a new hall call is registered, and then decides which car to allocate to the upper car or lower car of that car. Some have been improved to make the final decision as to whether to allocate.

特開２０００－２７２８４７号公報JP-A-2000-272847

上述した従来の改良方法では、最初に号機を決める段階では、各号機で上かご・下かごのどちらを選ぶべきかが決まっていないので、新しい呼びを上かご又は下かごの一方に、仮で決めて仮割当した場合の運行予測評価を行い、次いで、仮割当するかごを上かごと下かごとの間で必要に応じて入れ替えて、最終的な割当かごを決めるなどの対応を要する。 In the above-mentioned conventional improvement method, at the stage of first determining the car number, it is not decided which of the upper car and the lower car should be selected for each car. It is necessary to perform operation prediction evaluation in the case of tentative assignment, and then replace tentatively assigned cars between the upper car and the lower car as necessary to determine the final assigned car.

しかし、この場合、運行予測評価を行ったときと異なるかごに仮割当すると、運行予測の内容と実際に見込まれる運行の誤差を生じ、群管理性能が悪化する懸念があった。 However, in this case, if a car is provisionally assigned to a car that differs from that at the time of operation prediction evaluation, there is a concern that an error will occur between the content of the operation prediction and the actual expected operation, and group control performance will deteriorate.

本発明は上記事情に鑑み、群性能の向上と処理時間の短縮とを両立させることのできるマルチデッキエレベータの群管理制御装置および群管理制御方法を提供することを目的とする。 SUMMARY OF THE INVENTION It is an object of the present invention to provide a multi-deck elevator group management control apparatus and a group management control method capable of achieving both improvement in group performance and reduction in processing time.

上記の目的を達成するための実施形態は、１台の号機に複数のかごを有するマルチデッキエレベータを、複数台まとめて制御する群管理制御装置において、予選処理部と、運行予測評価部と、割当かご決定部とを備える。予選処理部は、乗場で発生した乗場呼びに対し、サービスするかごを割当てる割当処理に際して、各号機を対象に、前記乗場呼びを、各号機のどのかごに割当てるかを、あらかじめ定めたルールにより評価し、号機ごとにいずれか１台のかごを候補かごとして選定する。運行予測評価部は、各号機を対象に、前記候補かごに仮割当する場合と、仮割当しない場合について、各呼びに応答するまでの時間の予測値を含む指標を算出する運行予測評価処理を実施する。割当かご決定部は、前記指標を用いて割当てる号機を決定し、前記割当てる号機の候補かごに、前記乗場呼びを割当てる。 An embodiment for achieving the above object is a group management control device that collectively controls a plurality of multi-deck elevators having a plurality of cars in one unit, including a qualifying processing unit, an operation prediction evaluation unit, and an assigned car determination unit. The qualifying processing unit evaluates, for each car, to which car of each car the said car is to be assigned in the allocation process of allocating a car to service a hall call generated at the hall according to a predetermined rule. Then, one car is selected as a candidate car for each car. The operation prediction evaluation unit performs operation prediction evaluation processing for calculating an index including a predicted value of the time required to respond to each call, for each car, in the case of provisional assignment to the candidate car and in the case of non-provisional assignment. implement. The assigned car determination unit determines a car to be assigned using the index, and assigns the hall call to the candidate car of the car to be assigned.

本発明の一実施形態に係る群管理制御装置が適用されるダブルデッキ群管理制御システムの構成を示すブロック図。1 is a block diagram showing the configuration of a double-deck group supervisory control system to which a group supervisory control device according to one embodiment of the present invention is applied; FIG. 一実施形態に係る群管理制御装置の処理手順を示すフローチャート。4 is a flowchart showing a processing procedure of a group supervisory control device according to one embodiment; 一実施形態に係る群管理制御装置の処理手順を示すフローチャート。4 is a flowchart showing a processing procedure of a group supervisory control device according to one embodiment; 一実施形態に係る群管理制御装置で実施される動作を示す説明図。FIG. 4 is an explanatory diagram showing operations performed by the group supervisory control device according to one embodiment; 他の実施形態に係る群管理制御装置の処理手順を示すフローチャート。9 is a flowchart showing the processing procedure of a group supervisory control device according to another embodiment;

＜第１実施形態＞
《第１実施形態の構成》
図１は第１実施形態のエレベータ群管理制御装置の構成を示すブロック図である。 <First embodiment>
<<Configuration of the First Embodiment>>
FIG. 1 is a block diagram showing the configuration of the elevator group management control device of the first embodiment.

本実施形態によるダブルデッキ群管理制御システム１は、ｎ階建ての建物内に設置された複数台のダブルデッキエレベータ（Ａ号機エレベータ１０Ａ、Ｂ号機エレベータ１０Ｂ、およびＣ号機エレベータ１０Ｃ）と、各階の乗場に設置された乗場呼び登録装置２０－１～２０－ｎと、群管理制御装置３０とを備える。 The double-deck group management control system 1 according to this embodiment includes a plurality of double-deck elevators (A-elevator 10A, B-elevator 10B, and C-elevator 10C) installed in an n-story building, and It comprises hall call registration devices 20-1 to 20-n installed at the halls and a group supervisory control device 30. FIG.

Ａ号機エレベータ１０Ａは、上かご１１Ａと、下かご１２Ａと、Ａ号機制御装置１３Ａとを有する。Ａ号機制御装置１３Ａは、上かご１１Ａおよび下かご１２Ａの位置情報、走行状況情報、戸開閉状況情報、荷重状態情報等を、エレベータ情報として群管理制御装置３０に出力する。またＡ号機制御装置１３Ａは、群管理制御装置３０からの割り当て指令によりＡ号機エレベータ１０Ａを呼びの登録階へ応答させ、該当する乗りかごを戸開させる。 The A-car elevator 10A has an upper car 11A, a lower car 12A, and an A-car controller 13A. The A car control device 13A outputs the position information of the upper car 11A and the lower car 12A, the traveling condition information, the door opening/closing condition information, the load condition information, etc. to the group supervisory control device 30 as elevator information. Further, the A car control device 13A makes the A car elevator 10A respond to the registered floor of the call according to the assignment command from the group supervisory control device 30, and opens the door of the corresponding car.

Ｂ号機エレベータ１０ＢおよびＣ号機エレベータ１０Ｃは、Ａ号機エレベータ１０Ａと同様の構成を有するため、詳細な説明は省略する。 Since the B elevator 10B and the C elevator 10C have the same configuration as the A elevator 10A, detailed description thereof will be omitted.

乗場呼び登録装置２０－１～２０－ｎは、エレベータの各乗場（１階～ｎ階）に設置され、利用者のボタン操作によって上方向（ＵＰ）呼びまたは下方向（ＤＮ）呼びを登録可能な装置である。なお、ここでは、エレベータの乗場で行先階を登録可能な装置も含むものとする。 Hall call registration devices 20-1 to 20-n are installed in each elevator hall (1st floor to nth floor), and can register upward (UP) calls or downward (DN) calls by user button operation. device. It should be noted that here, a device capable of registering a destination floor at an elevator hall is also included.

群管理制御装置３０は、Ａ号機エレベータ１０Ａ、Ｂ号機エレベータ１０Ｂ、およびＣ号機エレベータ１０Ｃを群管理する。群管理制御装置３０は、乗場呼び登録部３１と、予選処理部３２と、エレベータ情報取得部３３と、選定ルール記憶部３４と、ルール選定部３５と、運行予測評価部３６と、割当かご決定部３７と、割当情報出力部３８とを有する。 The group management control device 30 group-manages the A-car elevator 10A, the B-car elevator 10B, and the C-car elevator 10C. The group supervisory control device 30 includes a hall call registration unit 31, a preliminary processing unit 32, an elevator information acquisition unit 33, a selection rule storage unit 34, a rule selection unit 35, an operation prediction evaluation unit 36, and an assigned car determination unit. It has a unit 37 and an allocation information output unit 38 .

乗場呼び登録部３１は、乗場呼び登録装置２０－１～２０－ｍから取得した乗場呼びの情報を受け付けて登録する。 The hall call registration unit 31 receives and registers the hall call information obtained from the hall call registration devices 20-1 to 20-m.

エレベータ情報取得部３３は、各号機制御装置１３Ａ～１３Ｃから出力されるエレベータ情報を取得する。具体的には、エレベータの現在の位置、方向、走行状態、扉状態、登録されている呼び、かご内荷重などの各種情報を、各号機制御装置１３Ａ～１３Ｃから取得し、群管理制御装置３０の各部に通知する。 The elevator information acquisition unit 33 acquires elevator information output from each elevator control device 13A to 13C. Specifically, various information such as the current position, direction, running state, door state, registered call, car load, etc. of the elevator is acquired from each elevator control device 13A to 13C, to each department.

予選処理部３２は、通常予選処理部４１と、最終予選処理部４２とを備えている。 The qualifying processing section 32 includes a normal qualifying processing section 41 and a final qualifying processing section 42 .

通常予選処理部４１は、各かごについてループしながら、所定のルールに基づき、条件が成立したかごを割当の候補から外す通常予選処理を実行する。 The normal qualifying processing unit 41 performs normal qualifying processing to exclude cars satisfying conditions from allocation candidates based on a predetermined rule while looping for each car.

最終予選処理部４２は、通常予選処理の結果、その号機の候補かごが２台以上となった場合には、ルール選定部３５により選定されたルールに従い、候補かごが１台以内となるように、絞り込む最終予選処理を実行する。 When there are two or more candidate cars for that car as a result of the normal qualifying processing, the final qualifying processing unit 42 follows the rule selected by the rule selection unit 35 so that the number of candidate cars is one or less. , perform the final qualifying process to narrow down.

選定ルール記憶部３４は、あらかじめ最終予選処理のルールと、その適用条件を記憶する。あらかじめ出荷時までに、工場等でデータを書込んでおくことが望ましい。選定ルールの具体例については後述する。 The selection rule storage unit 34 stores in advance the rules of the final qualifying process and their application conditions. It is desirable to write the data in advance at the factory or the like before shipment. A specific example of the selection rule will be described later.

ルール選定部３５は、選定ルール記憶部３４に記憶されている最終予選処理のルールの中から実際に今適用するルールを、エレベータの利用状況や現在時刻、群管理システムで適用中の機能の状況などに基づいて選択する。 The rule selection unit 35 selects a rule to be actually applied from among the rules of the final qualifying process stored in the selection rule storage unit 34, based on the usage status of the elevator, the current time, and the status of the function being applied in the group control system. and so on.

運行予測評価部３６は、登録済みの呼びと、新たに登録されたホール呼びの仮割当に順次停車するようにエレベータが運行した場合を想定して、各階へ到着するまでの時間と、各呼びに応答するまでの時間を算出し、その結果から評価値を算出する。 The operation prediction evaluation unit 36 assumes that the elevators are operated so as to sequentially stop at the registered calls and the newly registered temporary allocation of hall calls, and calculates the time required to reach each floor and each call. is calculated, and the evaluation value is calculated from the result.

割当かご決定部３７は、算出された評価値を用いて、割当てるかごを決定する。 The assigned car determination unit 37 uses the calculated evaluation value to determine the assigned car.

割当情報出力部３８は、決定した割当かごに対応するエレベータ制御装置１３Ａ～１３Ｃに対し、割当情報を出力し、エレベータを割当に従い運行させる。 The allocation information output unit 38 outputs the allocation information to the elevator control devices 13A to 13C corresponding to the determined allocated car, and operates the elevators according to the allocation.

《第１実施形態の処理手順》
図２、図３のフローチャートに基づき、第１実施形態の処理手順を説明する。 <<Processing procedure of the first embodiment>>
The processing procedure of the first embodiment will be described based on the flowcharts of FIGS. 2 and 3. FIG.

利用者によって乗場呼び登録装置２０－１，・・・，２０－ｎのいずれかが操作され、乗場呼びが登録されると（ステップＳ１YES）、その乗場呼びが群管理制御装置３０の乗場呼び登録部３１に登録される。そして、最適なかごを割当てるための処理が開始される。 . . , 20-n is operated by the user and the hall call is registered (step S1YES), the hall call is registered in the group controller 30. registered in the section 31. Then, the process for assigning the optimum car is started.

ステップＳ２～Ｓ６は、通常予選処理部４１で実行される通常予選処理を示している。先ず、各かごを対象として、登録された呼びを分担不可能なかごか否かが判定される（ステップＳ２）。登録された呼びを分担不可能なかごであれば、このかごを割候補外とする（ステップＳ３）。例えば、最下階で発生した乗場呼びは上かごには割当できないというルール、また、最上階で発生した乗場呼びは下かごには割当できないというルールなどに基づいて、割当不可能なかごを、割当候補から取り除く。 Steps S 2 to S 6 represent the normal qualifying process executed by the normal qualifying process section 41 . First, for each car, it is determined whether or not the registered call cannot be shared (step S2). If the car cannot share the registered call, this car is excluded from allocation candidates (step S3). For example, based on the rule that a hall call that occurs on the lowest floor cannot be assigned to an upper car, or that a hall call that occurs on the top floor cannot be assigned to a lower car, Remove from allocation candidates.

登録された呼びを分担可能なかごであれば（ステップＳ２NO）、次に、該当かごは荷重がしきい値以上で、かつ、登録された呼び応答まで降車予定階がないか否かが判定される（ステップＳ４）。該当かごは荷重がしきい値以上で、かつ、登録された呼び応答まで降車予定階がない場合には（ステップＳ４YES）、該当かごを割当候補外とする（ステップＳ３）。混雑したかごへの割当を防ぐために、混雑したかごを割当候補から取り除くための処理である。 If the car can share the registered call (step S2 NO), then it is determined whether or not the load of the car is equal to or greater than the threshold value and there is no floor to which the passenger is scheduled to get off until the registered call is answered. (step S4). If the load of the car in question is equal to or greater than the threshold value and there is no scheduled exit floor until the registered call is answered (step S4 YES), the car in question is excluded from allocation candidates (step S3). This is a process for removing congested cars from allocation candidates in order to prevent allocation to congested cars.

該当かごは荷重がしきい値以上でない（混雑していない）、または、登録された呼び応答まで降車予定階がある場合には（ステップＳ４NO）、次に、同一号機の別かごは登録された呼びを他の呼びと同時応答できるが、当該かごは同時応答できないか否かが判定される（ステップＳ５）。同一号機の別かごは、登録された呼びを他の呼びと同時応答できるが、当該かごは同時応答できない場合には、当該かごを割当候補外とする（ステップＳ３）。 If the load of the relevant car is not equal to or greater than the threshold value (not crowded), or if there is a floor scheduled to get off until the registered call response (step S4 NO), then another car of the same number is registered. A call can be answered simultaneously with another call, but it is determined whether or not the car concerned cannot answer the call simultaneously (step S5). Another car of the same car can respond to the registered call simultaneously with other calls, but if the car cannot respond simultaneously, the car is excluded from allocation candidates (step S3).

ステップＳ５の条件が不成立となる場合には（ステップＳ５NO）、当該かごを割当候補とする（ステップＳ６）。この処理は、仮割当することで、既に登録された呼びと同時に応答できる場合には、エレベータの停車回数を削減でき、エレベータの周回が早まり、運行の効率が高まるため、そのような割当を促進するためのものである。 If the condition of step S5 is not met (step S5 NO), the car is made an allocation candidate (step S6). This process promotes such allocation because provisional allocation can reduce the number of elevator stops, speed up elevator laps, and improve operational efficiency if calls can be answered at the same time as calls that have already been registered. It is for

このようにして、通常予選処理部４１では、エレベータの周回を早め、平均的な待ち時間や乗車時間を短縮する目的で割当候補かごの選定処理が実施される。 In this manner, the normal qualifying processing unit 41 performs selection processing of allocation candidate cars for the purpose of speeding up the rotation of the elevator and shortening the average waiting time and boarding time.

なお、他にも、フローチャートには図示していないが、同一号機の一方のかごが、登録された乗場呼びに直ちに応答可能であり、もう一方は直ちに応答可能でないときは、直ちに応答可能ではない側を、候補から外すなどの条件等を追加することもできる。 In addition, although not shown in the flowchart, if one car of the same car can immediately respond to a registered hall call and the other car cannot immediately respond, it cannot immediately respond. It is also possible to add conditions such as removing the side from the candidates.

上述した通常予選処理では、号機別に、候補かごを上かご・下かごの一方に確実に絞ることを意図したものではないため、号機によっては上かご・下かごの両方が候補かごとして残ることもある。そこで、最終予選処理部４２によって、選定された号機の候補かごが２台以上となった場合には、候補かごが１台以内となるように絞り込む最終予選処理を実施する。 The normal qualifying process described above is not intended to reliably narrow down the candidate cars to either the upper car or the lower car, depending on the car number, both the upper car and the lower car may remain as candidate cars. be. Therefore, when the number of candidate cars of the selected car is two or more by the final preliminary processing unit 42, final preliminary processing is performed to narrow down the number of candidate cars to one or less.

図３のステップＳ１１～Ｓ１４は、最終的に上かご・下かごの一方に限定するために、最終予選処理部４２によって実施される最終予選処理の一例を示している。 Steps S11 to S14 in FIG. 3 show an example of final qualifying processing performed by the final qualifying processing section 42 in order to finally limit to one of the upper car and the lower car.

先ず、それぞれの号機において、上かご、下かごとも、ステップＳ６により選定した割当候補か否かが判定される（ステップＳ１１）。 First, in each car, it is determined whether or not the upper car and the lower car are candidates for allocation selected in step S6 (step S11).

ここでは、上かご・下かごとも割当候補に残っている号機のみ、処理の対象とする。すなわち、ＵＰ呼びであれば上かごだけを候補とし、下かごを候補外とする（ステップＳ１２YES、Ｓ１３）、ＤＮ呼びであれば下かごだけを候補とし、上かごを候補外とする（ステップＳ１２NO、Ｓ１４）。なお、このルールは一例であり、エレベータの利用状況に応じて別の方法に切り替えることも可能である。 Here, only the cars that remain in the allocation candidates for both the upper car and the lower car are processed. That is, if it is an UP call, only the upper car is a candidate and the lower car is not a candidate (step S12 YES, S13), and if it is a DN call, only the lower car is a candidate and the upper car is not a candidate (step S12 NO). , S14). Note that this rule is just an example, and it is possible to switch to another method according to the usage status of the elevator.

上かご、下かごの一方でも割当候補でない場合には、その号機では最終予選処理は不要であるため、次の号機に処理を進める（ステップＳ１１NO）。 If neither the upper car nor the lower car is an allocation candidate, the process proceeds to the next car because the final qualifying process is unnecessary for that car (step S11 NO).

最終予選処理部４２による最終予選処理が終了すると、運行予測評価部３６によって運行予測評価が行われる（ステップＳ１５）。 When the final qualifying process by the final qualifying processing unit 42 is finished, the operation prediction evaluation is performed by the operation prediction evaluation unit 36 (step S15).

運行予測評価は、運行予測と、評価からなる。 Operation prediction evaluation consists of operation prediction and evaluation.

運行予測では、エレベータが登録済みの呼びや仮割当に従って行う将来の運行にかかる所要時間を、予測し、各呼びに応答するまでの時間を算出する。 In the operation prediction, the required time required for future elevator operations according to registered calls and provisional allocations is predicted, and the time required to respond to each call is calculated.

１台の号機に対する運行予測は、割当要求の呼びを、どのかごにも仮割当しない場合と、その号機のいずれかのかごに仮割当して行う場合について考えることができる。 The operation prediction for one car can be considered in the case where the allocation request call is not provisionally allocated to any car, and in the case where the call is provisionally allocated to one of the cars of the car.

とくに、ダブルデッキエレベータでは、「どのかごにも仮割当しない場合」「下かごに仮割当する場合」「上かごに仮割当する場合」の３通りの運行予測を考えることができる。 In particular, in the case of double-deck elevators, three types of operation predictions can be considered: "no temporary allocation to any car", "temporary allocation to the lower car", and "temporary allocation to the upper car".

評価では、それぞれの運行予測の結果として得られた、各呼びの待ち時間などの群性能指標に対する予測値に基づいて、運行予測毎の評価値を算出する。このような評価値を、第１の評価値と呼ぶことにする。例えば、その号機に割当済みの乗場呼びと、仮割当された乗場呼びを対象に、待ち時間の予測値を２乗した値を、全ての呼びに対し合計した値を、第１の評価値としてもよい。 In the evaluation, an evaluation value for each operation prediction is calculated based on the predicted value for the group performance index such as the waiting time of each call obtained as a result of each operation prediction. Such an evaluation value will be called a first evaluation value. For example, the value obtained by squaring the estimated value of the waiting time for the hall call already assigned to the car and the hall call temporarily allocated to the car is summed for all calls as the first evaluation value. good too.

各号機では、第１の評価値が、行った運行予測の回数分だけ得られる。 In each car, the first evaluation value is obtained as many times as the number of operation predictions performed.

次に、どのかごに割当てるべきかを示す、第２の評価値を算出する。第２の評価値は、かご間で比較が可能な指標で、その値が最小となるかごを、最も割当てるべきかごとする。 Next, a second rating value is calculated that indicates to which car it should be assigned. The second evaluation value is an index that can be compared between cars, and the car with the smallest value is the car that should be assigned the most.

第２の評価値は、例えば、いずれかのかごに割当要求を仮割当して得た第１の評価値から、どのかごにも仮割当を行わずに得た第１の評価値を引いた値とする。 The second evaluation value is obtained, for example, by subtracting the first evaluation value obtained without provisional assignment to any car from the first evaluation value obtained by provisionally assigning the assignment request to any car. value.

この値は、以下の２種類の情報に基づいて求めた値を合わせたものとなっている。
・１点目は、仮割当あり時の予測結果にのみ含まれる、割当要求の呼びに対する待ち時間の予測値である。これが短いほど、割当てるのにふさわしいかごであると言える。
・もう１点目は、登録済みの乗場呼びの待ち時間の変化である。割当要求を仮割当することで、運行スケジュールが変化し、登録済みの乗場呼びに対する待ち時間が長くなることがある。この程度が小さいかごほど、割当てるのにふさわしいかごであると言える。 This value is a combination of values obtained based on the following two types of information.
• The first point is the predicted waiting time for a call with an allocation request, which is included only in the prediction result when there is provisional allocation. It can be said that the shorter this is, the more suitable the cage is for allocation.
・The other point is the change in the waiting time for registered hall calls. Tentatively assigning an assignment request may change the service schedule and increase the waiting time for registered hall calls. It can be said that the smaller the degree is, the more suitable the car is to be assigned.

上記の方法では、特定のかごに対する第２の評価値を算出するためには、その号機の「どのかごにも仮割当しない場合」の運行予測と、評価したいかごに対して仮割当した場合の運行予測が必要となる。一方で、予選処理・最終予選処理で候補外となったかごに対しては、第２の評価値が不要であるため、そのかごに仮割当する場合の第１の評価値も不要である。従って、候補外のかごに対して仮割当する場合の運行予測は不要である。 In the above method, in order to calculate the second evaluation value for a specific car, it is necessary to predict the operation of that car "when not provisionally assigned to any car" and the operation prediction when provisional assignment is made to the car to be evaluated. Operation forecast is required. On the other hand, the second evaluation value is not required for a car that is not a candidate in the qualifying process/final qualifying process, so the first evaluation value is not required when provisionally assigned to that car. Therefore, there is no need to predict operation when provisional allocation is made to non-candidate cars.

従って、最終予選処理により、候補かごを各号機１台に絞ることで、各号機に対する運行予測を、「仮割当なし」「候補かごへの仮割当あり」の２回とできる。 Therefore, by narrowing down the candidate car to one car by the final preliminary process, the operation prediction for each car can be performed twice, ie, "no provisional allocation" and "with provisional allocation to the candidate car".

従来の基本的な方法で割当処理を行う場合は、ダブルデッキエレベータでは、各号機３回の運行予測を行う必要がある。従って、提案の方法により、運行予測の回数を３分の２に短縮できる。一般的には、１つの号機にＮ台のかごを有するマルチデッキエレベータでは、候補かごを各号機１台に絞ることで、運行予測の回数をＮ＋１分の２倍とすることができる。 When the allocation process is performed by the conventional basic method, it is necessary to perform operation prediction three times for each car in the case of a double-deck elevator. Therefore, the proposed method can reduce the number of trip predictions by two-thirds. In general, in a multi-deck elevator having N cars per car, the number of times of operation prediction can be doubled by N+1 by narrowing down the candidate cars to one car per car.

運行予測評価部３６によって、運行予測評価が終了すると、割当かご決定部３７によって、候補かごから割当てかごを決定する処理が実行される（ステップＳ１６）。この処理では、第２の評価値が最小となるかごを、割当かごに決定する。 When the operation prediction evaluation unit 36 completes the operation prediction evaluation, the assigned car determination unit 37 executes a process of determining an assigned car from the candidate cars (step S16). In this process, the car with the smallest second evaluation value is determined as the assigned car.

割当情報出力部３８は、割当かご決定部３７で決定された割当かご情報を該当するエレベータへ出力する（ステップＳ１７）。すなわち、割当かご情報を、割当号機のエレベータ制御装置１３Ａ～１３Ｃの何れかに伝達し、伝達されたエレベータ制御装置１３Ａ～１３Ｃによって該当するエレベータ１０Ａ～１０Ｃが運転される。 The assigned car information output unit 38 outputs the assigned car information determined by the assigned car determining unit 37 to the corresponding elevator (step S17). That is, the assigned car information is transmitted to one of the elevator controllers 13A to 13C of the assigned car, and the corresponding elevator 10A to 10C is operated by the transmitted elevator controller 13A to 13C.

図４は、第１実施形態の動作を具体的に示している。 FIG. 4 specifically shows the operation of the first embodiment.

図４（Ａ）に示すように、今、４階の乗場呼び登録装置２０－４から乗場呼びが登録されたとする。A号機では、１階に下かご、２階に上かごが位置し、下かごには３階のかご呼び、上かごには６階のかご呼びが登録されている。この状態では、上かご又は下かごのどちらのかごに割当てる方が効率的かは確定的に決定可能である。 As shown in FIG. 4A, it is now assumed that a hall call is registered from the fourth floor hall call registration device 20-4. In machine A, the lower car is located on the 1st floor and the upper car is located on the 2nd floor. The car call on the 3rd floor is registered for the lower car, and the car call for the 6th floor is registered for the upper car. In this situation, it can be definitively determined whether it is more efficient to assign to the upper car or the lower car.

上かごに仮割当すれば、上かごが４階で応答するときに、下かごで３階のかご呼びに同時に応答できる。 By provisionally assigning to the upper car, when the upper car answers the 4th floor, the lower car can simultaneously answer the car call on the 3rd floor.

しかし、下かごに仮割当すると、下かごが３階に応答する停車と、下かごが４階に応答する停車は、別々となるため、サービスを終えるまでに要する時間は明らかに長くなる。従って、Ａ号機では下かごを候補に選び、上かごを候補から外すことができる。 However, when provisionally assigned to the lower car, the stop for which the lower car responds to the 3rd floor and the stop for which the lower car responds to the 4th floor are separate, so the time required to finish the service obviously increases. Therefore, for car A, the lower car can be selected as a candidate, and the upper car can be excluded from the candidates.

図４（Ｂ）は、図４（Ａ）にＢ号機、Ｃ号機を加えた状況を示す。 FIG. 4(B) shows a situation in which B-car and C-car are added to FIG. 4(A).

Ａ号機は、下かご１２Ａが１階、上かご１１Ａが２階に位置し、下かご１２Ａ、上かご１１Ａともに乗客が居る。また、下かごに３階のかご呼び、上かごに６階のかご呼びが登録されており、ＵＰ運転している。 In car A, the lower car 12A is located on the first floor and the upper car 11A is located on the second floor, and there are passengers in both the lower car 12A and the upper car 11A. A car call on the 3rd floor is registered in the lower car, and a car call on the 6th floor is registered in the upper car, and UP operation is performed.

Ｂ号機は、下かご１２Ｂが５階、上かご１１Ｂが６階に位置し下かごにのみ乗客が居る。また、下かごに１階のかご呼びが登録されており、ＤＮ運転中である。 In Car B, the lower car 12B is located on the 5th floor, the upper car 11B is located on the 6th floor, and there are passengers only in the lower car. Also, a car call on the first floor is registered in the lower car, and the DN is in operation.

Ｃ号機は、下かご１２Ｃが１階を出発し、上かご１１Ｃが２階を出発し、上かご１１Ｃのみ多数の乗客が居る。また、上かご６階にかご呼びが登録されており、ＵＰ運転中である。 In car No. C, the lower car 12C departs from the first floor, the upper car 11C departs from the second floor, and only the upper car 11C has many passengers. Further, a car call is registered for the sixth floor of the upper car, and the UP operation is in progress.

Ａ号機では、予選処理で上かごのみ候補かごに残ることは、前記の通りである。 As described above, in car A, only the upper car remains as a candidate car in the qualifying process.

Ｂ号機では、最終予選処理により、４Ｆ－ＵＰが上方向であることを踏まえ、上かごのみ候補かごに残る。 In Car B, only the upper car remains as a candidate car, based on the fact that 4F-UP is upward due to the final qualifying process.

Ｃ号機では、上かごが混雑しているため、予選処理により下かごのみ候補かごに残る。従って、運行予測は、各号機２回ずつ、合計６回行うことで、４Ｆ－ＵＰの割当かごを選定できる。 In Car No. C, the upper car is crowded, so only the lower car remains as a candidate car by preliminary processing. Therefore, the operation prediction is performed twice for each car, for a total of six times, so that the assigned car for the 4F-UP can be selected.

最も基本的なダブルデッキエレベータ群管理の割当処理では、各号機で３回（仮割当なし、下かご仮割当あり、上かご仮割当あり）の運行予測を行い、割当処理全体では９回の予測が必要となる。 In the most basic allocation process of double-deck elevator group management, operation prediction is performed 3 times for each elevator (no temporary allocation, temporary allocation for lower car, and temporary allocation for upper car), and 9 times for the entire allocation process. Is required.

従来の、先に割当てる号機を決め、次に選んだ号機に対し上かご・下かごのどちらに割当てるかを決める方法では、運行予測の回数は提案手法と同等にできる。しかし、最初に号機を決める段階で、上かご・下かごの選択を十分考慮せずに一方を選んだうえで、運行予測を行う必要があるため、運行予測の際に仮割当したかごと、最終的に仮割当するかごが、異なる可能性がある。従って、号機を決める際に行った運行予測が、不正確なものとなりやすく、群管理性能が悪化する懸念がある。 With the conventional method of determining which car to allocate first and then deciding which car to allocate to the upper car or lower car for the next selected car, the number of traffic forecasts can be made the same as the proposed method. However, at the stage of first deciding on the number of cars, it is necessary to select one of the upper and lower cars without giving sufficient consideration to the choice of the upper car and lower car, and then forecast the operation. There is a possibility that the cars to be tentatively allocated in the end may be different. Therefore, there is a concern that the operation prediction made when determining the number of cars is likely to be inaccurate, and group control performance deteriorates.

このように第１実施形態では、ダブルデッキ群の割当アルゴリズム実施前の予選処理で、運行予測を行う前に、上かご、下かごの一方に割当候補を絞るようにすることで、運行予測評価の回数を減らし処理時間を短縮できる。 As described above, in the first embodiment, in the preliminary processing before executing the double-deck group allocation algorithm, the allocation candidates are narrowed down to one of the upper car and the lower car before the operation prediction is performed. It is possible to shorten the processing time by reducing the number of

また、運行予測評価を行う際に、各号機で仮割当したいかごがもう決まっているので、正確な予測結果を期待でき、群管理性能の低下を抑えることができる。 In addition, since the cars to be tentatively assigned to each car have already been determined when evaluating operation prediction, accurate prediction results can be expected, and deterioration in group control performance can be suppressed.

＜最終予選処理における選定ルール＞
最終予選処理は、群管理性能をなるべく悪化させないように、エレベータの利用状況に応じて、例えば以下のように定める。なお、以下の説明で、例えば、７階の上方向呼び（ＵＰ呼び）を７Ｆ－ＵＰ、下方向呼び（ＤＮ呼び）を７Ｆ－ＤＮと記載する。 <Selection rules for the final qualifying process>
The final qualifying process is determined, for example, as follows, according to the usage status of the elevator so as not to deteriorate the group control performance as much as possible. In the following description, for example, an upward call (UP call) on the 7th floor is described as 7F-UP, and a downward call (DN call) is described as 7F-DN.

＜閑散時：需要がほとんどないとき＞
上下かごのうち、割当要求に近いほうのかごを選び、選ばれなかったほうを候補かごから外す。 <Off-peak time: when there is little demand>
Of the upper and lower cars, the car closest to the allocation request is selected, and the one not selected is removed from the candidate cars.

例えばＡ号機について、下かごが３Ｆ、上かごが４Ｆで待機しているときに、７Ｆ－ＵＰの乗場呼びが発生した場合は、７Ｆに近い上かごを選ぶ。他に呼びがあまり発生しない状況であるため、位置的に近いかごのほうが、早く応答する可能性が高いからである。 For example, for car A, when the lower car is on the 3rd floor and the upper car is on the 4th floor, and a hall call for 7F-UP occurs, the upper car near the 7th floor is selected. This is because there are not many other calls, so there is a high possibility that a car that is closer in position will respond sooner.

＜通常需要時＞
ＵＰ呼びであれば上かご、ＤＮ呼びであれば下かごを選び、選ばれなかったほうを候補かごから外す。 <During normal demand>
An upper car is selected for an UP call, and a lower car is selected for a DN call, and the car not selected is excluded from the candidate cars.

ある程度需要が多くなると、エレベータは最下階と最上階の間を往復するような運転になりがちである。このときは、ＵＰ呼びは上かご、ＤＮ呼びは下かごが先に通ることが多いため、ＵＰ呼びは上かご、ＤＮ呼びは下かごを選ぶようにする。この方法には、建物の終端階を行先階とする利用者が、乗継を必要とする可能性を下げる効果もある。なぜならば、ＵＰ呼びを下かごに割当てた場合、下かごでは建物の最上階まで行けないから、あるいは、ＤＮ呼びを上かごに割当てた場合、上かごでは建物の最下階まで行けないからである。 When the demand increases to a certain extent, the elevator tends to be driven back and forth between the lowest floor and the highest floor. At this time, since UP calls often go through the upper car and DN calls go through the lower car first, the upper car is selected for the UP call and the lower car is selected for the DN call. This method also has the effect of reducing the possibility of requiring a transfer for passengers whose destination is the terminal floor of the building. This is because if an UP call is assigned to a lower car, the lower car cannot reach the top floor of the building, or if a DN call is assigned to an upper car, the upper car cannot reach the bottom floor of the building. be.

＜混雑時＞
奇数階で発生した乗場呼びは下かご、偶数階で発生した乗場呼びは上かごを選び、選ばれなかったほうを、候補かごから外す。なるべく、下かごは奇数階、上かごは偶数階をサービスするようにして、かごが昇降路を１周するあたりに停車する回数を減らすことで、かごの周回を早くして、単位時間あたりに輸送できる人数を増やすことができる。 <During congestion>
A lower car is selected for a hall call generated on an odd-numbered floor, and an upper car is selected for a hall call generated on an even-numbered floor. As much as possible, the lower car serves odd-numbered floors and the upper car serves even-numbered floors. By reducing the number of stops that the car makes during one revolution of the hoistway, it is possible to speed up the car circling and increase the number of cars per unit time. You can increase the number of people you can carry.

閑散時／通常需要時／混雑時の切替は、エレベータの利用状況を、群管理制御装置３０が監視することで、自動的に実施することができる。 Switching between off-peak hours/normal demand hours/congested hours can be automatically performed by the group supervisory control device 30 monitoring the usage status of the elevators.

混雑の検出方法としては、例えば、乗場呼びが登録されてから、かごが応答することにより消去されるまでの時間（未応答時間）の平均値を、過去数分間に対して求め、その値がしきい値１（例えば１０秒）未満であれば閑散時、しきい値１以上しきい値２未満であれば通常需要時、その値がしきい値２（例えば３０～４０秒）以上であれば混雑時と判断してもよい。 As a method of detecting congestion, for example, the average value of the time (unanswered time) from when a hall call is registered until it is deleted by responding to a car (unanswered time) is obtained for the past few minutes, and the value is If it is less than threshold 1 (eg 10 seconds), it is off-peak, if it is above threshold 1 and below threshold 2 it is normal demand, if the value is above threshold 2 (eg 30 to 40 seconds) If so, it may be determined that the traffic is congested.

また、「出勤時運転」「退勤時運転」などの、混雑に対応した機能が動作している間だけ混雑時とみなす、というように、特定の群機能を実行しているかどうかにより、切替を行ってもよい。 In addition, switching is performed depending on whether a specific group function is being executed. For example, it is considered to be busy only when functions corresponding to congestion, such as "drive when arriving at work" and "drive when leaving work," are operating. you can go

また、混雑する時間帯や曜日をあらかじめ記録しておき、その記録に従い切替を行ってもよい。 Alternatively, the busy hours and days of the week may be recorded in advance, and switching may be performed according to the records.

上記のルールを適用することにより、割当処理で時間を要する運行予測評価について、最悪でも、号機数の２倍の回数を実行すれば割当てかごを選ぶことができるようになる。このため、処理時間の最悪値を改善でき、呼び登録から割当かごまでの決定までの時間が長くなり過ぎない、使いやすい群管理制御装置を実現することができる。また、予選処理により割当てに適さないかごをあらかじめ除外してから運行予測評価を行うため、全てのかごに仮割当する場合を対象に運行予測評価を行った場合と比べた群管理性能の低下を、最低限に抑えることができる。 By applying the above rule, it is possible to select an assigned car by executing twice as many times as the number of elevators, even in the worst case, for operation prediction evaluation, which requires a long time for assignment processing. Therefore, the worst value of the processing time can be improved, and an easy-to-use group supervisory control device can be realized in which the time from call registration to determination of an assigned car does not become too long. In addition, since the operation prediction evaluation is performed after excluding cars that are not suitable for allocation by preliminary processing, there is no deterioration in group management performance compared to the case where the operation prediction evaluation is performed for the case where all the cars are provisionally allocated. , can be minimized.

＜第２実施形態＞
次に、図５のフローチャートを参照して第２実施形態を説明する。図５に示すフローチャートは、図３のフローチャートに対して、ステップＳ２１とステップＳ２２の処理を追加したものである。なお、第２実施形態の構成は、基本的には第１実施形態のエレベータ群管理制御装置と同様であるため、図１を援用して説明する。 <Second embodiment>
Next, a second embodiment will be described with reference to the flow chart of FIG. The flowchart shown in FIG. 5 is obtained by adding processing of steps S21 and S22 to the flowchart of FIG. Since the configuration of the second embodiment is basically the same as that of the elevator group management control device of the first embodiment, the description will be made with reference to FIG.

前述した第１実施形態によれば、運行予測評価の回数を減らすことができる。しかし、状況によっては、エレベータの利用が少なく、登録されている呼びの数が少ない等の理由により、割当処理の時間に余裕がある場合も考えられる。 According to 1st Embodiment mentioned above, the frequency|count of operation prediction evaluation can be reduced. However, depending on the situation, there may be a case where there is enough time for allocation processing due to reasons such as a small number of elevators being used and a small number of registered calls.

そこで、第２実施形態では、予選処理部３２による候補かごとして選定する割当処理の所要時間に制限を設ける。最終予選処理を通過したかごに対する処理を終えた段階で、所定の所要時間に達していない場合（ステップＳ２１NO）は、通常の予選処理を通過したが、最終予選処理により候補から外したかごに仮割当する場合についても、追加で運行予測評価を行う（ステップＳ２２）。この処理を、制限時間まで行い、少しでも多くのかごに対し、運行予測評価を行う。 Therefore, in the second embodiment, a limit is set on the time required for allocation processing for selecting candidate cars by the preliminary processing unit 32 . When the predetermined required time has not been reached at the stage of finishing the processing for cars that have passed the final qualifying process (step S21 NO), the cars that have passed the normal qualifying process but have been excluded from the candidates by the final qualifying process Also when allocating, operation prediction evaluation is additionally performed (step S22). This processing is performed until the time limit, and operation prediction evaluation is performed for as many cars as possible.

例えば、所要時間の制限値を１０ｍｓに設定することで、最終予選処理を通過したかごに対する運行予測評価が６ｍｓの所要時間で終わった場合は、残りの４ｍｓを、通常の予選処理を通過したが最終予選処理で候補から外したかごに対する運行予測評価処理に使用してもよい。 For example, by setting the required time limit value to 10ms, if the operation prediction evaluation for a car that passed the final qualifying process ends with a required time of 6ms, the remaining 4ms will pass through the normal qualifying process. It may also be used for operation prediction evaluation processing for cars excluded from candidates in the final qualifying processing.

その後、運行予測評価を終えた全てのかごを対象に、割当てるかごを決め、選んだかごに割当を出力する。 After that, for all the cars for which the traffic prediction evaluation has been completed, the car to be assigned is determined, and the assignment is output to the selected car.

この方法では、最終予選処理を終えた後での、運行予測評価処理にかかる時間に余裕がどれほどあるかに応じて、それぞれ以下の結果となる。段階が進むほど、より適切に割当てかごを選べるので、群管理性能が向上する。 With this method, the following results are obtained depending on how much time is left for the operation prediction evaluation process after the final qualifying process is finished. As the stage progresses, the assigned car can be selected more appropriately, so the group management performance is improved.

例えば、下記に示す「段階４」に達するまでの処理時間がなくても、「段階２」までに必要な時間があれば、よい群性能が望めない「段階１」により割当かごを決定する事態に陥らずに済むメリットがある。 For example, even if there is no processing time to reach "stage 4" shown below, if there is enough time to reach "stage 2", good group performance cannot be expected. There is an advantage that you do not fall into

《段階１》
最終予選処理を終えたかごに対する運行予測評価処理が、制限時間内に終わらないとき
⇒最低限必要な評価ができなかったので、各かごが割当要求に応答するまでの所要時間を簡易的に見積もり、最も短時間で応答可能なかごを割当かごに決定する。 《Step 1》
When the operation prediction evaluation process for cars that have completed the final qualifying process does not finish within the time limit ⇒ Since the minimum required evaluation could not be performed, simply estimate the time required for each car to respond to the allocation request. , the car that can respond in the shortest time is determined as the assigned car.

簡易的な見積もりの方法には、例えば、現在のかご位置・方向から、割当要求の階・方向に至るまでの経路の距離や、その経路上に登録されている呼びの種類と個数から、所要時間を計算する方法がある。簡易的な方法では、呼びに対する待ち時間の評価は、割当要求に対してだけとし、登録済みの呼びに対しては評価を行わないことで、処理時間を短縮できる。 A simple estimation method includes, for example, the distance of the route from the current car position/direction to the floor/direction of the allocation request, and the type and number of calls registered on that route. There are ways to calculate time. In a simple method, processing time can be reduced by evaluating wait times for calls only for allocation requests and not for registered calls.

《段階２》
最終予選処理を終えたかごに対する運行予測評価処理を終えたが、通常予選処理を通過したが、最終予選処理を通過しなかったかご(準候補かご)に対する評価が全くできなかったとき
⇒最終予選処理を通過したかごの運行予測評価の結果に基づいて、割当かごを決定する。 《Stage 2》
When the operation prediction evaluation process for a car that has completed the final qualifying process has been completed, but the car that passed the normal qualifying process but did not pass the final qualifying process (second-candidate car) cannot be evaluated at all ⇒Final qualifying process An assigned car is determined based on the result of the operation prediction evaluation of the cars that have passed the process.

《段階３》
制限時間までに、最終予選処理を終えたかごに対する処理を全て終えたが、準候補かごに対する運行予測評価処理は一部の号機に限り終えたとき
⇒最終予選処理を通過したかごと、一部の準候補かごに対する運行予測評価の結果から、割当かごを決定する。 《Stage 3》
When all the processes for cars that have completed the final qualifying process have been completed by the time limit, but the operation prediction evaluation process for the second-candidate cars has been completed for only some of the cars ⇒Some of the cars that have passed the final qualifying process The assigned car is determined from the result of the operation prediction evaluation for the second candidate car.

《段階４》
制限時間までに、最終予選処理を終えたかご、準候補かごに対する運行予測評価処理を全て終えたとき
⇒最終予選処理の結果によらず、通常予選処理を通過した全てのかごに対する運行予測評価の結果に基づいて、割当かごを決定する。 《Stage 4》
When the operation prediction evaluation process for all cars that have completed the final qualifying process and the second-candidate cars is completed by the time limit ⇒ Regardless of the result of the final qualifying process, all cars that have passed the normal qualifying process will be evaluated for operation prediction. Based on the result, the assigned car is determined.

このように、第２実施形態によれば、割当処理の時間に余裕がある場合には、少しでも多くのかごに対し、運行予測評価を行うことで、処理時間の制限の範囲内で、最大限の群管理性能を実現できるメリットがある。 As described above, according to the second embodiment, when there is time to spare for allocation processing, operation prediction evaluation is performed on as many cars as possible. It has the advantage of being able to achieve the highest possible group management performance.

以上、本発明のいくつかの実施形態を説明したが、これらの実施形態は、例として提示したものであり、発明の範囲を限定することは意図していない。これら新規な実施形態は、その他の様々な形態で実施されることが可能であり、発明の要旨を逸脱しない範囲で、種々の省略、置き換え、変更を行うことができる。これら実施形態やその変形は、発明の範囲や要旨に含まれるとともに、特許請求の範囲に記載された発明とその均等の範囲に含まれる。 Although several embodiments of the invention have been described above, these embodiments are presented by way of example and are not intended to limit the scope of the invention. These novel embodiments can be implemented in various other forms, and various omissions, replacements, and modifications can be made without departing from the scope of the invention. These embodiments and modifications thereof are included in the scope and gist of the invention, and are included in the scope of the invention described in the claims and equivalents thereof.

１…ダブルデッキ群管理制御システム、１０Ａ…Ａ号機エレベータ、１０Ｂ…Ｂ号機エレベータ、１０Ｃ…Ｃ号機エレベータ、１１Ａ，１１Ｂ，１１Ｃ…上かご、１２Ａ，１２Ｂ，１２Ｃ…下かご、１３Ａ…Ａ号機制御装置、１３Ｂ…Ｂ号機制御装置、１３Ｃ…Ｃ号機制御装置、２０－１～２０－ｎ…乗場呼び登録装置、３０…群管理制御装置、３１…乗場呼び登録部、３２…予選処理部、３３…エレベータ情報取得部、３４…選定ルール記憶部、３５…ルール選定部、３６…運行予測評価部、３７…割当かご決定部、３８…割当情報出力部、４１…通常予選処理部、４２…最終予選処理部 1 Double-deck group management control system 10A Elevator A 10B Elevator B 10C Elevator C 11A, 11B, 11C Upper car 12A, 12B, 12C Lower car 13A Control A Device, 13B... Car B control device, 13C... Car C control device, 20-1 to 20-n... Hall call registration device, 30... Group management control device, 31... Hall call registration unit, 32... Qualifying processing unit, 33 Elevator information acquisition unit 34 Selection rule storage unit 35 Rule selection unit 36 Operation prediction evaluation unit 37 Assigned car determination unit 38 Assignment information output unit 41 Normal qualifying processing unit 42 Final Preliminary processing section

Claims (5)

１台の号機に複数のかごを有するマルチデッキエレベータを、複数台まとめて制御する群管理制御装置において、
乗場で発生した乗場呼びに対し、サービスするかごを割当てる割当処理に際して、各号機を対象に、前記乗場呼びを、各号機のどのかごに割当てるかを、あらかじめ定めたルールにより評価し、号機ごとにいずれか１台のかごを候補かごとして選定する予選処理部と、
各号機を対象に、前記候補かごに仮割当する場合と、仮割当しない場合について、各呼びに応答するまでの時間の予測値を含む指標を算出する運行予測評価処理を実施する運行予測評価部と、
前記指標を用いて割当てる号機を決定し、前記割当てる号機の候補かごに、前記乗場呼びを割当てる割当かご決定部と、を備えるマルチデッキエレベータの群管理制御装置。 In a group management control device that collectively controls a plurality of multi-deck elevators having multiple cars in one unit,
In the allocation process for allocating a car to service a hall call generated at a hall, for each car, to which car of each car the hall call is to be allocated is evaluated according to a predetermined rule. a qualifying processing unit that selects one of the cars as a candidate car;
A traffic prediction evaluation unit that performs a traffic prediction evaluation process for calculating an index including a predicted value of the time required to respond to each call in cases where each car is provisionally allocated to the candidate car and where it is not provisionally allocated. and,
A group management control device for a multi-deck elevator, comprising: an assigned car determining unit that determines an elevator car to be assigned using the index, and assigns the hall call to a candidate car of the assigned elevator car. 前記予選処理部は、
各号機の候補かごを、その号機のかごのうち１台に限定することなく、所定の条件が成立したかごを割当の候補から外す通常予選処理を実施する通常予選処理部と、
通常予選処理の結果、選定された号機の候補かごが２台以上となった場合には、候補かごが１台以内となるように、絞り込む最終予選処理を実施する最終予選処理部と、を備える請求項１に記載のマルチデッキエレベータの群管理制御装置。 The preliminary processing unit
a normal qualifying processing unit that performs normal qualifying processing that excludes a car that satisfies a predetermined condition from allocation candidates without limiting the candidate car of each car to one of the cars of that car;
a final qualifying processing unit that performs final qualifying processing to narrow down the number of candidate cars so that the number of candidate cars is one or less when the number of candidate cars for the selected machine is two or more as a result of normal qualifying processing. The multi-deck elevator group management control device according to claim 1. 前記最終予選処理部は、かご内荷重の検出結果、呼びの登録状況、呼びへの平均的な応答時間、あらかじめ設定された時間帯、群管理制御システムが提供する他の機能の実施状況の少なくとも１つに応じて、閑散時、通常需要時、及び混雑時の何れかの処理を実施する、請求項２に記載のマルチデッキエレベータの群管理制御装置。 The final preliminarily processing unit performs at least the detection result of the load in the car, the registration status of the call, the average response time to the call, the preset time period, and the implementation status of other functions provided by the group management control system. 3. The multi-deck elevator group management control system according to claim 2, which performs processing for off-peak time, normal demand time, or congestion time, depending on one of them. 前記運行予測評価部は、前記候補かごに仮割当する場合と、仮割当しない場合の運行予測処理を、全ての号機に対し終了した時点で、
運行予測処理に要した時間が、あらかじめ設定された第１のしきい値に達しない場合は、最終予選処理で候補かごから外れることになったかごを準候補かごとし、当該準候補かごを対象に、準候補かごに仮割当する場合の運行予測評価を、運行予測評価の処理に要した時間が第２のしきい値に達するまでの間に実施し、
割当かご決定部は、前記第２のしきい値に達するまでの間に運行予測評価が完了した準候補かごを候補かごに戻して、最終的な割当かごを決定する、請求項２又は３に記載のマルチデッキエレベータの群管理制御装置。 When the operation prediction evaluation unit completes the operation prediction processing in the case of temporary allocation to the candidate car and in the case of non-temporary allocation for all cars,
If the time required for operation prediction processing does not reach the first threshold value set in advance, the car that was excluded from the candidate cars in the final qualifying process is treated as a second-candidate car, and the second-candidate car is targeted. (2) performing the operation prediction evaluation when provisionally allocated to the quasi-candidate car until the time required for processing the operation prediction evaluation reaches the second threshold value;
4. The assigned car determining unit returns to the candidate cars the secondary candidate cars for which the operation prediction evaluation has been completed before the second threshold value is reached, and determines the final assigned car. A group management controller for a multi-deck elevator as described. １台の号機に複数のかごを有するマルチデッキエレベータを、複数台まとめて制御する、マルチデッキエレベータの群管理制御装置において、乗場で発生した乗場呼びに対し、サービスするかごを割当てる割当処理は、
まず、各号機を対象に、前記乗場呼びを、その号機のどのかごに割当てるかを、あらかじめ定めたルールにより評価し、号機ごとにいずれか１台のかごを候補かごとして選定する予選処理を行い、
次に、各号機を対象に、候補かごに仮割当する場合と、仮割当しない場合について、各呼びに応答するまでの時間の予測値を含む指標を算出する運行予測評価処理を実施し、
前記指標を用いて割当てる号機を決定し、
前記割当てる号機の候補かごに、前記乗場呼びを割当てる、マルチデッキエレベータの群管理制御方法。 In a multi-deck elevator group management control device for collectively controlling a plurality of multi-deck elevators having a plurality of cars in one unit, allocation processing for allocating a car to serve a hall call generated at a hall is as follows:
First, for each car, the car to which the hall call should be assigned is evaluated according to a predetermined rule, and preliminary processing is performed to select one of the cars as a candidate car for each car. ,
Next, for each car, for the case of provisional assignment to a candidate car and the case of non-provisional assignment, an operation prediction evaluation process is performed to calculate an index including a predicted value of the time until each call is answered,
Determine the machine number to be assigned using the index,
A group management control method for a multi-deck elevator, wherein the hall call is assigned to the candidate car of the assigned elevator.
JP2021205084A 2021-12-17 2021-12-17 Group management control device and group management control method for multi-deck elevator Active JP7322127B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2021205084A JP7322127B2 (en) 2021-12-17 2021-12-17 Group management control device and group management control method for multi-deck elevator
CN202211602185.4A CN116265364A (en) 2021-12-17 2022-12-13 Group management control device and group management control method for multi-layer elevator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2021205084A JP7322127B2 (en) 2021-12-17 2021-12-17 Group management control device and group management control method for multi-deck elevator

Publications (2)

Publication Number Publication Date
JP2023090222A true JP2023090222A (en) 2023-06-29
JP7322127B2 JP7322127B2 (en) 2023-08-07

Family

ID=86744343

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2021205084A Active JP7322127B2 (en) 2021-12-17 2021-12-17 Group management control device and group management control method for multi-deck elevator

Country Status (2)

Country Link
JP (1) JP7322127B2 (en)
CN (1) CN116265364A (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0873138A (en) * 1994-09-07 1996-03-19 Toshiba Corp Double deck elevator operation controller
JP2002302347A (en) * 2001-04-04 2002-10-18 Toshiba Elevator Co Ltd Group control device for elevator
JPWO2003101873A1 (en) * 2002-05-30 2005-09-29 三菱電機株式会社 Elevator group control system
WO2011055414A1 (en) * 2009-11-09 2011-05-12 三菱電機株式会社 Double-deck elevator group control device
WO2013164882A1 (en) * 2012-05-01 2013-11-07 三菱電機株式会社 Elevator system
JP2014108854A (en) * 2012-11-30 2014-06-12 Hitachi Ltd Group control system of elevator
JP2020121854A (en) * 2019-01-30 2020-08-13 フジテック株式会社 Group management system of multi-deck elevator

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003101873A (en) 2001-09-21 2003-04-04 Canon Inc Image pickup device, photographing image generation method, program and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0873138A (en) * 1994-09-07 1996-03-19 Toshiba Corp Double deck elevator operation controller
JP2002302347A (en) * 2001-04-04 2002-10-18 Toshiba Elevator Co Ltd Group control device for elevator
JPWO2003101873A1 (en) * 2002-05-30 2005-09-29 三菱電機株式会社 Elevator group control system
WO2011055414A1 (en) * 2009-11-09 2011-05-12 三菱電機株式会社 Double-deck elevator group control device
WO2013164882A1 (en) * 2012-05-01 2013-11-07 三菱電機株式会社 Elevator system
JP2014108854A (en) * 2012-11-30 2014-06-12 Hitachi Ltd Group control system of elevator
JP2020121854A (en) * 2019-01-30 2020-08-13 フジテック株式会社 Group management system of multi-deck elevator

Also Published As

Publication number Publication date
JP7322127B2 (en) 2023-08-07
CN116265364A (en) 2023-06-20

Similar Documents

Publication Publication Date Title
KR920011080B1 (en) Group supervision apparatus for elevator system
JP5351510B2 (en) Station destination floor reservation type group management elevator control device
JP4505901B2 (en) Elevator control device
JP4777241B2 (en) Method and elevator scheduler for scheduling a plurality of cars in an elevator system in a building
US20090032339A1 (en) Elevator group management control device
KR920001299B1 (en) Group control device of elevator
JPH0725491B2 (en) Elevator group management device
WO2001028909A1 (en) Elevator group controller
JPH04213574A (en) Elevator distribution system
KR930004754B1 (en) Method and apparatus for effecting group management of elevators
JP4732343B2 (en) Elevator group management control device
CN116777126A (en) Crown block transportation scheduling method based on multi-layer AMHS system
WO2006082729A1 (en) Control method and system for elevator
JP2004107046A (en) Group supervisory operation control device for elevator
JP7322127B2 (en) Group management control device and group management control method for multi-deck elevator
JPH07117941A (en) Group supervisory operation control device for elevator
KR100399882B1 (en) Elevator controller
JPH0761722A (en) Group management controller for elevator
CN114644267B (en) Group control device and group control method for double-deck elevator
CN113023505B (en) Group management control device for elevator
CN112209188B (en) Group management system for elevator
KR101024799B1 (en) Elevator traffic control
JPH08217342A (en) Group supervisory operation control device for elevator
CN115402888B (en) Group management control device for elevator and group management control method for elevator
JPS60106774A (en) Method of controlling group of elevator

Legal Events

Date Code Title Description
A621 Written request for application examination

Free format text: JAPANESE INTERMEDIATE CODE: A621

Effective date: 20211217

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20221108

A521 Request for written amendment filed

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20221215

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20230307

A521 Request for written amendment filed

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20230419

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20230627

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20230726

R150 Certificate of patent or registration of utility model

Ref document number: 7322127

Country of ref document: JP

Free format text: JAPANESE INTERMEDIATE CODE: R150