JP5566646B2 - Elevator group management control system and group management control method - Google Patents

Description

  The present invention relates to an elevator group management control system and a group management control method for allocating any of a plurality of elevator cars to a hall call in an arbitrary direction generated at an arbitrary time on an arbitrary floor.

  The purpose of elevator group management is to assign hall calls to appropriate cars, taking into account the status of calls currently being generated (hall calls, car calls), the current position of the car, and the number of passengers. In order to properly assign hall calls to the car, all of the following factors must be considered.

1. The impact of the current assignment on calls that have occurred so far and have not yet been serviced (unanswered calls).
2. The impact of current assignments on future calls.
3. The impact of future call generation on all unanswered calls assigned to date.
Among these factors, the first factor is easy to handle, but other factors are hardly handled in the conventional method except for some proposals (see, for example, Patent Documents 1 and 2). This is because, unlike a general conventional group management method, it is necessary to simultaneously consider a plurality of calls including a virtual call in the future. That is, the method becomes complicated because a sub-optimal solution must be found out of all allocation combinations for a plurality of calls and a kind of combination optimization operation must be performed.

JP-A-5-319707 JP-A-5-319706

  However, the traffic situation in the building after the allocation changes, and the influence of the above 1 considered at the time of allocation may not be predicted, and so-called long waiting may occur for passengers waiting for the floor. In this case, the reassignment process for changing the hall call corresponding to the long waiting floor from the current assigned unit to another unit is generally performed in the elevator system. However, in this reassignment process, since the effect 1 is considered for one hall call to be reassigned, the effects 2 and 3 cannot be considered. In addition, when there are a plurality of reassignment target hall calls at the same time, they cannot be processed at the same time to take into account the effects of 1, 2, and 3.

  In order to take into account the above two or three factors, it is necessary to perform combinatorial optimization calculation for a plurality of calls within a predetermined time limit. However, the GA (genetic algorithm) proposed in Patent Document 1 and the method using SA (Simulated Annealing) proposed in Patent Document 2 have real-time characteristics required for group management. It is extremely difficult to realize.

  An object of the present invention is to provide a group management control system and a group management control method capable of obtaining an optimal allocation number for an existing unanswered hall call.

An elevator group management control system according to the present invention is an elevator group management control system that assigns one of a plurality of elevator cars to a hall call in an arbitrary direction that occurs at an arbitrary time on an arbitrary floor. From the current time, the car position information of each elevator, the car direction information, the information of the already assigned hall call to which the elevator is assigned to the hall call, and the car call information, The current operation information creation unit that creates current operation information on which floor the elevator unit will move to when and the unassigned elapsed time up to the current time of the allocated elevator unit among the previously allocated hall calls As described above, the hall call whose response time from the current time until it reaches the floor of the hall call exceeds the set time is determined as the reassigned hall call. And assigned hall call determination unit, when said call reassignment target hole is determined by the re-allocation hall call determination unit there are a plurality, for the call the plurality of reassignment target hole, the already Units are assigned combination A search operation processing unit that temporarily allocates another combination of units, and the result of the temporary allocation, multiple reassignments of temporary allocation operation information on which floor each elevator unit will move to and from which time after the current time create for each call subject hall, these tentative allocation operation information and said current operation information compared respectively, to calculate the improved value of the reallocation target hall call, already assigned hall other than call this reassignment target Hall and operating the simulation evaluation unit which is referred to calculate the impact value is subjected, to evaluate the provisional assignment result obtained by integrating the impact value and the improved value for every call a plurality of reallocation target Hall, this An operation simulation result storage unit that stores a temporary allocation result of which the evaluation by the operation simulation is equal to or higher than a predetermined level as a new temporary allocation result, and stores an allocation before the temporary allocation as a temporary allocation result if the predetermined level is not reached, and this operation simulation result storage An allocation determining unit that reallocates a temporary allocation result selected as a temporary allocation result having the highest evaluation from the temporary allocation result stored in the unit to a corresponding unit.

  Further, in the present invention, the current operation information creation unit includes the car position information of each elevator at the current time, the car direction information, the information on the already assigned hall call in which the elevator is assigned to the hall call, the car In addition to the call information, by using the car status information including the door open / close information of each elevator car at the current time T, to which floor each elevator car moves to which floor after the current time T It may be configured to create current operation information.

  Furthermore, in the present invention, each floor is provided with arrival machine notification means, and when the hall call is reassigned as a result of the hall call reassignment of each machine by the assignment determining unit, the arrival machine is The notification is collectively reported to passengers waiting on the floor by the notification means.

In addition, the elevator group management control method according to the present invention includes car position information, car direction information of each elevator at the current time, information on an already assigned hall call to which the elevator is assigned to the hall call, and a car. Based on the call information, current operation information on which floor each elevator unit will move to which floor after the current time is created by the current operation information creation unit, and among the already allocated hall calls, the current status of the assigned elevator unit The unallocated elapsed time until the time exceeds the set time and the response time from the current time to the hall call floor reaches the set time or more is determined as a reassigned hall call by the reassigned hall call determination unit. and, if the reallocation target hall call there are multiple, they respect the reassignment subject hall call, and already Units are assigned combination The Unit of different combination tentatively assigned by the search processing unit, from this provisional assignment is a result of the operation simulation evaluation unit, the current and future time, tentative assignment operation if the elevator machines what floor to what time moved to generates information for each call the plurality of reallocation target hole, it compares these provisional allocation operation information and said current operation information, to calculate the improved value of the reallocation target hall call, call this reassignment target Hall The impact value affected by other allotted hall calls other than the above is calculated, and the temporary allocation result that combines the improvement value and the impact value is evaluated for each of the plurality of reassigned hall calls . The temporary allocation result is set as a new temporary allocation result. If the predetermined level is not reached, the allocation before the temporary allocation is stored as a temporary allocation result in the operation simulation result storage unit, The operation simulation result storage unit temporarily assigned result voted provisional allocation results stored is selected as the highest provisional allocation results, characterized in that it reassigned Unit corresponding by allocation determination unit.

  According to the present invention, when it is determined that reassignment should be performed for an existing unanswered hall call, reassignment processing is performed, but the state when each reassignment target hall call is reassigned to each unit is By simulating what happens and comparing the operation schedule before reassignment with the operation schedule after reassignment, the optimal assigned number can be obtained.

1 is a block diagram illustrating an embodiment of an elevator group management system according to the present invention. It is a flowchart explaining operation | movement of one Embodiment same as the above. It is a figure explaining the current operation information in one embodiment same as the above. It is a figure explaining the case where the hall call of the reallocation object is elected using the present operation state of FIG. It is a figure explaining the operation information at the time of allocating another unit different from the former to one of the hall calls selected for reassignment according to FIG. It is a figure explaining the operation information at the time of assigning the same number machine as before to one of the hall calls of the reallocation object elected by FIG. It is a figure explaining the operation information at the time of assigning the same number machine as before to another one of the hall calls of the reallocation object to the state of FIG. It is a figure explaining the operation information at the time of allocating another unit different from the former to another one of the hall calls of the reallocation object to the state of FIG.

  Hereinafter, an elevator group management control system according to an embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 is a block diagram showing a schematic configuration of an elevator group management control system according to this embodiment.

  The group management control system targeted by the present invention performs group management control of an elevator, and performs group management of an elevator system having at least two elevator cars (hereinafter also referred to as “units”). Further, the present invention relates to a reassignment processing operation for changing a hall call assignment number for a hall call that has already occurred and has already been assigned, rather than an assignment operation processing for a newly generated hall call. Therefore, the allocation calculation method for the new hall call is omitted.

  In general, an elevator system includes a hall call button 11 at a landing on each floor. When the hall call button 11 is pressed, the allocation calculation unit for a new hall call (not shown) of the group management device performs the above-described allocation calculation process for the new hall call and allocates the elevator car 12 that responds to the hall call. Then, an allocation command is issued to the corresponding machine 12.

  The car control unit 13 of each car 12 is provided with an assigned hall call information list 14 and a car call information list 16, and the assigned hall call information list 14 of the corresponding car 12 is assigned to the assigned hall call information list 14 by the assignment command. Information on the time, floor, and direction of the generated hall call is registered. Each car 12 is provided with a car call button 15, and a passenger who gets on the car 12 responding to the hall call presses the car call button 15 to enter the destination floor of the car 12 itself. Notify the floor. At this time, the occurrence time / floor of the generated car call is registered in the car call information list 16 of the corresponding car 12.

  Each elevator 12 is based on the current state information including the open / closed state of the car door, the current position information, the current direction information, and the information of its assigned hall call information list 14 and car call information list 16. Next, the next response call is determined autonomously according to the operation rules of the elevator. Then, the car control unit 13 controls the physical operation of the elevator to the next response call floor to perform a response process to the hall call and a response process to the car call. At this time, the responding hall call information and car call information are deleted from the lists 14 and 16.

  In addition, the elevator system includes arrival machine notification means 18 at the landings on each floor. This arrival number notification means 18 is means for notifying passengers who are users of which number 12 is assigned to the generated hall call and arrives at the corresponding hall call floor. The passenger waits for the numbering machine in front of the numbering machine 12 scheduled to arrive according to the contents of the notification.

  The above is the normal processing flow of the elevator system.

  Next, the group management control device 20 will be described. First, the car information collection unit 21 and the car stop command information collection unit 22 will be described.

  The car information collecting unit 21 collects current information of each car 12 at an arbitrary time T. The car information collecting unit 21 collects current position information of each car 12 and detects current direction information of each car 12. The car direction information detecting unit 24 and a car state information detecting unit 25 representing the state of each car 12 (moving, door open, etc.).

  The car stop command information collecting unit 22 collects hall call assignment information and car call generation information of each car 12 at an arbitrary time T, and hall call information (occurrence time / floor) from the hall call information list 14 of each car 12. A hall call allocation information detection unit 26 for detecting floor / direction / assignment number) and a car call information detection unit 27 for detecting car call information (floor / generation number) from the car call information list 16 of each unit 12. The

  Next, the reassignment calculation process start determination unit 28 that issues a reassignment calculation start command will be described. This reassignment calculation process start determination unit 28 is a reassignment hall call candidate determination unit 29 that detects one or more hall calls to be reassigned, and performs reassignment hall call determination calculation, which will be described later. The reassignment hall call determination calculation instruction unit 30 for instructing the unit 34 and the non-reassignable hall call reset unit 31 for changing all the hall calls that cannot be reassigned from “impossible” to “possible”.

  The reallocation hall call candidate determination unit 29 has a reallocation hall call list 32 that can be reassigned. By referring to this list 32, the reallocation hall call candidate determined by the reallocation hall call candidate determination unit 29 can be reassigned. ”Or“ impossible ”. A hall call determined as a reallocation hall call candidate by the reallocation hall call candidate determination unit 29 changes the information in the corresponding reallocation hall call list 32 from “possible” to “impossible”. Then, the reallocation determination calculation command unit 30 transmits the reallocation hall call candidate to the reallocation hall call determination unit 34, and the calculation of the reallocation hall call determination unit 34 is executed.

In the present embodiment, the reallocation hall call candidate determination unit 29 monitors the response status of the hall call that has not been allocated yet for each monitoring time interval CT, and the allocated allotted unanswered normal that has passed the TH ^PASS or more A hall call that is targeted for a hall call and whose reassignable flag of the reassignable hall call list is “possible” is transmitted to the reallocation hall call determination unit 34 as a reallocation hall call candidate.

  Next, the reallocation hall call determination unit 34 will be described. The reassignment hall call determination unit 34 determines whether or not there is a hall call to be reassigned. The operation of each unit 12 at time T when the calculation start command is received from the reassignment calculation process start determination unit 28. Reassignment hall call that determines whether or not to reassign a reassignment candidate hall call from the current operation information creation part 35 that creates schedule information (operation schedule) and the current operation information creation part created by the current operation information creation part The determination calculation unit 36 includes a reassignment hall call transmission unit 38 that transmits a hall call determined to be reassigned by the reassignment hall call determination calculation unit 36 to a reassignment calculation device 37 described later.

  Among them, the current operation information creation unit 35 includes a derived car call generation unit 39, and generates a car call derived therefrom from the statistical demand traffic flow information for an already allocated unanswered hall call. The method for generating the derived car call is omitted because it is not the essence of the invention. The reallocation hall call transmission unit 38 includes a sorting unit 40, and sorts the reallocation hall calls to be transmitted in order to determine the calculation order of the reallocation state of the reallocation hall call in the reallocation calculation device 37. Details of the sorting unit 40 will be described later.

  When the reallocation hall call determination unit 34 receives a calculation command from the reallocation hall call determination calculation command unit 30 of the reallocation calculation process start determination unit 28, the current operation information creation unit 35 stops the car information collection unit 21 and the car stop. Based on the information from the command information collection unit 22, the operation information at the time T of each unit 12 is created. That is, the current operation information creation unit 35 determines the current position after the current time T from the car position information, the car direction information, the already assigned hall call information to which the elevator car is assigned, and the car call information at the current time T. In addition, the current operation information on which floor each elevator unit moves to which floor is created.

  In addition, as described above, the current operation information creation unit 35, when creating the current operation information, as the car information, the car position information and the car direction information of each elevator car 12 at the current time T described above are further added to each elevator. The accuracy of the current operation information may be further increased by adding car status information including door opening / closing information of the car door of the unit. Hereinafter, the operation information created by the current operation information creation unit 35 is shown in FIG.

  In FIG. 3 and subsequent figures, for the sake of simplicity, it is assumed that two elevators 12 constituting the elevator system are provided and applied to a 4 floor building. The current operation information creation unit 35 can determine the starting point of the operation diagram at the current time T because the position, direction, and state of each car 12 are input from the information of the car information collection unit 21. Next, from the information of the car stop command information collection unit 22, the call response order and time of each car 12 can be determined. In the figure, △ represents an upward hall call, and ▽ represents a downward hall call.

In the figure, the numerical values of the hall calls HC _{1 to} HC ₆ represent the order in which the hall calls HC are generated. In the example of FIG, HC _1, at the present time, that are assigned to the second car is a call upward hall second floor holes generated in the first past. HC ₂ is the downward-facing hall call in the third-floor hall that has occurred the second time in the past, and Unit 1 is assigned. HC ₃ is a downward hall call in the 3rd floor hall that has occurred in the third time, and Unit 2 is assigned. HC ₄ is the upward hall call in the 1st floor hall that has occurred for the fourth time in the past. Unit 1 is assigned. HC ₅ is the downward-facing hall call in the fourth-floor hall that has occurred the _{fifth time} in the past, and Unit 1 is assigned. HC ₆ is the upward hall call in the 3rd floor hall that has occurred the _{sixth time} in the past, and Unit 1 is assigned.

  Further, in the figure, ● indicates the car call of each car 12 that is actually generated, and ○ indicates the derived car call generating part 39 of the current operation information creating part 35 from the hall call information that has not yet been assigned to each car 12. Derived car call generated by.

  Here, the travel time between floors can be calculated from the travel time table or the rated speed, acceleration, jerk, deceleration, and deceleration of the car. Furthermore, the average stop time in the stop direction of each floor is adopted as the stop time of each floor, the stop time due to hall call stop, the stop time due to car call stop, and the stop time due to hall call and car call are tabled beforehand. It can be decided by making it.

  Next, based on the current operation information at the current time T created by the current operation information creation unit 35, the reassignment hall call determination calculation unit 36 performs the reassignment based on the instruction from the reassignment calculation process start determination unit 28. A calculation is performed to determine whether or not to reassign the hall call candidate for allocation hall call. Hereinafter, a calculation example by the reallocation hall call determination calculation unit 36 will be described with reference to FIG.

FIG. 4 shows an example in which there are _two HC ₁ and HC ₂ as reassignment candidate hall calls that have exceeded the allocation elapsed time Th ^PASS up to the current time T. That is, since these two hall calls HC ₁ and HC ₂ have not yet responded even after the allocation elapsed time Th ^PASS has elapsed, it is determined whether or not to perform the reallocation. First, the number of seconds after the time T each hall call HC ₁ , HC ₂ is expected to respond is calculated from the current operation information. In FIG. 4 , it can be calculated that HC ₁ responds after the predicted time t _HC1 ^res from the current time T, and HC ₂ responds after the predicted time t _HC2 ^res from the current time T. In this embodiment, these prediction time ^{_{t HCi res (i = 1,2)}} , reallocates determined as follows by comparing the response determined time Th ^RESS a preset.

t _HCI ^res <Th ^RESS : The reallocation candidate hall call HCI is not regarded as a reallocation target hall call.
t _HCI ^res > Th ^RESS : Reassign candidate hole call HCI is a reassign target hall call.

In the case of FIG. 3, the reallocation candidate hall calls HC ₁ and HC ₂ are determined as reallocation target hall calls by the reallocation hall call determination calculation unit 36.

The allocation hall call transmission unit 38 transmits the reassignment candidate hall call determined as the reassignment target hall call based on the calculation result by the allocation hall call determination calculation unit 36 to the search calculation processing unit 42 of the reallocation calculation device 37. . That is, the reassignment target hall calls HC ₁ and HC ₂ are sent to the search calculation processing unit 42. Here, the sorting unit 40 provided in the reallocation hall call transmission unit 38 will be described.

The sorting unit 40 determines the calculation order in the reallocation calculation device 37 of the reallocation candidate hall call determined as the reallocation target hall call. As the calculation order, the order of time of occurrence of the reassigned hall calls, the order of scheduled responses, and the like can be considered, but in this embodiment, they are sorted in the order of scheduled responses. That is, since the reallocation hall call HC ₁ is scheduled to respond earlier from the current operation information than the reallocation hall call HC _2, it is sorted and sent to the search calculation processing unit 42 as shown below. .

The current operation information transmission unit 41 transmits the current operation information of FIG. 3 created by the current operation information creation unit 35 to the operation simulation evaluation unit 43 of the reallocation calculation device 37. Further, the hall call assignment information of each car 12 from which the reassigned hall calls HC ₁ and HC ₂ have been deleted and the car call generation information of each car 12 are transmitted to the operation simulation evaluation unit 43 as call information.

  The reallocation calculation device 37 includes a search calculation processing unit 42, an operation simulation evaluation unit 43, an operation simulation evaluation result storage unit 44, and an allocation determination unit 45.

The search calculation processing unit 42 assigns a number 12 different from the number 12 already assigned to the reassigned hall calls HC ₁ , HC ₂ determined to be reassigned by the reassignment hall call determination unit 34. Temporarily assign. That is, a plurality of provisional allocation results are created by reallocating the reassignment target hall calls HC ₁ and HC ₂ to each unit 12 other than the unit 12 allocated before the reassignment.
The operation simulation evaluation unit 43 creates temporary allocation operation information on which floor each elevator car 12 moves to which floor after the current time T from the result of the temporary allocation by the search calculation processing unit 42. The allocation operation information is compared with the current operation information, and an improvement value of the temporary allocation result is calculated and evaluated. That is, the temporary allocation operation information which is the operation information is generated from the temporary allocation result generated by the search calculation processing unit 42, and is generated by the temporary allocation operation information and the current operation information generation unit 35 of the reallocation hall call determination unit 34. The provisional allocation operation information is evaluated by comparing the current operation information.

  The operation simulation result storage unit 44 stores, as a new temporary allocation result, a temporary allocation result of which the evaluation by the operation simulation evaluation unit 43 is equal to or higher than a predetermined level, and stores the allocation before the temporary allocation as a temporary allocation result if the predetermined level is not reached. . That is, it is determined whether or not to store the temporary allocation result evaluated by the operation simulation evaluation unit 43 and its evaluation value. If it is determined to be stored, it is stored. If it is determined not to be stored, it is not stored.

  The allocation determination unit 45 reallocates the corresponding unit according to the temporary allocation result selected as the highest temporary allocation result from the temporary allocation result stored in the operation simulation result storage unit 44. That is, it is determined whether or not to change the allocation number of the hall call to be reassigned from the final reassignment result. If it is determined to be reassigned, an allocation command is issued to the reassignment unit and before reassignment. An order to cancel the allocation is issued to Unit No.

  Hereinafter, each component described above of the reallocation calculation device 37 will be described in detail.

  The search calculation processing 42 includes a search calculation initialization unit 47 that initializes the search calculation processing, a reassignment target hall call list 48 that stores the reallocation target hall call transmitted from the reallocation hall call determination unit 34, and a reallocation. A temporary allocation result creating unit 49 for creating a plurality of temporary allocation states in which the target hall call is allocated to each unit; a temporary allocation result selecting unit 50 for selecting a temporary allocation result stored in the operation simulation evaluation result storage unit 44; The search calculation processing unit 42 includes a search calculation processing end determination unit 51 that determines the end of calculation processing.

  The search calculation initialization unit 47 creates an initial provisional assignment result in a state where the reassigned hall call is not assigned to any of the units 12, and sets the state corresponding to the search base node in the search calculation process described in detail below. create. After the creation, the search calculation initialization unit 47 transmits the initial temporary allocation result to the operation simulation evaluation result storage unit 44. In the operation simulation evaluation result storage unit 44, a temporary allocation result storage determination unit 53 described later determines that the initial temporary allocation result is stored, and the initial temporary allocation result is stored and stored in a temporary allocation result storage list 54 described later. . As will be described in detail later, the temporary allocation result storage information creation unit 55 of the operation simulation evaluation result storage unit 44 stores the evaluation result of the temporary allocation result as a set, but in the case of the initial temporary allocation result, the evaluation value Is not necessary, so the evaluation value is not calculated.

  The search calculation processing end determination unit 51 includes a temporary allocation result reference unit 56 that refers to the temporary allocation result in the temporary allocation result storage list 54 in the operation simulation evaluation result storage unit 44 and an iterative calculation counter 57. Then, as a result of referring to the temporary allocation result by the temporary allocation result reference unit 56, the temporary allocation result does not exist in the temporary allocation result storage list 54 in the operation simulation evaluation result storage unit 44 storing the temporary allocation result during the search. In some cases, or when the predetermined number of calculations has been completed by the iterative calculation counter 57, the search calculation process is ended, and the allocation determining unit 45 is notified of the end. When continuing the calculation, the temporary allocation result selecting unit 50 is notified of the continuation of the calculation.

  The temporary allocation result selection unit 50 includes a temporary allocation list operation unit 59 and a temporary allocation result selection calculation unit 60. The temporary allocation list operation unit 59 refers to the temporary allocation result storage list 54 in the operation simulation evaluation result storage unit 44 when receiving the calculation continuation notification from the search calculation processing end determination unit 51. The temporary allocation result selection calculation unit 60 selects a temporary allocation result stored in the temporary allocation result storage list 54 according to a predetermined evaluation criterion from the referenced content. The selected temporary allocation result is transmitted to the temporary allocation result creating unit 49 of the search calculation processing unit 42, and the temporary allocation result in the temporary allocation result storage list 54 is deleted by the temporary allocation list operation unit 59. The predetermined selection evaluation criterion by the temporary allocation result selection calculation unit 60 is a temporary allocation result having the best evaluation value among the temporary allocation results stored in the temporary allocation result storage list 54.

  The temporary allocation result creation unit 49 includes a temporary allocation hall call selection unit 62 and a temporary allocation result calculation unit 63. The temporary allocation hall call selection unit 62 is not included in the temporary allocation result selected by the temporary allocation result selection unit 50 (not allocated), and is the first hall call among the hall calls in the reassignment target hall call list 48. Select one. At this time, if none is selected, that is, if the temporary allocation results for all the reallocation target hall calls in the reallocation target hall call list 48 are selected, this temporary allocation result is stored in the operation simulation evaluation result storage unit. The result is transmitted to the all search end result storage list 64 in 44, and the all search end result storage list stores it. When one is selected, that is, when there are still unassigned reassigned hall calls, the temporary assignment result calculation unit 63 assigns the reassigned hall calls of the selected reassigned hall call list to each unit. A temporary allocation result is created and transmitted to the operation simulation evaluation unit 48.

  For example, if the elevator system is from Unit 1 to Unit 4, and the selected reassigned hall call was assigned to Unit 1 before reassignment, the selected reassigned hall call was temporarily assigned to Unit 1. Result (that is, allocation state not reassigned) Temporary allocation result that was provisionally assigned to Unit 2 (that is, state that was reassigned to Unit 2) Temporary assignment result that was temporarily assigned to Unit 3 (that is, state that was reassigned to Unit 3), Four temporary allocation results are generated, which are temporarily allocated to Unit 4 (that is, reassigned to Unit 4), and transmitted to the operation simulation evaluation unit.

  The above is the description of each component of the search calculation processing unit 42.

  Next, the operation simulation evaluation unit 43 will be described. The operation simulation evaluation unit 43 includes temporary allocation operation information creation unit 66 that creates operation information from the temporary allocation result created by the temporary allocation result creation unit 49, and temporary allocation operation information created by the temporary allocation operation information creation unit 66. Is composed of a temporary allocation result evaluation unit 67 for calculating an evaluation value of the temporary allocation result.

  The temporary allocation operation information creation unit 66 stores a call information list 68 that stores the call information of each unit 12 received from the current operation information transmission unit 41, and a derived car call that predicts and generates a derived car call generated from an unanswered hall call. The generator 69 is provided, and temporary allocation operation information of each car 12 is created from these information and the temporary allocation result of each car 12.

  The temporary allocation result evaluation unit 67 includes an operation information comparison unit 71 and an operation information evaluation value calculation unit 72. The operation information comparison unit 71 compares the temporary allocation operation information of the temporary allocation result created by the temporary allocation operation information creation unit 66 with the current operation information received from the current operation information transmission unit 41 of the reallocation hall call determination unit 34. The operation information evaluation value calculation unit 72 calculates an evaluation value from the comparison result. At this time, the evaluation value is calculated from the improvement value of the result of reassigning the hall call to be reassigned to Unit N and the effect on the hall call assigned to Unit N by a hall call other than the reassigned hall call. The In this embodiment, the improvement value of the hall call non-response time as a result of reassigning the reassigned hall call to Unit N, and the hall call assigned to Unit N by a hall call other than the reassigned hall call It is calculated from the influence value of the non-response time. After calculating the evaluation value of the temporary allocation result, the temporary allocation result and the evaluation value are transmitted to the operation simulation evaluation result storage unit 44.

  Next, the operation simulation evaluation result storage unit 44 will be described. The operation simulation evaluation result storage unit 44 includes a temporary allocation result storage unit determination unit 53, a temporary allocation result storage information creation unit 55, a temporary allocation result storage list 54, and a full search end result storage list 64.

  The temporary allocation result storage unit determination unit 53 determines whether to store the received temporary allocation result from the evaluation value of the temporary allocation result received from the operation simulation evaluation unit 43. If the temporary allocation result storage information creation unit 55 determines that the temporary allocation result storage unit determination unit 53 stores the temporary allocation result storage information creation unit 55, the temporary allocation result and the improvement value if the hall call is a reallocation target, the allocated hall call Then, temporary allocation result storage information in which influence values are grouped is created. The temporary allocation result storage list 54 stores temporary allocation result storage information created by the temporary allocation result storage information creation unit 55. The all-search end result storage list 64 stores temporary allocation results that have been temporarily allocated for all allocation target hall calls.

  Hereinafter, each of the above components will be described in more detail.

The temporary allocation storage determination unit 53 determines whether to store the temporary allocation result from the temporary allocation result received from the operation simulation evaluation unit 43 and the evaluation value. In the example shown in the figure, the reassigned hall call HCi (i: index of the reassigned hall call assigned to the temporary assignment result is assigned to the temporary assignment result. In this embodiment, i = 1 as described above. , 2), when all the improvement values t _HCi ^imp are smaller than the improvement threshold value Th ^IMP as shown in the following equation, the temporary allocation result is not stored. However, if it is assigned to the original assigned unit, it will be stored regardless of the value of HCI.

t _HCi ^imp <Th ^IMP
Also, the already assigned hall call HCj (j: index of the already assigned hall call assigned to the temporary assignment result, which is assigned to the temporary assignment result. In this embodiment, j = 3, 4, 5 as described above. , 6) If all the influence values t _HCj ^inf are _larger than the influence threshold value Th ^INF as shown in the following equation, the allocation result is not stored.

t _HCj ^inf > Th ^INF
If it is determined by the temporary allocation result storage determination unit 53 that the temporary allocation result storage determination unit 53 stores the temporary allocation result storage information creation unit 55, the temporary allocation result, the improvement value t _HCi ^imp of the _reassignment hall call included in the temporary allocation result, and the existing allocation Temporary allocation result storage information that is a combination of the temporary allocation result evaluation value calculated from the hall call influence value t _HCj ^inf is sent to the temporary allocation result storage list 54, and this temporary allocation result storage information is stored in the temporary allocation result storage list. To do. In this embodiment, a temporary allocation result evaluation value Enode (node: index of temporary allocation result) is calculated as follows.

Enode = _{Σt HCi} ^imp + _{Σt HCj} ^inf
Next, the allocation determination unit 45 will be described.

  The allocation determination unit 45 includes a storage list reference unit 75, an allocation change determination unit 76, and an allocation command unit 77. When the end of the search calculation processing end determination unit 51 of the search calculation processing unit 42 is determined to end the storage list reference unit 75, the temporary allocation result storage list 54 and the all search end result storage list in the operation simulation evaluation result storage unit 44 are stored. 64. At this time, if there is temporary allocation result storage information for which the full search has been completed in the full search end result storage list 64, the temporary allocation result storage information for max (Enode) in the full search end result storage list 64 is acquired. And sent to the allocation change determination unit 76. When there is no information in the all-search end result storage list 64, the temporary allocation result storage information which becomes max (Enode) is acquired from the temporary allocation result storage information in the temporary allocation result storage list 54, and the allocation change determination is performed. Send to part 76. If there is no temporary allocation result storage information in either list, a signal without information is transmitted.

  The allocation change determination unit 76 extracts the reallocation number of the reallocation hall call from the temporary allocation result of the received temporary allocation result storage information and transmits it to the allocation command unit 77. At this time, if a signal without information is received, a signal without reassignment change is transmitted to the assignment command unit 77.

  Based on the information received from the allocation change determination unit 76, the allocation command unit 77 cancels the hall call response command to the unit before reassignment if the assigned unit number of the reassigned hall call has been changed. That is, the corresponding hall call information is deleted from the assigned hall call information list 14 of the unit before the reallocation, and the arrival notification of the corresponding arrival number notification means is canceled. Furthermore, a hall call response command is issued to the reassigned unit. That is, the corresponding hall call information is added to the assigned hall call information list 14 of the reallocation machine, and the arrival notification of the corresponding arrival machine notification means 18 is commanded. If the allocation number of the reassignment target hall call has not been changed, the allocation command unit 77 does not perform the above-described operation relating to the corresponding reassignment target hall call. Similarly, when a signal with no change is received, the above-described operation regarding all reassigned hall calls is not performed.

  The above is description of each component which comprises this invention. FIG. 2 is a flowchart showing a series of flows of the reallocation calculation apparatus 37, and the series of flows will be described using an explanation example.

First, in the explanation example, for simplicity of explanation, the elevator system 12 provided in the elevator system is N = 2, that is, two. First, current operation information is created by the current operation information creation unit 35 of the reassignment hall call determination unit 34 as shown in FIG. 3, and the reassignment hall call determination calculation unit 34 creates HC ₁ , HC ₂ is determined to be the reassigned hall call. Then, the information on the reassignment target hall calls HC ₁ and HC ₂ is sorted by the reallocation target hall call transmission unit 38 as described above, and the following information is sent to the search calculation processing unit 42 of the reallocation calculation device 37. Sent.

HC ₁ information {occurrence time = t _HC1 , calling direction = UP, occurrence floor = f _HC1 }
HC ₂ information {occurrence time = t _HC2 , calling direction = DN, occurrence floor = f _HC2 }
Also, the current operation information transmission unit 41 transmits the current operation information of FIG. 3 to the temporary allocation result evaluation unit 67 of the operation simulation evaluation unit 43. The reallocation calculation device 37 that has received these pieces of information executes the following processing as shown in the flowchart of FIG.

In (STEP 1), the search operation initialization unit 47 creates the initial temporary assignment results shown in Table 1 below.

  In (STEP 2), the initial temporary allocation result is stored in the temporary allocation result storage list 54 of the operation simulation evaluation result storage unit 44.

  In (STEP 3), the temporary allocation result node that is max (E) is acquired from the temporary allocation result storage list 54, and the acquired temporary allocation result is deleted from the temporary allocation result list 54. In the description example, since only the initial allocation result shown in Table 1 is stored in the temporary allocation result storage list 54 at this time, the initial temporary allocation result is acquired as the temporary allocation result node, and the temporary allocation result storage list Delete from 54.

In (STEP 4), the hall call hc to be reassigned to be assigned to the obtained temporary assignment result is obtained. In the illustrative example, the temporary allocation result obtained, so does not calculate the first reassignment subject hall call state assigned the HC _1, reassignment subject hall call hc = HC ₁ is obtained.

In (STEP 5), a temporary allocation result node ^ n (n = 1, 2,..., N) that is a state in which the reallocation target hall call hc = HC ₁ is temporarily allocated to each unit is created. In the explanation example, since the number of units 12 is only unit 1 and unit 2, as shown below, the temporary allocation result node ^ ₁ (Table 2) allocated to unit 1 other than the already allocated unit and the already allocated unit Two temporary assignment results of the temporary assignment result node ^ ₂ (Table 3) assigned to the second machine which is also the unit No. 2 are created.

In (STEP 6), the evaluation value of the created temporary allocation result is calculated. In the explanation example, the temporary allocation operation information of the temporary allocation result of node ₁ is as shown in FIG. From Figure 5, reassign hall call HC ₁ is the response in comparison to the current operation information shown in FIG. 3 t _HC1 ^imp accelerated, which becomes the improved value. On the other hand, the hall calls HC ₃ and HC ₄ that are not reassigned do not change in response compared to the current operation information shown in FIG. 3, and their influence values are t _HC3 ^inf = 0 and t _HC4 ^inf = 0. Although the hall call HC _5, HC ₆ the other non-reassignment response t _HC5 ^inf, t _HC6 ^inf slower than current operation information shown in FIG. 3, is calculated such as the impact value The The total evaluation value of node ^ ₁ is calculated by the following equation.

E = Enode ^ ₁ = _{Σt HCi} ^imp + _{Σt HCj} ^inf
Therefore, the information of the temporary allocation result node ^ ₁ is as shown in Table 4 below.

Further, provisional assignment operation information of the node ^ ₂ are as in Table 5 below for a temporary assignment allocation Unit Change hc = HC ₁ is not made as in FIG.

In (STEP 7), it is determined whether or not each calculated Enode ^ n is stored in the temporary allocation storage list 54. As described above, if all the improvement values t _HCi ^imp of the reallocation hall call HCi of the temporary allocation result have the following relationship with respect to the improvement threshold Th ^IMP , the temporary allocation result is stored.

t _HCi ^imp ≧ Th ^IMP (Condition 1)
However, if it is assigned to the original assigned unit, it will be stored regardless of the value of HCI.

If all the influence values t _HCj ^{inf of the} already assigned hall call HCj assigned to the temporary assignment result have the following relationship with respect to the influence threshold value Th ^INF , the assignment result is stored.

t _HCj ^inf ≦ Th ^INF (Condition 2)
That is, if both (Condition 1) and (Condition 2) are satisfied, it is a storage target. In the explanation example, because node ^ ₁ is a temporary allocation result when HC ₁ is reassigned to Unit 1, each improvement value / influence value is as shown in Table 4 above.
t _HC1 ^imp ≧ Th ^IMP ,
^{_{t HC3 inf (= 0) ≦}} Th INF, t HC4 inf (= 0) ≦ Th INF, t HC5 inf ≦ Th INF, t HC6 inf ≦ Th INF
If it is, store node ^ ₁ . If the above conditions are not satisfied, the data is not stored and discarded. In the explanation example, it is assumed that node ₁ is determined to be stored as satisfying these conditions.

Since node ^ ₂ is a temporary allocation result that does not reallocate HC ₁ with the allocation of Unit 2, it is unconditionally stored in the temporary allocation result storage list 54.

In (STEP 8), the temporary allocation result determined to be stored in (STEP 7) is stored in the temporary allocation result storage list 54. That is, in the explanation example, both node ₁ and node ₂ are stored in the provisional result storage list 54.

  In (STEP 9), it is determined whether or not to end a series of processing. Here, assuming that the number of iterations is 2, the number of computations is 1 in the explanation example, so that the computation is continued and the process returns to (STEP 3). Similarly, the subsequent processing will be described.

In the second operation count (STEP 3), a temporary allocation result of max (E) is acquired from the temporary allocation result stored in the temporary allocation result storage list 54. In the explanation example, it is assumed that the data in Table 4 as a result of reassigning HC ₁ to the first unit is a temporary assignment result having max (E), and this is acquired as a node.

In the second calculation step (STEP 4), a reassignment target hall call to be added to the temporary allocation result acquired from the reallocation target hall call list is acquired. At this time, since HC ₁ has already been added, hc = HC ₂ to be added next is acquired.

In the second calculation step (STEP 5), a temporary allocation result when hc is allocated to a node is created. In the explanation example, the temporary allocation result node ^ ₁ (Table 6) in which HC ₂ is allocated to Unit 1 and the temporary allocation result node ^ ₂ (Table 7) in which Unit 2 is allocated are as follows. create.

In the second calculation step (STEP 6), the evaluation value of the created temporary allocation result is calculated. In the explanation example, the temporary allocation operation information of the temporary allocation result of node ^ _{1 is} the temporary allocation in which the allocation unit change of hc = HC ₂ has not been made, so the operation information is as shown in FIG. From Figure 7, reassign hall call HC ₂ are responses t _HC2 ^imp slower than the current operation information shown in FIG. Therefore,
t _HC2 ^imp is an improvement value in the reverse direction. On the other hand, the hall calls HC ₃ and HC ₄ that are not reassigned have no change in response compared to the current operation information shown in FIG. 3, and their influence values are t _HC3 ^inf = 0 and t _HC4 ^inf = 0 becomes, hall call HC _5, HC ₆ the other non-reassignment response compared to the current operating information t _HC5 ^inf, t _HC6 ^inf slows shown in FIG. 3, it calculates these as impact value Is done.

That is, HC ₁ improvement value = t _HC1 ^imp , HC ₂ improvement value = −t _HC2 ^imp , HC ₃ influence value = t _HC3 ^inf (= 0), HC ₄ influence value t _HC4 ^inf (= 0 ), impact value of ^HC ₅ t _HC5 infF, impact value t _HC6 ^inf of HC ₆ can be calculated. Since the comprehensive evaluation value E is calculated by the following equation, information on the temporary allocation result node ^ ₁ is as shown in Table 8 below.

E = Enode ^ ₁ = _{Σt HCi} ^imp + _{Σt HCj} ^inf

The temporary allocation operation information of node ^ ₂ is the temporary allocation result when the allocation of HC ₂ is changed to Unit 2, and the operation information is as shown in FIG. From FIG. 8, the reallocation hall call HC ₂ has a response t _HC2 ^imp earlier than the current operation information shown in FIG. 3, which is an improved value. In contrast, the hall call HC ₃ not reassigned, HC _5, HC ₆ is the response in comparison to the current operation information shown in FIG. 3, respectively ^{_{t HC3 inf, t HC5 inf,}} t HC6 inf slower, HC ₄ does not change. That is, HC ₁ improvement value = t _HC1 ^imp , HC ₂ improvement value = t _HC2 ^imp , HC ₃ , influence value = t _HC3 ^inf , HC ₄ influence value t _HC4 ^inf (= 0), HC ₅ influence value ^t _HC5 infF, influence value t _HC6 ^inf of HC ₆ can be calculated. Since the comprehensive evaluation value E is calculated from these values according to the following equation, information on the temporary allocation result node ₂ is as shown in Table 9 below.

E = Enode ^ ₂ = _{Σt HCi} ^imp + _{Σt HCj} ^inf

In the second calculation (STEP 7), it is determined whether or not each calculated node ^ n is stored in the temporary allocation storage list 54. In the explanation example, since node ^ ₁ is a temporary allocation result that does not reallocate HC ₂ while allocating to Unit 1, it is unconditionally stored in the allocation result storage list. Since node ^ ₂ is the temporary allocation result when HC ₂ is reassigned to Unit 2, each improvement value / influence value is as shown in Table 9 above.
t _HC1 ^imp ≧ Th ^IMP , t _HC2 ^imp ≧ Th ^{IMP
_{t HC3 inf ≦ Th INF, t}} HC4 inf (= 0) ≦ Th INF, t HC5 inf ≦ Th INF, t HC6 inf ≦ Th INF
If the condition is satisfied, node ^ ₂ is stored. If the above conditions are not satisfied, the data is not stored and discarded. In the explanation example, it is assumed that the memory determination is made that node ₂ satisfies these conditions.

In (STEP 8), the second calculation count, the temporary allocation result determined to be stored in (STEP 7) is stored in the temporary allocation result storage list 54. That is, in the explanation example, both node ₁ and node ₂ are additionally stored in the provisional result storage list 54.

  In the second calculation (STEP 9), it is determined whether or not to end the series of processes. Here, since the number of repetitive operations is set to 2, it is assumed that the predetermined number of operations is completed, and the process proceeds to (STEP 10).

  In (STEP 10), the temporary allocation result is acquired from the all-search end result storage list 64. In (STEP 11), if there is a temporary allocation result in the all-search end storage list 64, the process proceeds to (STEP 15), and if not, the process proceeds to (STEP 12). In this example, since there is no temporary allocation result in the all search end result storage list, the process proceeds to (STEP 12).

  In (STEP 12), a temporary allocation result having the best evaluation value is acquired from the temporary allocation result storage list 54. If there is no temporary allocation result in the temporary allocation result storage list 54, the process proceeds to (STEP 14), and information indicating no reallocation is transmitted. In the explanation example, since there is a temporary allocation result in the temporary allocation result storage list 54, the process proceeds to (STEP 15).

In (STEP 15), and acquires the allocation result of each reassignment hall call HC _i from reallocation results obtained. In the explanation example, when the temporary allocation result having the best evaluation value acquired in (STEP 12) is the data of Table 9, the next re-allocation is executed.

Reassign HC ₁ to Unit ₁
HC ₂ is reassigned to Unit _2. That is, the allocation command for Unit 2 to which HC ₁ was allocated in (STEP 16) is canceled, the allocation command is issued to Unit 1, the unit notification means 18 for the arrival of Unit 2 is canceled, and 1 The unit arrival means 18 of the unit arrival is issued. Similarly, the allocation command for the first unit to which HC ₂ is allocated is canceled, the allocation command is issued to the second unit, the unit notification means 18 for the arrival of the first unit is canceled, and the unit arrival unit 18 for the second unit arrival is issued.

  If the temporary allocation result having the best evaluation value acquired in (STEP 12) is the data shown in Table 8, the next reallocation is executed.

Reassign HC ₁ to Unit ₁
Leave HC ₂ assigned to Unit 1 In other words, cancel the allocation command for Unit 2 to which HC ₁ was allocated in (STEP 16), issue an allocation command to Unit 1, and cancel the unit notification means 18 when Unit 2 arrives. The unit arrival means 18 for the arrival of the first unit is issued. On the other hand, nothing is done about the HC _2.

  If the temporary allocation result acquired in (STEP 12) is the data shown in Table 5, the next reallocation is executed.

Leave HC ₁ assigned to Unit 2
Since there is no HC ₂ allocation information, leave the Unit 1 allocation. In other words, do nothing for HC ₁ and HC ₂ . In addition, the temporary allocation result acquired in (STEP 12) is also as follows when the allocation result is the allocation-no-change signal issued in (STEP 14), and nothing is done for HC ₁ and HC ₂ .

Leave HC ₁ assigned to Unit 2
Leave HC ₂ assigned to Unit 1 As described above, according to this embodiment, it is possible to see the effect of the improvement value / influence value when multiple reassigned hall calls are processed simultaneously. The reallocation process can be executed in consideration of the effect on hall call response caused by the change, and can be executed by an efficient calculation procedure for estimating these effects.

DESCRIPTION OF SYMBOLS 12 ... Car 18 ... Arrival machine notification means 20 ... Group management control device 23 ... Car position information detection part 24 ... Car direction information detection part 25 ... Car state information detection part 26 ... Hall call allocation information detection part 27 ... Car call information Detection unit 34 ... reallocation hall call determination unit 35 ... current operation information creation unit 36 ... reallocation hall call determination calculation unit 37 ... reallocation calculation device 42 ... search calculation processing unit 43 ... operation simulation evaluation unit 44 ... operation simulation evaluation result Storage unit 45 ... Allocation determination unit 53 ... Temporary allocation result storage determination unit 54 ... Temporary allocation result storage list 66 ... Temporary allocation operation information creation unit 67 ... Temporary allocation result evaluation unit 71 ... Operation information comparison unit 72 ... Operation information evaluation value calculation Part

Claims (4)

An elevator group management control system that assigns one of a plurality of elevator units to a hall call in an arbitrary direction that occurs at an arbitrary time on an arbitrary floor,
From the elevator position information, the car direction information, the assigned hall call information assigned to the hall call to the hall call, and the car call information at the current time, A current operation information creation unit that creates current operation information on which floor to move to when,
Among the previously assigned hall calls, those that have passed the unreacted elapsed time up to the current time of the assigned elevator, and the response time from the current time until reaching the floor of the hall call exceeds the set time. A reassignment hall call determination unit for determining a reassignment hall call;
When said call reassignment target hole is determined by the re-allocation hall call determination unit there are a plurality, for the call the plurality of reassignment target hole, provisionally the Unit Another combination with already Unit combination of allocated A search calculation processing unit to be assigned;
This from the temporary assignment has been a result, in the current and future time, to create a provisional allocation operation information of whether each of the elevator machines is what floor to what time move to every call multiple re-assigned target hole, and these provisional allocation service information Each of the current operation information is compared, and an improvement value of the reassigned hall call is calculated, and an influence value received by an already assigned hall call other than the reassignment hall call is calculated, and the improvement value and the influence value are calculated. An operation simulation evaluation unit that evaluates the temporary allocation result for each of a plurality of reassigned hall calls ,
An operation simulation result storage unit that stores a temporary allocation result of which the evaluation by the operation simulation is equal to or higher than a predetermined level as a new temporary allocation result, and stores an allocation before the temporary allocation as a temporary allocation result if the predetermined level is not reached;
An allocation determining unit for reallocating the temporary allocation result selected as the temporary allocation result having the highest evaluation from the temporary allocation result stored in the operation simulation result storage unit to the corresponding unit;
An elevator group management control system comprising: The current operation information creation unit, in addition to the car position information of each elevator at the current time, car direction information, information on the already assigned hall call to which the elevator is assigned to the hall call, car call information, Using the car status information including the door open / close information of each elevator car at the current time T, create current operation information on which floor each elevator car will move to and from which time after the current time T The elevator group management control system according to claim 1 . Each floor is provided with arrival unit notification means, and when a hall call is reassigned according to the hall call reassignment result of each unit by the allocation determination unit, the floor waiting by the arrival unit notification unit is waited for. The elevator group management control system according to claim 1 or 2 , wherein notifications are collectively reported to passengers . An elevator group management control method for allocating one of a plurality of elevator cars to a hall call in an arbitrary direction generated at an arbitrary time on an arbitrary floor,
  From the elevator position information, the car direction information, the assigned hall call information assigned to the hall call to the hall call, and the car call information at the current time, The process of creating current operation information on which floor to move to when and by the current operation information creation unit,
  Among the previously assigned hall calls, those that have passed the unreacted elapsed time up to the current time of the assigned elevator, and the response time from the current time until reaching the floor of the hall call exceeds the set time. , A step of determining a reassigned hall call by a reallocation hall call determining unit;
  When there are a plurality of reassignment target hall calls, the search calculation processing unit temporarily allocates a combination of units different from the combination of units already allocated to the reassignment target hall calls;
  From the temporarily allocated result, the operation simulation evaluation unit creates temporary allocation operation information for each floor to which floor each elevator unit will move to and from which time after the current time. The temporary allocation operation information and the current operation information are compared to calculate the improvement value of the reassigned hall call, and the influence value of the already allocated hall call other than the reallocation target hall call is calculated. A step of evaluating a temporary allocation result obtained by combining the improvement value and the influence value for each of a plurality of reassignment target hall calls;
  A process of evaluating the operation simulation as a temporary allocation result at a predetermined level or higher as a new temporary allocation result, and storing the allocation before the temporary allocation in the operation simulation result storage unit as a temporary allocation result if the predetermined level is not reached;
  A step of reallocating the temporary allocation result selected as the temporary allocation result having the highest evaluation from the temporary allocation result stored in the operation simulation result storage unit to the corresponding unit by the allocation determination unit;
  An elevator group management control method characterized by comprising:

Images