JP4690799B2 - Elevator group management system and elevator group management method - Google Patents

Description

  The present invention relates to a technique for managing an elevator group.

  The purpose of the elevator group management is to assign an appropriate car to a newly generated hall call, taking into account information such as the current call state, the current position of the car, and the number of passengers. Conventionally, a method of switching a variable parameter of a simple allocation basket determination logic prepared in advance to the best one according to the situation has been mainstream. As a criterion for selecting a variable parameter, a method in which a predicted performance for a combination of a feature amount indicating a situation such as traffic demand and a variable parameter is learned in advance using a neural network model, and used as a selection criterion is disclosed in Patent Document 1. Proposed in A method for estimating the expected performance with a simulator is proposed in Patent Document 2 and the like.

However, in order to properly allocate calls to the basket, it is necessary to consider all the following factors.
1. The impact of the current allocation on calls that have occurred so far and have not yet been serviced (unanswered calls)
2. Impact of current assignments on future calls
3. Impact of future call generation on all unanswered calls assigned to date
Among the above factors, one factor is easy to handle, but the other factors are hardly handled in the conventional method except for some proposals as in Patent Document 3. Unlike the conventional group management system, it is necessary to consider a plurality of calls including a virtual call in the future at the same time. Therefore, a sub-optimal solution is found from all the combinations of assignments for the plurality of calls. This is because the method becomes complicated because a kind of combinatorial optimization calculation must be performed. In Cited Document 3, it is proposed to perform combinatorial optimization computation using GA (genetic algorithm).
Japanese Patent Application No.1-47136 Japanese Patent Application No. 11-125978 JP-A-5-319707 JP-A-5-319706

  In order to use it as an elevator group management control method, it is necessary to perform combinatorial optimization calculations for a plurality of calls within a predetermined time limit. However, in the method using GA (genetic algorithm) proposed in cited document 3 or SA (simulated annealing) proposed in cited document 4, the optimization operation converges until it can be used as a solution. Since it takes time, it is extremely difficult to realize the real-time property required for group management.

  In order to achieve the real-time characteristics required for group management while performing combinatorial optimization calculations for multiple calls, the best call allocation at that time is the best for the call allocation that is really necessary, depending on the possible calculation time limit. You need to be able to get an assignment.

  An object of the present invention is to provide a technique for allocating a plurality of hall calls in a situation where there are a plurality of hall calls to be allocated.

  The elevator group management system according to an aspect of the present invention is an elevator group management system that executes group management control for allocating an elevator car that responds to a hall call that occurs at an arbitrary time on an arbitrary floor in a building. The group management control for allocating the plurality of allocation calculation target hall calls to the elevator car according to the type of hall call is performed on a plurality of allocation calculation target hall calls that have already occurred in the elevator hall And means for setting a calculation priority as a hall call allocation execution order, and means for performing a temporary call allocation calculation for the hall call according to the calculation priority.

  What happens when the present invention assigns a certain hall call to a plurality of assignment target hall calls to be assigned a cage? The temporary allocation (basis temporary allocation pattern) is performed and a plurality of types (for example, the temporary allocation patterns for the number of baskets) are created for one hall call. After the creation, a basket temporary allocation pattern having the best evaluation value at the present time is selected, and a new basket temporary allocation pattern is obtained when the next allocation target hall call is added to this basket temporary allocation pattern. By using an exploratory procedure of repeating this until the time limit is reached, a basket temporary allocation pattern having a high evaluation value is created within the given calculation time limit. With this created temporary basket allocation pattern, it is checked to which basket each of the plurality of hall calls to be allocated is allocated, and the basket allocation of the plurality of hall calls to be allocated is determined.

  If there are multiple hall calls to be allocated, the calculation priority order is set for the hall calls stored in the hall call queue waiting for allocation processing, and the basket allocation pattern is sequentially set according to the set allocation calculation order. Create. In addition, a cage allocation pattern as appropriate as possible is created within the time limit by using a search method called A search that uses estimated values for evaluation of allocation target hall calls for which temporary allocation has not been determined.

  If the allocation of all hall calls stored in the hall call queue waiting for allocation processing is not completed, it is also possible to perform the basket allocation calculation process by combination optimization calculation for the remaining hall calls. Alternatively, by extending the time limit, it is also possible to determine the cage allocation of more hall calls in more queues or to determine the allocation of all hall calls stored in the queue.

  As described above, the elevator group management system according to one aspect of the present invention is an elevator group management system that executes group management control for assigning an elevator car to a hall call that occurs at an arbitrary time on an arbitrary floor in a building. When there are a plurality of unallocated hall calls that have already occurred, a combination calculation order corresponding to the type of hall call is set for the plurality of hall calls, and a combination optimization calculation process is performed according to the set calculation order. By executing the basket allocation process according to the above, a plurality of the basket allocation calculation processes for the existing unallocated hall call are performed collectively.

  According to the present invention, in a situation where there are a plurality of hall calls to be allocated, a plurality of hall call allocations can be performed simultaneously.

Embodiments of the present invention will be described with reference to the drawings.
FIG. 1 is a block diagram showing a schematic configuration of an elevator group management system according to an embodiment of the present invention.
The elevator group management unit 0 is a part that executes elevator group management control. The elevator group management unit 0 executes elevator group management control including at least two elevator baskets 11,..., 1N. That is, the elevator group management unit 0 includes a car assignment calculation processing unit 01 that implements the elevator group management control method according to the embodiment of the present invention for a hall call that occurs at an arbitrary time on an arbitrary floor in a building. Group management control is performed according to the calculation result of the allocation calculation processing unit 01. In addition, the elevator group management unit 0 includes a hall call information collection unit 03 that detects and collects information on the all call buttons 21,..., 2M on each floor. A hall call allocation waiting queue for buffering hall call information is provided. In addition, the elevator group management unit 0 has already assigned a car call information collecting unit 05 that collects information of the car call buttons 112,..., 1N2 for inputting the destination designation of passengers installed in each car. The hall call allocation information storage unit 02 stores the basket allocation information for hall calls that have been completed but have not yet been answered. Further, in order to control the operation of each car, a car control unit 1111,..., 1N1 is provided for each elevator car 11,. The car control units 111, ..., 1N1 collect car information such as car speed and car position in addition to operation control. The basket allocation calculation processing unit 01 includes a search calculation processing unit 011, a calculation priority order determination unit 012, a search calculation data storage unit 013, and an evaluation model unit 014.

  Each of the above components can be realized by computer software or a combination of computer software and hardware. The computer and the actual elevator are connected via a control panel and a communication interface for transmitting and receiving electrical signals necessary for control.

The general operation of the elevator group management system configured as described above will be described.
A passenger who wishes to get on the elevator while staying in the building presses the hall call button 21,..., 2M, and requests the elevator group manager 0 to dispatch the elevator car 11,. In the present specification, “allocation” means that an elevator car is allocated in response to a hall call. The elevator car dispatch request is transmitted to the car assignment calculation processing unit 01 via the hall call information collecting unit 03 in the form of generation of a new hall call. At this time, the new hall call is buffered in the hall call allocation waiting queue in the hall call information collection unit 03. The basket allocation calculation processing unit 01 receives hall call information in the hall call allocation waiting queue from the hall call information collecting unit 03 at a timing at which calculation is possible (for example, after completion of calculation when received during calculation) Using the information held by each component of the hall call allocation information storage unit 02, the car information collection unit 04, and the car call information collection unit 05 as input, an arithmetic process for determining a car allocation for the generated hall call is executed. . Then, the car to be dispatched for the new hall call is determined, and the car control unit 111,..., 1N1 is instructed. The basket control units 111,..., 1N1 are defined by the hall call assigned to the car, the car call generated in the car, and the current car position information and system according to the instructions of the car assignment calculation processing unit 01. The order of patrol of the car is uniquely determined from the information on the car state (stopped, moving, door open, etc.) and the car is operated.

  The hall call assignment information and the cage call occurrence information are temporarily stored in the hall call assignment information storage unit 02, such as the generation floor, the call direction, and the occurrence time, and when an unanswered call is processed, the hall call is assigned. Information regarding the processed call in the call assignment information storage unit 02 is deleted. However, depending on the difference in the group management processing system, for example, a so-called basket call in which a passenger other than the basket originally assigned to the hall call arrives first due to the occurrence of a car call and the passenger waiting on the floor gets on board. First-come-first-serve may occur. In such a case, the call information may not be deleted.

Hereinafter, the operation of the basket allocation calculation processing unit 01 will be described in detail.
As described above, when a hall call is generated by pressing the hall call button, the hall call information to be allocated is stored in the hall call allocation waiting queue in the hall call information collection unit 03. The basket allocation calculation processing unit 01 receives all allocation target hall call information stored in the hall call allocation waiting queue from the hall call information collection unit 03 at a timing at which calculation is possible. At this time, the allocation target hall call stored in the hall call allocation waiting queue is received by the calculation priority order determination unit 012 which is a component of the basket allocation calculation processing unit 01. When there are a plurality of hall call information stored in the hall call allocation waiting queue, the calculation priority determining unit 012 performs an allocation operation in the car allocation operation processing unit 01 according to the data attribute of the hall call. Determine the order of hall call operations.

A situation where a plurality of hall call information is stored in the hall call allocation waiting queue will be described.
In the elevator group management system, new hall calls that are generated when the system is performing allocation calculations in the hall call allocation calculation routine or when the allocation calculation CPU is executing another process due to an OS interrupt are allocated. Wait. For example, this is a situation where hall calls occur frequently, such as during a busy hour. During such congestion, hall call basket allocation calculation processing cannot catch up, and hall calls waiting for allocation calculation processing are buffered in a buffer corresponding to the hall call allocation waiting queue. Also, even if the hall call has already been allocated, if the cage takes time to respond to the hall call after the allocation, wait for the arrival of the cage at the hall call generation floor that requires time. In order to reduce the waiting time of passengers, hall call reassignment calculation processing may be performed. Even in this case, in order to execute the allocation calculation process, the hall call to be reassigned is buffered in the hall call allocation waiting queue.

  In this way, a situation occurs in which a plurality of allocation target hall calls that have already occurred are buffered.

Next, the calculation order determination method of the calculation priority order determination unit 012 will be described.
For example, as the data attribute of the hall call in the elevator group management system, the “occurrence time”, “occurrence floor”, “occurrence direction”, “normal call”, “VIP call”, “disability call”, “call to the underground floor”, “number of times of transmission” It is assumed that a data attribute such as (number of transmissions to the basket allocation calculation processing unit) is defined. Here, it is assumed that hall call data as shown in FIG. 2 is stored in the hall call allocation waiting queue in the order of occurrence, such as [0], [1],..., [4]. In this case, it is assumed that the calculation priority in the calculation priority determining unit 012 is defined by a flow as shown in FIG. As shown in FIG. 3, the calculation priority order is determined as follows.
(1) Sort 1: Number of transmissions> Call for disabled person> VIP call> Normal call> Sort in the order of priority of calls to the underground floor.
(2) Sort 2: When there is the same call type in sort 1, sort in order of occurrence time.
(3) Sort 3: When there is the same occurrence time in sort 2, sorting is performed in order of priority from the ground floor to the basement floor. However, in the case of the ground floor, the priority of the lower hierarchy is increased, and in the case of the underground floor, the priority of the floor near the first floor is increased.
(4) Sort 4: When there is the same occurrence floor in sort 3, sorting is performed in the order of priority of UP> DOWN.
And the calculation priority obtained by this calculation is output. FIG. 4 shows the calculation processing order obtained in this way. As shown in FIG. 4, the calculation order is changed according to the algorithm defined as shown in FIG.
As described above, the calculation priority determination unit 012 determines the calculation order of the allocation target hall call received from the hall call information collection unit. Then, according to this calculation order, the basket allocation calculation processing unit 01 performs the basket allocation calculation. Note that the priority ranking rule in the calculation priority determination unit 012 can be changed. For example, the time when the traffic flow changes such as “at work”, “normal time”, “lunch time”, “when leaving the office”, etc. The ranking rule may be changed according to the band, and the prioritization rule is also determined by using a combination of hall call data attributes, for example, “the person with a disability call and 1F generation UP hall” A prioritization rule such as “call” is also possible.

Based on the priority determined by the calculation priority determining unit 012, the car allocation calculation processing unit 01 performs the car allocation calculation. The calculation method will be described.
The basket allocation calculation processing unit 01 performs a combination optimization calculation for finding a sub-optimal solution from among the combinations of the temporary allocation patterns of the baskets for the hall call data arranged in the order of calculation priority. Then, the temporary allocation status of the allocation target hall call having the most evaluated temporary allocation pattern is instructed to the basket control units 111,..., 1N1 as an actual allocation result. Here, the “temporary allocation pattern” represents a state when temporary allocation of hall calls is performed for each allocation target hall call.

  The search processing of the search calculation processing unit 011 constituting the basket allocation calculation processing unit 01 is controlled by a calculation control unit (not shown), but in this embodiment, this calculation control unit controls only the calculation processing time. The search calculation processing unit 011 performs an iterative search until the search time limit controlled by the calculation control unit is reached.

The search calculation processing unit 011 performs a search calculation in accordance with the calculation order in the search calculation processing unit determined by the calculation priority order determination unit, and creates a temporary allocation pattern of the basket 11,..., 1N as follows. To go. First, a plurality of types (at least one type) of temporary allocation patterns of baskets 11,... After the baskets 11,..., 1N are created, the basket temporary assignment pattern with the highest evaluation value is selected from the created basket temporary assignment patterns. In the selected basket temporary allocation pattern, a hall call having the next highest priority next to the allocation target hall call currently added to the basket temporary allocation pattern is newly added to this basket temporary allocation pattern, and a new temporary basket allocation is performed. Get a pattern. Using a search procedure that repeats the above processing until the time limit is reached, a plurality of basket temporary assignment patterns are created within the given time limit. In the basket temporary allocation pattern of the best evaluation value, the result of the hall call temporarily allocated to the basket 11,..., 1N is set as the allocation calculation result of the basket allocation calculation processing unit 01. Send to.
Here, the created basket temporary allocation pattern is stored in the search calculation data storage unit 013.

  The evaluation model unit 014 is used in the search process of the search calculation processing unit 011. The evaluation model unit 014 performs an update calculation process of model data described below by a simple simulation calculation. Furthermore, the evaluation model unit 014 evaluates the basket temporary allocation pattern based on the update result.

First, “allocation target hall call list”, “model data”, “search list”, and “storage list”, which are main data structures, will be described.
The “allocation target hall call list” is a list for storing hall call information to be allocated to a basket. That is, the hall call data sorted in the above-mentioned allocation priority order is also stored in this allocation target hall call list. The unit data of this allotted hall call list is predicted to be generated from the hall call as the attribute data of the hall call "occurrence floor""directioninformation""occurrence time information""calltype""number of transmissions" Derived car call information (destination floor information). The hall call information and the cage call information derived from the hall call information are grouped together, and the unit data is called “call set”. There may be a plurality of derived car calls that are combined with one hall call. The data structure of the allocation target hall call list is shown in FIG.

  Although not described in the above description of the embodiment, a virtual call (in the case of virtually assuming a hall call that is not actually generated but may occur in the future, is assigned to the prior-assigned hall call data group that has not yet been allocated. Hall call data) It is also conceivable to use a group of data added in order of time of occurrence.

  The allocation target hall call list in FIG. 5 is obtained by adding a call set ID and derived cage call information to the prioritized results in FIG. The call set ID is assigned priority, and the derived car call information is destination (car call) data expected from the hall call. There may be one or more derived basket call information for the call set ID.

Next, model data will be described.
In the present embodiment, in the evaluation model unit 014, the time at which each cage arrives at the hall call generation floor stored in the allocation target hall call list in a round is determined by a simple simulation ignoring dynamic characteristics. Estimate at high speed, calculate the delay time (that is, unanswered time) based on the difference between arrival time and hall call occurrence time, and evaluate the goodness of allocation based on the delay time. In this case, what is calculated as the evaluation value may be various forms such as time from arrival of the hall call floor to arrival of the target floor (that is, service time). In the present embodiment, description will be made using a delay time as an evaluation value.
The “model data” is data that stores the intermediate results of the simulation of the evaluation model unit 014 as the tour schedule information of the basket. The model data includes at least information regarding the car assignment pattern information indicating which car is assigned to all the hall calls in the hall call assignment list, and information on the traveling time of each floor. FIG. 6 shows an example of model data for one basket. In FIG. 6, the time required to move between floors is set to 5, and the time required to open and close the door is set to 5.
In the calling direction of FIG. 6, U is an upward call, D is a downward call, N is a basket call, and all passengers are swept free.

When the search operation processing unit 011 tentatively decides the call set allocation, candidates for locations where a new call can be processed in the cyclic schedule so as not to break the allocation of the already-assigned unanswered calls and the cyclic order associated therewith Is searched. The place where insertion is possible is a place that satisfies the physical restrictions and restrictions of the operation rules of the basket that must be observed at least in order not to make passengers uncomfortable, for example, when the passenger is in the car, Even if the efficiency of the car operation is high (e.g., the waiting time for passengers waiting on other floors can be reduced), it satisfies the car operation rules that do not reverse the car in progress toward the destination floor of the passenger on the car In some cases, a plurality of locations are candidates. For hall calls, for example:
(1) The calling direction matches the direction of the car at the time of the previous stop, and
(2) (immediate stop floor-call generation floor) x (immediate stop floor-call generation floor) <0, and
(3) Departure time of the previous stop floor + travel time from the previous stop floor to the call generation floor ≥ generation time of new call
A place that satisfies the insertable condition such as is an insertable place. The movement time between floors is estimated by previously storing the movement time between floors in consideration of dynamic characteristics such as acceleration / deceleration in a table.
The derived car call is uniquely determined because the place where the hall call is processed must be processed after the hall call processing place and before the place where the moving direction of the car is reversed. This is because, as a general rule, elevators are prohibited from reversing the direction of movement of the car while passengers are still on it.

  When a candidate for a place where a new call set can be processed is tentatively determined in the cyclic schedule of model data, the model data is updated to a state where the new call set is added. That is, if you add a call set to be processed at each stop floor and set up a new stop floor to handle hall calls or basket calls of the call set, go to the stop floor that is scheduled to go around after the new stop floor Update the arrival time and departure time of each. The flow of time update processing is shown below.

(1) New stop floor time setting
The arrival time is obtained by “departure time of the previous stop floor + travel time to the call generation floor”, and the departure time is obtained by “arrival time + door opening / closing time”.
(2) Correction of arrival times of existing stop floors after the new stop floor
The arrival time is obtained by “departure time of the previous stop floor + travel time to the stop floor to be updated”.
(3) If “arrival time + door opening / closing time> departure time”, proceed to (4). If not, exit.
(4) Departure time is arrival time + door opening and closing time.
(5) Move the time update processing target to the next stop floor, and return to (2).
FIG. 7 is a diagram showing an outline of the above processing. As shown in the search for insertable locations in (1) of FIG. 7, if there is an upward hall call on the 1st floor and a downward hall call on the 4th floor, Search for. Next, as shown in (2) of FIG. 7, if the insertion process is performed, for example, if the upper call of the third floor is inserted into the basket that rises from the second floor to the fourth floor, The call time is inserted, and the estimated time to reach the fourth floor is updated. Note that a plurality of model data corresponding to a plurality of types of basket allocation patterns during the search is temporarily stored in a search list and a save list.

With reference to FIG. 8 and FIG. 9, an outline of search processing performed by the search calculation processing unit 011 will be described. FIG. 8 is a flowchart showing a schematic flow of the entire search process, and FIG. 9 is a flowchart in which the process of the iterative search calculation process part is extracted.
In the search calculation processing unit 011, a time limit is provided in order to realize real-time property in the elevator group management, and the search is performed in the middle even if the allocation of all the hall calls in the allocation target hall call list has not been determined. Abort. That is, the temporary allocation is sequentially determined from the hall call having the higher priority of the hall call allocation in which the target hall call is determined by the calculation priority determining unit 012. Therefore, there is a high possibility that the best allocation result at that time can be obtained according to the possible calculation time limit. Hereinafter, the flow of operation will be described for each step.

The already generated unallocated hall calls sorted in the order of search calculation processing by the calculation priority determining unit 012 are set in the allocation target hall call list (step A1).
Based on the current position of each car (floor position at which deceleration can start and stop when moving), the already assigned assigned unanswered hall call, and the unprocessed car call for each car, By determining a traveling schedule and setting this schedule in the model data, the model data is initialized (step A2). Here, the cage tour schedule is uniquely determined. Note that a derived cage call (step A4) expected from an unanswered hall call, which will be described later, may also be set in the model data. Even in this case, the cage tour schedule is uniquely determined. Then, the initialized model data is set at the top of the search list (step A3).

  The basket temporary allocation pattern is determined by iterative calculation by the search calculation processing unit 011 (step A4). Here, with reference to the flowchart of the search operation of FIG. 9, a method for determining the temporary allocation pattern of the hall call in the allocation target hall call list by the iterative calculation process will be described.

  Model data to be examined next is extracted from the top of the search list (step B1). If the search list is empty, the search operation is terminated (step A5), and if not, the process proceeds to step B3 (step B2).

  It is checked whether all set calls in the allocation target hall call list have been added to the model data at the top of the search list (hereinafter referred to as “pre-update model data”) (step B3). If the set call has been added in step B3, the model data at the head of the search list is moved to the storage list, and the process returns to step B1 (step B4). If the addition process has not ended in step B3, the process proceeds to step B5.

  In order to create model data corresponding to the cage allocation status when a set call is allocated, a hall call that is unprocessed in the pre-update model data and has the highest calculation priority (in this case set The data of “call N” is extracted (step B5). Then, a plurality of types of model data corresponding to the number of baskets corresponding to the situation where it is assumed that the set call N is assigned to each basket are created. Specifically, it is as follows.

A place where a hall call can be inserted, which is attribute data of the set call N, is searched for in the pre-update model data (assignment target car tour schedule) (step B6).
A place where the derived basket call which is the attribute data of the set call N data is inserted is searched (step B7). Then, a copy of the pre-update model data is generated (step B8). Next, a set call N is inserted into the copy, and the copy is updated (step B9). Hereinafter, the copy after the update calculation is referred to as “updated model data”.
An evaluation value of the updated model data is calculated (step 10). The updated model data is added to the search list as model data corresponding to a new situation (step B11). The search list is sorted in the order of evaluation values (step B12).

Here, if the process is completed for all the insertable places where the set call N has been inserted (step B13), the process proceeds to step B15. Otherwise, the process proceeds to the next insertable place, and the process returns to step B7. (Step B14).
When the process is completed for all the assignable baskets (step B15), the process proceeds to step B17. Otherwise, the process proceeds to the next basket, and the process returns to step B6 (step B16).
If the search time limit has not been reached (step B17), the process returns to step B1, and if the time limit has been reached, the process proceeds to step A5.

  The detailed flow of the search calculation processing unit 011 has been described above. When the time limit is reached in step B17, the storage list is sorted in the order of evaluation values (step A5). Then, it is determined whether or not the storage list is empty (step A6). If it is empty, the process proceeds to step A7, and the top model data of the storage list is acquired (step A7). In step A6, if the storage list is not empty, the process proceeds to step A8, and the top model data of the search list is acquired (step A8). Instead of the processing of steps A6, A7, and A8, the evaluation value of the top model data in the list for saving is compared with the evaluation value of the top model data in the search list, and the model data with the better evaluation value is selected. You may get it.

  According to the contents of the basket allocation of the acquired model data, the basket allocation result of the allocation target hall call data is output (step A9). Then, the assigned hall call is deleted from the hall call allocation waiting queue, and the processing of the search calculation processing unit 011 is terminated (step A10).

  In the above description, the evaluation value is the non-response time when the already-assigned unanswered hall call and the already-not-assigned hall call stored in the allocation target hall call list are temporarily assigned (from the call occurrence time to the corresponding call). Elapsed time until the basket arrival time). Instead of the unanswered time, “maximum unanswered time”, “call dispatching time (time until a cage call derived from a hall call) is processed”, or the like can also be used.

  However, when the evaluation values are sorted as they are in the sort of evaluation values, the evaluation values are always better when the number of added hall calls is smaller, so a so-called breadth-first search is performed. In order to consider as many hall calls as possible within the time limit, the evaluation value increases for each call set so that the evaluation values can be compared between model data with different numbers of added hall calls. Such an average evaluation value is stored and used as an estimated value of the search node for adjustment. The search proceeds more efficiently as the average evaluation value is an expected value closer to the actual evaluation value increment. As described above, the method of using the estimated value for prioritizing search nodes is called “A search” and is often used in the field of artificial intelligence and the like.

In the case of A search, the evaluation value is defined as follows, for example.
Evaluation per call: P = estimated arrival time−call generation time−reference waiting time
Evaluation of entire model data: ΣP + number of unprocessed call sets × evaluation estimated value FIG. 10 is a diagram showing basic iterative processing during search.
In reality, it is impossible to store all model data appearing during the search and perform a search for all combinations. For this reason, as described with reference to FIG. 10, when the size of the search list overflows, the basket allocation pattern (model data) having a poor evaluation value (large penalty) becomes an optimal basket allocation pattern thereafter. It is determined that the possibility is small, and it is repeated to discard such model data.

  As described above, according to the present embodiment, when there are a plurality of existing unallocated hall calls, the calculation prioritization is performed according to the priority determination method that defines them. Then, according to the priority order, the plurality of hall calls assigned with calculation priority are created according to the priority order, and a plurality of types of basket temporary assignment patterns are created for the hall call with the highest priority, and the basket temporary assignment with the highest evaluation value is selected. . Furthermore, for each of the temporary basket allocation patterns, one type of allocation target hall call that is not temporarily allocated and has a high priority is added to create a plurality of new temporary basket allocation patterns. From among the temporary allocation patterns, the cage temporary allocation pattern having the best evaluation value is selected as a basket temporary allocation pattern to be examined next.

By using an exploratory procedure in which the above processing is repeated until the time limit is reached, a basket temporary allocation pattern having a good evaluation value is created within the given calculation time limit. The temporary allocation of the hall calls to be allocated is performed, and the temporary allocation is determined in order from the call with the highest priority according to the procedure in which the call is determined based on the priority order. It is possible to obtain the best allocation result in, and real-time elevator group management can be realized, and
・ If there are multiple unassigned hall calls that have already occurred in the hall call queue waiting for assignment processing, the car assignment calculation process is performed one by one, so the car assignment calculation process for the last hall call in the queue is performed for several seconds. Later, the lighting timing of the hall lantern for notifying passengers waiting for the hall of the allocation result is greatly delayed. In the meantime, hall calls are generated and stored in the queue.
・ Even though multiple hall calls have already occurred, since hall calls are assigned one by one, the degree of impact on the currently scheduled floor at the time of assigning the first hall call taken from the queue (waiting time) Even if the optimal basket allocation solution can be derived with some consideration, the allocation result of the first hall call is not necessarily the optimal basket allocation solution when the last hall call is allocated. ,
Can be solved.

  Note that the present invention is not limited to the above-described embodiment as it is, and can be embodied by modifying the constituent elements without departing from the scope of the invention in the implementation stage. In addition, various inventions can be formed by appropriately combining a plurality of components disclosed in the embodiment. For example, some components may be deleted from all the components shown in the embodiment. Furthermore, constituent elements over different embodiments may be appropriately combined.

The block diagram which shows schematic structure of the elevator group management system which concerns on one Embodiment of this invention. The figure which shows the example of data of a hall call. The figure which shows an example of the flow for determining calculation priority. The figure which shows the calculation priority order obtained by the process shown in FIG. The figure which shows the data structure of an allocation object hall call list. The figure which shows an example of the model data for one basket. The figure which shows the outline | summary of the insertion process in the elevator group management system which concerns on one Embodiment of this invention. The flowchart which shows the general | schematic flow of the whole search process. The flowchart which extracted the process of the iterative search calculation process part. The figure which shows the basic repetition process at the time of a search.

Explanation of symbols

DESCRIPTION OF SYMBOLS 0 ... Elevator group management part 01 ... Basket allocation calculation process part 02 ... Hall call allocation information storage part 03 ... Information collection part 04 ... Basket information collection part 05 ... Information collection part 011 ... Search calculation process part 012 ... Calculation priority order determination part 013 ... Search calculation data storage unit 014 ... Evaluation model unit 015 ... Calculation control unit 015 ... Search control unit 11, ..., 1N ... Kago 21, ..., 2M ... Hall call buttons 111, ..., 1N1 ... Basket control unit 112, ... 1N2 ... Basket call button

Claims (6)

In an elevator group management system that executes group management control for assigning an elevator car that responds to a hall call that occurs at an arbitrary time on any floor in the building,
With respect to a plurality of allocation calculation target hall calls that have already occurred in the elevator hall , at least one of the existing floor calls, the generation direction, the type of hall call, and the generation time of the hall call . A calculation priority setting means for setting a calculation priority as an allocation execution order of the hall calls for performing group management control for allocating a plurality of allocation calculation target hall calls to an elevator car;
Temporary allocation of hall calls is performed according to the calculation priority of the hall call, and a plurality of basket temporary allocation results in an elevator state when the temporary allocation of the basket is made are held, and the plurality of held baskets are retained. elect a single car allocation result according to predetermined evaluation from the temporary allocation result, performs basket provisional allocation of hall call in accordance with the non-provisional allocation and the calculated priority to the selected the car temporary allocation result, that elevator group control system characterized by comprising a series of operations repeat the search procedure, and a plurality of hall call car assignment processing means capable of determining the car provisional allocation results for. In the elevator group management system according to claim 1 ,
From among the plurality of car temporary allocation result held in the car assignment processing means, the selected basket provisional allocation result according to predetermined evaluation, a plurality of the already generated in the selection has been car tentative allocation result When the basket temporary allocation of the allocation calculation target hall call is performed, an allocation command to the basket is executed for the plurality of already generated allocation calculation target hall calls in accordance with the basket temporary allocation result. Elevator group management system. The elevator group management system according to claim 1 or 2 , wherein an allocation calculation time limit is added to the basket allocation calculation processing means. The elevator group management system according to claim 3 , wherein the allocation calculation time limit is a variable time. The elevator group management system according to any one of claims 1 to 4 , wherein an A search algorithm is used as the exploratory means of the basket allocation calculation processing means. In an elevator group management method for executing group management control for assigning an elevator car to respond to a hall call that occurs at an arbitrary time on an arbitrary floor in the building,
With respect to a plurality of allocation calculation target hall calls that have already occurred in the elevator hall , at least one of the existing floor calls, the generation direction, the type of hall call, and the generation time of the hall call . Set the calculation priority as the allocation execution order of the hall calls for executing group management control to allocate a plurality of allocation calculation target hall calls to the elevator car,
Temporary allocation of hall calls is performed according to the calculation priority of the hall call, and a plurality of basket temporary allocation results in an elevator state when the temporary allocation of the basket is made are held, and the plurality of held baskets are retained. One basket allocation result is selected from the temporary allocation results according to a predetermined evaluation, and the temporary allocation of hall calls according to the calculation priority order is performed on the selected basket temporary allocation result. An elevator group management method characterized in that a series of operations are repeated in an exploratory procedure to obtain a temporary basket allocation result for a plurality of hall calls .

Images