Group management control device and group management control method for multi-deck elevator

Abstract

A group management control device of a multi-car elevator that collectively controls a plurality of multi-car elevators each having a plurality of cars, and performs allocation processing of a car that provides service to a hall call generated in a hall. The group management control device includes a pre-selection processing section that, in the allocation processing, evaluates, for each machine, which car of the machine to allocate the hall call to, according to a predetermined rule, and selects an arbitrary car as a candidate car for each machine; a running prediction evaluation section that, for each machine, performs running prediction evaluation processing for a case where the candidate car is temporarily allocated and a case where the candidate car is not temporarily allocated, the running prediction evaluation processing calculating an index including a predicted value of a time until each call is responded to; and an allocation car decision section that decides a machine to which the hall call is allocated using the calculated index, and allocates the hall call to the candidate car of the decided machine.

Description

Technical Field

[0001] The embodiments of the present invention relate to a group management and control device and a group management and control method for multi-story elevators. Background Technology

[0002] Each unit in the group management system of a double-deck elevator, which constitutes one type of multi-story elevator, has an upper car and a lower car. When using the group management system of a double-deck elevator, when a user registers an elevator call in the waiting hall, the group management system selects the unit that serves the waiting hall call and whether that unit's upper or lower car is the correct one, and executes an "assignment process" that orients the selected car toward the waiting hall.

[0003] The allocation process is accompanied by operational prediction and evaluation. This includes predicting when each caller will arrive at which level, and calculating predicted values ​​such as waiting time for newly registered calls and already registered calls.

[0004] For newly registered calls, different assumptions can be made not only based on which machine number it is assigned to, but also on whether it is assigned to the upper or lower car. Operational prediction and evaluation need to be repeated for each assumption. The situation where a new call is assigned to a car before the actual assignment is called a "temporary assignment."

[0005] In previous allocation algorithms for double-deck elevators, scenarios were used to predict operation and evaluate group management performance indicators such as waiting time for each call: temporarily assigning newly registered calls to the lower car of each elevator, temporarily assigning them to the upper car, and not temporarily assigning them to any car. Therefore, compared to allocation algorithms for single-deck elevators with only one car, this method required more time for evaluating car allocation decisions.

[0006] In the previous allocation algorithm for double-decker elevators, in order to shorten the processing time, there is also an improved algorithm as follows: when a new waiting hall call is registered, it is first decided which elevator number to allocate to, and then, finally, it is decided which of the upper or lower cars of that elevator number to allocate to. Summary of the Invention

[0007] In the aforementioned previous improved methods, during the initial stage of determining the number of the caller, since it was not determined whether each caller should choose the upper or lower car, an operational prediction evaluation was performed to temporarily determine and assign the new call to either the upper or lower car. Then, it was necessary to switch the temporarily assigned car between the upper and lower cars as needed, and to determine the final assigned car, etc.

[0008] However, in this case, if temporary assignments are made to cars that are different from those when the operation prediction evaluation was performed, errors may sometimes occur between the operation prediction and the actual estimated operation, and the group management performance may deteriorate.

[0009] The problem to be solved by the present invention is to provide a group management and control device and a group management and control method for multi-story elevators that can simultaneously improve group performance and shorten processing time.

[0010] The multi-story elevator group management control device involved in the implementation method aggregates and controls multiple multi-story elevators with one elevator number and multiple cars, and performs car allocation processing for waiting hall calls generated in the waiting hall. The group management control device includes: a pre-selection processing unit, which, during the allocation processing, evaluates each elevator number according to predetermined rules to determine which car to allocate the waiting hall call to for each elevator number, and selects any car as a candidate car for each elevator number; an operation prediction evaluation unit, which performs operation prediction evaluation processing for each elevator number, considering both temporary allocation to the candidate car and non-temporary allocation, and calculates an index including a predicted value of the time until each call is responded to; and a car allocation decision unit, which uses the calculated index to determine the elevator number to allocate the waiting hall call, and allocates the waiting hall call to the candidate car of the allocated elevator number.

[0011] Based on the above structure, it is possible to simultaneously improve the group performance of double-decker elevators and shorten the processing time. Attached Figure Description

[0012] Figure 1 This is a block diagram illustrating the structure of a two-layer group management control system using the group management control device of the first embodiment.

[0013] Figure 2 This is a flowchart illustrating the processing steps of the group management control device according to the first embodiment.

[0014] Figure 3 This is a flowchart illustrating the processing steps of the group management control device according to the first embodiment.

[0015] Figure 4A This is an explanatory diagram showing the actions performed by the group management control device of the first embodiment.

[0016] Figure 4B This is an explanatory diagram showing the actions performed by the group management control device of the first embodiment.

[0017] Figure 5 This is a flowchart illustrating the processing steps of the group management control device according to the second embodiment. Detailed Implementation

[0018] Hereinafter, the apparatus and method of the embodiments will be described with reference to the accompanying drawings.

[0019] <First Implementation>

[0020] Structure of the First Embodiment

[0021] Figure 1 This is a block diagram showing the structure of the elevator group management and control device according to the first embodiment.

[0022] The dual-layer group management control system 1 of this embodiment includes multiple dual-layer elevators (elevator A 10A, elevator B 10B, and elevator C 10C) installed in an n-story building, elevator lobby call registration devices 20-1 to 20-n installed in the lobby of each floor, and a group management control device 30.

[0023] Elevator 10A (Unit A) has an upper car 11A, a lower car 12A, and a control device 13A. The control device 13A outputs elevator information, including the position information, travel status information, door opening / closing status information, and load status information of the upper car 11A and lower car 12A, to the group management control device 30. Furthermore, based on the allocation instructions from the group management control device 30, the control device 13A causes elevator 10A to respond to the registered floor's call, opening the corresponding passenger car door.

[0024] Elevators 10B (unit B) and 10C (unit C) have the same structure as elevator 10A (unit A), so detailed descriptions are omitted.

[0025] Elevator lobby call registration devices 20-1 to 20-n are installed in each elevator lobby (floors 1 to n) and are devices that can register upward (UP) or downward (DN) calls based on the user's button operation. Furthermore, this also includes a device for registering the destination floor in the elevator lobby.

[0026] The group management control device 30 performs group management on elevators A10A, B10B, and C10C. The group management control device 30 includes a waiting hall call registration unit 31, a pre-selection processing unit 32, an elevator information acquisition unit 33, a selection rule storage unit 34, a rule selection unit 35, an operation prediction and evaluation unit 36, a car allocation decision unit 37, and an allocation information output unit 38.

[0027] The elevator lobby call registration unit 31 receives and registers the elevator lobby call information obtained from the elevator lobby call registration devices 20-1 to 20-m.

[0028] The elevator information acquisition unit 33 acquires elevator information output from each elevator control device 13A to 13C. Specifically, it acquires various information from each elevator control device 13A to 13C, such as the elevator's current position, direction, travel status, door status, registered calls, and car load, and notifies each part of the group management control device 30.

[0029] The pre-selection processing unit 32 has a general pre-selection processing unit 41 and a final pre-selection processing unit 42.

[0030] Normally, the pre-selection processing unit 41 performs normal pre-selection processing, which excludes cars that meet the conditions from the assigned candidates, according to the prescribed rules, while cycling through each car.

[0031] If the result of the normal pre-selection process is that there are two or more candidate cars for the machine, the final pre-selection processing unit 42 performs a limited final pre-selection process according to the rules selected by the rule selection unit 35, so that there is one or fewer candidate cars.

[0032] The rule selection storage unit 34 pre-stores the rules for the final pre-selected processing and the applicable conditions of those rules. Preferably, the data is pre-written at the factory or elsewhere before shipment. Specific examples of selection rules will be described later.

[0033] The rule selection unit 35 selects the rule currently in use from the rules in the final pre-processing stored in the rule selection storage unit 34, based on factors such as the elevator's utilization status, the current time, and the status of the function applied in the group management system.

[0034] The operation prediction and evaluation unit 36 ​​assumes that the elevator operates in a manner that stops sequentially in the temporary allocation of registered calls and newly registered waiting hall calls, calculates the time until it reaches each floor and the time until it responds to each call, and calculates an evaluation value based on the results.

[0035] The car allocation decision unit 37 uses the calculated evaluation value to determine the assigned car.

[0036] The allocation information output unit 38 outputs allocation information to the elevator control devices 13A to 13C corresponding to the determined allocation car, so that the elevator operates according to the allocation.

[0037] Processing steps of the first embodiment

[0038] according to Figure 2 , Figure 3 The flowchart illustrates the processing steps of the first embodiment.

[0039] When a user registers a waiting area call by operating any one of the waiting area call registration devices 20-1, ..., 20-n (step S1: Yes), the waiting area call is registered in the waiting area call registration section 31 of the group management control device 30. Then, the process for allocating the optimal car begins.

[0040] Steps S2 to S6 represent the normal pre-selection process performed by the normal pre-selection processing unit 41. First, for each car, it is determined whether it is a car capable of handling the registered call (step S2). If a car is not capable of handling the registered call (step S2: no), then that car is set as an allocation candidate (step S3). For example, based on rules such as that a waiting hall call generated on the lowest floor cannot be allocated to an upper car, or that a waiting hall call generated on the highest floor cannot be allocated to a lower car, cars that cannot be allocated are removed from the allocation candidates.

[0041] If the car is capable of handling the registered call (step S2: Yes), then it is determined whether the car's load is above a threshold and whether it has not descended to a predetermined floor by the time the registered call is responded to (step S4). If the car's load is above the threshold and it has not descended to a predetermined floor by the time the registered call is responded to (step S4: Yes), the car is set as an unassigned car (step S3). This process is used to remove crowded cars from the assignment candidates in order to prevent them from being assigned to crowded cars.

[0042] If the car's load is not above the threshold (not crowded), or if there is a predetermined floor to descend before responding to the registered call (step S4: No), then, if other cars on the same machine can simultaneously respond to the registered call and other calls, it is determined whether this car can also respond simultaneously (step S5). If other cars on the same machine can simultaneously respond to the registered call and other calls, but this car cannot respond simultaneously (step S5: No), this car is set as an unassigned candidate (step S3).

[0043] If the condition in step S5 is met (step S5: Yes), the car is set as a dispatch candidate (step S6). This process, through temporary dispatch, can reduce the number of elevator stops, speed up elevator turnaround, and improve operating efficiency when it can respond simultaneously with already registered calls, so it is a process used to promote such dispatch.

[0044] Thus, in the normal pre-selection processing unit 41, the selection process for allocating candidate cars is carried out with the aim of speeding up elevator turnaround, shortening average waiting time and elevator travel time.

[0045] In addition, although not shown in the flowchart, conditions can be added such as that if one car on the same elevator number can immediately respond to the registered waiting hall call, and the other car cannot respond immediately, the car that cannot respond immediately will be removed from the candidate list.

[0046] In the aforementioned general pre-selection process, since the intention is not to reliably limit the candidate cars to either the upper or lower car for each machine number, sometimes both the upper and lower cars are retained as candidate cars, depending on the machine number. Therefore, when there are two or more candidate cars for the selected machine number, the final pre-selection process 42 performs a final pre-selection process to limit the candidate cars to one or fewer.

[0047] Figure 3 Steps S11 to S14 represent an example of the final pre-selection process performed by the final pre-selection processing unit 42 in order to ultimately limit the selection to either the upper car or the lower car.

[0048] First, in each machine, it is determined whether the upper and lower cars are the allocation candidates selected in step S6 (step S11).

[0049] Here, both the upper and lower car calls are processed only on the numbers remaining in the allocation candidate list. That is, if it is an upper call (step S12: Yes), only the upper car is set as a candidate, and the lower car is set as an unselected candidate (step S13); if it is a lower call (step S12: No), only the lower car is set as a candidate, and the upper car is set as an unselected candidate (step S14). Furthermore, this rule is an example, and other methods can be switched depending on the elevator's usage.

[0050] If neither the upper nor lower car is a candidate for allocation, the process proceeds to the next car since no final pre-selection is required in that car (step S11: No).

[0051] When the final pre-selection processing of the final pre-selection processing unit 42 is completed, the operation prediction and evaluation unit 36 ​​performs operation prediction and evaluation (step S15).

[0052] Operational prediction and evaluation (processing) consists of operational prediction (processing) and evaluation (processing).

[0053] In the operation forecast, the time required for the elevator to operate in the future according to the registered calls and temporary assignments is predicted, and the time until each call is responded to is calculated.

[0054] For the operation prediction of machine number 1, we can consider the case where the call for allocation request is not temporarily allocated to any car, and the case where it is temporarily allocated to any car of that machine number.

[0055] Especially in double-deck elevators, it is possible to consider three operational scenarios: “not temporarily assigned to any car”, “temporarily assigned to the lower car”, and “temporarily assigned to the upper car”.

[0056] In the evaluation, an evaluation value for each operational prediction is calculated based on the predicted values ​​of group performance indicators such as waiting time for each call, which are obtained as the results of their respective operational predictions. This evaluation value is called the first evaluation value. For example, the first evaluation value can be obtained by taking both the waiting hall calls already assigned to that number and the temporarily assigned waiting hall calls as objects, and using the square of the predicted value of the total waiting time for all calls as the first evaluation value.

[0057] In each machine, only the first evaluation value of the number of times the operation prediction was performed is obtained.

[0058] Next, a second evaluation value is calculated to indicate which car should be assigned to it. The second evaluation value is an indicator that allows comparison between cars, and the car with the lowest value is selected as the most appropriate car to be assigned to.

[0059] The second evaluation value is, for example, the value obtained by subtracting the first evaluation value obtained by temporarily assigning the allocation request to any car from the first evaluation value obtained by subtracting the first evaluation value obtained by not temporarily assigning any car.

[0060] This value is a combination of two pieces of information: First, the predicted waiting time for calls requesting allocation, included only in the prediction results when temporary allocation is involved. A shorter predicted waiting time indicates a more suitable car for allocation. Second, the variation in waiting time for registered lobby calls. Due to temporary allocation requests, the operating schedule sometimes changes, increasing the waiting time for registered lobby calls. A lower waiting time for registered lobby calls indicates a more suitable car for allocation.

[0061] In the above method, to calculate the second evaluation value for a specific car, it is necessary to perform operation predictions for the case where the car is not temporarily assigned to any car and for the case where the car to be evaluated is temporarily assigned. On the other hand, for cars that are not candidates in the pre-selection process or the final pre-selection process, since a second evaluation value is not required, a first evaluation value is also not required for the case where the car is temporarily assigned. Therefore, it is not necessary to perform operation predictions for the case where cars are not candidates.

[0062] Therefore, through the final pre-selection process, the candidate cars are limited to one car per machine number, thereby enabling the operation prediction for each machine number to be set to two scenarios: "no temporary allocation" and "temporary allocation of candidate cars".

[0063] Using the traditional basic allocation method, a double-decker elevator requires three operation predictions for each machine. Therefore, by using a proposal method, the number of operation predictions can be reduced to two-thirds. Generally, in a multi-story elevator with N cars per machine number, limiting the candidate cars to one per machine number reduces the number of operation predictions to two times N+1.

[0064] When the operation prediction evaluation is completed by the operation prediction evaluation unit 36, the car allocation decision unit 37 performs the process of determining the car to be allocated from the candidate cars (step S16). In this process, the car with the smallest second evaluation value is determined as the car to be allocated.

[0065] The allocation information output unit 38 outputs the allocation car information determined by the allocation car determination unit 37 to the corresponding elevator (step S17). That is, the allocation car information is transmitted to one of the elevator control devices 13A to 13C of the allocation machine, and the corresponding elevator 10A to 10C is operated by the transmitted elevator control device 13A to 13C.

[0066] Figure 4A , Figure 4B Specifically, this describes the actions of the first embodiment.

[0067] like Figure 4A As shown, a call to the elevator lobby is now being registered from the 4th-floor lobby call registration device 20-4. In elevator A, the lower car is located on the 1st floor, and the upper car is located on the 2nd floor. A call to the 3rd floor is registered in the lower car, and a call to the 6th floor is registered in the upper car. In this state, it is more efficient to reliably determine which car, the upper or lower car, to assign the call to.

[0068] If temporarily assigned to the upper car, then when the upper car responds on the 4th floor, it can simultaneously respond to the car call on the 3rd floor while the lower car is in motion.

[0069] However, if the car is temporarily assigned to the lower car, the stopping of the lower car's response to the 3rd floor and the stopping of the lower car's response to the 4th floor are performed separately, so the time required to complete the service is significantly longer. Therefore, in machine A, the lower car can be selected as a candidate, and the upper car can be excluded from the candidates.

[0070] Figure 4B Indicates in Figure 4A The status of machines B and C has been added.

[0071] The lower car 12A of aircraft A is located on the 1st floor, and the upper car 11A is located on the 2nd floor. There are passengers in both the lower car 12A and the upper car 11A. In addition, there are car calls registered in the lower car for the 3rd floor and car calls registered in the upper car for the 6th floor, which are being operated up.

[0072] The lower car 12B of machine B is located on the 5th floor, and the upper car 11B is located on the 6th floor. Only the lower car has passengers. In addition, there is a car call registered on the 1st floor in the lower car, which is in DN operation.

[0073] The lower car 12C of aircraft C departs from the 1st floor, and the upper car 11C departs from the 2nd floor. Only the upper car 11C has many passengers. In addition, there are car calls registered on the 6th floor in the upper car, which are currently in UP operation.

[0074] In machine A, as mentioned above, only the upper car remains in the candidate cars during the pre-selection process.

[0075] In machine B, through the final pre-selection process, based on the case that 4F-UP is in the upward direction, only the upper car is retained in the candidate cars.

[0076] In machine C, due to overcrowding in the upper car, only the lower car is retained in the candidate cars through pre-selection. Therefore, the operation prediction is performed twice for each machine, for a total of six times, so that the assigned car for 4F-UP can be selected.

[0077] In the most basic allocation process of double-decker elevator group management, each elevator number undergoes 3 operational predictions (no temporary allocation, temporary allocation with the lower car, and temporary allocation with the upper car), and the overall allocation process requires 9 predictions.

[0078] In the previous method, which first determined the assigned car number and then decided whether to assign it to the upper or lower car, the number of prediction runs could be the same as the proposal method. However, in the initial car number determination stage, prediction runs need to be performed based on a choice between the upper and lower car options without fully considering the choice. Therefore, the temporarily assigned car during prediction runs may differ from the final temporarily assigned car. Consequently, the prediction runs performed during car number determination are prone to inaccuracy, potentially degrading group management performance.

[0079] Thus, in the first embodiment, during the pre-selection process before the implementation of the two-layer group allocation algorithm, by limiting the allocation candidates to either the upper car or the lower car before performing the operation prediction, the number of operation prediction evaluations can be reduced and the processing time can be shortened.

[0080] In addition, when conducting operational prediction evaluations, since the cars to be temporarily assigned have already been determined for each machine, accurate prediction results can be expected, which can suppress the decline in group management performance.

[0081] <Selection rules in the final pre-selection process>

[0082] In the final pre-selection process, to minimize the deterioration of group management performance, the elevator utilization status is determined, for example, as follows. Furthermore, in the following explanation, for example, an upward call (UP call) to the 7th floor will be recorded as 7F-UP, and a downward call (DN call) will be recorded as 7F-DN.

[0083] <Leisure time: when there is almost no need>

[0084] In the process of boarding and alighting the cars, select the car that is closer to the allocation request and exclude the cars that have not been selected from the candidate cars.

[0085] For example, for elevator A, when the lower car is waiting on the 3rd floor and the upper car is waiting on the 4th floor, if a call for elevator 7F-UP is made in the waiting hall, the upper car closer to the 7th floor will be selected. This is because, since other calls are unlikely to occur, the car that is closer is more likely to respond quickly.

[0086] <When there is a normal demand>

[0087] If the call comes from above, select the car to board; if the call comes from below, select the car to disembark. The party not selected will be excluded from the candidate cars.

[0088] When demand increases to a certain level, elevators often shuttle back and forth between the lowest and highest floors. In this situation, since calls from above are mostly for the upper elevator car, and calls from below are mostly for the lower elevator car, calls from above are assigned to the upper elevator car, and calls from below are assigned to the lower elevator car. This method also reduces the likelihood of users whose destination floor is the building's final floor needing to transfer. This is because if an upper call is assigned to the lower elevator car, the lower elevator car cannot reach the building's highest floor, or if a lower call is assigned to the upper elevator car, the upper elevator car cannot reach the building's lowest floor.

[0089] <When crowded>

[0090] Calls made in the waiting hall on odd-numbered floors select the lower elevator car, while calls made in the waiting hall on even-numbered floors select the upper elevator car. The side not selected is excluded from the candidate elevator cars. The goal is to ensure that lower elevator cars serve odd-numbered floors and upper elevator cars serve even-numbered floors. By reducing the number of times the elevator car stops per revolution around the elevator shaft, the turnaround time of the elevator cars can be increased, thus increasing the number of passengers that can be transported per unit of time.

[0091] The group management control device 30 monitors the elevator's utilization status, thereby enabling automatic switching between idle / normal demand / crowded conditions.

[0092] As a method for detecting congestion, for example, the average of the time (non-response time) from the start of a call in the registration waiting hall to the time it is cleared by the response in the elevator car can be calculated over the past few minutes. If the value is less than threshold 1 (e.g., 10 seconds), it is judged as an idle time. If it is above threshold 1 but less than threshold 2, it is judged as a normal demand time. If the value is above threshold 2 (e.g., 30-40 seconds), it is judged as a congested time.

[0093] Alternatively, it can be configured to switch based on whether a specific group function is being performed, such as "operating during working hours" or "operating after working hours," where congestion is only considered during the period of the function action corresponding to congestion.

[0094] Alternatively, you can pre-record the peak time periods and days of the week, and switch accordingly.

[0095] By applying the above rules, even in the worst-case scenario, for operation prediction evaluations that require time in the allocation process, only twice the number of times the number of car registrations needs to be executed to select and allocate a car. Therefore, the worst-case scenario for processing time can be improved, resulting in an easy-to-use group management control device where the time from call registration to car allocation decision is not excessively long. Furthermore, since operation prediction evaluations are performed after pre-selection processing to remove unsuitable cars, the reduction in group management performance can be minimized compared to performing operation prediction evaluations on the basis of temporarily allocating all cars.

[0096] (Second Implementation)

[0097] Next, refer to Figure 5 The flowchart illustrates the second implementation method. Figure 5 The flowchart shown is a Figure 3 The flowchart for steps S21 and S22 has been added. Furthermore, the structure of the second embodiment is basically the same as that of the elevator group management control device of the first embodiment; therefore, reference is made to... Figure 1 Please provide an explanation.

[0098] According to the first embodiment described above, the number of operation prediction evaluations can be reduced. However, depending on the circumstances, such as low elevator utilization or a small number of registered calls, it is conceivable that there may be leeway in allocating processing time.

[0099] Therefore, in the second embodiment, a time limit is set for the allocation process of cars selected as candidate cars by the pre-selection processing unit 32. After the stage of processing cars that have passed the final pre-selection process is completed, if the predetermined time has not been reached (step S21: No), an additional operation prediction evaluation is performed (step S22) for cars temporarily assigned to that which, although they passed the normal pre-selection process, were excluded from the candidate list by the final pre-selection process. This process is continued until the time limit is reached, and operation prediction evaluations are performed on as many cars as possible.

[0100] For example, by setting the time limit to 10ms, if the operation prediction evaluation of the car that has passed the final pre-selection process ends in 6ms, the remaining 4ms can be used for the operation prediction evaluation of the car that has passed the usual pre-selection process but was excluded from the candidates in the final pre-selection process.

[0101] Then, taking all the cars that have completed the prediction evaluation as the target, the assigned cars are determined and the output is distributed to the selected cars.

[0102] In this method, based on the leeway in the time spent on the final pre-selection process and the prediction evaluation process, the following results are obtained. The more advanced the stage, the more appropriately cars can be selected and assigned, thus improving group management performance.

[0103] For example, even if the processing time up to "Phase 4" as shown below is not reached, as long as the necessary time up to "Phase 2" is reached, it has the advantage of not falling into the situation where the allocation of cars is determined by "Phase 1" where good group performance cannot be expected.

[0104] Phase 1: Operation prediction and evaluation of the car that has completed the final pre-selection process, if the process does not end within the time limit.

[0105] Since the minimum necessary evaluation cannot be performed, the car that can respond to the allocation request is simply estimated and the car that can respond in the shortest time is determined as the allocation car.

[0106] Simple estimation methods include calculating the required time based on the distance of the path from the current car position and direction to the floor and direction of the assigned call, as well as the type and number of calls registered along that path. In these simplified methods, the evaluation of call waiting time is performed only on the assigned call, not on the registered calls, thereby reducing processing time.

[0107] Phase 2: The operation prediction and evaluation process for cars that have completed the final pre-selection process is finished. However, the evaluation of cars that passed the usual pre-selection process but failed the final pre-selection process (potential candidate cars) cannot be carried out at all.

[0108] Based on the results of the operational prediction evaluation of the cars that have passed the final pre-selection process, the allocation of cars is determined.

[0109] Phase 3: By the time the deadline arrives, all cars that have completed the final pre-selection process will have finished processing. However, the operation prediction and evaluation process for aligning candidate cars will only be completed at the end of a portion of the car numbers.

[0110] Based on the results of the operational prediction and evaluation of the cars that have passed the final pre-selection process and a portion of the candidate cars, the allocation of cars is determined.

[0111] Phase 4: By the time the deadline arrives, all operation prediction and evaluation processes for the cars that have completed the final pre-selection process and the quasi-candidate cars have been completed.

[0112] The car allocation is determined not based on the final pre-selection process results, but based on the results of the operational prediction evaluation of all cars that have passed the usual pre-selection process.

[0113] Thus, according to the second embodiment, when there is sufficient time for allocation and processing, by performing operation prediction and evaluation on as many cars as possible, it has the advantage of achieving maximum group management performance within the constraints of processing time.

[0114] The above describes several embodiments of the present invention, but these embodiments are provided as examples and are not intended to limit the scope of the invention. These new embodiments can be implemented in various other ways, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. These embodiments or their variations are included in the scope or spirit of the invention, and are included in the scope equivalent to the invention described in the technical solution.

Claims

1. A group management and control device for multi-story elevators, which aggregates and controls multiple multi-story elevators with one number and multiple cars, and assigns service cars to elevators that receive calls in the waiting hall, characterized in that the multi-story elevator group management and control device comprises: The pre-selection processing department, during the allocation process, evaluates each elevator number according to pre-determined rules which car the waiting hall call will be assigned to for each elevator number, and selects any car as a candidate car for each elevator number. The operation prediction and evaluation department, targeting each car number, performs operation prediction and evaluation processing for both temporary and non-temporary allocation of the candidate cars. This processing calculates indicators including predicted values ​​for the time remaining until each call is responded to; and The car allocation decision unit uses the calculated index to determine the car number to be allocated for the waiting hall call, and allocates the waiting hall call to the candidate car of the allocated car number.

2. The multi-story elevator group management and control device according to claim 1, characterized in that, The pre-selection processing unit includes: The normal pre-selection processing unit does not limit the candidate cars of each machine to one car of each machine, but performs normal pre-selection processing to exclude cars that meet the prescribed conditions from the assigned candidates. as well as The final pre-selection processing unit performs a final pre-selection process that limits the number of candidate cars to one if the result of the normal pre-selection process is two or more.

3. The multi-story elevator group management and control device according to claim 2, characterized in that, The final pre-selection processing unit performs any of the following processing methods based on at least one of the following: the detection results of the load inside the car, the registration status of the call, the average response time to the call, the preset time period, and the implementation status of other functions provided by the group management control system equipped with the multi-story elevator and the group management control device, during idle time, normal demand time, and crowded time.

4. The multi-story elevator group management and control device according to claim 2 or 3, characterized in that, When the operation prediction and evaluation department finishes the operation prediction processing for all car numbers, including both the temporary allocation to candidate cars and the non-temporary allocation, and if the time required for the operation prediction processing has not reached a preset threshold, the department will designate the cars excluded from the candidate cars in the final pre-selection process as potential candidate cars. Using these potential candidate cars as the target, the department will perform the operation prediction and evaluation processing for the temporary allocation to these potential candidate cars until the time required for the operation prediction and evaluation processing reaches the threshold. The car allocation decision unit will return the candidate cars that have completed the operation prediction and evaluation process during the period up to the threshold to the candidate cars, and determine the final car allocation.

5. A group management and control method for multi-story elevators, which aggregates and controls multiple multi-story elevators with one elevator number having multiple cars, and assigns service cars to elevators that receive calls in the waiting hall. The group management and control method for multi-story elevators is characterized by the following steps: During the allocation process, each elevator number is considered as an object, and the elevator hall call is evaluated according to a predetermined rule to determine which car is assigned to each elevator number. Any car is selected as a candidate car for each elevator number. Taking each car number as an example, and considering both temporary and non-temporary allocation of the candidate cars, an operational prediction and evaluation process is implemented. This process calculates indicators including predicted values ​​of the time until each call is responded to; and The calculated index is used to determine the elevator number to be assigned to the waiting hall call, and the waiting hall call is assigned to the candidate car of the assigned elevator number.

Images