JPS6256076B2 - - Google Patents

Description

[Detailed description of the invention]

The present invention manages multiple elevators as a group, and when a new common hall call occurs, an evaluation value is calculated based on the elevator car position and the call situation using a predetermined evaluation formula, and the result is This relates to a group management control method that determines service elevators based on the above information, and is particularly effective during off-peak hours. Conventionally, during off-peak hours such as at night, a distributed waiting system has been used in which empty cars are moved to appropriate floors in order to shorten and even out waiting times for hall calls. However, this decentralized standby system not only results in excessive power consumption due to the wasteful operation of empty cars, but also causes building occupants to feel suspicious because it is carried out during off-peak hours such as at night. Ta. The present invention has been made in view of the above points, and provides a group management control method for elevators that can control the waiting time of each landing to always be averaged without wasteful operation due to distributed waiting. It is. A feature of the present invention is that when calculating the evaluation value for allocating a hall call, the abandoned car position after responding to the hall call is predicted, and the degree of dispersion of the final car position is taken into consideration. The point is that I tried to do it. Below, to simplify the present invention, we will discuss the case where two elevators service a building with 7 floors, and as for the evaluation value, the value corresponding to the waiting time and the value corresponding to the degree of distribution of cars are each given a weight of 1. An example of a method of assigning a hall call to the elevator with the smallest value after summing the values in a pair-to-one manner will be explained. In addition,
Needless to say, the number of elevators and the number of floors are not limited to those in this example, and the evaluation value may include at least one that corresponds to the degree of dispersion of car positions. It is not limited to the combination of and dispersion degree. Further, the weighting ratio may be determined depending on the expected effect. Table 1 shows the running time of the elevator between each floor in this embodiment.

[Table] This travel time corresponds to the time from when a hall call occurs until the elevator responds, that is, the waiting time, and is stored in advance as data. Of course, the time can be calculated each time from the speed of the elevator and the floor spacing, or the time can be measured and stored by actually running the elevator. FIG. 1 shows a state in which car A is stopped on the 6th floor and car B is stopped on the 1st floor. If a hall call H in the descending direction of the fourth floor is newly registered in this state, the waiting time of each elevator is first calculated for the hall call H. In this case, the distance between car A and hall call H is 2nd floor, and the distance between car B and hall call H is 3rd floor, so the waiting time is 6 seconds for car A and 6 seconds for car B from Table 1. 8 seconds. Next, the degree of dispersion is calculated from the abandoned car position after the service is completed for each of the case where car A responds to hall call H and the case where car B responds to hall call H. To do this, it is first necessary to predict the location of the abandoned car after the service ends.
This can be easily done by determining the transition probability from a hall call to a car call in advance and storing the case with the highest probability (see, for example, Japanese Patent Application Laid-Open No. 156981/1989 for the transition probability). Furthermore, by providing a learning function, predictions may be made each time based on past patterns. In this case, if hall call H is assumed to transit to car call C on the second floor with probability, the second floor is expected to be the abandoned car position since there are no other calls. In Figure 2 a, car A is hall call H.
Figure 3a shows the case where the vehicle is abandoned on the second floor after responding to
Each figure shows a case where car B is abandoned on the second floor after answering hall call H. Once the abandoned car position is predicted, the degree of dispersion of the car at that time is then calculated, and the degree of dispersion can be expressed as the waiting time at each floor for the placement state of the car at that time. In the cage arrangement shown in Figure 2a,
The waiting time at each floor (the smaller of cars A and B) at that time is as shown in Table 1 to Figure 2b. Similarly, the waiting time for each floor in the state shown in FIG. 3a is as shown in FIG. 3b. That is, the smaller the degree of dispersion (the cars are clustered in one place), the greater the maximum value of the waiting time becomes, and the greater the degree of dispersion, the more the waiting time on each floor is averaged and the maximum value becomes smaller. Assuming that the degree of dispersion is expressed by the maximum value of waiting time, the degree of dispersion according to the final car position when car A responds to boarding call H is 12 from Figure 2b, and similarly when car B responds. The degree of dispersion in this case is 6 from FIG. 3b. When this degree of dispersion is summed with the waiting time mentioned above with a weight of 1:1, the evaluation value S _A for car A is S _A =6+12=18 Similarly, the evaluation value S _B for car B is S _B =8+6= 14. Therefore, in the state shown in FIG. 1, the car B with the smaller evaluation value is assigned to the hall call H and serves it. As a result, car B has a landing call of H.
After responding to the request, it is expected that the cars will be dispersed and abandoned as shown in FIG. In the above embodiment, the degree of dispersion of car positions is expressed by the maximum value of the waiting time on each floor, but it is not limited to this, and it may also be expressed, for example, by the dispersion or standard deviation of the waiting time on each floor. good. In addition, the degree of dispersion may be determined not only by the waiting time but also by using the distance between the hall call and the car or the required travel time.In addition, by weighting a specific floor such as a reference floor, The location can also be set close to a specific floor. The above-described allocation of hall calls can be easily realized using a microcomputer or the like, and a flowchart of the program is shown in FIG. This program starts when a hall call occurs on any Nth floor. First, the input data necessary for various calculations, such as car position, direction, car call, and landing call, are taken in (step 10). Next, the waiting time is calculated for each elevator (step 11), the degree of dispersion is calculated (step 12), and the evaluation value is calculated (step 13). In step 14, the evaluation values are compared and the smallest elevator is memorized (step 14).
15). When the above process is completed for all elevators (step 16), the Nth floor hall call is assigned to the elevator with the lowest evaluation value stored in step 15 (step 17). As described above, according to the present invention, when determining the assigned car by calculating the evaluation value of each car, when a new hall call occurs, the hall call is temporarily assigned to each car in sequence, and the temporarily assigned car is discarded. The position is predicted, and the degree of dispersion of the car is calculated from the expected drop-off position of the tentatively assigned car and the positions of other cars, and at least this degree of dispersion is used as the evaluation value for each temporarily assigned car.The higher the degree of dispersion, the easier it is to be assigned. As a result, the cars are dispersed even after the service is finished at the hall call, and this prevents wasted operation of empty cars due to dispersed standby, which has a great effect on energy conservation, and eliminates the sense of suspiciousness among building occupants. Can be done.

[Brief explanation of the drawing]

Figure 1 is a diagram showing the relationship between elevator car positions and calls for explaining the present invention, Figure 2a is a diagram showing the positional relationship of the elevator cars, and Figure 2b is Figure 2a.
Figure 3a shows the waiting time on each floor in the state of
3B is a diagram showing the positional relationship of the cars, FIG. 3B is a diagram showing the waiting time of each floor in the state of FIG. 3A, and FIG. 4 is a flowchart of a program for carrying out the present invention. A, B...Elevator cars, H...4th floor descending hall call, C...2nd floor car call, 10
~17...Each step of the flowchart.

Claims (1)

[Claims] 1. In an elevator that waits for cars at drop-off positions, when a new hall call occurs, the hall call is provisionally assigned to each car in sequence, the predicted drop-off position of the provisionally assigned car is predicted, and the predicted drop-off position of the provisionally assigned car is compared with the expected drop-off position of the other cars. The degree of distribution of the car is calculated from the position of the car, and at least the degree of distribution is used as the evaluation value of each tentatively allocated car, so that the higher the degree of distribution, the easier it is to be allocated, and the car to be allocated is determined from the evaluation value of each car. A group management control method for an elevator, characterized in that: