CN104909224A - Elevator group management system - Google Patents

Elevator group management system Download PDF

Info

Publication number
CN104909224A
CN104909224A CN201510079226.XA CN201510079226A CN104909224A CN 104909224 A CN104909224 A CN 104909224A CN 201510079226 A CN201510079226 A CN 201510079226A CN 104909224 A CN104909224 A CN 104909224A
Authority
CN
China
Prior art keywords
mentioned
cage
calling
time
ladder riding
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
CN201510079226.XA
Other languages
Chinese (zh)
Other versions
CN104909224B (en
Inventor
浅野宜正
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
Publication of CN104909224A publication Critical patent/CN104909224A/en
Application granted granted Critical
Publication of CN104909224B publication Critical patent/CN104909224B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66BELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00Control systems of elevators in general
    • B66B1/02Control systems without regulation, i.e. without retroactive action
    • B66B1/06Control systems without regulation, i.e. without retroactive action electric
    • B66B1/14Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
    • B66B1/18Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages

Abstract

The invention provides an elevator group management system which can solve the problem the problem that an optimal cabin is not ensured to be selected only through evaluation values in congestion, and improve group management performance. A group management device (10) is provided with an RTS evaluation portion (12), an optimal cabin selection portion (13) and a distribution control portion (14). Based on a current call state and a future call prediction, the RTS evaluation portion (12) calculates the evaluation values of distributing elevator hall calls becoming distribution objects to each passenger cabin. The optimal cabin selection portion (13) selects a passenger cabin with an optimal evaluation value from the passenger cabins to be used as an optimal cabin. Based on the predicted arriving time of the optimal cabin relative to an elevator hall call, the distribution control portion (14) searches for passenger cabins meeting preset conditions form the passenger cabins, and distributes the elevator hall call to the searched passenger cabin or an optimal elevator cabin.

Description

The cluster management system of elevator
The application, based on Japanese patent application 2014-051220 (applying date: on March 14th, 2014), enjoys the preceence of this application.The application comprises the full content of this application by referring to this application.
Technical field
Embodiments of the present invention relate to the cluster management system to the elevator that the running of multiple stage cage controls.
Background technology
In the cluster management system of elevator, when creating new ladder riding hall calling, by evaluation function, evaluation number is calculated to each cage, the cage with wherein optimum evaluation number is judged as distributing car, above-mentioned evaluation function with the calling of having registered at each cage (ladder riding hall calling and car call), car position etc. for parameter." distribution car " refers to the cage distributing ladder riding hall calling, also referred to as " Distribution Unit ".
Herein, as the mode of distributive judgement of carrying out ladder riding hall calling, the new mode being referred to as RTS (Real Time Scheduling: Real-Time Scheduling) is being considered.This is as under type: consider the impact that the calling of current distribution brings to all callings do not responded distributed up to now with calling in the future to the impact that calling in the future brings to calculate evaluation number to each cage.By the evaluation number utilizing this RTS to calculate each cage, better distribution car can be selected.
Summary of the invention
In above-mentioned RTS, when having calculated roughly the same evaluation number, select distribution car according to the magnitude relationship of this evaluation number.But, such as, when crowded etc., produce calling beyong contemplation in a large number sometimes.Thus, compared to the cage of evaluation number optimum, sometimes more wish ladder riding hall call distribution to the cage of the register layer near ladder riding hall calling.
The problem to be solved in the present invention is to provide a kind of can to save when crowded etc. and not necessarily can selects the situation of best cage by means of only evaluation number and improve the cluster management system of the elevator of group management of performance.
The running of cluster management system to multiple stage cage of the elevator of present embodiment controls, and possesses evaluation section, best car selects portion and distributes control part.
Evaluation section based on the state of current calling and the prediction of calling that produces in the future, calculate will become distribution object ladder riding hall call distribution to evaluation number when above-mentioned each cage.Best car selects the cage that portion selects the evaluation number optimum calculated by above-mentioned evaluation section from above-mentioned each cage, as best car.Distribute the prediction time of advent that control part is called out for above-mentioned ladder riding hall based on the above-mentioned best car selected by the above-mentioned best car portion of selecting, from above-mentioned each cage, retrieval meets the cage of predetermined condition, by above-mentioned ladder riding hall call distribution to this cage retrieved or above-mentioned best car.
According to the cluster management system of the elevator of said structure, the situation not necessarily can selecting best cage by means of only evaluation number such as can to save when crowded, improve group's management of performance.
Accompanying drawing explanation
Fig. 1 is the block diagram of the structure of the cluster management system of the elevator that the 1st embodiment is shown.
Fig. 2 is the diagram of circuit of the allocation process of the ladder riding hall calling of the group management control apparatus illustrated in the 1st embodiment.
Fig. 3 is the figure of an example of the run curve of the group management control apparatus illustrated in the 1st embodiment.
Fig. 4 is the figure of an example of the operative condition of each machine of the group management control apparatus illustrated in the 1st embodiment.
Fig. 5 is the block diagram of the structure of the cluster management system of the elevator that the 2nd embodiment is shown.
Fig. 6 be the group management control apparatus illustrated in the 2nd embodiment set the diagram of circuit of relevant process to threshold value.
Detailed description of the invention
Below, with reference to accompanying drawing, embodiment is described.
(the 1st embodiment)
Fig. 1 is the block diagram of the structure of the cluster management system of the elevator that the 1st embodiment is shown, shows the structure that multiple stage (being these 3, A ~ C machine) elevator is managed by group herein.In addition, said " elevator " refers to " cage " substantially herein, but also there is " number machine " this saying.
1a ~ 1c number of being machine control part in figure, 2a ~ 2c is cage.The running that A machine control part 1a carries out the cage 2a of A machine controls.Specifically, number machine control part 1a carries out the not shown control of motor (winch), the open and close controlling etc. of door for making cage 2a carry out lifting action.B machine control part 1b, C machine control part 1c is also same.These number machine control part 1a ~ 1c is made up of computing machine.
Cage 2a ~ 2c carries out lifting action by the driving of motor (winch) in elevating road.The various action buttons comprising object stratum button 3a, door open button 4a, door close button 5a are provided with in the indoor of cage 2a.The signal of these buttons is sent to group management control apparatus 10 via A machine control part 1a.
Equally, the various action buttons comprising object stratum button 3b, door open button 4b, door close button 5b are provided with in the indoor of cage 2b.The signal of these buttons is sent to group management control apparatus 10 via B machine control part 1b.The various action buttons comprising object stratum button 3c, door open button 4c, door close button 5c are provided with in the indoor of cage 2c.The signal of these buttons is sent to group management control apparatus 10 via C machine control part 1c.
In addition, the boarding place (the elevator riding Room) of each layer is provided with ladder riding hall button 6a, 6b, the 6c for registering ladder riding hall calling ...In addition, in the example in fig 1, although ladder riding hall button 6a, 6b, 6c ... be connected with group management control apparatus 10 via a number machine control part 1a ~ 1c, but also can be structure direct coupled with group management control apparatus 10.
These ladder riding hall buttons 6a, 6b, 6c ... comprise upwards button and downward button, be configured to the direction, destination according to user and press upwards button or downwards button.In addition, be only made up of upwards button in orlop, be only made up of downward button in the superiors.
" ladder riding hall calling " refers to the operation of the ladder riding hall button by arranging in the boarding place of each layer and the signal of the calling of registering, and comprises the information in register layer and direction, destination.
" car call " refers to the operation of the object stratum button by arranging in cage and the signal of the calling of registering, and comprises the information on object stratum.
Group management control apparatus 10 carries out for the running of the cage 2a ~ 2c to each machine the device that group manages control, is made up of in the same manner as number machine control part 1a ~ 1c computing machine.In the present embodiment, this group management control apparatus 10 is provided with status surveillance portion 11, RTS evaluation section 12, best car select portion 13, distribute control part 14, distribute enforcement division 15.In addition, these handling parts actually by software or software restraint combination and realize.
Status surveillance portion 11 monitors the operative condition (car position, rotation direction, door open and-shut mode etc.) of the cage 2a ~ 2c of each machine, the generation situation etc. of calling (ladder riding hall calling and car call).
When arbitrary layer creates new ladder riding hall calling, RTS evaluation section 12 utilizes RTS (Real Time Scheduling) to carry out evaluation process, based on state and the prediction of the calling produced in the future of current calling, calculate and will become the ladder riding hall call distribution of distribution object to evaluation number when cage 2a ~ 2c.
In addition, evaluation number is the index of the optimum degree represented when being assigned with ladder riding hall calling.The numerical value of this evaluation number is less, then represent that evaluation is higher, its numerical value is larger, then represent that evaluation is lower.In addition, because RTS is known, so description is omitted herein.
Best car selects the cage that portion 13 selects the evaluation number optimum calculated by RTS evaluation section 12 from cage 2a ~ 2c, as best car.In addition, " best car " refers to the cage of RTS evaluation number optimum.On the other hand, " distribution car " refers to the cage being in fact assigned with ladder riding hall calling.
Distribute the distribution control that control part 14 carries out calling out for the ladder riding hall of cage 2a ~ 2c.Distribute control part 14 and usually directly determine to be distribute car by being selected the best car selected in portion 13 by best car.In the present embodiment, distribute control part 14 and utilize when following condition other method to retrieve other cage, and determine to distribute car.
[condition]
The best car obtained by RTS evaluation number is more than Ts fiducial time preset for the prediction Tx time of advent that ladder riding hall is called out.
Registering the possibility of unpredictable calling (ladder riding hall calling/car call) in during said reference time Ts considers till best car arrives the register layer of ladder riding hall calling and set, such as, is " 30 seconds ".
Namely, when the prediction Tx time of advent that best car is called out for ladder riding hall is more than Ts=30 second fiducial time, distribute the value that the evaluation number of cage 2a ~ 2c is transformed to unit of time by control part 14, retrieve and the cage of the time difference of best car lower than the threshold value TH preset.When there is qualified cage, distributing control part 14 and the cage of the register layer near ladder riding hall calling being determined, for distributing car, give this cage by this ladder riding hall call distribution.Details will be described with reference to Fig. 2 ~ Fig. 5 afterwards.
Distribute enforcement division 15 exports ladder riding hall calling distributed intelligence to the cage gone out by the final decision of distribution control part 11.Such as, when determining cage 2a, distribute the distributed intelligence that enforcement division 12 couples of A machine control part 1a export ladder riding hall calling.A machine control part 1a receives the distributed intelligence of this ladder riding hall calling, thus makes cage 2a respond the register layer of this ladder riding hall calling.
Below, the action of present embodiment is described in detail.
Fig. 2 is the diagram of circuit of the allocation process of the ladder riding hall calling of the group management control apparatus 10 that native system is shown.In addition, the process shown in this diagram of circuit reads in preset program to perform by the group management control apparatus 10 as computing machine.
When creating the calling of new ladder riding hall at arbitrary layer (step S11 is), the information of this ladder riding hall calling is supplied to RTS evaluation section 12 via the status surveillance portion 11 of group management control apparatus 10.Thus, in RTS evaluation section 12, each cage 2a ~ 2c is calculated to the evaluation number (step S11) of RTS.
Specifically, first, RTS evaluation section 12 adds the prediction of the state considering current calling and the calling produced in the future and imagination calling that imagination produces to the ladder riding hall calling becoming distribution object.RTS evaluation section 12 calculates these call distributions to the evaluation number (step S12) when cage 2a ~ 2c according to the bounds evaluation of RTS.
The RTS evaluation number of the cage 2a ~ 2c calculated by RTS evaluation section 12 is provided to best car and selects portion 13.Thus, best car is selected portion 13 and is selected the cage of evaluation number optimum in cage 2a ~ 2c as best car.The information of the best car that this selects by RTS evaluation section 12 is supplied to together with the RTS evaluation number of cage 2a ~ 2c distributes control part 14 (step S13).
When have selected best car, distribute control part 14 first calculate this best car from current location arrive ladder riding hall calling register layer till the prediction Tx time of advent (step S14).The information, operating speed etc. of the registered calling (ladder riding hall calling/car call) that this prediction Tx time of advent exists during this period according to the Distance geometry of the register layer called out from the current location of best car to ladder riding hall calculate.
Herein, distribute control part 14 and judge whether the prediction Tx time of advent is more than Ts fiducial time (such as 30 seconds) (step S15) preset.As mentioned above, Ts registered the possibility of unpredictable calling during considering till best car arrives the register layer of ladder riding hall calling and set fiducial time.
Herein, the Tx time of advent is shorter in prediction, then best car more early arrives the register layer of ladder riding hall calling, therefore can think that the possibility registering calling (ladder riding hall calling/car call) beyong contemplation is during this period low.Therefore, at the prediction Tx time of advent than (step S15 is) fiducial time, Ts was short, distribute control part 14 and the best car selected by RTS evaluation number is directly determined be distribute car, give this best car (step S20) by this ladder riding hall call distribution.Specifically, distributing control part 14 via distributing enforcement division 15 by number machine control part corresponding with above-mentioned distribution car in the distributed intelligence number of outputting to machine control part 1a ~ 1c, making this distribution car respond the register layer of this ladder riding hall calling.
On the other hand, the Tx time of advent is longer in prediction, then can think that the possibility registering calling beyong contemplation is during this period higher.Therefore, when predicting that the time of advent, Tx was more than Ts fiducial time (step S15 is), distribute the RTS evaluation number of cage 2a ~ 2c is transformed to unit of time by control part 14 value according to (1) formula, carry out revaluing (step S16).
In above-mentioned (1) formula, by RTS evaluation number divided by calling registrating number, and its result is made even root.The reason of " by RTS evaluation number divided by calling registrating number " is, in the bounds evaluation of RTS, comprise the calling produced in the future prediction and with a large amount of callings accumulative come Calculation Estimation value.Therefore, by RTS evaluation number divided by calling registrating number be in order to obtain 1 calling aviation value.In addition, the reason of " root of making even " is, in the bounds evaluation of RTS, for the wait time quilt square of each calling.
Be described for run curve as shown in Figure 3.
Such as suppose that A machine (cage 2a) responds in 1 layer of registration ladder riding hall calling upwards.Now, 5 layers, 3 layers, 2 layers registered ladder riding hall calling downwards, the wait time of each layer is set to T1, T2, T3.
■ situation a
As situation a, suppose that the wait time of each layer is T1=20 second, T2=30 second, T3=10 second.In RST bounds evaluation, these wait times quilts square.Therefore, if be only conceived to wait time, then 20 are become 2+ 30 2+ 10 2=1400 these values.In addition, in fact, according to comprising the bounds evaluation of other key elements to obtain RST evaluation number.
■ situation b
As situation b, suppose that the wait time of each layer is T1=10 second, T2=20 second, T3=5 second.If be only conceived to wait time, then the RST evaluation number in this situation becomes 10 2+ 20 2+ 5 2=525 these values.
Like this, in RST bounds evaluation, owing to emphasizing wait time to evaluate, so evaluation number significantly can change because wait time changes a little.So, use above-mentioned (1) formula evaluation number to be transformed to the value of unit of time, thus be set to the form of the average wait time that can compare for 1 calling.
Distribute control part 14 based on the time obtained by above-mentioned (1) formula, restudy selecting of best car.That is, the time difference (step S17) that control part 14 investigates best car and other cages selected in above-mentioned steps S13 is distributed.
When there is the cage with the time difference of best car lower than threshold value TH (step S18 is), distribute control part 14 to determine, for distributing car, to give this cage (step S19) by ladder riding hall call distribution closer to a side of the register layer of ladder riding hall calling by this cage and the best car selected in above-mentioned steps S13.Specifically, number machine control part corresponding with above-mentioned distribution car that distribution control part 14 is checked the number in machine control part 1a ~ 1c via distribution enforcement division 15 exports distributed intelligence, makes this distribution car respond the register layer of this ladder riding hall calling.
Above-mentioned threshold value TH presets according to traffic needs etc., such as, be " 1 second ".That is, when the time difference with the best car selected by RST lower than 1 second, give the side of register layer closer to ladder riding hall calling by ladder riding hall call distribution.This is because, if the condition of timeliness is identical, then high apart from the possibility of a upper nearer side early arrival.
On the other hand, when there is not the cage with the time difference of best car lower than threshold value TH (step S18's is no), distribute control part 14 best car selected by RTS evaluation number directly to be determined, into distributing car, give this best car (step S20) by ladder riding hall call distribution.Specifically, number machine control part corresponding with above-mentioned distribution car that distribution control part 14 is checked the number in machine control part 1a ~ 1c via distribution enforcement division 15 exports distributed intelligence, makes this distribution car respond the register layer of this ladder riding hall calling.
Fig. 4 illustrates concrete example.
Now, suppose, in the calling of 1 layer of registration ladder riding hall, to have selected A machine (cage 2a) as best car by RTS.When cage 2a for 1 layer ladder riding hall calling the prediction Ta time of advent be more than Ts fiducial time (such as 30 seconds), by above-mentioned (1) formula, the RTS evaluation number of each machine is transformed to the value of unit of time, restudies selecting of best car.
Herein, the time of the A machine obtained by above-mentioned (1) formula is set to ta, the time of B machine is set to tb, the time of C machine is set to tc.
ta=10.5
tb=11.0
tc=12.0
Suppose that time ta, tb, tc of each machine are values as above.In this case, due to as the A machine of best car and the time difference of B machine lower than threshold value TH (such as 1 second), so by ladder riding hall call distribution in A machine and B machine closer to a side of the register layer (1 layer) of ladder riding hall calling.In the example in fig. 4, due to B machine than A machine closer to 1 layer, so by ladder riding hall call distribution to the cage 2b of B machine.
Like this, according to the 1st embodiment, by the RTS evaluation number of each machine is transformed to the value of unit of time and compares, even if the situation of the calling that registration is unpredictable such as when being in crowded, also can give best cage by ladder riding hall call distribution and make its early response.
(the 2nd embodiment)
Then, the 2nd embodiment is described.
In the 2nd embodiment, except the structure of above-mentioned 1st embodiment, also possesses the function carrying out setting threshold TH according to traffic.Condition during cage beyond the best car that this threshold value TH is obtained by RTS as retrieval and setting.
Fig. 5 is the block diagram of the structure of the cluster management system of the elevator that the 2nd embodiment is shown.In addition, for the part identical with the structure of the Fig. 1 in above-mentioned 1st embodiment, also the description thereof will be omitted to enclose identical label.
In the 2nd embodiment, group management control apparatus 10 is provided with traffic needs study portion 16 and threshold value configuration part 17.Traffic needs study portion 16 with the traffic needs of schedule time unit study (storage) each layer.The traffic of each layer needs such as by pressing every layer to ladder riding hall button 6a, 6b, the 6c by each layer ... operation registration ladder riding hall calling carry out counting to obtain.
In addition, if the not shown load transducer that the cage 2a ~ 2c being used in each machine is arranged infers the number from each layer boarding, then the traffic needs of each layer can be detected more accurately.And then, also supervision camera can be set in the boarding place of each layer, the image of this supervision camera be resolved to the number of people boarding detecting each layer.
Threshold value configuration part 17 based on the traffic needs of each layer being needed study portion 16 to learn by traffic, condition, threshold value TH during cage beyond the best car that setting retrieval is obtained by RTS.Specifically, when being still in unused when threshold value configuration part 17 judges to be in crowded based on the traffic needs of each layer being needed study portion 16 to learn by traffic.If when being in crowded, then threshold value configuration part 17 makes threshold value TH raising compared with time usual, if when being in unused, then threshold value configuration part 17 makes threshold value TH reduction compared with time usual.
Fig. 6 be the group management control apparatus 10 that native system is shown set the diagram of circuit of relevant process to threshold value.In addition, the process shown in this diagram of circuit reads in preset program to perform by the group management control apparatus 10 as computing machine.In addition, the process of this diagram of circuit performs with different from the process of the diagram of circuit shown in Fig. 2 routines, and the threshold value TH herein set is reflected in the step S18 of Fig. 2.
The traffic of group management control apparatus 10 needs study portion 16 to obtain the traffic needs of each layer by status surveillance portion 11, carries out learning (storage) (step S21) with schedule time unit.Threshold value configuration part 17 based on the traffic needs of each layer needing study portion 16 to learn by this traffic, when judgement is in crowded or when being in unused (step S22).
Such as, when the registrating number of the calling by each layer judge each layer traffic need, threshold value configuration part 17 to the registrating number of the calling of each layer of per schedule time and preset usual time registrating number compare.Its result, when the calling of each layer of per schedule time registrating number than usual time registrating number many, when threshold value configuration part 17 is judged as being in crowded.On the contrary, when the calling of each layer of per schedule time registrating number than usual time registrating number few, when threshold value configuration part 17 is judged as being in unused.
When crowded (step S23 is), threshold value configuration part 17 makes the threshold value TH of current setting improve (step S24) compared with time usual.This is because when crowded, the possibility registering unpredictable calling is higher, and RTS evaluation number easily produces error.Therefore, by improving threshold value TH (being such as set to 2 seconds), can be taken into and more select the candidate beyond into the cage of best car by RTS.
When unused (step S23's is no), threshold value configuration part 17 makes the threshold value TH of current setting reduce (step S25) compared with time usual.This is because when unused, the possibility registering unpredictable calling is low, RTS evaluation number is not easy to produce error.Therefore, by reducing threshold value TH (being such as set to 0.5 second), make the cage selected as best car by RTS preferential.
In addition, when not also being in unused when being neither in crowded, the threshold value TH (such as 1 second) preset when applying usual.
The threshold value TH set by threshold value configuration part 17 is provided to and distributes control part 14.In distribution control part 14, retrieval meets the cage of this threshold value TH, the cage this retrieved determines as distributing car or the best car selected by RTS directly being determined as distributing car, and ladder riding hall call distribution is given this cage (the step S18 ~ S20 with reference to Fig. 2).
Like this, according to the 2nd embodiment, according to traffic setting threshold TH, use the threshold value TH of this setting to retrieve the candidate of the cage beyond the best car that exported by RTS.
In this case, if be in RTS evaluation number when easily producing error crowded, be then taken into and more select the candidate beyond into the cage of best car by RTS, the cage that wherein can respond as early as possible can be given by ladder riding hall call distribution.On the other hand, when few unused of the error being in RTS evaluation number, preferentially ladder riding hall call distribution can be given and select cage into best car by RTS.
In addition, in the example of fig. 6, although switching threshold TH when crowded and time unused, such as, also can segment the degree that traffic needs further, periodically setting threshold TH.
According to above at least 1 embodiment described, a kind of can to save when crowded etc. can be provided not necessarily can to select the situation of best cage by means of only evaluation number and improve the cluster management system of the elevator of group management of performance.
In addition, although be illustrated some embodiment of the present invention, these embodiments are pointed out as an example, and intention does not limit scope of invention.These new embodiments can be implemented with other various forms, can carry out various omission, displacement, change in the scope of main idea not departing from invention.These embodiments and distortion thereof are contained in scope of invention and/or main idea, and the scope of the invention be contained in described in claims and equalization thereof.

Claims (7)

1. a cluster management system for elevator, controls the running of multiple stage cage, it is characterized in that, possess:
Evaluation section, its state based on current calling and the prediction of calling produced in the future, calculate will become distribution object ladder riding hall call distribution to evaluation number when above-mentioned each cage;
Best car selects portion, and it selects the cage of the evaluation number optimum calculated by above-mentioned evaluation section from above-mentioned each cage, as best car; And
Distribute control part, its prediction time of advent of above-mentioned ladder riding hall being called out based on the above-mentioned best car selected by this best car portion of selecting, from above-mentioned each cage, retrieval meets the cage of predetermined condition, by above-mentioned ladder riding hall call distribution to this cage retrieved or above-mentioned best car.
2. the cluster management system of elevator according to claim 1, is characterized in that,
Above-mentioned distribution control part, prediction time of advent of calling out for above-mentioned ladder riding hall in above-mentioned best car is more than the fiducial time preset, from above-mentioned each cage, retrieval meets the cage of predetermined condition.
3. the cluster management system of elevator according to claim 2, is characterized in that,
Above-mentioned distribution control part, the evaluation number of above-mentioned each cage is transformed to the value of unit of time, using the time difference with above-mentioned best car lower than this condition of the threshold value preset as above-mentioned predetermined condition, retrieval meets the cage of this predetermined condition, by above-mentioned ladder riding hall call distribution to the cage of the register layer of ladder riding hall calling close above-mentioned in this cage retrieved and above-mentioned best car.
4. the cluster management system of elevator according to claim 2, is characterized in that,
Above-mentioned distribution control part, prediction time of advent of calling out for above-mentioned ladder riding hall in above-mentioned best car is shorter than the said reference time, or when there is not the cage meeting above-mentioned predetermined condition, give above-mentioned best car by above-mentioned ladder riding hall call distribution.
5. the cluster management system of elevator according to claim 2, is characterized in that,
The said reference time, the possibility registering unpredictable calling in during considering till above-mentioned best car arrives the register layer of above-mentioned ladder riding hall calling sets.
6. the cluster management system of elevator according to claim 3, is characterized in that, also possesses:
Traffic needs study portion, and it learns the traffic needs of each layer; With
Threshold value configuration part, its traffic needs based on the above-mentioned each layer needing study portion to learn by this traffic set above-mentioned threshold value.
7. the cluster management system of elevator according to claim 6, is characterized in that,
Above-mentioned threshold value configuration part, based on the traffic needs of the above-mentioned each layer needing study portion to learn by above-mentioned traffic, when judgement is in crowded or when being in unused, above-mentioned crowded time, make the raising compared with time usual of above-mentioned threshold value, above-mentioned unused time, make the reduction compared with time usual of above-mentioned threshold value.
CN201510079226.XA 2014-03-14 2015-02-13 Elevator group management system Active CN104909224B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2014-051220 2014-03-14
JP2014051220A JP5847224B2 (en) 2014-03-14 2014-03-14 Elevator group management system

Publications (2)

Publication Number Publication Date
CN104909224A true CN104909224A (en) 2015-09-16
CN104909224B CN104909224B (en) 2017-04-12

Family

ID=54078745

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510079226.XA Active CN104909224B (en) 2014-03-14 2015-02-13 Elevator group management system

Country Status (2)

Country Link
JP (1) JP5847224B2 (en)
CN (1) CN104909224B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111517184A (en) * 2019-02-05 2020-08-11 东芝电梯株式会社 Group management system for elevator
CN112079212A (en) * 2019-06-12 2020-12-15 东芝电梯株式会社 Group management control device and group management control system
CN114644267A (en) * 2020-12-17 2022-06-21 东芝电梯株式会社 Group management control device and group management control method for double-deck elevator

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6352472B1 (en) * 2017-03-24 2018-07-04 東芝エレベータ株式会社 Elevator group management system
CN110950197B (en) * 2019-12-12 2022-04-01 中国联合网络通信集团有限公司 Selection method of intelligent elevator and intelligent elevator control device
JP7171773B2 (en) * 2021-01-04 2022-11-15 東芝エレベータ株式会社 ELEVATOR CONTROLLER, ELEVATOR CONTROL SYSTEM, METHOD AND PROGRAM

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1939830A (en) * 2005-09-27 2007-04-04 株式会社日立制作所 Elevator group management system and control method therefor
CN101056812A (en) * 2005-04-21 2007-10-17 三菱电机株式会社 Elevator group management and control device
CN102139824A (en) * 2010-01-15 2011-08-03 东芝电梯株式会社 Elevator group managing device
CN102264620A (en) * 2008-12-25 2011-11-30 富士达株式会社 Method and device for managing/controlling group of elevators

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4763403B2 (en) * 2005-09-27 2011-08-31 株式会社日立製作所 Elevator group management system and control method thereof
JP4621620B2 (en) * 2006-03-30 2011-01-26 株式会社東芝 Elevator group management system, method and program

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101056812A (en) * 2005-04-21 2007-10-17 三菱电机株式会社 Elevator group management and control device
CN1939830A (en) * 2005-09-27 2007-04-04 株式会社日立制作所 Elevator group management system and control method therefor
CN102264620A (en) * 2008-12-25 2011-11-30 富士达株式会社 Method and device for managing/controlling group of elevators
CN102139824A (en) * 2010-01-15 2011-08-03 东芝电梯株式会社 Elevator group managing device

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111517184A (en) * 2019-02-05 2020-08-11 东芝电梯株式会社 Group management system for elevator
CN112079212A (en) * 2019-06-12 2020-12-15 东芝电梯株式会社 Group management control device and group management control system
CN114644267A (en) * 2020-12-17 2022-06-21 东芝电梯株式会社 Group management control device and group management control method for double-deck elevator
CN114644267B (en) * 2020-12-17 2023-06-23 东芝电梯株式会社 Group control device and group control method for double-deck elevator

Also Published As

Publication number Publication date
JP2015174723A (en) 2015-10-05
CN104909224B (en) 2017-04-12
JP5847224B2 (en) 2016-01-20

Similar Documents

Publication Publication Date Title
CN104909224A (en) Elevator group management system
JP5511037B1 (en) Elevator group management system
CN104229570B (en) The group management control method of elevator device
JP4762397B2 (en) Elevator group management control device
CN110589642B (en) Group management control system for elevator
CN101613043A (en) Elevator cluster management system
CN103420233A (en) Group management control device and method of elevator
US9682843B2 (en) Elevator group management system
CN104030100A (en) Elevator group management control device
CN102001556A (en) Group management control device of an elevator
JP2016016990A (en) Group control system for elevator
CN105253726B (en) Elevator cluster management system and elevator control system
CN102976170B (en) Group management control device of elevator
JP2004107046A (en) Group supervisory operation control device for elevator
JP6352472B1 (en) Elevator group management system
CN104030114B (en) The group management control device of elevator
CN106414293B (en) Target dispatch covering including carriage positioning monitoring system
CN102701030A (en) Elevator group management and control device
CN104918871A (en) Elevator group management control device
JP2001058764A (en) Group supervisory control system for elevator
CN105035890A (en) Group management elevator device
JP7346683B1 (en) Elevator group management system
JP5981590B1 (en) Elevator group management control device
JP7276994B1 (en) elevator group control system
JP4341112B2 (en) Double deck elevator

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant