JPH0138752B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an improvement in an elevator group management device, and more particularly to an elevator group management device that statistically predicts the occurrence of future hall calls.

First, a conventional elevator group management system will be described with reference to FIGS. 1 and 2.

In FIG. 1, 1 is a hall call button provided in an elevator hall, and 10 is a group management control device that performs group management of a plurality of elevators. A processing unit (hereinafter abbreviated as CPU) 11, a data transmission element (consisting of Intel 8251 or the like) 12 connected to the CPU 11 via a bus line 15, a read-only memory (ROM) and a random memory.
It is comprised of a memory 13 comprised of an access memory (RAM), etc., and a voltage converter 14 connected between the hall call button 1 and the bus line 15. Further, reference numeral 20 denotes a control device that receives commands from the group control device 10 and controls the movement of the elevators of each car, and is provided for each car (only one is shown in the drawing).
0 is connected to a central processing unit (hereinafter abbreviated as CPU) 21 consisting of a microprocessor or the like via a bus line 25, and is capable of exchanging data with the transmission element 12 of the group management control device 10. a data transmission element 22 connected to a memory 23 consisting of ROM, RAM, etc., and a voltage converter 24 connected between an external device 2 and a bus line 25.
It is composed of.

In the elevator group control device configured as described above, when the hall call button 1 is pressed, the group management control device 10 controls the hall call button 1 via the voltage converter 14.
It detects that the button has been pressed, and if predetermined conditions are met, this is registered. When a call is registered, a program corresponding to the flowchart of FIG. 2 stored in the memory 13 is executed to allocate the call to each machine. Data exchange at this time is performed via the transmission elements 12 and 22. Each control device 20 that has received the assignment operates the elevator according to the assignment.

The operation of the above allocation process will be explained in detail using FIG. First, when the hall call data is taken into the CPU 11 by pressing the hall call button 1, the hall call is registered in step 31, and each elevator is sent to the hall call using the current floor and other data of each car. In step 32, the expected arrival time is calculated to determine how many seconds from now the vehicle will arrive at the destination. And the next step
Step 33, based on the registered calls and the expected arrival time of each car calculated in step 32, consider the psychological waiting time for passengers, etc., and calculate the evaluation value when the above calls are assigned to each elevator. Calculate. Upon completion of this calculation, the process moves to the next step 34, where the optimum elevator number is selected according to the evaluation value, and a call assignment command is given to the control device 20 corresponding to that number.

However, the allocation evaluation calculation in the conventional elevator group management control device 10 was calculated based on, for example, the following calculation formula. Here, the expected waiting time for each call is expressed by the following formula.

(Expected waiting time) = (Call registration elapsed time up to now) + (
(Estimated time from the current time of the car assigned to that call to arrival at the called floor) The group control elevator is 8 from car #0 to car #7.
If a new call occurs, for example, an upbound call on the 8th floor, and if the call is assigned to machine #0, it will not be assigned to machine #0. The expected waiting time for a certain floor should change depending on whether that car answers the call. Similarly, if the above call is assigned to car #1, the expected waiting time for a floor other than the above where a call has already been registered will be affected.

When a new call is registered in this way,
Depending on which car the call is assigned to, the expected arrival time for each floor that has already been registered changes. This is symbolized and expressed as Tij: the expected waiting time of floor i, where there is already a registered call, when a newly registered call is assigned to machine #j.

Using this symbol, the allocation evaluation calculation in step 33 takes into account the importance of the landing area, etc.
The main part is calculated by the following formula.

(Assignment evaluation value when a new registered call is assigned to machine #j: J _j ) = 〓 ⁱ f (Tij) + f (Tj) (Floor where there is already a registered call) Here Σ is generally used In the sense of sunmation, Tj is the expected arrival time of a newly registered call at a certain floor by assigning it to machine #j, and f( ) is a functional expression, which is based on psychological In many cases, a square function formula is used in consideration of the waiting time and the like.

In this way, when a new registered call is assigned to each machine, the respective assignment evaluation values J ₀ to J ₇ can be calculated. Further, in step 34, allocation is performed by selecting the car that has achieved the smallest value among the above-mentioned allocation evaluation values.

However, in the calculation formula for allocation evaluation as mentioned above,
Calculations are performed using information on hall calls registered up to that point, and because there is insufficient consideration of hall calls that will occur in the future, it cannot be said that optimal allocation will be possible in the future.

This invention solves the above-mentioned problem by adding data on expected occurrence of hall calls to the registered allocation evaluation value for hall calls.
The object of the present invention is to provide an elevator group management device with shorter waiting time and better service.

Embodiments of the present invention will be described below with reference to FIGS. 3 to 6.

FIG. 3 shows an example of an elevator group management device according to the present invention, and similarly to FIG. A control device (1 in the drawing) corresponding to each machine controlled by the device 10
The group management control device 10 and each car control device 20 are composed of parts shown with the same names as in FIG. 1. Reference numeral 40 is a statistical arithmetic processing unit that takes statistics on call occurrences for each floor, which is the main part of this invention.
41 and a bus line 46, which stores a processing program for taking statistics on call occurrences.
It is composed of a memory 43 consisting of ROM and RAM, and a data transmission element 45 that transmits data to the group management control device 10.

Next, the operation of the apparatus according to the present invention constructed as described above will be explained based on the flowchart shown in FIG. 4 and subsequent figures.

FIG. 4 shows the memory 4 of the statistical calculation processing device 40.
This shows the flow of the program contents written in 3, and calculates the average time for which no calls are registered for each floor. That is, in step 51, when calculating the average time for which no call is registered for each floor, it generally starts with an upward call on the lowest floor, and initializes the floor at that time.
In addition, step 52 is for determining whether or not all floors have been scanned. If the above calculation has been completed for all floors, the process moves to step 58. A process of transmitting data of the results to the group management control device 10 via the transmission element 45 is executed. In addition, if the scanning of all floors is not completed in step 52, advance one floor to the next floor and proceed to the next step.
53.

Since the floor to be calculated is set in step 52, a check is performed in step 53 to see if a call is currently registered on that floor. If it is not registered, the process moves to step 57. The occurrence time counter is counted up and the process returns to step 52. Furthermore, if it is determined that the call has been registered as a result of the determination in step 53, the process moves to step 54 to check whether the registration is a newly registered call or not. If so, the average call occurrence time is calculated in step 55 using the results counted up as the occurrence time counter up to that point, and the occurrence time counter is reset in the next step 56. If it is not a newly registered call, the process goes directly to step 56 without performing the average calculation, and resets the occurrence time counter to zero.

At this time, if the program shown in the flowchart of Fig. 4 is designed to be activated by a timer interrupt operation every second using an external timer element (not shown) such as Intel 8155, the above-mentioned generation time can be The counter will directly display the time during which no calls are registered.

FIG. 5 is a processing routine showing details of step 55 of calculating the average call origination time shown in FIG. 4, and step 62 is a processing step for checking how many times the average value has been calculated. , N is a preset value, for example 100, and if the above number of times is less than N, the process moves to step 63 to count up the above number of times, and if it is determined that it is greater than or equal to N. If so, proceed directly to step 64. Step 64 is a processing step for performing a well-known average calculation, and is a processing step for performing the calculation of the formula shown below.

(New average value) = {(Number of calculations) x (Old average value) + (Occurrence time counter)} ÷ {(Number of calculations) + 1} In other words, in processing step 64 in FIG. 5, the above calculation is repeated many times. Therefore, the number of calculations described above becomes infinitely large. On the other hand, step 62
When the number of calculations is N or more, it is approximated to N by adding , and the calculation can be performed without the above problem. Therefore, the flowchart of FIG. 5 calculates the average occurrence time by calculating the time during which call registration is not performed for each floor.

Note that, depending on the use of the building, it may be better to define the average call generation time as the period from the generation of a call to the generation of the next call.

The average call origination time calculated by the statistical processing unit 40 as described above is transmitted to the group management control device 10, and the group management control device 10 that receives this data determines the occurrence of future calls. Taking this into consideration, the allocation evaluation calculation is performed as shown in the following formula.

J _j = [{ 〓 ⁱ f (T _ij )} + f (T _j )] + [(weighting coefficient) × 〓 ⁱ f {T _ij − (average call generation time of floor i)}] , i in the previous section of the item enclosed in square brackets [ ]
is a floor with a registered call; i in the latter section is a floor without a registered call (unregistered floor);
T _ij is the expected waiting time of the i floor with an already registered call when a newly registered call is assigned to machine #j, and T _ij in the later section is Expected waiting time for floor i with no recently registered calls when assigned to machine _#J is the allocation evaluation value when a newly registered call is assigned to machine #j, Σ is generally used Sunmation, T _j
is the expected arrival time of the newly registered call at the floor where the call is located by assigning it to car #j, and f( ) is the functional expression.

Therefore, in the above formula, the former term enclosed in square brackets [ ] is the same evaluation item as in the conventional formula, and the latter term is an evaluation item newly added according to the present invention. In other words, the above equation is the sum of the conventional allocation evaluation value and the expected call occurrence on an unregistered floor multiplied by a certain weighting coefficient. In other words, by including predicted calls that are predicted to occur in the future in the above-mentioned conventional calculation formula for the allocation evaluation value, evaluation calculations can be made that predict future calls rather than based on data only at that point in time. This will allow us to provide a group control elevator with better service than currently available.

Note that although the statistical calculation processing device in the above embodiment does not collect detailed statistics for days of the week or time slots, more detailed control can be performed if such information is also taken into account. In addition, the above-mentioned allocation evaluation method is called the comprehensive evaluation method, but other evaluation methods, such as the MIN and MAX evaluation method, evaluate the MAX number of calls assigned to each car. The present invention is not limited to the allocation evaluation method of this embodiment, and can be similarly implemented using an evaluation method in which calls are allocated to the car with the least predicted service time.

As explained above, the present invention, in the hall call allocation system of group control elevators, selects the most suitable allocation car for calls, even in the future, even on floors where no calls are registered, thereby reducing waiting time. It is possible to provide group control elevators that are small in number and provide good service.

[Brief explanation of drawings]

FIG. 1 is a schematic configuration diagram of a conventional group management elevator system, FIG. 2 is a flowchart of call assignment calculation in the conventional system, and FIG. 3 is a schematic configuration diagram showing an example of a group management elevator system according to the present invention. FIG. 4 is a flowchart of statistical calculation processing in the present invention, and FIG. 5 is a flowchart showing details of average call generation time calculation in the processing flow of FIG. 4. 1... Hall call button, 10... Group management control device, 2
0...Each machine control device, 40...Statistical calculation processing device. Note that the same reference numerals in the figures indicate the same or equivalent parts.

Claims (1)

[Claims] 1. In a group management elevator system using the assignment evaluation method, which has a group management control device that performs group management of elevators of multiple cars, and a separate car control device that receives commands from this group management control device and controls the movement of each car, Unregistered hall calls when the above-mentioned hall calls are assigned to each car based on the calculation processing means that statistically predicts the occurrence of future hall calls, and the degree of occurrence of hall calls obtained from the calculation processing means. unregistered hall call evaluation value calculation means for calculating an evaluation value for;
When selecting a car to which a newly registered hall call is assigned, the evaluation value calculated based on the already registered hall call and the evaluation value obtained by the unregistered hall call evaluation value calculation means are added. 1. An elevator group management device comprising: allocation evaluation calculating means for calculating an allocation evaluation value for each car.