JPH0114150B2 - - Google Patents

Description

[Detailed description of the invention]

[Technical Field of the Invention] The present invention relates to group management control of a plurality of elevators, and particularly to an evaluation method for selecting an assigned car for a common hall call that occurs. [Technical Background of the Invention] With the remarkable development of microcomputers and the like, in recent years it has become common to use small electronic computers such as microcomputers as the core of group management control systems that manage multiple elevators. I'm getting used to it. Then, various signals of the elevator car status and hall status are obtained, and the computer is caused to calculate a comprehensive evaluation formula to determine the optimal car number for the target hall call. Various evaluation formulas are used, and for example, there is one expressed by the following formula. E=F(X _d , C _d , H _d , W _d )+T _d ……(1) (However, E is the value of the evaluation formula, F indicates the function, and X _d is the boarding area to be calculated. Relative floor difference by ascending/descending direction for each car to be calculated, C _d is the number of car stops due to car calls alone up to the landing to be calculated, H _d is the number of stops assigned to a hall call on the way to the landing to be calculated. (W _d is the car load, and T _d is the waiting time at the hall that has passed by the time the evaluation value is calculated.) In addition, each car is provisionally assigned to the hall call that has occurred, and the maximum predicted waiting time at that time is calculated. A method of allocating the car with the minimum value to the floor where the hall call occurred,
There is a method of allocating the car to the car that minimizes the total waiting time of all registered hall calls. The purpose of each evaluation formula is to shorten and equalize the waiting time of passengers waiting at the landing, and with this in mind, they allocate the most suitable elevator among the multiple elevators. However, these evaluation formulas are based on the waiting time distribution, and the statistical distribution of the waiting time was not as good as expected. As a result, the average value of waiting time becomes large or the variation becomes large, and further improvements are desired in terms of passenger service and driving efficiency. [Purpose of the Invention] The present invention has been made in view of the above circumstances, and aims to improve service to users by shortening and equalizing waiting time at boarding points. The purpose of this invention is to provide a group management control method for elevators. [Summary of the Invention] In other words, in order to achieve the above object, the present invention operates a plurality of elevators for a plurality of floors,
The optimal elevator is determined using a comprehensive evaluation formula that determines elevator operation for a hall call that has occurred, and the optimal elevator is determined in group management control of elevators that is assigned to the hall where the hall call has occurred. When doing so, the generated hall calls are provisionally assigned to each elevator, and the average value of the expected waiting time t _i of all registered hall calls at that time and the addition value of the standard deviation increasing function are calculated for each elevator. In addition to the evaluation value, the elevator with the lowest evaluation value is assigned to the hall call that has occurred, thereby actively shortening and equalizing the waiting time at the hall from a statistical point of view, and reducing the standard deviation. By making this a major element in the evaluation formula, it is possible to actively control the distribution of landing waiting times. Specifically, for example, the evaluation value E(X) of car X (elevator X) is E(X) = K ₁ (X) + K ₂ S(X)
……… however

【formula】

(E(X) is the evaluation value when the car is provisionally allocated,
K ₁ and K ₂ are the normal numbers, N is the number of registered hall calls, and t _i (X) is the number of already registered hall calls (occurred hall calls) when X car is provisionally assigned to the generated hall call. ), (X) is the expected average value of t _i (X), S
(X) is the expected value of the standard deviation of t _i (X)), and E
Find (X) for each car, (X=A, B, C......
(to find E(A), E(B), E(C)...)
E(X) is the one that allocates the smallest car to the generated hall call. [Embodiment of the Invention] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing the configuration of a group management system implementing the present invention. In the figure, 2 is a hall call registration device that registers calls from each hall. In addition, 5A to 5D are each elevator unit (single)
This is an individual control device that controls the movement of the cars, and subscripts A to D are attached to each car to distinguish them. 30 is a group management control device, which controls the movement of each car based on the hall call and information on each car. Further, the signal line connecting these is shown as one signal line in the figure even when a plurality of parallel signal lines are used. The group management control device 30 has a car status information table 2.
2. Hole condition information table (hereinafter,
When a hall call is registered by the hall call registration circuit 2, each hall call is sent to the HCT 24 (held in a part of memory) in the group management control device 30. Bit <11> of the data of the corresponding index is set (the position and meaning of each bit are predetermined), and the arithmetic unit (including input/output device) 26 in the group management control unit 30 sets this bit. In this case, the optimum car is selected from among the four elevators (A to D), and the sub-car call registration circuits 13A to 1 in the control device 5 of the optimum car are selected.
Give layout output to 3D. At this time, the hall lantern, that is, the forecast light is turned on. At the same time, bit <10> of the index of the hall call to be allocated in the HCT 24 and allocation bits <0> to <3> corresponding to the car number are set. Then, when the assigned car decelerates in response to the landing assignment,
The hall call registration is cleared by the car position signal from the car position selectors 14A to 14D, and the HCT 24
Bit <11> of is also reset. Also, this assigned car slows down and opens the door,
After servicing the landing, the car position selector 1
The hall lantern is turned off by the car position signal from 4A to 14D, and at the same time, the assigned bit, that is, bit <10> of HCT24, is also reset, and bits <0> to <3> corresponding to the car number are also cleared. . Reference numerals 11A to 11D are car call registration circuits, and when car call registration switches 15A to 15D are turned on, the car call registration switches 15A to 15D on the in-car operation panel are provided inside the car and input the desired stop floor, input door opening/closing instructions, etc. When operated, the car call is registered, the bit (any of bit <0> to bit <3>) corresponding to the corresponding car in the car call status information table KCT23 is set, and the floor where the car call was registered is set. After servicing, the car position selectors 14A to 14
The car position signal is obtained from D, the car call registration is deleted, and the bit corresponding to the corresponding car of KCT23 is also reset. 12A to 12D are car status buffers, which receive car position signals from selectors 14A to 14D, as well as contacts 16A to 1 such as relays that close when the door is opened.
6D, relay contact 17 that closes when it becomes a non-directional state
A~17D, contacts 20A~2 that close while the car is running
0D, relay contact 21A that closes when group control is possible
-21D etc. are input and are given to the car status information table (hereinafter referred to as CCT) 22 (held in memory) in the group control device 30 for each car as a car status signal. be. The car status signals held by the car status buffers 12A to 12D are stored and held within the CCT 22. FIG. 2a shows a general flowchart of the control method of the present invention executed by the arithmetic unit 26, and FIG. 2b shows a flowchart showing details of the routine between B1 and C1 in FIG. 2a. In FIG. 2a, when the program starts, RAM (Random Access Memory; here refers to the memory that constitutes the storage section of the arithmetic unit 26,
CCT22, KCT23, HCT24, etc. are also placed here. ) and initial clear of input/output,
Enter the repeat start RS routine. In the repeat start RS routine, the car status information table (CCT) 22 and the car status information table (KCT)
23, no processing will be performed if all cars are outside the group, and if there is even one car in the group, processing related to the car status (processing when changing direction, changing full occupancy allocation, etc.) will be performed, and the hall index will be changed. (Hall index is a number assigned to each floor as an index from 0 to n according to the direction of ascending or descending, for example, 10d, 9d, 8d, 7d, etc.)
If there is a table of hall calls by direction such as 8u, 9u (d and u are directions for descending and ascending, and numbers indicate floors), the index of 10d is 0, the index of 9d is 1, and the index of 8d is 2) is set to 0, and the word (information for one word length) corresponding to that hole index in each hall call status table (HCT) 24 is set to 0. Then, the hall call allocation process (FIG. 2b) begins. Next, set the hole index to 1
Plus, perform the same process for the next landing.
When the processing for all the landings is completed, distributed standby processing, advance command processing, and other processing are executed, and the process returns to the repeat start RS routine to repeat these processing. FIG. 2b is a flowchart showing a hall call allocation method, in which bit <11> of HCT(i) in FIG. 1 corresponding to the hall index is checked, and if there is a hall call, bit <10 of HCT is checked. >, check
If it is not allocated, HCT is the landing arrival time corresponding to car index j (car index).
Calculate from information such as KCT, CCT, etc., calculate the overall evaluation value, select the optimal car, and output the allocation. The feature of the present invention lies in the method of determining the comprehensive evaluation value at this time. An example of a formula for calculating the predicted arrival time T _i at hall i (hall i) in the present invention is shown. T _i = _o 〓 ^k=1 f(xk)+(n-1)t _dp ……(2) However, f(xk) is the xk floor travel time, and n is the calculation target landing call floor (i floor) The predicted stop floor number at which the car will stop, T _dp , is the expected time required to open and close the door (for simplicity, it is assumed to be the same for both hall call stops and car call stops). The above predicted arrival time differs depending on the car to which the hall call (hall call) is provisionally allocated. Further, the elapsed time T _i ' from when the hall call was registered is stored in the RAM of the arithmetic unit 26 in the group management control device 30 as shown in FIG. 3, and is counted up by a timer interrupt of the arithmetic unit 26. Ru. To obtain the predicted waiting time t _i from the above-mentioned predicted arrival time T i and the elapsed time T _{i ′} since the hall call was registered, it is sufficient to add the two. That is, t _i =T _i ′+T _i
is required. However, the present invention can be practiced without being limited by the above formula. Since T _i in the above equation is the predicted arrival time when provisionally assigned to a hall call that has occurred, it differs depending on the car to which the car is provisionally allocated, so the predicted waiting time t _i when provisionally allocated to a certain car is also provisionally allocated. Varies depending on the basket. Therefore, the predicted waiting time at hall i when X cars are provisionally allocated is expressed as t _i (X). (However, i=1,
2,......N) Estimated waiting time t _i (x) of the hall where the hall call is registered (including the generated call) when the X car is tentatively allocated.
The average value (X) and its standard deviation S(X) of [i=1, 2, . . . , N] are determined from the following equation. Here, (X) indicates the average waiting time when X car (elevator X) is assigned, and S
(X) indicates the degree of variation in waiting time, and N indicates the number of registered hall calls. From the above (X) and S(X), if X car is assigned, the evaluation value E(X) is calculated using the following formula: E(X)=K ₁ (X) + K ₂ S(X) ……( 5) K ₁ K ₂ is a constant (K ₁ , K ₂ >0) The value E(X) in the above formula is calculated for each car. In other words, the evaluation value E(A) is obtained by temporarily allocating the hall call to the car A by varying the number of cars as X = A, B, C, etc.
Similarly, find E(B), E(C)... This evaluation value E
(X) allocates the smallest car to the hall call that occurs.
The first term in the above equation is an increasing function based on the average value of waiting time, and the second term is an increasing function of variation in waiting time.If K ₁ , K ₂ >0, shortening and equalizing waiting time Realize. If K ₁ is set to a large value, the waiting time will be reduced more strongly, and if K ₂ is set to a large value, the waiting time will be equalized more strongly. In addition, the above equation is a parameter (average, standard deviation, etc.) that represents the characteristics of the waiting time distribution.
This evaluation formula includes the following, and it can be seen that this provides an allocation method that actively utilizes and controls the waiting time distribution. Next, the optimum car will be selected by applying the evaluation formula of the present invention according to FIG. Figure 4 is from the first floor.
In a building with up to 10 floors and 4 elevators from A to D, when a car call, assigned call, or assigned call on each floor is answered, the resulting car call, registered hall call, etc. Assume that the distribution is as shown in the figure, and shows a state where a descending hall call occurs on the 9th floor at that time. Now, K ₁ = 2, K ₂ =
1, E(X) = 2 x (X) + S(X) ...(6) The predicted waiting time before the 9d call (descending call at the landing on the 9th floor) is t _dp = 5 seconds f(x _k ) = 4 + 2x _k seconds then 1u; t ₁ = 10 + f (6) + f (3) + t _dp = 10 + 16 + 10 + 5 = 36 seconds 4d; t ₂ = 30 + f (6) = 30 + 16 = 46 seconds 4u; t ₃ = 20 + f (2) + f (1) +t _dp = 20 + 8 + 6 + 5 = 39 seconds 6d; t ₄ = 10 + f (7) + f (4) + t _dp = 10 + 18 + 12 + 5 = 45 seconds. If the next hall call 9d is provisionally assigned to car A, and the predicted waiting time for 9d is t ₅ , then t ₁ (A) = t ₁ = 36 seconds t ₂ (A) = t ₂ = 46 seconds t ₃ (A)=39 seconds t ₄ (A)=t ₄ =45 seconds t ₅ (A)=f(3)+f(3)+f(1)+2×t _dp =10+10+6+2×5=36 seconds ∴E(A)=2×(A)+S(A)=85.6 Next, try temporarily assigning it to car B. t ₁ (B) = 10 + f (1) + f (5) + f (3) + 2 × t _dp = 10 + 6 + 14 + 10 + 10 = 50 (seconds) t ₂ (B) = 30 + f (1) + f (5) + t _dp = 30 + 6 + 14 + 5 = 55 ( t ₃ (B) = t ₃ = 39 (seconds) t ₄ (B) = t ₄ = 45 (seconds) t ₅ (B) = f(1) = 6 (seconds) (B) = 50 + 55 + 39 + 45 + 6/5 =39.0 (seconds) ∴E(B)=2×(B)+S(B)=97.4 Next, try temporarily assigning it to the C car. t ₁ (C) = t ₁ = 36 (seconds) t ₂ (C) = t ₂ = 46 (seconds) t ₃ (C) = t ₃ = 39 (seconds) t ₄ (C) = t ₄ = 45 ( t ₅ (C)=f(2)+f(1)+f(2)+f(1)+4×t _dp (seconds) =8+6+8+8+6+20=56(seconds) (C)=36+46+39+45+56/5=44.4(seconds) ∴E(C)=2×(C)+S(C)=96.5 Next, try temporarily assigning it to car D. t ₁ (D) = t ₁ = 36 (seconds) t ₂ (D) = t ₂ = 46 (seconds) t ₃ (D) = t ₃ = 39 (seconds) t ₄ (D) = 10 + f(7) + f (1) + f (3) + 2 × t _dp = 10 + 18 + 6 + 10 + 10 = 54 (seconds) t ₅ (D) = f (7) + f (1) + t _dp = 18 + 6 + 5 = 29 (seconds) (D) = 36 + 46 + 39 + 54 + 29/5 = 40.8 (seconds) ∴E(D)=2×(D)+S(D)=91.2 Therefore, the minimum value of the evaluation value E(X) is E(A), and the optimal car is A car, that is, elevator of car A. is selected and assigned to the generated hall call 9d. When a hall call occurs in this way, a car with a small predicted average value of unanswered time (approximately equal to waiting time) of all registered hall calls at that time, and a car with a small variation from this predicted average value. This makes it easier to allocate the waiting times, so the statistical distribution of waiting times can be actively used for control, and the waiting times can be shortened and made uniform. It should be noted that the present invention is not limited to the embodiments described above and shown in the drawings, and can be implemented with appropriate modifications within the scope of the gist thereof.For example, in the above explanation, the evaluation formula E=F(,S ) In other words, it was a function of the mean value and standard deviation, but other parameters representing the waiting time distribution, such as skewness, kurtosis, probability of 30 seconds or less (%), and percentage of 60 seconds or more (%), were evaluated. It may be added to one element of. [Effects of the Invention] As detailed above, the present invention puts a plurality of elevators into service for a plurality of floors, and uses a comprehensive evaluation formula to determine the operation of the elevator for each hall call that occurs, to determine the optimal elevator. In elevator group management control, when determining the optimal elevator, a hall call is provisionally assigned to each elevator, and all registered hall calls are assigned to the hall where the hall call has occurred. The average value of the expected waiting time t _i of a hall call and the addition value of the increasing function of the standard deviation are calculated for each elevator and used as an evaluation value, and the elevator with the minimum evaluation value is assigned to the generated hall call. Therefore, this assignment is based on the current location and direction of operation of each elevator for a hall call, and each hall required to service the floor for which each hall call is registered in response to an already assigned call. By finding and allocating the elevator with the minimum sum of the average predicted waiting time and its deviation value, it becomes possible to provide service with the minimum waiting time, thereby reducing the waiting time. It is now equalized, and since the standard deviation is used as an element in the evaluation formula, the distribution of waiting times at landings can be actively controlled, making rational and effective elevator group management control possible. It is possible to provide a group management control method for elevators having the following.

[Brief explanation of drawings]

FIG. 1 is a system configuration diagram of the present invention, FIG. 2 is a flowchart of group management control according to the present invention, FIG. 3 is a diagram showing a hall call registration elapsed time storage table, and FIG. 4 is a specific example of the present invention. It is a figure for explaining. 2... Hall call registration circuit, 5A to 5D... Elevator single control device, 1U, ~9U, 2D to 10D
... Hall call registration relay, 11A to 11D ... Car call registration circuit, 12A to 12D ... Car status buffer, 13A to 13D ... Semi-car call registration circuit, 14
A to 14D... Selector, 15A to 15D... Car call registration button switch, 16A to 16D... Relay contact that closes when the door is opened or closed, 17A to 17D...
...Relay contact that closes when there is no direction, 18A to 18D
...Relay contacts that close when driving, 19A to 19D
...Relay contact that closes in the ascending direction, 20A to 20D
...Relay contact that closes in descending direction, 21A to 21D
...Relay contact that closes when group management control is possible, 22...
... Car state information table "CCT", 23 ... Car call state information table "KCT", 24 ... Hall call state information table "HCT", 26 ... Arithmetic device,
30...Group management control device.

Claims (1)

[Claims] 1 Multiple elevators are put into service for multiple floors, and the optimal elevator is determined using a comprehensive evaluation formula that determines elevator operation for each hall call, and is assigned to the hall where the hall call occurs. In the group management control of elevators, when determining the optimal elevator, the generated hall calls are provisionally assigned to each elevator, and the average value and standard of the expected waiting time t _i of all registered hall calls at that time are calculated. A group management control method for elevators, characterized in that an added value of an increasing function of deviation is determined for each elevator and used as an evaluation value, and the elevator with the minimum evaluation value is assigned to the generated hall call.