JPS59177265A - Group controller for elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to an elevator group management control system, and particularly to one that measures the number of elevator users or the usage load on each floor.

[Technical background of the invention]

In recent years, when multiple elevators are installed in parallel, 1 L/
In order to improve the operating efficiency of the elevators and the service provided to elevator users, a small computer such as a microcomputer will be used to rationally and quickly allocate answering machines for hall calls from halls on each floor. So-called group management control is being carried out. In other words, when a hall call occurs, the system selects the elevator most suitable for handling that hall call, quickly assigns the elevator to respond to that hall call, and prevents other elevators from responding to that hall call. . Conventionally, it has been thought that the best method for selecting the allocation type is to predict which elevator will arrive first at the floor where the hall call has occurred and to allocate the hall call to that elevator. Therefore, many methods have been considered to predict which elevator will arrive first, such as by calculating the child time until the elevator arrives at each floor.

However, this type of group management does not fully grasp the number of tenants in a building or the number of personnel, so it is difficult to understand the number of tenants in a building or the number of personnel, so it is difficult to understand the number of tenants and personnel in a building. Services in each zone tended to be uneven.

In other words, when a large number of customers visit multiple halls at the same time, such as during a funeral or when leaving at 1 o'clock, services can be provided by dividing the service floor into multiple service zones, such as dividing the service floor into upper and lower zones. Zoning is being done. However, because this zone division was done mechanically, for example by simply dividing all service floors into two equal parts, it did not correspond to the actual number of users, load, etc., and if these were uneven between valley zones, When a large number of passengers concentrate, the service to each zone becomes uneven, resulting in long waiting times (the waiting time at the station where the assigned car arrives after the call is registered), This led to a decline in service.

[Purpose of the invention]

The purpose of the present invention is to effectively measure user agility or usage load information on each floor of a building, enable continuous operation of elevators in accordance with actual demand, and improve service. An object of the present invention is to provide a group management control device for elevators that can be realized.

[Summary of the invention]

The present invention grasps the daily number of tenants on each floor, that is, the number of users or the usage load of tenants, based on the unloading type on each floor at the time of dispatch, and reflects this in group management control to adjust the actual situation of the building. It is characterized by making it possible to realize elevator operation control.

[Embodiments of the invention]

FIG. 1 shows the system configuration of an embodiment of the present invention.

In Figure 1, 1 is a hall call registration circuit, in which registers for the corresponding floor and direction are set when registering a hall call, and are reset when the car arrives at the floor corresponding to the hall call. be. 2A to 2F are elevator operation control devices provided for each of the elevators A to F of 6 Iso, and each car state buffer 3A
~3F, car call registration circuit 48~4F.

Quasi-call registration circuit 58-5F1 signal synthesis circuit 68-6
F is provided separately. Cart status buffer 38~3
F is a buffer for inputting the car state to a wiper shutoff circuit 7, which will be described later. Car call registration circuit 48~
4F is set at the time of car call registration and reset when the car arrives at its call registration floor.

The standard call registration circuits 5A to 5F store the hall call assigned to the car, and are reset when the car arrives at the floor corresponding to the hall call. Signal synthesis circuits 68 to 6F are car call registration circuits 4A to 4F.
The logical OR of the output of the quasi-call registration circuits 58 to 5F is output.

7 is a Y/Z select circuit, and 8 is a decoding circuit. The decoding circuit 8 decodes the output signal of the output register 12, which will be described later, and sends a call registration circuit 58 to 5F in the direction of the corresponding floor of the corresponding car. Se1. It is intended to be 9
is a small computer using a 12-pit microcomputer, for example, and has an output register of 10. input register 1
1, has an output register 12. Output register 10
has the function of holding the same output until the next output.

Note that the registers and interface devices having the same function, provided one for each elevator, are connected by a plurality of parallel signal lines, for example, twelve. Furthermore, all the registers have the number of bits equivalent to one candy of the small computer 9.

Next, the operation of this embodiment will be explained with reference to the flowcharts shown in Figures 2 to 9.

In addition, Figures 2 and 3 are flowcharts for all 6 in this embodiment, Figure 4 is a detailed flowchart for unloading type detection, and Figures 5 and 6 reflect the number of tenants in the building, etc. FIGS. 7 to 9 are detailed flowcharts of the response car selection routine.

In Figure 2, when the program starts, first R
First JOJ in AM (rank 9m access memory) area
, proceed to the repeat start point (connector A),
Read the car status of all machines.

Here, the car status is stored in the microcomputer as a car status table CCT whose format is shown in FIG.

The car loads are stored in the microcomputer as a load table WTT consisting of 8 bits (for example, right-justified) binary data for each beach, as shown in the format shown in FIG.

Next, it is determined whether the demand is during the dispatch time, and if it is not the dispatch time, the process proceeds to connector A2, and if it is the dispatch time, the unloading type is detected for each car and each floor. Proceed to detection routine.

The flowchart in FIG. 4 shows this unloading type detection routine in more detail.

That is, in FIG. 4, the cage index J (J=1
to 6 (corresponding to machines A to F, respectively) are set to 1 (-JO), and the process starts from machine A.

It is judged based on the CCT in Fig. 11 whether the door in the rear row of A has started to open, and if not, it moves to connector c2 and if the door has started to open, it is connected unless the direction of the car is "up". Proceed to child C3, and if the direction of the car is "up", store the current car position (direction not included) in I, and store the current load k WE
I GHT 1 (LJ) (indicating the load 1 on the first floor of car J at the time the door starts to open) is obtained by referring to WTT in FIG. 12, is stored, and the process proceeds to connector C2.

Proceeding to connector C2, the next step is to check whether the door of car J has been closed. That is, in the OCT of FIG.
When the bit <0> of the A-Q machine changes from Pa1# to “o” (“i” to close the door, 0 to open the door), the door starts to open, “°0”
”→Pa1' is considered to be the completion of door closing (since the edge of the change is captured, the door closing is not completed when Pa1"→"1").

When the door is closed, the WEIGHT 7 (I
.

In the same manner as J), the load WEIGH'r2(I, J) of car J just before departure on the first floor is determined.

Next, J's basket dropped off at the 11th hall, Fukuri Choju 0R.
IW (I, J) is determined by the following formula.

0RIW (T, J) = N'EIGHT1 (■, J)
−”−〜−gIGuT2(■, J) ...(1) If there are no passengers getting off and only boarding, or
If there is an error in the load detector, equation (1) may become negative, so it is determined whether the unloading type 0RIW (I, J) is negative, and if it is negative, it is sent to connector C3, If the value is positive or 0, the process moves to the next step. (In addition, since there is generally almost no traffic between floors when dispatched, it is safe to ignore the boarding load on intermediate floors in such cases.) Next, the total unloading type on the first floor. F 0RIW(I) is F
0RIW(I) = F 0RIW(I) +0RIW
(I, J) ... (2) 9- is obtained, and the process proceeds to connector C3.

Once the above processing is completed for machine A, the following machines will be transferred to machine B:
The same process is repeated until all units are completed, and the unloading type (ascending direction only) at the time of dispatch is calculated and stored as the day's on-board load. Next, control applied to zone division will be described in detail as an example of this total control.

That is, the first time during lunch time is detected through the connector A2 in FIG. 2, and only at that time, the connector A
The process proceeds to step 3 to proceed to a zone division floor determination routine, and otherwise proceeds to connector A4.

FIGS. 5 and 6 show the above zone division floor determination routine in more detail.

In FIG. 5, the first half includes unloading on all the ship's floors on the day, but in this 10-year example, unloading on the dining floor is excluded.

Next, set the floor index ■ (unlike the hall index, which indicates the floor and direction, when ■ is 1, it indicates the 1st floor) to 1, and set the unloading type F 0RIW (]) on the 1st floor (required at the time of dispatch). Load type) is used as the existing load on the first floor on the day, and the load for zone division zORIW (as mentioned earlier, in this example, 2
TORI
Find the floor that exceeds the W bar (i.e., the floor where the total known load is divided into two by the upper and lower zones).
(Moving to Figure 6) Store this and further raise the lower zone,
Lower limit subaddress LINDXU.

LINDXD is obtained using the following formula.

L INDXU = FMAX 2 +ZONE I
=-(4)LINDXD=FMAX
-ZONE I'-(5) When the above processing is completed, the process advances to A4 in FIG.

Then, in process P4, the hole index IiO is set.

Next, in process P5, the state of the hall (a hall call has occurred, a response to the hall call has been completed, a hall call has been generated but the service has not been completed, and there is no hall call) is determined by the method described below.

That is, the hall call is registered in the hall call registration circuit 1 of FIG.
When the hall call state table HCT shown in FIG. 13 shows the former, the corresponding bit becomes 1", and when there is no hall call, it becomes IIQ 1".

Therefore, when the corresponding bit changes from 0'' to 1#, it means that a new call has occurred, and the process advances to process P6. Also, when the corresponding bit changes from '1'' to 0#, it means that the response to the hall call has been completed, and after storing the unanswered time TI of the hall call in process P7, T, = 0 is set in process P8. Move to process P9. The corresponding bit is “1” →
If "1#", there is a hall call but the service has not been completed, so the process PIO increments the unresponse time TI for hall calls by 11 and proceeds to process P9.

If the corresponding bit is divided from 0" to "°0", there is no hall call and there is no change, so 'rl=Q is set in process P8 and the process moves to process P9.

In the above process P6, the answering machine that is effective for the newly generated hall call is determined by the method shown in the flowcharts in Figures 7 to 9, but the assignment of the hall call on the i floor and the conversion to the evaluation value are performed using mathematical formulas. explain.

In other words, the predicted arrival time (predicted non-response time) Tit of car j to the first floor hall is the time required for car j to travel from its current position to the first floor, and the time required for car j to travel to the first floor. It is calculated as the sum of the loss time (mainly acceleration/deceleration time, door opening/closing time, and opening time) spent on the vehicle.

Next, when the hall call on floor i is assigned to car j,
Predicted time of the already allocated hall call Tjkt+..., T
jkn (kn=n=hall call allocation) is determined by the following formula. However, the predicted waiting time changes (delays) only for calls that stop after floor i (assigned to hall calls).

Tjkt = (time elapsed since the hall call for floor kt occurred) + (estimated arrival time until the car arrives at floor kz) 10 (time required for car j to stop at the 1st floor)... (6) Furthermore, k
The t floor is the floor that stops after the i floor, and for the floor that stops earlier than the i floor, the time required for the car to stop at the first floor in the above equation is not necessary.

Next, the predicted waiting time TJkt obtained by equation (6) is set appropriately in advance using a weighting function with a single minimum value (any function with one minimum value is effective, but , here, a function with characteristics as shown in FIG. 10 is used as an example).

That is, as shown in FIG. 10, the horizontal axis represents the predicted waiting time Tj.
1. As shown by taking the weighted evaluation value f(Tj) on the vertical axis, the corresponding evaluation value f(Tjkt) is obtained from the predicted waiting time Tjkt.

Therefore, the evaluation value of the newly generated hall call and the previously allocated hall call for each car is determined by the following formula.

After calculating the average evaluation value of all six groups using this equation (7), the minimum average evaluation value EMIN is calculated using equation (8).

EMIH=min (EA J En #
EC"'+Er) - (8) 14- (8) EMrMVC of equation (8) The corresponding machine is assigned to the service machine in the hall on the first floor, and the forecast is displayed in the hall.

The above-mentioned processing will be explained in detail with reference to the flowcharts of FIGS. 7 to 9.

In FIG. 7, the car index J is set to 1, and the following process is started for car A.

That is, it is determined whether it is lunch time or not, and if it is not, the process proceeds to connector E2. (Normal Processing Routine) If it is the lunch time period, it is determined whether car No. A is a lower zone car or not as follows.

Now, if we decide that the numbers from machine A up to the bar of the group cardinality (CMAX) will be placed in the lower zone basket, and the remaining cardinal numbers will be placed in the upper zone, the index J will be determined by equation (9), whether it is in the lower zone or not. This can be determined by checking whether the conditions are met.

J≦2 IX to C...
- (9) If the car index J is 1 and the group cardinal number CMAX is 6 (groups), it becomes a lower zone car. Hole index LINDX where the new hall call generation floor (Hall Intex ■) is the limit of the lower zone
D or above and limit uphole index L
If it is less than or equal to INDXU, the hall index (■) is a hall call in the lower zone, and machine A can serve the first floor, so it proceeds to connector E2.

Also, when the hole index I is smaller than LINDXD or larger than LINDXU, it is a hole call in the upper zone, so machine A becomes unserviceable.
The process proceeds to connector E3, sets the average evaluation value to infinity (inputs the maximum possible value with 12 bits), and proceeds to connector E5.

Also, if the basket J is in the upper zone, proceed to connector E4 in Figure 8, L INDX D, L INT)X
Based on the magnitude relationship between U and the hole index ■, it is determined whether or not the service is possible using the same method as in FIG.

When proceeding to connector E2, first, in process Q1, the predicted waiting time Tjk of the hall call new occurrence floor and the hall call command floor that has been allocated is calculated for car A using equation (6).
Proceed to process Q2.

In process Q2, the predicted waiting time Tj calculated in this way is
An evaluation value weighted according to the characteristics shown in Figure 0 is obtained.

Next, in process Q3, the average evaluation value Ej is calculated. When the A machine is completed, it is checked in process Q4 of Fig. 9 whether the above process has been completed for all machines.2, and if it is not completed for all machines, the process returns to FJ and connector E, and in the same way, B
The calculations are also made for the car No. 1 and the car No. C, and when the calculation is completed for all the cars, the car with the minimum value of the average evaluation value Ej is determined in process Q5, and the elevator corresponding to this minimum value is selected as the service machine in process Q6. , display the forecast in the hall.

It is determined in process P9 in Figure 3 whether the above operations have been carried out on all floors. If not, the process returns to process P5; if it has been completed, the process proceeds to connector A, which is the repeat start point. Repeat the process every time you click 0 In this way, we can determine the number of people on each floor and the overall load on the building by measuring the unloading type on each floor when dispatched, so we can reflect this and further increase the number of people in the building. Elevator group management control that suits the actual situation becomes possible. That is, when the hall is divided into zones when the demand for the hall increases rapidly, such as during lunch time, the zone is divided so that the number of elevator users in the upper and lower zones is equally divided, so that equalization of services can be achieved.

The present invention is not limited to the embodiments described above and shown in the drawings, and can be implemented with various modifications without changing the gist thereof.

For example, in the above embodiment, the case where the zone is divided into two zones and the number of elevator users is equal in the upper and lower zones has been described, but the following case can be implemented in substantially the same way.

0) Divide into three or more zones (divide so that each zone has the same number of elevator users or usage load).

(b) Divide the zone into two or more zones with the ratio of the number of users or usage load in each zone as the expected value.

(c) Number of floors other than 10 floors.

) The number of elevators shall be other than 6.

In addition, information on the number of users or usage load for each floor and the total number of users measured by the unloading type can be used for purposes other than zone division, such as 11 spotting for landing call assignments, standard time for reviewing long waiting times, etc.
The control may be carried out by reflecting it in the predicted arrival time calculation, etc., or may be carried out by combining these as appropriate.

In any case, since control is carried out that is more in line with the actual situation of the building, it is still effective in improving elevator operation efficiency and service.

〔Effect of the invention〕

According to the present invention, it is possible to effectively measure user agility and usage load information on each floor of a building, to enable elevator operation in a manner that matches actual demand, and to improve services. A group management control device can be provided.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the system configuration of an embodiment of the present invention, FIGS. 2 to 9 are detailed flowcharts explaining the embodiment, and FIG. 10 is a block diagram showing the system configuration of an embodiment of the present invention. Characteristic diagrams illustrating an example, and FIGS. 11 to 13 are diagrams showing the format of a data table in a microcomputer used in the same embodiment. 1...Hall call registration circuit, 28-2F...Elevator operation control device, 7...Y/Sen selection circuit, 8
...Decoding circuit, 9...Small computer. Applicant's agent Patent attorney Suzue Takehiko Pressure Tomoe Japanese Patent Publication No. 59-177265 (7) Figure 3 1 Inoma 59-177265 (8) Figure 5 ○ Figure 6 Figure 7 r, m P5 ■ r'': 1 1 Bikkasen/fight 1. 2　force・N　ILINDXD〉〉〉〉 1: LINDXU E3E2
≦ 91 Figure 10 Preliminary Ritatan W Senkai Tj (4 times) Figure 11 CT TT Nuvea Zuka 1

Claims (1)

[Claims] In an elevator group management control system that targets multiple elevators installed in parallel and performs group management control that selects and responds to a service call in response to a hall call, each elevator machine is provided with a system that controls each car. A load detector that measures the live load, an unloading type calculation means that uses this load detector to calculate the unloaded load on each floor during daily dispatch, and a unloading type calculation means that calculates the unloaded load on each floor during daily dispatch. 1. A group management control device for elevators, comprising a control means for controlling each elevator by reflecting the descending load of each floor as information on the number of users or the usage load for each floor and as a whole.