JP2560403B2 - Elevator group control device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an elevator group management control device, and more particularly to an elevator group management control device that manages an elevator group in response to traffic in a building that changes moment by moment. It is a thing.

[Prior Art] In recent group management of elevators, when a hall call is generated by operating a hall button of an elevator hall, a predictive calculation such as estimated arrival time at each hall when each elevator is provisionally assigned and not assigned The mainstream control method is to select a car to be assigned and then turn on the indicator light at the hall to guide the passengers.

The following method is adopted as the assigned car selection method in the conventional elevator group management method.

That is, the service state at the time when the latest call is generated when each elevator is selected as the assigned car is calculated by using a predetermined evaluation function as shown in the equation (1) based on the above prediction calculation result. This is a method of evaluating and selecting the one with the best evaluation value.

J (e) = min [J (1), J (2), ..., J (N)]
(1) J (i) = f (xik, yik, zik, ..., ik, ik, ik, ...) where e: assigned car N: total number of elevators J (i): evaluation value of elevator i xik: latest Wait time of hall call k when elevator i is assigned to each hall call yik: Forecast probability of hall call k when elevator i is assigned to the latest hall call zik: For latest hall call Forecast probability of hall call k when elevator i is allocated by ik: waiting time of hall call k when elevator i is not allocated to the latest hall call ik: elevator i is allocated to latest hall call Probability of missed forecast of hall call k when there is no ik: Probability of forecast change of hall call k when elevator i is not assigned to the latest hall call [Problem to be solved by the invention] Present time (Latest hall call has occurred Since it only evaluates the hall calls that have occurred up to the point of time), it does not consider hall calls that may occur in the future. Depending on the call,
As a result, inconvenient situations such as dumpling operation occur, and the service deteriorates.

Further, the above-mentioned conventional method is a control method using a preset evaluation function. In other words, this means that control is performed by a fixed allocation logic. However, since the traffic conditions in the building change extremely dynamically with each call at the hall, there are cases in which fixed allocation logic may not be able to keep up, which has been a cause of service degradation.

The present invention has been made in view of the above circumstances, and in consideration of not only the present time but also the traffic conditions in the near future, group management of elevators capable of efficient elevator service that immediately responds to the ever-changing intra-building traffic demand An object is to provide a control device.

[Means for Solving the Problems] A group management control device for an elevator according to the present invention performs a prediction calculation of a predicted arrival time at each floor of a plurality of elevators and a passenger load at a hall when a hall call occurs. A calculation means, an evaluation item calculation means that serves as an evaluation index of the current and near future traffic conditions when a plurality of elevators are selected as assigned cars based on the prediction calculation result, and the current and near evaluation points based on the evaluation item calculation result. From the group management rule base that stores the rule group that calculates fuzzy quantities corresponding to future traffic conditions and describes in advance the appropriate allocation method for various traffic conditions in the conditional execution form, the rule that best suits the traffic conditions at that time Rule selection means for selecting, a candidate car selection means for eliminating inappropriate elevators based on the selected rule, and a candidate car selection means It is provided with an assigned car selecting means for selecting an appropriate assigned car from the cars.

[Operation] In the present invention, the prediction calculation means performs the prediction calculation of the estimated arrival time of each elevator to each floor when a hall call occurs and the passenger load at each hall, and the evaluation item calculation means performs the prediction calculation. Based on the results, various evaluation items that are evaluation indicators of the current and near future traffic conditions when multiple elevators are selected as assigned cars are calculated, and the rule selection means calculates the evaluation items or the traffic at that time. The fuzzy amount corresponding to the state is calculated, an appropriate rule is selected from the group management rule base based on the fuzzy amount, and the candidate car selection means eliminates inappropriate elevators based on the selected rule and selects the candidate car. Then, the assigned car selecting means selects an appropriate assigned car from the selected candidate cars based on the selected rule.

Therefore, according to the present invention, it is possible to provide an efficient elevator service that immediately responds to the demands for traffic in the building, which is constantly changing.

Embodiments Embodiments of the present invention will be described in detail below with reference to the drawings.

FIG. 1 is an overall configuration diagram of an elevator group supervisory control device according to an embodiment of the present invention.

In the figure, the operation control unit 1 takes in information regarding the states from the elevator control devices 9 _{1 to} 9 m corresponding to the respective units and the hall control devices 10 ₁ to 10 n at each landing, and controls the operation and the like. 9 ₁ ~9m and
It is intended to be sent to 10 ₁ to 10n.

When a hall call occurs, the call assignment control unit 2 selects and assigns an appropriate assigned car to the hall call.

The group management rule base 3 stores an elevator allocation method required for group management in a conditional execution format.

The call allocation control unit 2 calculates the estimated arrival time of each elevator at each landing and the prediction calculation sub-unit 4 that performs a calculation calculation of the passenger load at each landing, and based on the prediction result of the prediction calculation sub-unit 4. When the elevator is selected as the assigned car, the evaluation item calculation sub-unit 5 that calculates various evaluation items that are evaluation indicators of the current and near future traffic conditions, and the fuzzy amount related to the traffic condition are calculated from the calculated evaluation items. , A rule selection subunit 6 that selects a rule that best suits the traffic condition from the group management rule base 3, and a candidate car that selects an elevator group that is an allocation candidate by eliminating inappropriate elevators based on the selected rule. The final assigned car is determined from the selected sub-unit 7 and the selected candidate car based on the selected rule. Assigned car determination sub-unit 8
It has.

Next, the operation of the present embodiment configured as described above will be described below.
This will be described with reference to the flowchart in the figure.

First, when a hall call occurs at a certain landing (Step S
0), information about the operating state of each elevator and each hall call generation state up to that point is transmitted to the call assignment control unit 2 via the operation control unit 1 (step S1).

In step S2, the prediction calculation subunit 4 performs a prediction calculation of the estimated arrival time at each hall of each elevator and the passenger load at each hall of each elevator. That is, when a hall call occurs, the estimated arrival time from the floor where the elevator is currently located to each floor is calculated for each elevator. Then, the passenger load prediction calculation is performed by calculating the number of passengers in the elevator. For example, if an elevator with x passengers is scheduled to stop on the fth floor, when it is predicted that y passengers will get off and z passengers will get on the fth floor, the passenger load prediction on the fth floor of this elevator is predicted. The value is (x-y + z). This passenger load prediction calculation is performed for each elevator and each hall.

In the next step S3, based on the prediction calculation result of the prediction calculation sub-unit 4, the evaluation item calculation sub-unit 5 makes various evaluations which are evaluation indexes for the current and near future traffic conditions when each elevator is selected as the assigned car. Calculate items. That is, the waiting time at each landing expected when each elevator is selected as the assigned car, the expected change probability for the registered hall call and the out-of-forecast probability, and the position of each elevator in the near future and their correlation Calculation of relationships and their maximum and average values.

In step S4, the rule selection sub-unit 6 calculates the fuzzy amount for each traffic state using the evaluation item calculation result of the evaluation item calculation sub-unit 5 by fuzzy inference from the rule group stored in the group management rule base 3. , Select the rule with the largest amount of fuzzy, ie the rule that best fits the traffic conditions.

The rule groups stored in the group management rule base are described in the condition-execution (IF-THEN) format as shown below.

(RULE N) IF ((condition-N1) or (condition-N2)) and (condi
tion-N3) ・ ・ ・ and (condition-Nn) THEN (Procedure-N) where “condition (IF part)” indicates the conformity of each rule to the traffic state, and each (condition) and , or are connected by a connecting branch. Further, each (condition) indicates a matching condition with respect to the traffic condition at each time. For example, a condition such as “the maximum waiting time that occurs when the elevator A is assigned is T seconds or less” is max-wait ( A) .LT. [T | b]. The suitability of each of these matching conditions is expressed by a fuzzy amount defined by associating the subjective ambiguity that a certain amount is “large” or “small” with a value from 0 to 1. Specifically, it is obtained by a membership function as shown in FIG. Fig. 4 shows that GT. [T | b] ・ LT. [T | b] ・ EQ. [T | b] is Are shown respectively.

The calculation of the fuzzy amount and the rule selection for the “condition” will be described with reference to the flowchart of FIG.

In step SA1, the rule selection subunit 6 uses the evaluation item operation result of the evaluation item operation subunit 5 to calculate the membership function value Cij of (condition-ij) of the rule i. That is, in rule 1, (condition-1
1), (condition-12), ..., (condition-1k),
…, Rule 2 (condition-21), (condition-2
2), ..., (condition-2k), ..., (condit of rule m
ion-m1), (condition-m2), ..., (condition-m
Calculate membership function values for k) ,.

In step SA2, the rule selection subunit 6 calculates the fuzzy amount Ci of the rule i by the connecting branch and, or between (dondition). That is, rule 1 fuzzy amount C1, rule 2 fuzzy amount C2, rule m
Calculate the fuzzy amount Cm of each.

At this time, for example, each (condition) of rule i is (condi
tion-i1) and ((condition-i2) or (condition-i
If they are connected as shown in 3), the calculation procedure will be Ci = min {Ci1, max {Ci2, Ci3}}.

In step SA3, the rule selection subunit 6 selects a rule having the maximum fuzzy amount C (max) among the fuzzy amounts C1, C2, ..., Cm, ... Of each rule.

In FIG. 2, in step S5, the candidate car selection subunit 7 executes the "execution (THEN part)" of the selected rule.
And select a candidate car. The "Procedure" of the rule "execution" describes the procedure to be executed when the rule that most satisfies the "condition", that is, the rule having the maximum fuzzy amount, is selected.

Here, for example, there is a condition such as "there is a high possibility that the dumpling operation will occur in the near future if the elevator A is assigned" is set in the "condition", and the description "excluding the elevator A" is included in the "execution" If there is, execute it and select a candidate car.

In step 6, the candidate car selection sub-unit 7 executes "execution" of the selected rule and selects a final assigned car from the candidate cars. Here, for example, if there is a description such as “select the elevator with the smallest waiting time average among the candidate cars” in the “execution” of the selected rule, it is executed and the assigned car is selected.

In step 7, the call allocation control unit 2 sends an operation command and a forecast command to the hall to each elevator via the operation control unit 1. These procedures are done online.

Therefore, in the present embodiment, not only the present traffic situation but also the near future traffic condition is recognized, and the service elevator is squeezed by the rule group describing the appropriate allocation method, which may occur in the near future. Inconvenient situations can be avoided in advance, and flexible and efficient elevator services can be provided for the various changes in the building environment.

[Effects of the Invention] As described above, the present invention captures the current and near future traffic conditions when assigning each elevator to a hall call as a fuzzy amount, and selects the rule that best suits each condition online. However, since the appropriate allocation car is selected according to the selected rule, it is possible to avoid inconvenient situations that may occur not only at the present time but also in the near future, and against the ever-changing building environment. This has the effect of enabling a flexible and effective elevator service.

[Brief description of drawings]

FIG. 1 is a block diagram of an elevator group management control system according to the present invention, FIGS. 2 and 3 are flow charts showing the operation of the elevator group management control system shown in FIG. 1, and FIG.
The figure is an illustration of the membership function. In each figure, 1 is an operation control unit, 2 is a call allocation control unit, 3 group management rule base, 4 is a prediction calculation subunit, 5 is an evaluation item calculation subunit, 6 is a rule selection subunit, and 7 is a candidate car selection. Subunit,
8 is an assigned car selection subunit. In the drawings, the same reference numerals indicate the same or corresponding parts.

Claims (1)

(57) [Claims] 1. A plurality of elevators working between floors,
Hall call means provided on each floor for calling the elevator, and a prediction calculation for predicting arrival time of each of the plurality of elevators at each landing and a passenger load at each landing by the generation of the hall call. Means, a group management rule base in which an appropriate elevator allocation method is described in a conditional execution form in advance, and a fuzzy amount corresponding to not only the time when a call occurs but also the traffic condition evaluation in the near future is calculated, and based on the fuzzy amount Rule selection means for selecting an optimum rule from the group management rule base, candidate car selection means for excluding inappropriate elevators based on the selected rule, and elevators not excluded by the candidate car selection means An elevator group management control device, comprising: an assigned car selecting means for selecting an assigned car based on a selected rule.