JPH03272979A - Group management device of elevator - Google Patents
Group management device of elevatorInfo
- Publication number
- JPH03272979A JPH03272979A JP2073104A JP7310490A JPH03272979A JP H03272979 A JPH03272979 A JP H03272979A JP 2073104 A JP2073104 A JP 2073104A JP 7310490 A JP7310490 A JP 7310490A JP H03272979 A JPH03272979 A JP H03272979A
- Authority
- JP
- Japan
- Prior art keywords
- car
- time
- floor
- waiting time
- call registration
- 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.)
- Pending
Links
- 238000004364 calculation method Methods 0.000 claims description 46
- 230000003111 delayed effect Effects 0.000 claims 1
- 238000011156 evaluation Methods 0.000 description 15
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 4
- 238000000034 method Methods 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 101100167260 Arabidopsis thaliana CIA2 gene Proteins 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Landscapes
- Elevator Control (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
この発明はエレベータの群管理装置に係り、特に乗場で
行先階を登録できる乗場行先登録装置を僅えたエレベー
タの群管理装置の改良に関するものである。[Detailed Description of the Invention] [Industrial Application Field] This invention relates to an elevator group management device, and more particularly to an improvement in an elevator group management device that includes a landing destination registration device that can register a destination floor at a landing. be.
近年第4図に示すように乗場に行先階釦操作盤(4)と
乗場行先階表示装置(10)〜(12)を設けた方式の
群管理装置が多く提案されている。これはマイクロコン
ピュータ等の電子技術、ソフトウェア技術の進歩に伴フ
て容易に実施可能となってきた。In recent years, many group management systems have been proposed in which a landing floor is provided with a destination floor button operation panel (4) and a landing floor display device (10) to (12), as shown in FIG. This has become easier to implement with advances in electronic technology such as microcomputers and software technology.
例えば第5図は特公昭54−1978号に示された従来
の群管理の割当て装置を示す一実施例であり、乗場で登
録された行先階に対応する呼びに各かごを仮に割当て、
このとき各かごが各階ですでに登録されている呼びに応
答してそれぞれの行先階に到着するまでに要するサービ
ス完了時間を各サービス完了時間演算手段にて演算しそ
れらサービス完了時間を比較装置で比較した結果より、
最短なサービス完了時間のかごを正規に割当て、そのか
ごを呼びに応答させるようにしたものがあった。7又第
6図は特公昭62−1io347号に示された、前記同
様乗場に行先階釦を設けた方式における他の実施例での
群管理装置の割当てフローチャートを示したものである
。このフローチャートによると新規にホール呼びが発生
すると、すでに割当てられている操作ホール呼び階ある
いは行先ホール呼び階との一致階床数を各エレベータ毎
に演算し、前記一致階床数の多いエレベータを優先的に
選択し前記呼び登録操作階に割当てることを特徴として
いた。For example, FIG. 5 shows an example of a conventional group management assignment device disclosed in Japanese Patent Publication No. 54-1978, which temporarily assigns each car to a call corresponding to the destination floor registered at the landing.
At this time, each service completion time calculation means calculates the service completion time required for each car to arrive at its destination floor in response to a call already registered on each floor, and the service completion time is calculated by a comparison device. From the comparison results,
There was a method in which the car with the shortest service completion time was regularly assigned and that car was made to respond to calls. 7 and FIG. 6 is a flowchart for allocating the group management device in another embodiment of the method shown in Japanese Patent Publication No. 62-1io347 in which a destination floor button is provided at the landing, as described above. According to this flowchart, when a new hall call occurs, the number of floors that match the already assigned operation hall call floor or destination hall call floor is calculated for each elevator, and the elevator with the highest number of matching floors is given priority. The feature is that the call registration operation floor is selected and assigned to the call registration operation floor.
すなわち、選択のアルゴリズムとして評価関数を用い次
のように定めていた。That is, an evaluation function was used as a selection algorithm and was determined as follows.
W、= TI、 十72. ・
・・(1)。W, = TI, 172.・
...(1).
ここでW五はにエレベータの1階における評価関数、T
llはにエレベータの現在位置から操作ホール呼びが発
生している階iまでの到着予測時間、T2.はにエレベ
ータのi操作ホール呼びの発生したときの時間から現在
までの継続時間とし、すべてのホール呼びについてと、
すべてのエレベータについて(1)の評価関数を計算す
る。そしてその中で最大の評価関数W、を選択し、発生
ホール呼びと割当て済ホール呼びの一致呼び数Sを演算
しMin(W、 −a S ;に= 1.2 ・・・n
) −(2)(2)の式により今発生した操
作ホール呼びを割当てていた。Here, W5 is the evaluation function on the first floor of the elevator, T
ll is the predicted arrival time from the current position of the elevator to the floor i where the operation hall call is occurring, T2. The continuous time from the time when the i-operated hall call of the elevator was generated to the present, and for all hall calls,
Calculate the evaluation function (1) for all elevators. Then, select the maximum evaluation function W among them, calculate the number S of matching calls between the generated hall call and the allocated hall call, and calculate Min(W, -a S ; = 1.2...n
) -(2) The operation hall call that just occurred was assigned using the formula (2).
しかしながら、従来の装置において、例えば特公昭54
−1978号に示されたものは、今発生した呼びのサー
ビス完了時間についてのみ演算しすでに割当てられた呼
びの継続時間及び予測サービス完了時間は演算されなか
った。その為、長時間のサービス完了時間が発生したり
呼の発生順によっては1台のかごに割当てが集中して効
率が悪いといった問題点があった。However, in conventional devices, for example,
The system disclosed in No. 1978 only calculates the service completion time of a call that has just occurred, but does not calculate the duration and predicted service completion time of already assigned calls. As a result, there have been problems such as a long service completion time, and depending on the order in which calls are generated, allocation is concentrated on one car, resulting in poor efficiency.
また、特公昭62−60347号に示されたものは、評
価値演算の要素としてかごのホール呼びへの到着予測時
間とホール呼びの継続時間のみを考慮に入れ発生ホール
呼びかう行先階に到着するまての時間は考慮に入れられ
なかった。その為、すてに割当てられたホール呼びに対
するサービス完了時間が長くなるといった問題点があっ
た。In addition, the method shown in Japanese Patent Publication No. 62-60347 takes into account only the predicted arrival time of the car to the hall call and the duration of the hall call as elements of evaluation value calculation, and calculates the car's arrival at the destination floor of the hall call. Waiting time was not taken into account. Therefore, there is a problem in that it takes a long time to complete the service for hall calls that have already been assigned.
この発明は上記のような問題点を解消するためになされ
たもので乗客か乗場階から行先階へ到達するまでのサー
ビス完了時間を最短にするようにかごを割当てるエレベ
ータの群管理装置を得ることを目的とする。This invention has been made to solve the above-mentioned problems, and provides an elevator group management system that allocates cars so as to minimize the service completion time from the landing floor to the destination floor. With the goal.
この発明に係るエレベータの群管理装置は、群管理制御
される複数台のかごが就役する各階床において待客の操
作によって行先階の呼び登録を行なう呼び登録装置と、
該呼び登録装置よる呼びを各かごに仮割り当てする仮割
当て手段とを備えると共に、各かご毎に、上記呼び登録
装置による新規の呼び登録が発生した乗場階に到着する
までの時間を予測する第1の乗場到着時間演算手段と、
到着した乗場階より以前の呼び登録に応じながら登録さ
れた行先階に到着するまでの時間を予測する第1の行先
階到着時間演算手段と、各予測時間の加算値を求め、該
加算値より、かごが乗場階より行先階まで走行するのに
必要とする必要最低限な時間を減じ、かごが乗場階より
行先階へ行く間に、乗客が乗場及びかご内で待機させら
れる第1の延滞待機時間を演算する第1の延滞待機時間
演算手段を有する第1のサービス完了時間演算手段と、
仮割当てかごが今回の呼び登録が発生する以前に、既存
の呼び登録を有した場合、上記新規の呼び登録に応じな
がら、既存の呼び登録発生階に到着するまでの時間を予
測する第2の乗場到着時間演算手段と、該到着した乗場
より既存の登録行先階に到着する時間を予測する第2の
行先階到着時間演算手段と、これら到着予測時間の加算
値よりかごが既存の呼び登録が発生した乗場より既存の
呼び登録にて登録された行先階まで走行するのに必要と
する必要最低時間を減じ、第2の延滞待機時間を演算す
る第2の延滞待機時間演算手段とを有する第2のサービ
ス完了時間演算手段と、第1及び第2の延滞待機時間の
平均値を求める平均延滞待機時間演算手段と、各かごの
第1の延滞待機時間中最少のかごを、或は仮割当てかご
が既存の呼び登録を有していた場合は平均延滞待機時間
を取り入れ延滞待機時間が最少なかごを本割当てかごと
するかご割当て手段を備えたものである。An elevator group control device according to the present invention includes a call registration device that performs call registration of a destination floor by an operation of a waiting customer on each floor where a plurality of cars to be group-managed and controlled are in service;
provisional allocation means for provisionally allocating the call by the call registration device to each car, and a provisional allocation means for predicting the time required for each car to arrive at the landing floor where a new call registration by the call registration device has occurred. 1 landing arrival time calculation means;
a first destination floor arrival time calculation means for predicting the time required to arrive at the registered destination floor while responding to call registrations earlier than the landing floor at which the arrival was made; , the first delay in which passengers are forced to wait at the landing and in the car while the car travels from the landing floor to the destination floor by reducing the minimum amount of time required for the car to travel from the landing floor to the destination floor; a first service completion time calculation means having a first overdue waiting time calculation means for calculating a waiting time;
If the provisionally assigned car has an existing call registration before the current call registration occurs, a second method is used to predict the time until the car arrives at the floor where the existing call registration occurs while responding to the new call registration. a landing point arrival time calculating means; a second destination floor arrival time calculating means for predicting the time at which the car will arrive at the existing registered destination floor from the arriving landing; a second overdue waiting time calculating means for calculating a second overdue waiting time by subtracting the minimum time required to travel from the landing place where the occurrence occurs to the destination floor registered in the existing call registration. 2, a service completion time calculating means, an average delinquent waiting time calculating means for calculating the average value of the first and second delinquent waiting times, and provisionally allocating or provisionally allocating the car which is the shortest in the first delinquent waiting time of each car. If the car has an existing call registration, a car allocating means is provided which takes the average delinquent waiting time and assigns the car with the minimum delinquent waiting time as the main allocated car.
(作用)
この発明によれば、呼び登録装置による新規の呼び登録
に仮割当てさせた各かごが、呼び登録の発生した乗場階
に到着するまでの予測時間とその乗場階より行先階に到
着するまでの予測時間の和を求め、その和より乗場階よ
り行先階まで走行するのに必要な必要最低時間を減じ、
乗客が行先階に行くまでに不必要にサービス開始を待た
される第1の延滞待機時間を第1のサービス完了時間演
算手段にて演算するとともに、仮割当てかごが新規の呼
び登録以前に既存の呼び登録に割当てられていた場合は
、新規の呼び登録に応じながら既存の呼び登録が発生し
た乗場階に到着するまでの予測時間と、該乗場階より、
既存の登録行先階に到着するまての予測時間との和を求
め、和より乗場階より行先階まで走行するのに必要な必
要最低時間を減し、乗客が行先階に行くまでに不必要に
サービス開始を待たされる第2の延滞待機時間を第2の
サービス完了時間演算手段に演算し、該第2の延滞待機
時間と上記第1の延滞待機時間との平均を平均延滞待機
時間演算手段にて演算する。(Operation) According to the present invention, the predicted time for each car provisionally assigned to a new call registration by the call registration device to arrive at the landing floor where the call registration occurred and the arrival time from that landing floor to the destination floor is determined. Find the sum of the predicted times until
The first overdue waiting time, in which passengers are forced to wait unnecessarily for the start of a service before going to their destination floor, is calculated by the first service completion time calculation means, and the provisionally allocated car is replaced with an existing call before a new call is registered. If it is assigned to a registration, the predicted time until the arrival at the landing floor where the existing call registration occurred while responding to the new call registration, and from that landing floor,
Calculate the sum of the predicted time required to arrive at the existing registered destination floor, and from the sum, reduce the minimum time required to travel from the landing floor to the destination floor, and reduce the time required for the passenger to reach the destination floor. A second overdue waiting time for waiting for the start of the service is calculated by a second overdue waiting time, and an average overdue waiting time of the second overdue waiting time and the first overdue waiting time is calculated by an average overdue waiting time calculating means. Calculate with.
この結果、既存の呼び登録を有さないかごの第1の延滞
待機時間と、既存の呼び登録を有するかごの平均延滞待
機時間を比較し、延滞待機時間が少ないかごを本割当て
かごとするものである。As a result, the first overdue waiting time of cars without existing call registration is compared with the average overdue waiting time of cars with existing call registration, and the car with the shortest overdue waiting time is designated as the main allocated car. It is.
(実施例)
以下、この発明の一実施例を図について説明する。第1
図は本実施例の全体構成を示すブロック図である。図に
おいて、(IA)ばかごAを管理する台管理装置、(1
8)はかごBを管理する台管理装置に相当するものであ
る。各台管理装置(IA)及び(1B)はそれぞれ第1
及び第2のサービス完了時間演算手段(IAI) 、
(IAz) 、 (IB+) 、 (IB2)及び割当
て呼の心理的サービス完了時間である2つの延滞待機時
間の平均を求める平均延滞待機時間演算手段(IA3)
、 (IB3)を有している。上記第1のサービス完
了時間演算手段(IAI)の構成として、(IA++)
はかこが上記呼び登録装置(第4図の(4))によって
呼びが登録された乗場に到着するまでの時間を予測する
第1の乗場到着時間演算手段、(IAI2)は上記到着
した乗場より既存の呼び登録に応じながら登録行先階に
到着するまでの時間を予測する第1の行先階到着時間演
算手段、(IAI3)は各到着予測時間の加算値を求め
ると共に、該加算値より上記呼び登録発生乗場より登録
行先階までのかごの最低必要走行時間を減算し、呼び登
録発生乗場より乗り込んだ乗客が要したかご待ち時間、
及び途中階におけるかご内待機時間からなる第1の延滞
待機時間を演算する第1の延滞待機時間演算手段である
。(Example) Hereinafter, an example of the present invention will be described with reference to the drawings. 1st
The figure is a block diagram showing the overall configuration of this embodiment. In the figure, (IA) a stand management device that manages Bakago A, (1
8) corresponds to a car management device that manages car B. Each management device (IA) and (1B) are the first
and a second service completion time calculation means (IAI),
(IAz), (IB+), (IB2) and average overdue waiting time calculation means (IA3) for calculating the average of two overdue waiting times which are the psychological service completion time of the assigned call.
, (IB3). As the configuration of the first service completion time calculation means (IAI), (IA++)
The first landing arrival time calculation means (IAI2) predicts the time until the car arrives at the landing where the call has been registered by the call registration device ((4) in Figure 4). A first destination floor arrival time calculation means (IAI3) that predicts the time until arrival at the registered destination floor according to the existing call registration calculates the addition value of each predicted arrival time, and calculates the addition value of each predicted arrival time, and calculates the addition value of each predicted arrival time. Subtract the minimum required travel time for the car from the registered landing platform to the registered destination floor, and calculate the car waiting time required by passengers who boarded the car from the registered landing platform.
and a first overdue waiting time calculating means for calculating a first overdue waiting time consisting of an in-car waiting time at an intermediate floor.
又、第2のサービス完了時間演算手段CIA2)の構成
として、(IA21)は上記呼び登録装置(第4図(4
))による呼びに応じながらかごが既存の呼び登緑が発
生した登録乗場に到着するまでの時間を予測する第2の
乗場到着時間演算手段、(IA22)はかごが到着した
乗場から登録された行先階に到着するまでの時間を演算
する第2の行先階到着時間演算手段、(IA23)は上
記第2の乗場及び行先階到着時間演算手段にて演算され
た各到着予測時間の加算値を求め、該加算値より上記既
存の呼び登録発生乗場より既存の登録行先階までのかご
の最低必要走行時間を減算し、既存の呼び登録発生乗場
より乗り込んだ乗客が要したかご待ち時間、及び途中階
におけるかご内待機時間からなる第2の延滞待機時間を
演算する第2の延滞待機時間演算手段である。更に、(
IA3)は第1、及び第2の延滞待機時間の平均を求め
る平均延滞待機時間演算手段、(1c)は既存のかと呼
び登録を有しないかごの第1の延滞待機時間と、既存の
かご呼び登録する有するかごの平均延滞待機時間を比較
し、延滞待機時間が少ない方のかごを本割当てかごとす
るかご割当て手段である。Further, as a configuration of the second service completion time calculation means CIA2), (IA21) is the above-mentioned call registration device (FIG.
)) A second landing arrival time calculation means (IA22) predicts the time it will take for the car to arrive at the registered landing where the existing call has occurred while responding to the call by (IA22). A second destination floor arrival time calculation means (IA23) that calculates the time required to arrive at the destination floor calculates the sum of the predicted arrival times calculated by the second landing and destination floor arrival time calculation means. Calculate the minimum required car travel time from the existing call registration landing area to the existing registered destination floor from the added value, and calculate the car waiting time required by passengers boarding from the existing call registration landing area, and the car waiting time on the way. This is a second overdue waiting time calculating means for calculating a second overdue waiting time consisting of an in-car waiting time on a floor. Furthermore, (
IA3) is an average overdue waiting time calculation means for calculating the average of the first and second overdue waiting times, and (1c) is an average overdue waiting time calculation means for calculating the average of the first and second overdue waiting times. This is a car allocating means that compares the average overdue waiting time of the registered cars and selects the car with the shorter overdue waiting time as the main allocated car.
第2図は本実施例のハードウェア構成図を示すもので、
(1)は群管理装置でCPU (la)、ROMメモリ
(1b)、RAMメモリ(1c)、CPU (1)
と乗場呼登録装置(4)とのインタフェースをとるイン
タフェース(1d)、各台管理装置(4a)〜(4d)
とのインタフェース(1e)らが伝送バスで結合されて
成り立っており群管理装置からの割当て信号は伝送ライ
ン(7a)〜(7d)を通って各台管理装置(4a)
〜(4d)へ伝送される。台管理装置は駆動装置(5a
)〜(5d)に指令を送り、かご(6a)を上下に昇降
させている。第3図は群管理装置内のROMメモリ(1
b)に格納された呼の割当てプログラムのフローチャー
トを示し、このプログラムはCPU (1)によつて随
時読み出され実行される。次に第4図はビルに配置され
たエレベータの状態図であり、図に示すようにエレベー
タA、B号機が各階をサービスしている状態でこのプロ
グラムが実行された場合について説明する。第4図に示
す1〜8階のビルに2台のエレベータA号機(50a)
とB号機(50b)がありかごAは8階のかご呼(5
8)をもって4階をUP走行中、かごBは空の状態で5
階乗場の1階行きの割当て(55)を持って8階をDO
WN走行中である。この呼は発生してから10秒経過し
ている。この時に7階乗場に3階行きの呼びが発生する
と第3図の割当てプログラムが実行される。Figure 2 shows a hardware configuration diagram of this embodiment.
(1) is a group management device that includes CPU (la), ROM memory (1b), RAM memory (1c), and CPU (1).
An interface (1d) that interfaces with the hall call registration device (4), and each machine management device (4a) to (4d)
interface (1e) and the like are connected by a transmission bus, and the assignment signal from the group management device passes through transmission lines (7a) to (7d) to each management device (4a).
~(4d). The stand management device is a drive device (5a
) to (5d) to move the car (6a) up and down. Figure 3 shows the ROM memory (1
b) shows a flowchart of a call assignment program stored in the CPU (1), which is read out and executed by the CPU (1) at any time. Next, FIG. 4 is a state diagram of elevators arranged in a building, and a case will be described in which this program is executed in a state where elevators A and B are serving each floor as shown in the figure. Two elevators A (50a) are installed in the building on the 1st to 8th floors shown in Figure 4.
and Car B (50b), and car A is on the 8th floor car call (50b).
8) While running UP on the 4th floor, car B was empty.
DO the 8th floor with the assignment (55) for the 1st floor of the landing hall
The car is running on WN. Ten seconds have passed since this call occurred. At this time, when a call to the 3rd floor occurs at the 7th floor landing, the allocation program shown in FIG. 3 is executed.
尚、本割当てプログラムについて説明する前に、各用語
について説明する。Before explaining this allocation program, each term will be explained.
(1)■乗場予測時間とは現時点からかごが到着するま
での時間を予測演算した値。(1) ■Predicted landing time is a value calculated by predicting the time from the current moment until the car arrives.
■行先階到着予測時間とはかごが到着し乗り込んでから
目的階に到着するまでの時間を予測演算した値。■Predicted arrival time at destination floor is a value calculated by predicting the time from when the car arrives and gets on board until it arrives at the destination floor.
■従フて、第4図かごA、Bに対して7階に発生した呼
(3階行き)について演算するので、A、B号機共に7
階が乗場階、3階が行先階である。又B号機はすでに割
当てられている5階の1階行きの呼については演算し累
積するので、この時は、5階が乗場階、1階が行先階で
ある。■As a follow-up calculation is made for calls that occur on the 7th floor (bound for the 3rd floor) for cars A and B in Figure 4, both cars A and B are 7
The first floor is the landing floor, and the third floor is the destination floor. Furthermore, since the B car calculates and accumulates calls to the 1st floor of the 5th floor, which have already been assigned, the 5th floor is the landing floor and the 1st floor is the destination floor.
(2)心理的予測サービス完了時間とは以下のように定
義される。(2) Psychological prediction service completion time is defined as follows.
乗場呼が発生してから目的階まで到着するまでの予測時
間−乗場から目的階までかごが直行して要する時間(予
測でない時間)
従って乗客が目的階まで到着するのに心理的に長いと感
する時間であり、具体的には乗場で長く待たされる又は
かごが途中何回も止まるという心理的わずられしさを時
間で表わしたもの)(3)■発生呼の心理的サービス完
了時間とは乗場予測待時量子行先階到着予測時間−Ti
p(乗場から行先階まで直行に要する時間)■登録呼の
心理的サービス完了時間とは乗場呼継続時間十乗場予測
待時間十行先階到着予測時間−Tlp(登録呼乗場から
行先階まで直行に要する時間)(すでに登録され割当て
られてから時間が経過している)
■上記においてTl−(目的階まで直行しても最少銀必
要な時間)を減する理由
かごが直行している間に乗客はいらいらしないので、こ
の間の時間は演算の対象には含めない。Predicted time from when a landing call occurs to arrival at the destination floor - Time required for the car to go directly from the landing to the destination floor (unpredicted time) Therefore, passengers feel that it is psychologically long to reach the destination floor. (3) What is the psychological service completion time for a call? Predicted landing waiting time quantum destination floor arrival time - Ti
p (time required to go directly from the landing to the destination floor)■What is the psychological service completion time for the registered call?Destination call duration 10 predicted waiting time at the landing 10 predicted arrival time at the destination floor - Tlp (to go straight from the registered call to the destination floor time required) (time has already passed since it was registered and assigned) ■Reasons for reducing Tl- (the minimum time required even if the car goes straight to the destination floor) in the above Since this is not irritating, the time during this period is not included in the calculation.
すなわち、1階から10階へ行く人は最少銀lO秒かか
るし、1階から40階へ行く人は最少銀40秒かかり、
この時間は短縮できない。In other words, a person going from the 1st floor to the 10th floor takes a minimum of 10 seconds, and a person going from the 1st floor to the 40th floor takes a minimum of 40 seconds.
This time cannot be shortened.
又演算にこの時間を含めると長距離を移動する(目的階
が遠い)乗客が優先されてしまうからである(評価式の
上ではそうなる)。In addition, if this time is included in the calculation, passengers traveling long distances (destination floors far away) will be prioritized (this is what happens in the evaluation formula).
まず7階乗場の呼(57)は新規呼なので(4])でY
ESへ進み(42)にてかごAに仮割当てされ、(43
)でサービス評価値が計算される。次にかごBに仮割当
てされ同様にサービス評価値が計算される。First, the call (57) on the 7th floor landing is a new call, so (4]) is Y.
Proceeds to ES, is provisionally assigned to car A at (42), and is provisionally assigned to car A at (43).
) is used to calculate the service evaluation value. Next, it is provisionally allocated to car B, and the service evaluation value is calculated in the same way.
まずかとへの場合は
エレベータの階間走行時間==1秒/階床エレベータの
停止時間=8秒/停止とすると乗場予測待時間t、0=
4 + 8 + 1 = 13秒(4:8階への走行
時間(IX4)
8:8階での停止時間
1:8−7階走行時間)
行先階到着予測時間t、、=8+4=12(8;7階で
の停止乗込み時間
4ニア−3階への走行時間(IX4))従ってかとへの
7階乗場呼に対する心理的予測サービス完了時間は
t、、=13秒+12秒−12上=ri3秒」となり(
12e : Tap = 8秒+4秒)A 13+
Σ0
サービス評価値1.= = r13Jとなる。In the case of machikato, elevator running time between floors = = 1 second/stopping time of floor elevator = 8 seconds/stopping, then predicted landing waiting time t, 0 =
4 + 8 + 1 = 13 seconds (4: Travel time to the 8th floor (IX4) 8: Stop time on the 8th floor 1: Travel time on the 8-7th floor) Predicted arrival time at the destination floor t,, = 8 + 4 = 12 ( 8; Stop boarding time on the 7th floor 4 near - Travel time to the 3rd floor (IX4)) Therefore, the psychologically predicted service completion time for the 7th floor boarding call to Kato is t,, = 13 seconds + 12 seconds - 12 above = ri3 seconds” (
12e: Tap = 8 seconds + 4 seconds) A 13+
Σ0 Service evaluation value 1. = = r13J.
(尚、第4図かごAに対してはすでに登録されかごAに
割当てられた呼はないので登録呼心理的サービス完了時
間は計算に入らない。かごAは8階のかご呼(58)を
持っているがこの呼にサービス終了後7階降り方向に応
答するのでこのかご呼に対するサービス完了時間も演算
には含めない。)一方かごBの場合は同様に
too = 1.ilp = 8 + 2 + 8 +
2 = 20Tio = 1 +20− (8+4)
= ’9 J秒しかし、かごBはすでに割当てられた
呼(55)を持フているから
+ (8+2+8+2)−(8+4)
(10:乗場呼継続時間
8:5→1階へ直行して必要な時間)
=
l、9+29
従ってサービス評価値1+= = ’19J
となる。(Note that for car A in Figure 4, there are no calls that have already been registered and assigned to car A, so the registered call psychological service completion time is not included in the calculation. Car A receives car call (58) on the 8th floor. However, the service completion time for this car call is not included in the calculation because the call is answered in the 7th floor down direction after the service ends.) On the other hand, in the case of car B, too = 1. ilp = 8 + 2 + 8 +
2 = 20Tio = 1 +20- (8+4)
= '9 J seconds However, since car B already has an assigned call (55), + (8+2+8+2) - (8+4) (10: Hall call duration 8:5 → Need to go directly to the 1st floor. time) = l, 9+29 Therefore, service evaluation value 1+= = '19J
becomes.
第3図フローチャート(44)で全号機評価値計算が終
フたので(45)へ進み評価値Iり=13. L=19
のうち小さい方、すなわちA号機が選択され、(46)
にて7階乗場の3階行き呼びはA号機に割当てられ出力
される。特公昭53−1978号のような従来方式の場
合はB号機に割当てられる。その結果かと已にすでに割
当てられている5階から1階へ行く0!(55)のサー
ビス完了時間が(13+8+4=)25秒から(25秒
+8+8=)41秒に伸び5階の乗客に対してはサービ
スが悪くなる一方かとBが早くフリーなかごになるのを
妨げることになる。ここでは仮割当てした前後で予測サ
ービス完了時間に変化がないものについては呼の数に含
めず計算から除外した。又特公昭61−53976号と
同様な発想で仮割当て後のサービス完了時間が所定値よ
り小さい時は呼の数に含めず計算から除外することは容
易に可能である。又本実施例での評価式の中で係数は省
略したが各心理的完了時間や呼の数に係数を付けて演算
することも容易に可能である。In the flowchart of Fig. 3, the calculation of evaluation values for all machines is completed in (44), so proceed to (45), and the evaluation value I = 13. L=19
The smaller one of these, that is, machine A, is selected (46)
At , the call for the 3rd floor of the 7th floor landing is assigned to the A car and output. In the case of the conventional system, such as Japanese Patent Publication No. 53-1978, it is assigned to No. B aircraft. As a result, 0 goes from the 5th floor to the 1st floor, which has already been assigned to him! The service completion time for (55) increases from (13 + 8 + 4 =) 25 seconds to (25 seconds + 8 + 8 =) 41 seconds, which worsens the service for passengers on the 5th floor and prevents B from becoming a free car quickly. It turns out. Here, calls whose predicted service completion time does not change before and after provisional allocation are not included in the number of calls and excluded from calculations. Also, based on the same idea as in Japanese Patent Publication No. 61-53976, when the service completion time after provisional allocation is smaller than a predetermined value, it is easily possible to exclude it from the calculation without including it in the number of calls. Further, although the coefficients are omitted in the evaluation formula in this embodiment, it is easily possible to calculate by adding coefficients to each psychological completion time or number of calls.
尚、上記実施例でばかご割当て演算の要素として
新規発生呼・・・乗場予測待時間(too)十行先階到
着予測時間(t+p)
割当で後の呼・・・乗場呼N続時量子乗場予測待時間十
行先階到着予測時間
の2点を中心に評価値演算動作を説明したが、3番目と
して、
乗場呼び−かご呼に変更後の呼・・・乗場呼待時間+か
ご呼継続時間+(現位置から)行先階までの到着予測時
間
を割当て演算要素として評価値演算を行なってもよい。In the above embodiment, the elements of the car assignment calculation are: Newly generated call...Predicted waiting time at the hall (too) Predicted arrival time on the 10th row ahead floor (t+p) Call after allocation...Nth consecutive quantum hall We have explained the evaluation value calculation operation focusing on two points: predicted waiting time for ten rows and the predicted arrival time on the next floor.Thirdly, the call after changing to a hall call - car call... Hall call waiting time + car call duration time The evaluation value calculation may be performed using the + predicted arrival time (from the current position) to the destination floor as an allocation calculation element.
以上のようにこの発明は従来と同じハードウェア構成で
群管理の割当てプログラムのみ工夫したので装置が安価
で済みかつ各呼びのサービス完了時間のビル全体での平
均値が短縮されると同時にかごの回転効率が良くなり乗
客に対して快適なサービスを提供できる効果がある。As described above, this invention has the same hardware configuration as the conventional one, but only the allocation program for group management has been devised, so the equipment is inexpensive, and the average value of the service completion time for each call for the entire building is shortened. This has the effect of improving rotational efficiency and providing comfortable service to passengers.
第1図はこの発明の一実施例によるエレベータの群管理
装置の全体構成図、第2図は本実施例によるハードウェ
ア構成図、第3図は本実施例による群管理装置内の割当
てプログラムのフローチャート例、第4図は本発明の詳
細な説明する為のビルとエレベータの状態図、第5図は
乗場に行先階釦を設けた方式の乗場状況図、第6図は特
公昭54−1978号に示された従来の群管理装置の一
部を示す図、第7図は従来の他の実施例(特公昭62−
80347号)による割当てプログラムの例を示す図で
ある。
図において、(IAz) 、 (lA2)はそれぞれ第
1及び第2のサービス完了時間演算手段、(IAz)は
第1の乗場到着時間演算手段、(l A I 2)は第
1の行先階到着演算時間、(IAzs)は第1の延滞待
機時間演算手段、(lA21)は第2の乗場到着時間演
算手段、(lA22)は第2の行先階到着時間演算手段
、(lA23)は第2の延滞待機時間演算手段、(1,
A s )は平均延滞待機時間演算手段、(IC)ばか
ご割当て手段。
A、B、Cはそれぞれかと、(4)は呼び登録装置。FIG. 1 is an overall configuration diagram of an elevator group management device according to an embodiment of the present invention, FIG. 2 is a hardware configuration diagram according to this embodiment, and FIG. 3 is an allocation program diagram in the group management device according to this embodiment. An example of a flowchart, Fig. 4 is a state diagram of a building and an elevator to explain the present invention in detail, Fig. 5 is a state diagram of a boarding hall with destination floor buttons provided at the boarding hall, and Fig. 6 is a diagram of the state of the boarding hall in which a destination floor button is provided in the boarding hall. FIG. 7 is a diagram showing a part of the conventional group management device shown in the above issue, and FIG.
80347) is a diagram showing an example of an allocation program. In the figure, (IAz) and (lA2) are the first and second service completion time calculation means, respectively, (IAz) is the first landing arrival time calculation means, and (lA I 2) is the arrival at the first destination floor. Calculation time, (IAzs) is the first overdue waiting time calculation means, (lA21) is the second landing arrival time calculation means, (lA22) is the second destination floor arrival time calculation means, (lA23) is the second Overdue waiting time calculation means, (1,
A s ) is an average overdue waiting time calculation means, and (IC) is a basket allocation means. A, B, and C are respectively, and (4) is a call registration device.
Claims (1)
いて待客の操作によって行先階の呼び登録を行なう呼び
登録装置と、該呼び登録装置よる呼びを各かごに仮割り
当てする仮割当て手段とを備えたエレベータの群管理装
置において、かごが上記呼び登録発生階床に到着するま
での時間を予測する第1の乗場到着時間演算手段と、上
記到着した階床より既存の呼び登録に応じながら上記行
先階に到着するまでの時間を予測する第1の行先階到着
時間演算手段と、各到着予測時間の加算値を求めると共
に、該加算値より上記呼び登録発生階床より登録行先階
までのかごの最低必要走行時間を減算し、呼び登録発生
階床より乗り込んだ乗客が要したかご待ち時間、及び途
中階におけるかご内待機時間からなる第1の延滞待機時
間を演算する第1の延滞待機時間演算手段とを有した第
1のサービス完了時間演算手段と、上記呼び登録装置に
よる呼びに応じながら、かごが既存の呼び登録が発生し
た登録階床に到着するまでの時間を予測する第2の乗場
到着時間演算手段と、かごが到着した呼び登録階床にて
登録された行先階に到着するまでの時間を演算する第2
の行先階到着時間演算手段と、上記第2の乗場及び行先
階到着時間演算手段にて演算された各到着予測時間の加
算値を求め、該加算値より上記既存の呼び登録発生階床
より既存の登録行先階までのかごの最低必要走行時間を
減算し、既存の呼び登録発生階床より乗り込んだ乗客が
要したかご待ち時間、及び途中階におけるかご内待機時
間からなる第2の延滞待機時間を演算する第2の延滞待
機時間演算手段とを有した第2のサービス完了時間演算
手段と、第1、及び第2の延滞待機時間の平均を求める
平均延滞待機時間演算手段と、既存のかご呼び登録を有
しないかごの第1の延滞待機時間と、既存のかご呼び登
録を有するかごの平均延滞待機時間とを比較し、延滞待
機時間が少ない方のかごを本割当てかごとするかご割当
て手段とを備えたことを特徴とするエレベータの群管理
装置。A call registration device for registering a call for a destination floor by operation of a waiting customer on each floor where a plurality of cars are in service under group management control, and provisional assignment means for provisionally allocating a call by the call registration device to each car. An elevator group management device comprising: a first hall arrival time calculation means for predicting the time until the car arrives at the floor where the call registration has occurred; A first destination floor arrival time calculation means for predicting the time required to arrive at the destination floor, and a first destination floor arrival time calculation means that calculates an added value of each predicted arrival time, and uses the added value to estimate the time required for the car to reach the registered destination floor from the floor where the call registration occurs. The first overdue waiting time is calculated by subtracting the minimum required traveling time of , and calculating the first overdue waiting time consisting of the car waiting time required for passengers who boarded from the floor where the call registration occurred, and the waiting time in the car at intermediate floors. a first service completion time calculation means having a calculation means; and a second service completion time calculation means for predicting the time until the car arrives at the registration floor where the existing call registration has occurred while responding to the call by the call registration device. a platform arrival time calculating means; and a second means for calculating the time required for the car to arrive at the destination floor registered at the call registration floor at which the car arrived.
The addition value of each predicted arrival time calculated by the destination floor arrival time calculation means and the second landing and destination floor arrival time calculation means is calculated, and from the added value, the existing call registration generation floor is The second delayed waiting time is calculated by subtracting the minimum required travel time of the car to the registered destination floor, and then subtracting the car waiting time required by passengers who boarded from the existing floor where the call registration occurred, and the waiting time in the car at intermediate floors. a second overdue waiting time calculating means for calculating the second overdue waiting time calculating means; an average overdue waiting time calculating means for calculating the average of the first and second overdue waiting times; Car allocation means that compares the first overdue waiting time of a car without call registration with the average overdue waiting time of cars with existing car call registration, and assigns the car with the shorter overdue waiting time as the main allocated car. An elevator group control device comprising:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2073104A JPH03272979A (en) | 1990-03-22 | 1990-03-22 | Group management device of elevator |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2073104A JPH03272979A (en) | 1990-03-22 | 1990-03-22 | Group management device of elevator |
Publications (1)
Publication Number | Publication Date |
---|---|
JPH03272979A true JPH03272979A (en) | 1991-12-04 |
Family
ID=13508667
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2073104A Pending JPH03272979A (en) | 1990-03-22 | 1990-03-22 | Group management device of elevator |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPH03272979A (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009008083A1 (en) * | 2007-07-12 | 2009-01-15 | Mitsubishi Electric Corporation | Elevator system |
CN101878173A (en) * | 2007-12-07 | 2010-11-03 | 三菱电机株式会社 | Elevator system |
DE112009002239T5 (en) | 2008-09-19 | 2011-07-14 | Mitsubishi Electric Corp. | Elevator management system |
CN105253726A (en) * | 2014-07-11 | 2016-01-20 | 富士达株式会社 | Elevator group management system and elevator control system |
-
1990
- 1990-03-22 JP JP2073104A patent/JPH03272979A/en active Pending
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009008083A1 (en) * | 2007-07-12 | 2009-01-15 | Mitsubishi Electric Corporation | Elevator system |
JPWO2009008083A1 (en) * | 2007-07-12 | 2010-09-02 | 三菱電機株式会社 | Elevator system |
US8196711B2 (en) | 2007-07-12 | 2012-06-12 | Mitsubishi Electric Corporation | Elevator system |
JP5404394B2 (en) * | 2007-07-12 | 2014-01-29 | 三菱電機株式会社 | Elevator system |
CN101878173A (en) * | 2007-12-07 | 2010-11-03 | 三菱电机株式会社 | Elevator system |
DE112009002239T5 (en) | 2008-09-19 | 2011-07-14 | Mitsubishi Electric Corp. | Elevator management system |
US8567569B2 (en) | 2008-09-19 | 2013-10-29 | Mitsubishi Electric Corporation | Elevator group management system |
CN105253726A (en) * | 2014-07-11 | 2016-01-20 | 富士达株式会社 | Elevator group management system and elevator control system |
JP2016016992A (en) * | 2014-07-11 | 2016-02-01 | フジテック株式会社 | Elevator group control system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6273217B1 (en) | Elevator group control apparatus for multiple elevators in a single elevator shaft | |
US7258203B2 (en) | Method for controlling the elevators in an elevator group | |
KR920011080B1 (en) | Group supervision apparatus for elevator system | |
JP3040237B2 (en) | Elevator operation method based on remaining response time | |
KR920001299B1 (en) | Group control device of elevator | |
JP2019142694A (en) | Group management control device and group management control method | |
EP0645337A2 (en) | Early car announcement | |
JPH0610069B2 (en) | Elevator group management device | |
JPH07149480A (en) | Momentary sector allocating method | |
JP2004107046A (en) | Group supervisory operation control device for elevator | |
US7549517B2 (en) | Elevator car dispatching including passenger destination information and a fuzzy logic algorithm | |
JPH03272979A (en) | Group management device of elevator | |
JPH07117941A (en) | Group supervisory operation control device for elevator | |
WO2020261361A1 (en) | Elevator group management system | |
JPH08217342A (en) | Group supervisory operation control device for elevator | |
JP2001058764A (en) | Group supervisory control system for elevator | |
JPH08198529A (en) | Control device for double-deck elevator | |
KR101024799B1 (en) | Elevator traffic control | |
JPS61136883A (en) | Group controller for elevator | |
JPH11322205A (en) | Group supervisory control system | |
JP2003276961A (en) | Elevator group management system | |
JP4177627B2 (en) | Elevator group management system and method | |
JPS6153976B2 (en) | ||
JPH0476914B2 (en) | ||
JPH064475B2 (en) | Elevator group management device |