JP2023011965A - Temporary transfer planning system, control method and program - Google Patents

Abstract

To improve accuracy of a temporary transfer plan of an operation group for performing a recovery operation.SOLUTION: A temporary transfer planning system (10) comprises: a recovery object information acquisition unit (11) which acquires information regarding a plurality of recovery objects; a situation information acquisition unit (14) which acquires status information including information for specifying a handling start possible period of an operator for discriminating a handling possible operator who can handle a recovery operation; and a search unit (12) which searches for an optimal temporary transfer plan which is an optimal solution or a quasi-optimal solution of a temporary transfer plan in which combination and a temporary transfer order of temporary transfer objects which are recovery objects to which the handling possible group including one or more handling possible operators is scheduled to be temporarily transferred are determined for every handling possible group, and the search unit searches for a temporary transfer plan in which completion estimation time when all pieces of recovery of temporary transfer objects are completed, which is estimated at least considering the total transfer time to be temporarily transferred to a temporary transfer object and the total operation time required for the recovery operation of the temporary transfer object is relatively early among temporary transfer plans of a plurality of different patterns as the optimal temporary transfer plan.SELECTED DRAWING: Figure 3

Description

The present invention relates to a system, a control method, and a program for making a dispatch plan for dispatching a worker to a restoration target where an event requiring restoration work has occurred.

Patent Literature 1 discloses an elevator maintenance management system that can accurately and quickly select a maintenance worker who can quickly arrive at a building in which elevator equipment such as an elevator has failed and who can respond to recovery.

Japanese Patent No. 4795457

In the event of a disaster such as an earthquake that causes many elevators to stop or break down at the same time over a wide area, a dispatch plan stipulates the recovery targets and the order of dispatch for each work group that normally performs restoration work. Secondment of each working group will be arranged according to the Here, some of the workers who make up the work group may not be able to handle the recovery work due to the effects of the disaster. becomes.

An object of one aspect of the present invention is to improve the accuracy of a dispatch plan for a work group that performs restoration work for a plurality of restoration targets in different locations.

In order to solve the above-described problems, a temporary staffing planning system according to an aspect of the present invention includes a recovery target information acquisition unit that acquires information about a plurality of recovery targets with different locations where an event requiring recovery work has occurred; Acquisition of situation information indicating the situation of the worker for determining the worker who can respond to the recovery work among the workers, the situation information including at least information for specifying the time when the response can be started. and one or more workers determined to be capable workers based on the situation information among a plurality of groups composed of one or more workers and performing the recovery work. searching for an optimal or quasi-optimal solution of a temporary transfer plan in which a combination and an order of temporary transfers, which are restoration targets to which the available groups are scheduled to be seconded, are determined for each of the available groups; a search unit, wherein the search unit is estimated by taking into account at least the total travel time for dispatching to the seconded target and the total work time required for the recovery work of the seconded target, all of the seconded target Among the plurality of different patterns of temporary transfer plans, the temporary transfer plan that is relatively earlier than the estimated recovery completion time is searched for as the optimum temporary transfer plan.

In order to solve the above-described problems, a control method according to an aspect of the present invention is a control method executed by one or more information processing apparatuses, comprising a plurality of information processing apparatuses at different locations where an event requiring recovery work has occurred. and a recovery target information acquisition step for acquiring information about the recovery target of the recovery work, and status information indicating the status of the worker for determining a worker who can handle the recovery work among the workers, at least a situation information acquisition step of acquiring situation information including information for specifying when it is possible to start responding; Temporation in which a combination of the dispatch targets that are restoration targets scheduled to be dispatched to the responsive group, which is the group including one or more of the workers determined to be responsive workers, and an order of dispatch are determined for each of the responsive group. a search step of searching for an optimal secondment plan that is an optimal solution or a quasi-optimal solution of the plan, wherein the search step includes the total travel time to visit the seconded target and the total work required for the recovery work of the seconded target. Among the plurality of different patterns of temporary transfer plans, the temporary temporary transfer plan that is relatively earlier than the estimated completion time of completion of restoration of all of the temporary temporary transfer targets, which is estimated by taking at least time into account, is searched for as the optimum temporary temporary transfer plan. do.

The secondment planning system according to each aspect of the present invention may be realized by a computer. In this case, the secondment planning system is realized by the computer by operating the computer as each part (software element) included in the secondment planning system. The program of the secondment planning system and the computer-readable recording medium recording it are also included in the scope of the present invention.

ADVANTAGE OF THE INVENTION According to one aspect of the present invention, it is possible to improve the accuracy of the dispatch plan of the work group that performs the restoration work.

1 is a block diagram showing an outline of a maintenance system; FIG. It is a flowchart which shows the process which a secondment support system performs. It is a block diagram which shows the principal part structure of a secondment planning system. FIG. 10 is a diagram illustrating an example of the data structure of a restoration target list; It is a figure which shows an example of the data structure of a worker database. It is a figure which shows the specific example of a situation information reception screen. It is a figure which shows the specific example of a situation information reception screen. It is a figure which shows an example of the procedure of the search which a search part performs. It is a figure which shows an example of the procedure of the search which a search part performs. It is a figure which shows an example of the data structure of an optimal secondment plan. It is a figure explaining the process which searches for the confluence|merging point which a confluence|merging support part performs. It is a figure which shows an example of the data structure of a confluence plan. It is a figure which shows an example of a confluence|merging plan notification screen. It is a figure which shows an example of a confluence|merging plan notification screen. It is a figure which shows an example of a temporary transfer plan screen. It is a block diagram showing an example of the hardware constitutions of the system of the present invention.

[Embodiment 1]
<Overview of maintenance system>
An embodiment of the present invention will be described in detail below. FIG. 1 is a block diagram showing an overview of a maintenance system 1000. As shown in FIG. The maintenance system 1000 is a system for supporting recovery work for a plurality of recovery targets at different locations where an event requiring recovery work has occurred. In this embodiment, restoration targets are typically elevator equipment such as passenger conveyors and elevators. An example of an event that requires recovery work is a stoppage or failure of elevator equipment.

Maintenance system 1000 includes at least dispatch support system 100 . The dispatch support system 100 includes, for example, a front-end system 1, a damage information providing system 200, a map information providing system 300, a situation confirmation system 400, an office device 2, and a terminal device 3 ( (information terminal) and other devices are communicably connected.

(Regarding secondment support system)
In the maintenance system 1000, the dispatch support system 100 has a function of dispatching each of work groups (hereinafter simply referred to as "groups") that perform restoration work on a plurality of restoration targets. The dispatch support system 100 has, as an example, a dispatch plan planning function for formulating a dispatch plan for dispatching each group to a plurality of restoration targets. A configuration group of hardware and software for realizing this transfer planning function is referred to as a transfer planning system 10 . Details of the configuration of the secondment planning system 10 will be described later in this embodiment.

In the maintenance system 1000, the secondment support system 100 arranges the secondment of each group based on the prepared secondment plan, manages the progress of recovery work, and adjusts the secondment plan according to the ever-changing disaster situation. It has a secondment arrangement function to review the A configuration group of hardware and software for realizing this dispatch arrangement function is referred to as a dispatch arrangement system 20 . The details of the configuration of the secondment arrangement system 20 will be described in detail later in the second embodiment.

The secondment planning system 10 and the secondment arrangement system 20 of the present disclosure may be configured by one information processing device having a configuration group of hardware and software, or may be configured by a plurality of information processing devices. . A configuration example of the information processing apparatus will be described later with reference to FIG.

A part of the hardware and software configuration group described above may be a configuration for realizing both the secondment planning function and the secondment arrangement function. That is, part of the configuration group that implements the secondment planning system 10 may be part of the configuration group that implements the secondment arrangement system 20 .

(Regarding secondment plan)
The secondment plan drawn up by the secondment planning system 10 defines, for each group, the combination of the secondment targets, which are scheduled to be seconded by the group for recovery work, and the order of the secondment. The secondment planning system 10 may draw up a secondment plan for an area managed by one business office that has a plurality of groups. Further, the secondment planning system 10 may draw up a secondment plan for each office under the jurisdiction of the maintenance company.

In this embodiment, as an example, it is assumed that the secondment planning system 10 draws up a secondment plan for each office under the jurisdiction of the maintenance company. The staffing planning system 10 may operate according to instructions from the front-end system 1 (output unit) operated by an operator who works at a maintenance company. In this case, the secondment planning system 10 may be incorporated in an information processing device that constitutes the front-end system 1, or may be a separate information processing device that is communicably connected to the front-end system 1 as an input/output device. may be configured.

In addition, when the secondment planning system 10 draws up a secondment plan for an area managed by one business establishment, the secondment planning system 10 is a business office device operated by an operator working at the business establishment. 2 (output section). In this case, the secondment planning system 10 may be incorporated in the office device 2 as an information processing device, or may be configured by another information processing device communicably connected to the office device 2 as an input/output device. may be

(for other devices)
The front-end system 1 is, as described above, a system composed of one or more information processing devices operated by an operator who works for a maintenance company. In this embodiment, the front-end system 1 is communicably connected to a secondment support system 100 including a secondment planning system 10 and a secondment arrangement system 20 . As an input/output device, the front-end system 1 assists the operator in inputting information to the seconding support system 100, acquires information output from the seconding support system 100, and presents it to the operator. The front-end system 1 and the secondment support system 100 are connected by an arbitrary communication network. The communication network may be a LAN (Local Area Network) or a wide area network including the Internet.

The office device 2 is a device operated by an operator who works at one office, as described above. In this embodiment, the office device 2 may be communicably connected to the temporary transfer support system 100 and the terminal device 3 via any communication network.

The terminal device 3 is a device operated by a worker who constitutes a group and performs recovery work. The terminal device 3 is assumed to be, for example, a mobile terminal such as a smart phone or a tablet PC. In this embodiment, the terminal device 3 is communicably connected to the temporary transfer support system 100 via any communication network. The terminal device 3 may be communicably connected to the office device 2 .

The damage information providing system 200 monitors the elevator equipment maintained by the maintenance company, collects information on each elevator equipment, and provides it to the secondment support system 100 . Specifically, when a disaster such as an earthquake occurs, the damage information providing system 200 collects information on the damaged elevator equipment. Then, when events such as stoppages or failures occur in a large number of elevator equipment at the same time, the damage information providing system 200 generates a list of elevator equipment that requires restoration work. The list is transmitted from the damage information providing system 200 to the secondment support system 100 via the communication network.

The map information providing system 300 provides the secondment support system 100 with map information. The map information providing system 300 may provide map information to the front-end system 1 , office device 2 and terminal device 3 . If necessary, the map information providing system 300 may grasp road traffic conditions in various places in real time and provide each device with map information to which information such as traffic jams or road closures is added. Further, the map information providing system 300 may receive a starting point and a destination from a client, and provide a possible travel route from the starting point to the destination, a moving distance, a moving time, and the like. Here, the clients are the dispatch support system 100, the front-end system 1, the office device 2, the terminal device 3, and the like.

The situation confirmation system 400 communicates with each worker's terminal device 3 and provides the dispatch support system 100 with a service for supporting the situation confirmation of the worker. In this embodiment, as an example, when a disaster occurs, the situation confirmation system 400 confirms the situation of each worker to the terminal device 3 of each worker who belongs to the office in charge of restoration work in the disaster area. Send an inquiry for Each worker can receive the above-mentioned inquiry on his or her own terminal device 3, prepare an answer to the inquiry, and send it back. The reply transmitted from the terminal device 3 may be directly transmitted to the dispatch support system 100 , or may be provided to the dispatch support system 100 via the situation confirmation system 400 .

(Processing flow of secondment support system)
FIG. 2 is a flow chart showing processing executed by the secondment support system 100 .

In step S1, the secondment support system 100 stores in advance the number of groups that can respond to emergencies for each office. The secondment support system 100 sets a group leader for each group of each office, and stores the contact information of the group leader for each office. A list storing the number of groups for each office and the contact information of the group leader of each group may be created in advance by the operator and stored in the storage device of the secondment support system 100 .

The process of step S1 is preferably executed in advance before a disaster actually occurs.

When an event such as a failure or stoppage is detected in a large number of elevator equipment at the same time due to the occurrence of a disaster, the damage information providing system 200 generates a list of the entire elevator equipment that requires restoration work. When the entire list is provided from the damage information providing system 200 to the seconding support system 100, the seconding support system 100 starts the processing from step S2 onward.

The damage information providing system 200 may directly communicate with each of the elevator installations to be remotely monitored, and add the elevator installations determined to require restoration work to the above-described overall list as restoration targets. Further, in the damage information providing system 200, an operator may be arranged to receive a failure report (callback) from the owner or user of the elevator equipment not subject to remote monitoring via communication means such as a telephone. The operator who has received the callback registers the elevator equipment that is not subject to remote monitoring in the damage information providing system 200 as a restoration target. In this way, the damage information providing system 200 may add the elevator equipment for which the callback has been received to the above-described overall list as restoration targets.

In step S2, the secondment support system 100 divides the entire list including a large number of elevator equipment to be restored for each business office. Splitting of the overall list may be performed based on geographic criteria. For example, the secondment support system 100 grasps in advance the area managed by each office, and depending on which area the location to be restored belongs to, the restoration target in the overall list is assigned to each office. can be associated. The secondment support system 100 generates a list of restoration targets to be dealt with, which is divided for each office. Below, the list of recovery targets to be handled, which is generated by dividing for each office, is referred to as a recovery target list. Note that the recovery target list for each office may be created according to the operator's manual input work.

In step S3, the secondment planning system 10 of the secondment support system 100 searches for an optimal secondment plan from several conceivable secondment plan candidates. An optimal seconding plan is an optimal or sub-optimal solution of a seconding plan. In this embodiment, the secondment planning system 10 searches for a secondment plan with a relatively early estimated completion time at which restoration of all the secondment targets handled by the office is completed, as the optimal secondment plan. A genetic algorithm can be applied as an example of a search method, but other algorithms for solving combinatorial optimization problems may also be applied.

Step S3 includes a restoration target information acquisition step (S3-1), a situation information acquisition step (S3-2), and a search step (S3-3). The recovery target information acquisition step (S3-1) is a step in which the staffing planning system 10 acquires information on a plurality of recovery targets in different locations where an event requiring recovery work has occurred. The secondment planning system 10 may acquire, for example, the restoration target list described above. The situation information acquisition step (S3-2) is a step in which the secondment planning system 10 acquires situation information indicating the worker's situation. The status information is information for determining which of the workers can respond to the recovery work, and in this embodiment, includes at least information for specifying when the response can be started. The status information is also information for confirming the safety of workers.

As an example, the situation information is generated in the worker's terminal device 3 as a reply to an inquiry sent by the situation confirmation system 400 to confirm the worker's situation. In the situation information acquisition step, the situation information of each worker may be acquired directly from the terminal device 3 of each worker, or may be acquired from the situation confirmation system 400 that collects the situation information of each worker. .

The time at which response can be started means the time at which workers can start taking actions for recovery work, or a period including that time. Actions for restoration work may include movement of workers from their current location to another location to prepare for restoration work, or movement to a location to be restored. The possible response start time may be determined or predicted based on the worker's own judgment, or may be predicted by an arbitrary information processing device according to the worker's situation.

The search step (S3-3) is a step in which the secondment planning system 10 searches for an optimal secondment plan, which is an optimal solution or a quasi-optimal solution for the secondment plan. In this embodiment, the temporary staffing planning system 10 includes one or more workers who are determined to be capable workers based on the above-described situation information, among a plurality of groups made up of one or more workers. For each group, search for the optimal secondment plan. Therefore, it is possible to prevent drafting or adopting a dispatch plan that does not match the actual situation, such as assigning a secondment target to a group that cannot proceed with recovery work because there is no worker who can handle it. .

In this embodiment, the secondment planning system 10 searches for the optimal secondment plan for each office owned by the maintenance company. That is, the secondment planning system 10 repeatedly executes the restoration target information acquisition step (S3-1), the status information acquisition step (S3-2), and the search step (S3-3) for each office.

In addition, when the business office proceeds with the recovery work according to the optimum transfer plan corresponding to the business office, the temporary transfer planning system 10 completes the recovery work for all restoration targets assigned to the business office. The estimated time may be output as the estimated completion time of the office.

Furthermore, the secondment planning system 10 virtually changes the affiliation of groups between offices, simulates secondment arrangements, and produces a better and optimal secondment plan that shortens the estimated completion time of each office. You can search every place. The secondment planning system 10 may propose to the operator a group allocation pattern for each office that will yield a better and more optimal secondment plan.

The staffing plan system 10 identifies the optimal staffing plan adopted by the operator as the final optimal staffing plan. The operator may adopt the optimum dispatch plan searched in step S3, or may select the optimum dispatch plan to be adopted from several simulated optimum dispatch plans.

The secondment planning system 10 saves the identified final optimal secondment plan in the storage device of the secondment support system 100 for each office. In this embodiment, the optimal secondment plan for each office may include, for each group, a queue in which the secondment targets, which are the restoration targets to which the group is scheduled to be seconded, are arranged in a line in the order of their secondment.

In step S4, the secondment planning system 10 may execute a merging support step. In the merging support step, the dispatch planning system 10 assists the workers who are scattered at the time of the disaster to smoothly join the available group and start the recovery work as soon as possible. For example, based on the status information of each worker and the optimal dispatch plan of each group, the dispatch planning system 10 identifies the earliest meeting point at which the worker can join the group the earliest, and the earliest meeting time at which the worker can join the group. to predict. In addition, the dispatch planning system 10 may determine a confluence destination group with which the workers can merge the earliest. In addition, the dispatch planning system 10 may specify the location of one of the dispatch targets of the group as the earliest meeting point where the worker can join the group the earliest. The dispatch planning system 10 may feed back to each worker a merging plan indicating at least one of the earliest merging point, the earliest merging time, and the merging destination group.

In step S5, the secondment arrangement system 20 of the secondment support system 100 arranges secondment according to the stored optimum secondment plan. First, the secondment arrangement system 20 may confirm whether or not the secondment target can be seconded with respect to the group with which the secondee target is associated. The secondment arrangement system 20 may manage a seconded subject informed by the group that the seconded subject is available as a confirmed seconded subject, distinguishing it from other unconfirmed seconded subjects.

In step S6, the secondment arrangement system 20 may manage the progress of the restoration work for each secondment confirmation target. Then, the secondment arrangement system 20 updates the above-mentioned queue according to the ever-changing situation, such as the progress of restoration work and the addition of new restoration targets.

Here, in this embodiment, the temporary staffing planning system 10 may execute the situation information acquisition step of step S3-2 at any time to receive the latest situation information from each worker.

In step S7, the dispatch planning system 10 monitors the latest status information from each worker and determines whether re-search for the optimum dispatch plan is necessary. If it is determined that re-search is necessary (YES in S7), the process returns to step S3, and the search for the optimum secondment plan is repeated for the unconfirmed secondment target.

For example, when the temporary transfer planning system 10 determines that the number of available groups has increased or decreased based on the situation information, it repeats the search for the optimum temporary transfer plan for each available group after the increase or decrease. As an example, the search unit 12 of the dispatch planning system 10, which will be described later, includes, at the start of the search, the past optimal dispatch plans that include workers who can respond and are determined based on the situation information acquired after the previous search. If there is a new serviceable group that does not exist, the search may be performed by adding the serviceable group. As a result, in accordance with the ever-changing situation, for example, the system for restoration work at the office gradually becomes clearer, and as it is put in place, the most appropriate dispatch plan corresponding to the latest system at that time is always drawn up. obtain.

In addition, when the dispatch planning system 10 determines that the number of available workers has increased based on the situation information, it creates a merging plan for each of the increased available workers. Then, the temporary transfer planning system 10 feeds back each generated merging plan to each available worker.

In step S8, the secondment arrangement system 20 determines whether or not the recovery work for all the secondment targets, ie, the recovery targets, has been completed in all the offices. When the restoration work has been completed for all restoration targets (YES in S8), the secondment support system 100 terminates the series of processes. Note that, if there are still restoration targets for which restoration work has not been completed (NO in S8), the secondment arrangement system 20 returns to step S6 and continues progress management.

<Configuration of Temporary Transfer Planning System 10>
FIG. 3 is a block diagram showing the main configuration of the secondment planning system 10. As shown in FIG. The secondment planning system 10 includes at least a restoration target information acquisition unit 11 , a situation information acquisition unit 14 , and a search unit 12 . The restoration target information acquisition unit 11 is hereinafter simply referred to as the information acquisition unit 11 .

The information acquisition unit 11 acquires information about a plurality of restoration targets in different locations where an event requiring restoration work has occurred. As an example, the information acquisition unit 11 may acquire a recovery target list as the information on the recovery target. The information acquisition unit 11 acquires the recovery target list generated by the secondment support system 100 for each office.

The status information acquisition unit 14 provides status information indicating the status of the workers for determining which of the workers can respond to the recovery work, and is information for specifying at least the time when the response can be started. Get status information, including

For example, the information for identifying when the response can be started includes (1) information indicating that the action for recovery work can be started before the current time, (2) information for recovery work. information indicating how many minutes or hours from the current time the action can start, (3) information indicating the scheduled time when the action for recovery work can start, (4) for recovery work and (5) information indicating that there is no prospect of starting actions for recovery work and the time to start actions cannot be predicted. good. The information for specifying the above-described timing when response can be started is hereinafter referred to as time information. For example, workers may determine time information based on their current situation.

The searching unit 12 searches for an optimal seconding plan, which is an optimal solution or a quasi-optimal solution for the seconding plan. As described above, the secondment plan defines for each group the combination of seconded targets, which are scheduled to be seconded by a group consisting of one or more workers to perform recovery work, and the order of the seconded workers. In this embodiment, a plurality of patterns are created for the secondment plan. Each pattern differs in the combination of seconded subjects and the seconded order. The pattern described above is hereinafter referred to as a dispatch pattern. The process of generating a plurality of secondment plans with different secondment patterns may be executed by the searching unit 12 . In the present embodiment, the searching unit 12 selects, from among a plurality of temporary assignment plans with various different temporary assignment patterns, a temporary assignment plan with a relatively early estimated completion time for completion of restoration of all the temporary assignment targets handled by the business establishment as the most suitable one. Explore as a secondment plan. In the present embodiment, the estimated completion time may be estimated by taking into account at least the total travel time to go to the seconded target and the total work time required for the recovery work of the seconded target. The estimation of the estimated completion time may be performed by the searching unit 12 . The search unit 12 may output, for example, numerical values indicating the date and hour and minute as the estimated completion time. The search unit 12 may output numerical values indicating the year, month, day and hour, minute, and second as the estimated completion time.

In the present embodiment, the search unit 12 searches for the optimum dispatch plan for each available group, which is a group including one or more workers who are determined to be available based on the situation information, among a plurality of groups.

According to the above-described configuration, the search unit 12 searches for the optimum secondment plan for a plurality of restoration targets with different locations for which information has been acquired by the information acquisition unit 11 . The optimal temporary assignment plan is an optimal or quasi-optimal temporary assignment plan among the temporary assignment plans in which a combination of temporary assignment targets, which are restoration targets to which the group is scheduled to be seconded, and an order of assignment are determined for each group. In other words, the searching unit 12 searches for a temporary temporary transfer plan with a relatively early estimated completion time at which restoration of all the temporary temporary transfer targets handled by the office is completed, as the optimal temporary temporary transfer plan. In addition, the search unit 12 searches for the optimal dispatch plan for each available group including one or more workers who are determined to be available based on the situation information.

As a result, it is possible to prevent the drafting of a secondment plan that does not match the actual situation, such as assigning a seconded worker to a group that does not have even one available worker. In this way, the accuracy of the secondment plan is enhanced. There is an effect that it is possible to draw up a dispatch plan that is a dispatch plan that is realistically achievable and that accelerates the time at which all of the recovery work is completed.

The search unit 12 may search for the optimal seconding plan for the available group including the available workers whose response start time is now among the available workers.

The searching unit 12 may search for the optimal seconding plan for a group including available workers whose response start time is within the period from the present to a predetermined time later.

In this way, the search unit 12 can generate a plurality of secondment plans with various different secondment patterns, taking into account the possible response start times for each group. That is, in any of a plurality of secondment plans with different secondment patterns, each secondment target is assigned only to a group that can already handle recovery work at present or a group that is highly likely to become a group that can handle recovery work soon.

A secondment plan in which an urgent secondment target is assigned to a group for which it is not possible to start responding immediately does not match the actual situation, and the recovery is not completed by the desired deadline. is. According to the above-described configuration, the search unit 12 can avoid wastefully generating such a bad secondment plan. Then, the search unit 12 can efficiently search for the optimum seconding plan from appropriate seconding plans that match the actual situation.

The search unit 12 may search for the optimal temporary assignment plan from the temporary temporary assignment plans in which the available group does not go to any restoration target until the time when the group leader can start handling. The optimal seconding plan thus searched is a seconding plan in which the supportable group is not seconded to any restoration target until the time when the group leader can start responding. A secondment plan that assumes that the group will start recovery work before the time when the group leader can start responding is an unfeasible secondment plan. According to the above configuration, the search unit 12 does not wastefully generate such unrealizable secondment plans. Then, the search unit 12 can efficiently search for the optimal temporary transfer plan from among the feasible temporary transfer plans.

The secondment planning system 10 may further include one or more of the travel time acquisition unit 13, the output control unit 15, and the joining support unit 16 (time prediction unit, group determination unit) as necessary. .

Each of the above-described units (information acquisition unit 11, search unit 12, travel time acquisition unit 13, situation information acquisition unit 14, output control unit 15, and merging support unit 16) of temporary transfer planning system 10 acquires information for realizing temporary transfer planning system 10. It is a control block realized by a control device provided in the processing device and a storage device for storing programs.

In addition, the temporary transfer plan system 10 may store the latest temporary transfer plan database 31 (latest temporary transfer plan DB31) and the worker database 33 (worker DB33) in the storage device described above.

The travel time acquisition unit 13 acquires the travel time required for the worker to travel from the starting point to the destination. For example, the travel time acquisition unit 13 transmits a request including a query designating the location of the first person to be seconded as the starting point and the location of the next person to be seconded as the destination to the map information providing system 300 . Then, the travel time acquisition unit 13 may acquire the travel time from the departure point to the destination from the map information providing system 300 . As a result, the search unit 12 can estimate the total travel time required to move the seconded targets in the order of arrival as the total travel time.

In this embodiment, the travel time acquisition unit 13 may further acquire the travel time required for the worker to move from the current location to the earliest meeting point.

The travel time acquisition unit 13 may acquire an average travel time calculated by the map information providing system 300 as the travel time described above. Alternatively, the travel time acquisition unit 13 may acquire the travel time calculated by the map information providing system 300, taking into consideration road traffic conditions. The travel time that takes road traffic conditions into account may be the travel time calculated taking into account the degree of road congestion, or if the shortest route is closed to traffic, it is calculated based on the travel distance of an alternative route. It may be the travel time that is set.

In this embodiment, as an example, the means of transportation used by each worker may be determined in advance. For example, the means of transportation may be associated with each worker and stored in advance in the worker DB 33 . The travel time acquisition unit 13 may acquire the travel time according to the type of means of transportation of the available worker.

In this embodiment, as another example, the means of transportation for each worker may be acquired by the situation information acquisition unit 14 . That is, the status information may also include information indicating the means of transportation available to the worker. In this case, the travel time acquisition unit 13 may acquire the travel time according to the type of transportation indicated by the situation information of the available worker.

The means of transportation is, for example, walking, bicycle, motorbike, car, bus, train, etc., and the travel time acquiring unit 13 obtains the average travel speed for each means of travel and the travel on the route that the travel means can travel. A travel time calculated based on the distance may be acquired. The travel time acquisition unit 13 may acquire the travel time in consideration of the traffic conditions on the route on which the means of transportation can travel. For example, when the means of transportation is public transportation such as a bus and a train, the travel time acquisition unit 13 may acquire the travel time in consideration of the operation status of each route (regular operation, suspension of service, etc.). .

By considering the type of means of transportation for each worker, it is possible to obtain a more accurate travel time for each worker.

The status information acquisition unit 14 may also acquire information that can identify the worker's current location. That is, the status information may further include information that can identify the worker's current location. Below, the information that can identify the current location of the worker is referred to as the current location information of the worker. The location information may be, for example, latitude and longitude information. In another example, the position information may be information specifying a range such as coordinates or cells in a coordinate system unique to the dispatch support system 100, or may be an address, a building name, an intersection name, or the like.

For example, the terminal device 3 of each worker is equipped with a location information acquisition unit such as GPS (Global Positioning System). The status information acquisition unit 14 may communicate with the terminal device 3 of each worker and acquire the current position information of each worker from the terminal device 3 .

As a result, the search unit 12 can determine the current location of the group leader as the starting point of the group to which the group leader belongs, for each of a plurality of secondment plans with various different secondment patterns. Then, the searching unit 12 can estimate the travel time from the place of departure to the location of the person to be seconded first in the order of arrival.

The merging support unit 16 supports the group leader of the available group and the available workers to smoothly join together based on the status information of each worker acquired by the status information acquisition unit 14 .

The merging support unit 16 may identify the earliest merging point at which the worker can join the group the earliest, based on the status information of each worker and the optimal seconding plan of each group. The merging support unit 16 may specify the location of one of the seconded targets of the group as the earliest merging point where the worker can join the group the earliest. The joining support unit 16 may predict the earliest joining time at which the worker can join the group the earliest. The merging support unit 16 may determine the merging destination group with which the worker can merge the earliest. The merging support unit 16 may feed back a merging plan indicating at least one of the earliest merging point, the earliest merging time, and the merging destination group to the terminal device 3 of each worker via the output control unit 15 .

The output control unit 15 outputs the search result executed by the search unit 12 to the output unit. Also, the output control unit 15 outputs the merging plan generated by the merging support unit 16 to the output unit. In this embodiment, the output unit is the front-end system 1, the office device 2, or the terminal device 3, as an example.

In this embodiment, as described above, each of the elevator installations to be restored is associated with one of the business establishments that perform the maintenance to be restored. Each group belongs to one of the offices. The search unit 12 searches for an optimal secondment plan for each business office, targeting groups that can be accommodated among groups belonging to the business office. By this search, the optimum secondment plan that matches the actual situation is searched for with more accurate estimated completion time for each office.

The output control unit 15 outputs each of the estimated completion times in the optimum secondment plan searched for each office to the output unit.

As a result, the operator can easily grasp when the restoration work for all restoration targets assigned to each office will be completed for each office. Presenting the estimated completion time for each office can contribute to the prompt transmission of the outlook for restoration work to relevant parties. Furthermore, the operator can contribute to expedite dispatch arrangements based on the optimal dispatch plan. Alternatively, it can help the operator to quickly make a decision to revise a more optimal dispatch plan.

As an example, the output control unit 15 may output to the front-end system 1 each of the estimated completion times in the optimum secondment plan searched for each office for all offices under the jurisdiction of the maintenance company. good. Furthermore, a dispatch pattern, in which a combination of dispatch targets and a dispatch order indicated by the optimal dispatch plan are defined for each group capable of being dispatched, may be output in addition to the estimated completion time. For example, the output control unit 15, for the office device 2, the optimum dispatch plan of the office where the office device 2 is installed, that is, the above-mentioned dispatch pattern of the office and the estimated completion time of the office may be output.

<S3: Search for Optimal Secondment Plan>
(Regarding input information)
Input information that is input to the search unit 12 for searching for the optimal secondment plan for one office (for example, office A) will be described below. For example, the searching unit 12 receives at least a restoration target list of the office A and status information of each worker belonging to the office A as input information.

Input information: Recovery target list FIG. 4 is a diagram showing an example of the data structure of the recovery target list. The secondment support system 100 divides the entire list including all recovery targets provided by the damage information providing system 200 into each office based on the location of each recovery target. The secondment support system 100, for example, as shown in FIG. 4, generates a recovery target list, which is a list of recovery targets assigned to each business office, for each business office. Assume that the recovery target list shown in FIG. 4 is the recovery target list for office A, as an example. The generated recovery target list is handed over to the information acquisition unit 11 of the secondment planning system 10 . Also, the restoration target list may be provided to the front-end system 1 . Also, the restoration target list of the office A may be provided to the office device 2 of the office A. FIG.

The recovery target list may include, for example, the items of target ID, location, confinement presence/absence, recovery priority, and number of required work locations.

The target ID is identification information for uniquely identifying the restoration target. Unique identification information is given to one elevator installation. In the present embodiment, one elevator facility is treated as one recovery target (seconded target) regardless of how many elevators the one elevator facility is composed of.

The location is information indicating the location to be restored, and includes a place name, an address, a building name, and the like.

The presence/absence of confinement is information indicating whether or not an event in which the user is confined in the recovery target has occurred due to the failure or stoppage of the recovery target. In this embodiment, the presence or absence of confinement indicates whether or not the user is confined in any of the elevators belonging to the elevator equipment to be restored. In the illustrated example, "yes" indicates that there are passengers trapped in the elevator and "no" indicates that there are no such passengers.

The recovery priority is information indicating the recovery priority set for the recovery target. In this embodiment, as an example, the recovery priority of the recovery target in which the user is confined is set to the highest (for example, priority S). Then, for recovery targets for which confinement has not occurred, the predetermined recovery priority may be adopted as it is. Restoration priorities set in advance for restoration targets may include, for example, three levels of priorities A to C, excluding priority S. For each restoration target, one of A, B, and C is set in advance in descending order of restoration priority.

For example, the restoration priority may be determined according to the functional properties of the building in which the elevator equipment to be restored is installed. For example, in society, a high restoration priority (priority A) may be set for elevator equipment that operates in facilities that play an important role, especially when a disaster occurs. Facilities that play an important role are, for example, medical institutions such as general hospitals, news organizations such as television stations, and administrative agencies such as city and ward offices. Alternatively, the restoration priority may be set according to the rank of the maintenance contract concluded between the manager of the building in which the elevator equipment is installed and the maintenance company.

The restoration priority set in advance for the elevator equipment may be stored in advance in the storage device of the secondment support system 100. In this case, in the restoration target list acquired by the information acquisition unit 11, "recovery priority The "degree" column may be omitted. When the information acquisition unit 11 does not acquire the recovery priority, the search unit 12 reads the recovery priority associated with the elevator equipment to be restored from the storage device, and identifies the recovery priority to be restored. can do. In this case, regardless of the preset recovery priority, the search unit 12 specifies the recovery priority of the recovery target with the presence or absence of confinement as "presence of confinement" as the highest value of "priority S". be able to.

The number of places requiring work is information indicating the number of places where restoration work by workers is required in the elevator equipment to be restored. For example, the number of places requiring work may be the number of floors where an elevator stops for a user to get on and off (hereinafter referred to as the number of getting on and off floors) in elevator equipment. Alternatively, the number of places requiring work may be the number of bases of elevators included in the elevator equipment×the number of floors to get on and off. For example, in an elevator facility that is installed in a five-story building and configured with four elevators that stop at each floor, the number of locations where work is required may be 4 units×5 floors=20 locations.

- Input information: status information FIG. 5 is a diagram showing an example of the data structure of the worker DB 33. As shown in FIG. The worker DB 33 is a database for managing information on workers who belong to each office and are in charge of restoration work. The worker DB 33 consists of predetermined static information regarding workers and dynamic information determined based on situation information reported by each worker in the event of an emergency.

For example, the worker DB 33 may include items such as office name, leader flag, worker name, contact information, group name, means of transportation, availability, time information, and location information. .

Among the above items, the office name, leader flag, worker name, and contact information are static information, and availability, time information, and location information are dynamic information. Each of the group name and means of transportation may be designed as static information or dynamic information.

For example, in the first case where the group to which the worker belongs is predetermined, the group name indicating the group to which the worker belongs can be designed as static information. In the second case of opportunistically determining the group placement of workers, the group name can be designed as dynamic information.

In addition, for example, in the case of prearranging and registering means of transportation used by workers, the item of means of transportation can be designed as static information. The items of transportation can be designed as dynamic information, in order to let workers select the most suitable transportation according to the situation and report it as situation information.

The office name is information indicating the name of the office to which the worker belongs. A business establishment ID, which is identification information for uniquely identifying a business establishment, may be employed instead of the business establishment name.

The leader flag is information indicating whether the worker is a group leader or a member other than the leader. As an example, a leader flag of "1" indicates that it is the associated worker and group leader. A leader flag of "0" indicates that the worker with which it is associated is a member.

The worker name is information indicating the name of the worker. A worker ID, which is identification information that uniquely identifies a worker, may be employed instead of the worker name.

The contact information is information indicating the contact information of the worker. The contact information may be, for example, the e-mail address of the terminal device 3 used by each worker.

The group name is information indicating the name of the group to which the worker belongs. A group ID, which is identification information for uniquely identifying a group, may be employed instead of the group name. In the second case described above, the group name item remains blank until the group to which the worker belongs is determined.

The means of transportation is information indicating the type of means of transportation used by the worker for the restoration work. Means of transportation includes information on the means of transportation used by workers to move from their homes to their workplaces when commuting, and information on the means of transportation used when making rounds for recovery work. It may include a certain movement means during work so as to be distinguishable. If the member is supposed to accompany the group leader at all times, the means of transportation of the member may be set identical to that of the group leader.

Responsiveness is information indicating the worker's ability to respond to recovery work. In this embodiment, it is assumed that three types of "possible", "impossible", and "unknown" are defined as the status related to the support possibility. In this embodiment, in the worker DB 33, by default, each worker is assigned a status of "unknown" indicating that the possibility of handling is unknown until status information is received from the worker's terminal device 3. attached.

The availability "available" indicates that the worker with which it is associated is the available worker. When the information acquisition unit 11 acquires the status information indicating that the worker is ready for restoration work, the information acquisition unit 11 associates the worker with a status of “available”.

The availability “not possible” indicates that the worker associated with it is a worker who cannot handle recovery work. When the information acquisition unit 11 acquires status information indicating that a worker is in a situation where recovery work cannot be handled, the information acquisition unit 11 associates the worker with a status of “cannot handle”.

The time information is information for specifying when the worker can start responding. In the present embodiment, as an example, the time information may be the time (hereinafter referred to as possible start time) at which an action for restoration work can be started, which is determined or predicted by the worker himself/herself.

The location information is information that can identify the current location of the worker. In this embodiment, as an example, the position information may be latitude and longitude information.

The information acquisition unit 11 acquires status information from each worker's terminal device 3 and registers the acquired status information in the worker DB 33 . Specifically, the information acquisition unit 11 registers each item of availability, time information, location information, and, in some cases, means of transportation of the worker who received the situation information in the worker DB 33 .

Input Information: Specific Example of Situation Information Acceptance Screen The situation confirmation system 400 may provide a situation information acceptance screen to the terminal device 3 of each worker in order to acquire situation information from each worker. The status information reception screen is a screen that receives status information input operation by the worker. The worker DB 33 may be shared by the situation confirmation system 400 and the dispatch support system 100 . Note that in other embodiments that do not employ the situation confirmation system 400 , the situation information acquisition unit 14 may generate a situation information reception screen and provide it to each terminal device 3 .

6 and 7 are diagrams showing specific examples of the status information reception screen. In the present embodiment, as an example, when the information acquisition unit 11 acquires the restoration target list of the office A due to the occurrence of a disaster, the situation confirmation system 400 collects the contact information of the worker of the office A. Extract from the member DB 33. The situation confirmation system 400 may send a report request message requesting a situation report including whether or not recovery work can be handled to the terminal device 3 of each of the extracted contacts. The report request message may be sent via existing communication tools such as e-mail applications and SNS (Social Networking Service) applications.

FIG. 6 is a diagram showing an example of a message screen including the above-described report request message among the status information reception screens. The situation confirmation system 400 transmits the report request message to the terminal device 3 and causes the display section of the terminal device 3 to display the message screen 51 .

As an example, the message screen 51 may include link information 52 for guiding the worker to an input screen for the worker to enter status information. The worker can display the input screen on the display unit of the terminal device 3 by performing an operation to select the link information 52 .

FIG. 7 is a diagram showing an example of the above-described input screen of the status information reception screen. The situation confirmation system 400 provides an input screen 55 corresponding to the link information 52 to the terminal device 3 in response to the request transmitted from the terminal device 3 in which the link information 52 is selected.

The input screen 55 includes, as an example, a first input area 56 for inputting availability and possible start time. For example, the first input area 56 is either (1) immediately available from the current time, (2) scheduled to be available in the future, and (3) not foreseeable availability. A user interface (hereinafter referred to as UI) component may be included that allows the user to select an appropriate option. Also, the first input area 56 may include a UI component 561 for inputting the possible start time in the option (2). Furthermore, the first input area 56 may include a UI component 562 such as a text box for entering the reason why recovery work cannot be performed in the option (3).

In the worker DB 33, if the means of transportation is designed as dynamic information, the input screen 55 may include a second input area 57 for inputting the means of transportation of the worker.

The worker can select an option that matches his situation and enter his situation through the first input area 56 and the second input area 57 .

The input screen 55 may include a send button 58 for sending the status information entered by the worker to the dispatch planning system 10 .

The operator can operate the send button 58 while the status information is input via the first input area 56 and the second input area 57 . When the send button 58 is operated, the terminal device 3 sends the status information including the items input by the worker and the position information acquired from the GPS installed in the terminal device 3 to the status of the dispatch planning system 10. It is transmitted to the information acquisition unit 14 .

The status information acquisition unit 14 receives status information transmitted from the terminal device 3 . The status information acquisition unit 14 registers in the worker DB 33 the response availability, time information (startable time), means of transportation, and position information included in the received status information. For example, when the acquired status information indicates the option (1) for availability of support, the status information acquisition unit 14 determines whether the status of support availability is “possible”, the time when the status information is received, Position information may be registered in the worker DB 33 . Alternatively, if the acquired situation information indicates the above option (2) and the possible start time, the situation information acquisition unit 14 obtains the indicated possible start time , and position information may be registered in the worker DB 33 . Alternatively, when the acquired situation information indicates the option (3) described above, the situation information acquisition unit 14 registers the status “impossible” indicating whether the response is possible and the location information in the worker DB 33. , the item of time information may be left blank.

(About exploration)
In the present embodiment, the searching unit 12, as a preparatory stage for starting the search, identifies a group that can be handled by the office A based on the status information of each worker collected in the worker DB 33, and Get the current location of the group leader of the possible group and the start possible time.

For example, the searching unit 12 may refer to the worker DB 33 and identify, as the available group, a group that includes available workers who are currently ready to start handling among the available workers. At this time, the searching unit 12 may specify, as the available group, a group to which one or more workers whose possible start time in the worker DB 33 is before the current time when the search is about to start belongs.

Alternatively, the searching unit 12 may identify, as the available group, a group that includes available workers whose response start time is within a predetermined time period from the present to the future. At this time, the searching unit 12 may specify, as the available group, a group to which one or more workers whose available start time arrives within two hours from the current time in the worker DB 33 belong.

Further, the searching unit 12 may specify the available groups such that at least one of the workers determined to be available in each of the available groups becomes a predetermined group leader.

It is considered that the group leader is usually selected by a worker who is skilled in the recovery work so that even one person can handle the recovery work. According to the above-described configuration, a group including at least one skilled and available worker is treated as a available group, and a dispatch plan is generated. Therefore, it is possible to prevent a dispatch plan from being searched for as an optimal dispatch plan in which dispatch targets are assigned to a group of all unskilled workers who can handle it because skilled workers cannot handle it. .

As an example, the searching unit 12 may identify a group whose group leader can handle restoration work at the current time or within two hours from now as a group that can handle. In this embodiment, when the current time is 7:30, the search unit 12 identifies three groups, group W, group T, and group U, as available groups based on the example shown in FIG. do.

Then, the search unit 12 acquires the current location of each group leader of the three groups described above from the position information item of the worker DB 33, and acquires the possible start time of each group leader from the time information item of the worker DB 33. .

FIG. 8 and FIG. 9 are diagrams showing an example of a procedure for searching for an optimal secondment plan, which is executed by the searching unit 12. FIG. Note that the maps M1 to M8 shown in FIGS. 8 and 9 are merely information obtained by visualizing the information held inside when the search unit 12 performs a search, in order to explain the search procedure in an easy-to-understand manner. Therefore, the search unit 12 does not actually need to generate the visualization information shown in the maps M1 to M8.

As shown in the map M1, the searching unit 12 is provided with the locations of all restoration targets included in the restoration target list, whether or not the restoration targets are confined, and the priority of restoration. Further, the searching unit 12 is provided with the number of available groups of the office A, the current location of the group leader of each available group, and the possible start time. Since the search unit 12 generates a seconding pattern with the recovery target as the seconding target, the term "seconding target" is used for the restoration target in the following description. In the following description of the search procedure, the simple notation of "group" refers to available groups (group W, group T, and group U).

As shown in the map M2, first, the search unit 12 narrows down to the seconded targets with the highest recovery priority, and sets the estimated completion times of all the seconded targets to be earlier, preferably the earliest. Assign each of the secondees to a group so that: Hereinafter, the seconded target with the highest recovery priority, that is, the seconded target with the priority S in which confinement has occurred is referred to as the seconded target S. For example, the search unit 12 may generate several dispatch patterns targeting only the dispatch target S, and search for the dispatch pattern that is the optimal solution or the semi-optimal solution from among them. The search unit 12 may execute a genetic algorithm, which will be described later, to search for a secondment pattern that is an optimal solution or a quasi-optimal solution.

In this embodiment, as an example, the searching unit 12 may set the current location of the group leader as the starting point of the available group to which the group leader belongs in each of the seconding plans based on each seconding pattern. As a result, the searching unit 12 can allocate, for example, the seconded target S closest to the current location of the group leader to the group of the group leader. As a result, it is possible to generate an appropriate secondment plan in line with the actual situation.

As an example, the map M2 indicates that the search unit 12 has searched for a secondment pattern in which the seconded target OS1 is first assigned to the group W and the seconded target OS2 is first assigned to the group T as the optimum or quasi-optimal solution. ing. The seconded target OS1 is the first seconded target assigned to the group W, and the seconded target OS2 is the first seconded target assigned to the group T in the seconded order. In this way, in the dispatch plan output by the searching unit 12, the dispatch order of the dispatch target S, in which the user is confined, is earlier than the dispatch order of the dispatch targets A to C, in which confinement does not occur. . As a result, a dispatch plan is generated that allows restoration work to be performed with top priority given to restoration targets in which users are confined.

In another example, the searching unit 12 may set the location of the office to which the available group belongs as the starting point of the available group in each of the secondment plans based on each secondment pattern. For example, it is assumed that the timing of the occurrence of the disaster is outside the working hours of the worker, for example, the group leader, and the group leader is not ready to start recovery work immediately. In this case, it is assumed that the group leader will go to work from his current location and prepare tools and means of transportation for the restoration work. Therefore, by setting the time at which the group leader arrives at the place of business as the possible start time and generating a secondment plan with the location of the place of business as the departure point, the search unit 12 searches for the optimum secondment plan that matches the actual situation. becomes possible.

As shown in the map M3, the search unit 12 then virtually shifts the status of all seconded targets S to the restoration work completed state. In addition, the search unit 12 sets the location of the seconded subject S scheduled to be seconded last as the latest current location for each of the groups.

Subsequently, as shown in the map M4, the search unit 12 narrows down the seconded targets with the priority A next to the priority S (hereinafter referred to as seconded targets A) so that the estimated completion time of all seconded targets A is earlier. Secondly, preferably, each seconded subject A is assigned to a group so that the estimated completion time is the earliest. The search unit 12 generates several dispatch patterns targeting only the secondee target A, similar to the secondee target S, and executes a genetic algorithm, which will be described later, from among them to obtain an optimal or quasi-optimal solution. You may search for a secondment pattern.

According to the map M4, as an example, these two seconded targets A are assigned to the group T in the order of seconded targets OA2 and seconded targets OA3. The seconding target OA2 is the second second in the order of seconding assigned to group T, and the third second in the order of seconding assigned to group T is the seconding target OA3. Since the seconded target S is not assigned to the group U, the seconded target OA4 is the first seconded target assigned to the group U in the order of seconding.

As shown in the map M5, the search unit 12 virtually shifts the status of all seconded targets A to the restoration work completion state, as in the case of priority S. FIG. In addition, the search unit 12 sets the location of the seconded candidate A who is scheduled to be seconded last to be the latest current location for each of the groups.

Subsequently, as shown in the map M6, the search unit 12 narrows down to seconded targets with priority B next to priority A (hereinafter referred to as seconded targets B) so that the estimated completion times of all seconded targets B are earlier. Secondly, preferably, each seconded target B is assigned to a group so that the estimated completion time is the earliest. The searching unit 12 generates several dispatch patterns targeting only the secondee target B as well as the secondee target S and the secondee target A, and among them, executes a genetic algorithm described later to find an optimal solution or a semi-optimal solution. A seconding pattern that is the optimum solution may be searched for.

According to the map M6, as an example, these three seconded targets B are assigned to the group W in the order of seconded targets OB1, seconded targets OB2, and seconded targets OB3. At this point, seconding targets OB1, seconding targets OB2, and seconding targets OB3 are assigned to group W in third to fifth positions in the order of seconding, following seconding target OS1 and seconding target OA1.

As shown in the map M7, the search unit 12 virtually shifts the status of all seconded targets B to the restoration work completion state, as in the case of the priority S and the priority A. FIG. In addition, the search unit 12 sets the location of the secondee B, who is scheduled to be seconded last, to be the latest current location for each of the groups.

Subsequently, as shown in the map M8, the search unit 12 narrows down to seconded targets with priority C next to priority B (hereinafter referred to as seconded targets C) so that the estimated completion times of all seconded targets C are earlier. In addition, preferably, each seconded subject C is assigned to a group so that the estimated completion time is the earliest. The search unit 12 generates several dispatch patterns targeting only the secondee target C in the same way as the secondee target S, the secondee target A, and the secondee target B, and executes a genetic algorithm to be described later from among them, A seconding pattern that is an optimal solution or a quasi-optimal solution may be searched for.

According to the map M8, at this point in time, the group W includes seconded targets OS1, seconded targets OA1, seconded targets OB1, seconded targets OB2, and seconded targets OB3. OC1, seconded target OC2, and seconded target OC3 are assigned respectively. In this way, in the dispatch plan output by the searching unit 12, the dispatch targets A to C in which the user is not confined are arranged in order of earlier dispatch as the restoration priority is higher. As a result, for the rest of the recovery targets excluding the recovery target in which the user is confined, a secondment plan is generated in which recovery work can be performed in descending order of predetermined recovery priority.

As described above, the searching unit 12 may search for the optimum seconding plan by setting only restoration targets associated with designated restoration priorities as seconding targets. As a result, among restoration targets with the same restoration priority, dispatch patterns in which the estimated completion time is relatively early are searched for, and by concatenating these in order of restoration priority, , a dispatch plan capable of performing recovery work is efficiently generated.

Finally, the searching unit 12 can obtain an optimal temporary worker transfer plan for the office A by combining the temporary worker dispatch patterns searched for each restoration priority from priority S to priority C, starting from the one with the highest restoration priority.

In the search for the optimal secondment plan described above, the search unit 12 may search for the optimal secondment plan from among the secondment plans whose secondment targets are all recovery targets included in the recovery target list. In another example, the search unit 12 selects one or more recovery targets that are relatively distant from the starting point of the above-mentioned supportable group among the recovery targets included in the recovery target list, The optimum temporary transfer plan may be searched for from the temporary temporary transfer plans generated by excluding them from the targets.

As time passes from the occurrence of a disaster, it is assumed that the number of groups capable of responding will gradually increase. In that case, it is more efficient for the group that can respond at the moment to move a long distance and go to a distant recovery target, but it is more efficient for the group that is near the recovery target and will be able to respond later. It may be possible to patrol the site to be restored, and as a result, it may be possible to shorten the restoration completion time. According to the above configuration, in anticipation of an increase in the number of available groups in the future, it is possible to search for a dispatch plan within a range in which the current available groups can efficiently patrol, and as a result, the recovery completion time is early. , it is possible to formulate an appropriate secondment plan. It should be noted that the measures excluding distant restoration targets may be implemented only for restoration targets with a restoration priority of A or lower. This is because it is desired that recovery work is advanced with the highest priority by a group that can reliably handle the recovery target of recovery priority S in which a user is confined.

The status information may include information indicating the worker's current location. The secondment planning system 10 may further include a travel time acquisition unit 13 that acquires the travel time required for travel between locations. In such a case, when generating a secondment plan based on a plurality of secondment patterns, the search unit 12 moves the group leader from the current location to the office as the destination at the time when the response can be started. Configured to generate a dispatch plan such that the available group to which the group leader belongs will not be dispatched to any of the restoration targets until the arrival time (the start time of the group leader) predicted based on the travel time required for may be

According to the above-described configuration, a secondment plan that does not match the actual situation, such as expecting that the group will be seconded to a seconded target during a period before the time when the skilled worker of the group can start the action for the recovery work. , can be prevented from being drafted or adopted.

(About output information)
The output information output from the searching unit 12 that has searched for the optimal secondment plan for the office A will be described below. For example, the search unit 12 outputs, as output information, the optimal secondment plan for the office A obtained according to the above-described search procedure, and the estimated completion time of the company A based on the optimal secondment plan.

Output Information: Optimal Secondment Plan FIG. 10 is a diagram showing an example of the data structure of the optimal secondment plan. The optimal secondment plan shown in FIG. 10 is the optimal secondment plan for office A with group W, group T, and group U as available groups. The optimal secondment plan includes a group-specific secondment pattern 71 that defines, for each group, the combination of secondment targets to which the recovery work group is scheduled to be seconded and the order of the secondment. At present, the groups that can be handled by office A are three groups, group W, group T, and group U. Therefore, the optimal secondment plan for office A includes three group-specific secondment patterns 71. . The group-by-group seconding pattern 71 includes information for uniquely identifying the seconded subject assigned to the group, and the order of arrival of each assigned seconded subject.

Note that the group-by-group dispatch pattern 71 shown in FIG. 10 is merely information visualized so that the combination of dispatch targets assigned to a group and the dispatch order can be easily visually recognized. Therefore, the search unit 12 does not actually need to generate the visualization information of the seconding pattern by group 71 as shown in FIG. 10 .

Output information: Estimated completion time Further, the search unit 12 may output the estimated completion time of the office A in the searched optimal secondment plan together with the optimal secondment plan. The searching unit 12 can estimate the estimated completion time for each temporary transfer plan based on the map information provided from the map information providing system 300 in the above-described search process.

For example, the searching unit 12 may estimate, for each group, the time at which the recovery work for the last seconded target in the order of seconded is completed for each of the seconded plans of a plurality of seconded patterns. Then, the search unit 12 sets the latest time of the estimated times for each group as the estimated completion time in the above-described secondment plan. This makes it possible to grasp the time of complete restoration at the office. Hereinafter, the time estimated for each group of the recovery work completion time of the last dispatched target will be referred to as the group-by-group estimated completion time.

For example, in the optimal dispatch plan shown in FIG. 10, assume that the estimated completion time for each group of group W, that is, the estimated completion time of the recovery work for the seconded target OC3, which is the last in the order of dispatch, is 10:48. Assume that the estimated completion time for each group of group T, that is, the time at which group T is estimated to complete the recovery work of the seconded target OC 6 last in the order of arrival is 10:26. Assume that the estimated completion time for each group of group U, that is, the time at which group U is estimated to complete the recovery work for the last dispatched target OC8 is 10:12. In this case, the search unit 12 determines the latest time "10:48" among the three estimated completion times for each group as the estimated completion time for the entire office A in the optimal secondment plan shown in FIG. do. The search unit 12 may output the estimated completion time “10:48” together with the optimal secondment plan shown in FIG.

As an example, the searching unit 12 calculates the estimated completion time for each group for obtaining the estimated completion time of the place of business, the total travel time for the group to be seconded to the seconded target, and the total required recovery work for the seconded target for the group. At least take into account the working hours and guess. The total travel time is, for example, the total sum of travel times required for a group to travel to a visiting target assigned to its own group in accordance with the order of arrival. The total work time is, for example, the sum of the work times required for the group to perform recovery work for each seconded target. For example, the search unit 12 may calculate the estimated completion time for each group by adding the above total travel time and the above total work time to the current time.

A procedure for calculating the total travel time of the group by the search unit 12 will be described by taking as an example a case of calculating the total travel time of the group W based on the optimal seconding plan shown in FIG. 10 .

First, the search unit 12 calculates the movement distance from the current location of the group leader of group W (map M1 in FIG. 5) to the location of the first seconded target assigned to group W (seconded target OS1 in map M2). Acquire the corresponding travel time MT1. In another example, the travel time from the location of the office A to which the group leader belongs to the location of the seconded OS1 may be acquired as the travel time MT1.

Note that the travel time acquired by the search unit 12 may be acquired from the map information providing system 300 by the travel time acquisition unit 13 . Further, the travel time described above may be an average travel time based on the travel distance, or may be a travel time in consideration of traffic conditions. Alternatively, the travel time may be one in consideration of the group leader's travel means. The same applies to various travel times acquired by the search unit 12 thereafter.

Thereafter, the searching unit 12 repeats the process of acquiring the travel time MTn from the location of the n-1th seconded target to the location of the nth seconded target (n is an integer equal to or greater than 2). In the example of group W, the search unit 12 repeats the above-described processing until it acquires the travel time MT8 from the second target OC2 to the second target OC3, which is the last travel route.

Then, the search unit 12 calculates the sum of the travel times MT1, MT2, . . . , MTn as the total travel time of the group W.

A procedure for calculating the total work time of the group by the search unit 12 will be described. The search unit 12 identifies the work time WT for each seconded subject according to the number of places requiring work determined for each seconded subject. In this way, by accurately estimating the work time to be restored according to the situation at the site, it is possible to further reduce the error in the estimated completion time.

The search unit 12 can refer to the recovery target list (FIG. 4) acquired by the information acquisition unit 11 to specify the number of locations requiring work for secondment targets (recovery targets). It should be noted that the seconded target, which is the recovery target, can be uniquely identified by the target ID, for example.

The search unit 12 can calculate the working time WT of one seconded target based on the following formula, as an example.
Formula: work time WT=number of places requiring work×unit time+fixed time The unit time is the average work time required for restoration for one place requiring work, and is, for example, 3 minutes. The fixed time is a fixed work time, for example, 5 minutes, for the restoration of one restoration target, that is, one elevator installation, regardless of the scale of the number of work-required locations.

For example, if the number of places requiring work of the first seconded target OS1 in the group W is 20, the searching unit 12 calculates the work time WT1 of the seconded target OS1 as 20 places x 3 minutes + 5 minutes = 65 minutes. do. In this way, the searching unit 12 calculates the work time WT for each of the n-th dispatched subjects assigned to the group W (work time WT1, WT2, . . . , WTn).

Then, the searching unit 12 calculates the total work time WT1, WT2, .

If the number of workers in the group contributes to shortening the work time, the search unit 12 determines the work time WT or the total work according to the number of available workers belonging to the group. You can adjust the time.

Finally, the search unit 12 adds the total travel time and the total work time calculated as described above to the current time to calculate the group-by-group estimated completion time of the group W. FIG. The searching unit 12 similarly calculates the estimated completion time for each group for the other group T and group U of the office A as well. Then, the latest estimated completion time among the three estimated completion times for each group is set as the estimated completion time in the optimal secondment plan shown in FIG.

The search unit 12 stores in the latest temporary transfer plan DB 31 the optimum secondment plan for the office A shown in FIG. The search unit 12 searches for the optimal temporary assignment plan, calculates the estimated completion time in the optimal temporary assignment plan, and stores them in the latest temporary assignment plan DB 31 for each of the offices corresponding to the disaster that occurred. run to

(An example of search: genetic algorithm)
The search unit 12 may generate each of a plurality of secondment patterns of secondment plans by alternation of generations according to a genetic algorithm.

For example, the search unit 12 executes (step 1) initialization, (step 2) evaluation, (step 3) selection, (step 4) crossover, and (step 5) mutation. The search unit 12 repeats each step from step 2 to step 5 until the number of generations specified in advance has passed. The number of generations may be specified in advance by the operator.

In the initial setting of step 1, the search unit 12, as an example, satisfies the first condition that at least one secondment target is assigned to all groups (available groups in this embodiment) in the office. , generate individuals randomly. The first condition described above may be specified in advance by the operator, for example.

In this embodiment, identification of dispatch patterns according to the genetic algorithm is performed for each recovery priority. Therefore, an individual is generated as information indicating to which group of business establishments a predetermined number of secondment targets with a certain recovery priority are assigned.

When assigning Y groups to X seconded subjects, the search unit 12 randomly generates individuals having the following data structure (X and Y are integers of 2 or more).
[G ₁ , G ₂ , . . . , G _x ]
Here, G _i is a value for identifying a group to be assigned to the i-th seconded target, and is an integer of 0 or more and less than Y (i is an integer of 1 or more and X or less).

For example, when assigning three groups (first to third groups) to ten seconded targets (first to tenth seconded targets), an example of an individual generated by the search unit 12 is [1, 0, 2, 2, 1, 0, 0, 2, 0, 1]. The three numbers "0", "1", and "2" indicate the first group, the second group, and the third group, respectively. That is, this individual assigns the second group to the first, fifth and tenth seconded subjects, the first group to the second, sixth, seventh and ninth seconded subjects, and the third, It shows assigning the third group to the fourth and eighth seconded subjects.

The search unit 12 generates a plurality of different individuals (for example, 300) and uses them as an initial group of individuals. The number of initial populations (second condition) may be specified in advance by the operator.

In the evaluation of step 2, the search unit 12 calculates, for each generated individual, the estimated completion time for completing the recovery work for all the seconded targets to which each group is assigned, and calculates the estimated completion time for the latest group. Correlate as the estimated completion time of the individual. As described above, the estimated completion time for each group is obtained by adding, to the current time, the total sum of the travel time MT and the total sum of the work time WT when all the assigned secondment targets are visited.

In the selection of step 3, the search unit 12 compares the estimated completion time of each individual by a tournament method, and selects several (for example, 3) individuals with the earliest estimated completion times as parent individuals of the next generation. do.

In the crossover of step 4, the search unit 12 randomly crosses the selected parent individuals such that the first condition is satisfied.

In the mutation in step 5, the searching unit 12 causes each individual to mutate with a predetermined probability (eg, 5%). The probability of causing mutation may be specified in advance by the operator.

The search unit 12 repeats the processes from step 2 to step 5 for the above-mentioned number of generations specified in advance, and selects the individuals remaining after the repetition as the optimal or quasi-optimal seconded target group with a certain recovery priority. Output as a temporary transfer pattern.

The search unit 12 executes the search according to the genetic algorithm consisting of steps 1 to 5 above for each restoration priority, and outputs the optimum or quasi-optimal dispatch pattern for each restoration priority.

<S4: Join Support>
The merging support unit 16 provides support for smoothly joining the available workers, who are scattered when a disaster occurs, into the available group. For merging support, the merging support unit 16 may have a time prediction unit 161 . The merging support unit 16 may further have a group determination unit 162 as necessary.

The time prediction unit 161 identifies the earliest merging point at which the available worker can join the available group earliest, and predicts the earliest merging time. Specifically, the time prediction unit 161 uses the dispatch route (moving route) and arrival time of the available group and the current location and available start time of each available worker to determine the available group and available work. Predict the earliest merging point and the earliest merging time. The dispatch route and arrival time of the available group are specified based on the optimum dispatch plan searched by the searching unit 12 . The current location and possible start time of each available worker are specified from the situation information of each available worker registered in the worker DB 33 .

The group determining unit 162 identifies the available group to which the available worker can join the earliest, and determines the identified available group as the merging destination group to which the available worker joins. In the first case where the group to which the worker belongs is predetermined, the group determining section 162 may be omitted.

(First case: when the group to which the worker belongs is predetermined)
In the first case where the group to which the worker belongs is predetermined in the worker DB 33 shown in FIG. 5, the merging support unit 16 supports merging as follows. FIG. 11 is a diagram illustrating an example of processing for searching for a meeting point executed by the meeting support unit 16. In FIG. The map shown in FIG. 11 is merely information that visualizes the information held internally when the merging support unit 16 executes the above-described processing, in order to explain the procedure of the processing in an easy-to-understand manner. Therefore, the merging support unit 16 does not actually need to generate the visualization information shown in the map of FIG. 11 . In the following, the case of supporting the joining of the group leader and members of group U of office A will be described. It should be noted that the procedure of processing for searching for a meeting point, which will be described below, is merely an example. The merging support unit 16 can employ any algorithm to search for a merging point.

First, the time prediction unit 161 obtains a seconding pattern by group 71 planned for the group U from the optimal seconding plan (FIG. 10) of the office A searched by the searching unit 12, and plots it on a map. The seconded subjects included in the group seconded pattern 71 are indicated by round icons along with the numbers indicating the seconded order in the map shown in FIG. 11 .

Next, the time prediction unit 161 identifies the outgoing route along which the group U travels. The time prediction unit 161 detects, from the map, a route along which the group leader of group U can move, and identifies the dispatch route of group U. FIG. The dispatched route is specified so as to tour each dispatched object in the order of dispatched from the starting point of the group U. Here, the starting point of group U is assumed to be the current location of the group leader GL of group U. On the map, the outgoing route is indicated by a thick solid line. Arrowheads shown on the solid line indicate the direction of movement.

Subsequently, the time prediction unit 161 acquires from the worker DB 33 the current location of the member GM, who is a capable worker among the members belonging to the group U of the office A acquired by the situation information acquisition unit 14 . When there are a plurality of member GMs, each member is arranged so as to be identifiable at a position on the map corresponding to each member's current location.

The time prediction unit 161 associates the current location of the group leader GL, which is the starting point of the seconded route, with the possible start time of the group leader GL, and associates the current location of each member GM with the possible start time of each member GM.

The time prediction unit 161 predicts that the group U will arrive at each point on the dispatch route based on the possible start time of the group leader GL and the travel time and work time of the group U obtained when the optimum dispatch plan is searched. Calculate the estimated time of arrival. Here, the predicted arrival time of the group U may be synonymous with the predicted arrival time of the group leader GL. The granularity of points on the dispatched route for which the predicted arrival time is to be calculated may be determined arbitrarily. For example, the granularity is appropriately determined according to the processing capacity of the secondment planning system 10, the required processing speed, the average moving speed of the moving means of the group leader GL, the total moving distance, and the like. For example, the time prediction unit 161 may calculate the predicted arrival time for each point with a travel distance of 100 m on the dispatch route.

The time prediction unit 161 calculates the predicted arrival time at which the member GM will reach each point on the dispatch route based on the possible start time of the member GM and the departure place (current location) of the member GM. The point on the outgoing route for which the predicted arrival time is calculated may be the same as the point for which the predicted arrival time of group U is calculated.

The time prediction unit 161 predicts that the group leader GL and member GM will arrive at the same or substantially the same time earliest based on the predicted arrival time on the dispatched route of the group leader GL and the predicted arrival time on the dispatched route of the member GM. A point on the outgoing route that can be present at the time is specified as the earliest meeting point. For example, in the illustrated example, it is assumed that the time prediction unit 161 has identified the earliest confluence point P near the second seconded target (star mark on the map).

The time prediction unit 161 determines the travel time required for the member GM to move from the possible start time to the member GM's current location as the destination, with the earliest meeting point P on the seconded route on which the group U travels as the destination. Predict the earliest merging time based on The travel time described above is acquired by the travel time acquisition unit 13, and is a travel time calculated in consideration of the member GM's travel means and the route on the map along which the travel means can move. good too. For example, the movement route along which the member GM moves from the current location to the earliest meeting point P is indicated by a dashed line on the map. Arrowheads shown on the solid line indicate the direction of movement. The time prediction unit 161 predicts, as the earliest merging time, the time when the member GM travels along the moving route indicated by the dashed line and reaches the earliest merging point P.

The time prediction unit 161 outputs the latitude/longitude information of the earliest confluence point with the group leader GL and the earliest confluence time for each member GM.

In another example, the merging support unit 16 may specify the location of one of the dispatched targets of the group as the earliest merging point where the worker can join the group the earliest. For example, the time prediction unit 161 identifies, for each seconded target, a predicted stay time period during which the group U (group leader GL) is predicted to stay at each seconded target based on the optimal seconding plan for the group U. Then, the time prediction unit 161 calculates the predicted arrival time at which the member GM arrives at the seconding target from the current location for each seconding target. The merging support unit 16 identifies, as the earliest merging point, the location of the dispatched target whose arrival order is the earliest among the dispatched targets whose estimated arrival time is included in the above-described predicted stay time zone (or is close in terms of time). may In the example shown in FIG. 11, the location of the second destination target in group U (the second destination target indicated as “2” in FIG. 11, the second destination target OA5 in FIG. 10) is specified as the earliest meeting point. good too. Also, in this case, the merging support unit 16 can select the earlier one of the start time of the predicted stay time period of the group U and the predicted arrival time of the member GM as the earliest merging time.

FIG. 12 is a diagram showing an example of the data structure of the merging plan output by the time prediction unit 161. As shown in FIG. The merging plan shown in FIG. 12 is, as an example, a merging plan for office A. In the first case, the merging plan is for each available worker belonging to the available group, and the earliest merging point (for example, latitude longitude information) and the earliest merging time. When the location of the seconded target is specified as the meeting point, the earliest meeting point may be information (building name, target ID, etc.) that identifies the seconded target instead of the latitude/longitude information.

The merging plan output as described above is useful for the responsive workers belonging to the responsive group to smoothly join their own groups. The merging plan may be notified to each available worker in the following manner, for example. 13 and 14 are diagrams showing an example of a merging plan notification screen provided on the terminal device 3 of the available worker. The output control unit 15 of the secondment planning system 10 generates a merging plan notification for each available worker based on the merging plan output by the merging support unit 16, and transmits it to each terminal device 3 of each available worker. do. The terminal device 3 that has received the joining plan notification from the secondment planning system 10 displays a joining plan notification screen as shown in FIG. 13 or 14 on the display unit of the terminal device 3 based on the received joining plan notification.

A merging plan notification screen 61 shown in FIG. 13 is an example of a merging plan notification screen displayed on the terminal device 3 of the group leader of the available group. The output control unit 15 of the secondment planning system 10 sends information regarding the joining of members to the group leader of each available group. Generate a merge plan notification that indicates what is possible. A join plan notification containing information about the join of one member may be generated for each member and notified to the group leader each time. A single joining plan notification may be collectively notified to the group leader including information on joining of a plurality of members. A joining plan notification screen 61 reflecting the content of the joining plan notification described above is displayed on the display unit of the terminal device 3 of the group leader.

For example, the merging plan notification screen 61 may include member name information 611 indicating the names of members who are available workers. The meeting plan notification screen 61 may include point information 612 indicating points where members can join. The meeting plan notification screen 61 may include time information 613 indicating the expected time when the members can join at the point.

By checking such a meeting plan notification screen 61, the group leader can grasp the workers who can join the restoration work, and also know in advance when and where they are scheduled to join. .

A merging plan notification screen 62 shown in FIG. 14 is an example of a merging plan notification screen displayed on the terminal devices 3 of the members belonging to the available group. The output control unit 15 generates a merging plan notification including information about the merging of the member, addressed to each member other than the leader among the available workers belonging to each available group. The information about joining specifically indicates the earliest time that the member can join which group, at what point, at what time, and the like.

For example, the merging plan notification screen 62 may include group name information 621 indicating the group name of the member's merging destination group. The joining plan notification screen 62 may include point information 623 indicating the point where the member can join the joining destination group earliest. Instead of the latitude and longitude information, the point information 623 may be a map image indicating the junction, information indicating the address of the junction, or the name of the nearest intersection or facility to the junction. may be information indicating The meeting plan notification screen 62 may include time information 624 indicating the expected time when the members can join at the point. In the first case, both the group to which the member belongs and the group leader of the group are predetermined. Therefore, in the first case, the group name information 621 and the leader name information 622 may be omitted from the merging plan notification screen 62, especially in the case where the affiliation of the members cannot be changed dynamically.

By confirming such a joining plan notification screen 62, the member can determine when and where to head to join the joining destination group most quickly, and can join smoothly.

As described above, in the first case, the situation information further includes information that can identify the worker's current location. The dispatch planning system 10 includes a travel time acquisition unit 13 that acquires the travel time required for travel between locations, and a time prediction unit 161 that predicts the earliest joining time at which the available worker joins the available group of the destination to which the worker belongs. and furthermore. The time prediction unit 161 can handle the merging point (earliest merging point) on the route (departure route) along which the available groups who are dispatched in the order of dispatch determined in the optimal dispatch plan searched by the search unit 12 move as the destination. The earliest merging time is predicted based on the travel time required when the worker (member) moves from the current location to the departure point at the response start possible time (start possible time).

According to the above-described configuration, it is possible to notify members who are going to join the group to which they belong, of the joining plan, that is, the joining point and joining time at which they can join the earliest. The member can act so as to be able to join at the meeting point at the notified meeting time. The merging plan is generated in consideration of when the members can start responding, that is, to suit the actual situation, so it is a merging plan that is feasible for the members. In this way, according to the merging plan drafted by the secondment planning system 10, the merging proceeds smoothly, and it is possible to quickly arrange the group configuration for the restoration work arranged in advance.

Furthermore, it is also possible to notify the merging destination group, for example, the group leader, of the member's merging plan. In this way, by providing information about the merging to both sides of the merging, the merging can proceed more reliably and smoothly.

(Second case: When determining the group allocation of workers according to the situation)
In the second case where the worker DB 33 shown in FIG. 5 does not predetermine the group to which the worker belongs and is determined according to the situation, the merging support unit 16 performs the following steps to facilitate merging. Support.

Specifically, the group determining unit 162 determines, as a merging destination group, for each member determined to be an available worker based on the situation information, an available group to which the member can join relatively quickly. As an example, the group determining unit 162 may determine the available group with which the member can join at the earliest time as the joining destination group of the member.

In this case, the time prediction unit 161 obtains the earliest joining time for one member when all available groups in the office are the joining destinations. In the example shown in FIG. 5, the available groups of the office A are three groups, Group W, Group T and Group U, whose group leaders are available workers. Besides the group leader of the office A, there are four workers who can respond, namely, Mr. Sato, Mr. Igawa, Mr. Ito, and Mr. Oda. In this example, the time prediction unit 161 obtains the earliest merging time when group W, group T, and group U are merging destinations for each of the four available workers.

The time prediction unit 161 can obtain the earliest merging point and the earliest merging time when the available worker joins the available group by a procedure similar to the procedure described with reference to FIG. 11 for the first case. can.

The group determination unit 162 determines the available group with the earliest time among the earliest joining times for each available group obtained for one available worker as the meeting destination of the available worker. can be done.

For example, it is assumed that the earliest merging times for the available worker, Mr. Sato, to group W, group T, and group U are predicted to be 10:30, 11:00, and 10:45, respectively. In this case, the group determining unit 162 determines that Mr. Sato's joining destination group is the group W with the earliest joining time. Then, the group determination unit 162 outputs the earliest merging point and the earliest merging time when Mr. Sato's merging destination group is group W as part of the merging plan. Then, the group determining unit 162 outputs the determined merging destination group, earliest merging point, and earliest merging time as a merging plan for each of the four available workers. Here, the merging plan output by the group determining unit 162 may have the same data structure as the merging plan shown in FIG. 12 .

Then, the group leader of each available group is presented with a merging plan notification screen 61 shown in FIG. 13, and the available workers are presented with a merging plan notification screen 62 shown in FIG. be.

As described above, in the second case, the situation information further includes information that can identify the worker's current location. The dispatch planning system 10 further includes a travel time acquisition unit 13 that acquires the travel time required for travel between locations, and a group determination unit 162 that determines available groups to which available workers join. The group determination unit 162 can handle the meeting point (earliest meeting point) on the route (departure route) along which the available groups that are dispatched in the order of dispatch determined in the optimal dispatch plan searched by the search unit 12 move as the destination. The earliest confluence time predicted based on the travel time required to start moving from the current location of the worker to the start point (start time) is relatively early among the available groups. A group is determined as a merging destination.

According to the above configuration, it is possible to notify the merging plan, that is, the earliest merging destination group, the merging point, and the merging time to the available workers who are going to participate in the restoration work. . The available worker can grasp the available group with which he or she should join, and act so as to be able to join at the meeting point at the notified meeting time. Since the merging plan is generated in consideration of the time when the available workers can start responding, that is, to suit the actual situation, it is a merging plan that is feasible for the available workers. In this way, the secondment planning system 10 can draw up an appropriate merging plan in which the merging can be accomplished quickly while meeting the actual situation. As a result, the merging will proceed smoothly, and it will be possible to quickly establish a system for restoration work for the entire office.

Furthermore, it is also possible to notify the merging destination group, for example, the group leader, of the merging plan of the available workers. In this way, by providing information about the merging to both sides of the merging, the merging can proceed more reliably and smoothly.

In addition, the group determination unit 162 may determine the group to which the available workers join, taking into account the latest type of means of transportation of each worker, which is grasped based on the situation information. For example, the group determination unit 162 selects capable workers who have secured the most suitable means of transportation (e.g., automobiles) to efficiently patrol the seconded target by a group leader who has not secured a car. You can preferentially join the group. In addition, the group determination unit 162 may preferentially join the available workers who have not secured a means of transportation to a group led by the group leader who has secured a vehicle. As a result, it will be possible to quickly establish a group structure for restoration work with optimum or sub-optimal patrol efficiency, leading to a reduction in the time required for complete restoration.

<Screen example of optimal secondment plan>
The output control unit 15 provides the front-end system 1 or the office device 2 with a dispatch plan screen for presenting to the operator the optimum dispatch plan for each office searched by the search unit 12 in step S3. good too. FIG. 15 is a diagram showing an example of a secondment plan screen showing details of an optimal secondment plan for one office. The output control unit 15 generates a secondment plan screen 700 based on the optimal secondment plan stored in the latest secondment plan DB 31 and the secondment confirmation target managed by the secondment arrangement system 20 . The output control unit 15 transmits the generated secondment plan screen 700 to an output unit such as the front-end system 1 or office device 2, for example. The secondment plan screen 700 is, for example, a screen for presenting the optimum secondment plan searched for office A. FIG.

The secondment plan screen 700 may include basic information 701 of the place of business. The basic information 701 may include, for example, the number of available groups that indicates the number of available groups that include one or more available workers who can handle recovery work among the groups belonging to the business establishment. . The number of available groups may be used as the numerator, and the number of all groups belonging to the office may be used as the denominator. The basic information 701 may include the number of available workers, which indicates the number of available workers who can handle recovery work among all the workers assigned to the office. The number of available workers may be used as the numerator, and the number of all workers belonging to the office may be displayed as the denominator. The basic information 701 may include the number of elevator installations for which restoration work has not been completed among the restoration targets assigned to the office. The basic information 701 may include estimated completion time. The estimated completion time is estimated by the searching unit 12 based on the optimal seconding plan searched by the searching unit 12 . Estimated time of completion is the time when all restoration work to be restored is completed as a whole at the business site in the case where the business site carries out recovery work according to the optimal dispatch plan with the current force (response group composed of workers who can respond). Refers to the expected time of completion.

The basic information 701 may be designed to represent the latest information regarding basic information relating to the organization of restoration work at the business establishment. For example, the travel plan screen 700 may include a latest button 702 . When the latest button 702 is operated by the operator, an update instruction is transmitted from the front-end system 1 or office device 2 to the secondment support system 100 . The secondment planning system 10 of the secondment support system 100 that has received the update instruction reads the latest status information of each worker from the worker DB 33 and counts the number of available groups and the number of available workers. In addition, the temporary transfer planning system 10 adds the number of restoration targets newly added after the time when the latest optimum temporary transfer plan is stored in the latest temporary transfer plan DB 31 to the number of restoration targets. In addition, the secondment arrangement system 20 of the secondment support system 100 determines the number of secondment targets for which recovery work has not been completed, among the secondment targets included in the latest optimal secondment plan of the office A stored in the latest secondment plan DB 31. Count the number of incompletes where The output control unit 15 displays the dispatch plan screen 700 reflecting the latest incomplete number obtained by adding the newly added recovery target number to the counted incomplete number. Apparatus 2 is provided.

When the optimum secondment plan stored in the latest secondment plan DB 31 is updated, the search unit 12 updates the estimated completion time displayed in the basic information 701 in response to the operation of the latest button 702 to the updated one. It may be updated to the estimated completion time in the optimal secondment plan.

The secondment plan screen 700 may include a list box 703 indicating the secondment pattern for each group, that is, the combination of secondment targets assigned to the group and the order of secondment. The list box 703 may include the order of visits, property names for visits, and the like. Also, the list box 703 may reflect the work progress of each seconded target. In the illustrated example, the background color of the order of arrival is color-coded according to work progress. The work progress of each secondee is managed by the secondment arrangement system 20 .

The secondment plan screen 700 may include a map image 704 in which the information of the secondment target is reflected on the map. As an example, the map image 704 may reflect information about seconded targets assigned to a specific group selected on the seconded plan screen 700 . In the illustrated example, the group U list box 703 is selected. Therefore, on the map image 704, along with the boundary line representing the area in charge of Group U, the icon of the seconded target assigned to Group U may be plotted. A number indicating the order of dispatch may be assigned to the icon of the dispatch target.

By displaying the dispatch plan screen 700 as described above on the front-end system 1 or office device 2, the operator can grasp the progress of recovery work for each office in real time.

<Modification>
(Correction of estimated completion time)
If the number of workers in the group contributes to shortening the work time, the search unit 12 corrects the estimated completion time based on the earliest merging time predicted by the time prediction unit 161. good too.

For example, assume that the time prediction unit 161 predicts that one available worker will join a certain available group at the earliest joining time. In this case, the search unit 12 may shorten the work time for the dispatched target that the available group visits after the earliest joining time, based on the increase of one available worker. As a result, the estimated completion time is corrected to a time earlier than the initial prediction, and is calculated more accurately according to the actual number of workers in the group.

(Reduction of standby workers)
If the large number of workers in the group contributes to shortening the working time, the group determining unit 162 selects a group to which the available workers join according to the situation. A group different from the belonging may be determined.

In the first case where it is predetermined that worker O belongs to group B, worker O can handle recovery work, but the group leader of group B cannot handle recovery work. Assume that the seconded target is currently not assigned. In such a case, the group determining unit 162 may determine to join the available worker O to another available group. The group determination unit 162 may determine the available group to which the available worker O can join the earliest as the group to which the available worker O joins. The group determining unit 162 may determine the available group with the latest estimated completion time as the group to which the available worker O joins. The group determining unit 162 may determine the available group having the smallest number of available workers as the meeting destination group of the available worker O.

According to the above configuration, it is possible to reduce the number of workers who are forced to wait even though they are ready to participate in the recovery work because the group to which they belong is not a group that can respond.

(Leveling the number of workers among groups)
If the large number of workers in the group contributes to shortening the working time, the group determination unit 162 determines the number of available workers so as to equalize the number of available workers among the available groups. You can decide where to join.

For example, in the first case and the second case described in the first embodiment, while the available workers are joining the available groups, the group determination unit 162 determines that the number of available workers between the available groups exceeds a predetermined number. Suppose there is a bias of In this case, the group determining unit 162 may select the joining destination of the newly available worker from among the groups with relatively small number of members in the group.

According to the above configuration, it is possible to flexibly adjust the number of available workers in the group according to the situation, and as a result, it leads to leveling the estimated completion times among the groups.

〔effect〕
According to the dispatch planning system 10 of the present invention, even if a large number of events such as stoppages or failures occur simultaneously in a wide area due to a disaster such as an earthquake, the time when all recovery work by a plurality of work groups is completed can be determined. It is possible to draw up a dispatch plan to accelerate.

In addition, according to the dispatch planning system 10 of the present invention, it is possible to check the status of the workers engaged in the restoration work, and to generate a dispatch plan that matches the actual situation grasped from the situation of each worker. It becomes possible. As a result, it is possible to improve the accuracy of the secondment plan of the work group. In this way, it is possible to accurately instruct recovery work to each group or each worker according to an accurate secondment plan that takes into consideration the worker's situation.

In addition, it is possible to present the prospect of recovery to related parties by utilizing the estimated completion time obtained for each dispatch plan. For example, it is possible to provide the user or owner who is waiting for restoration of the restoration target with the estimated completion time obtained in the accurate dispatch plan that takes into consideration the situation of the worker. In addition, since the status of each worker is checked in a timely manner, it is possible to provide the user or owner with information such as the position and status of the group in charge of the restoration work to be restored. By presenting the prospect of recovery in this way, it is possible to give a sense of security to the user or owner of the recovery object.

As described above, the secondment planning system 10 of the present invention is a system that brings about an excellent effect of early recovery from a disaster with respect to facilities such as elevators that form the basis of life. Therefore, the secondment planning system 10 of the present invention can contribute to the development of high-quality infrastructure with excellent disaster mitigation or disaster prevention performance, and by extension, the Sustainable Development Goals (SDGs), such as Goal 11 ( We can contribute to the achievement of sustainable city development.

[Example of realization by software]
FIG. 16 is a block diagram showing an example of the hardware configuration of each device or system included in the maintenance system 1000. As shown in FIG.

The functions of one or a plurality of information processing devices that implement the secondment planning system 10 and the secondment arrangement system 20 can be implemented by a program that causes a computer to function as the information processing device. This program can be realized by a program for causing a computer to function as each control block of the information processing apparatus described above. The control blocks described above are, in particular, the information acquisition unit 11, the search unit 12, the travel time acquisition unit 13, the situation information acquisition unit 14, the output control unit 15, the joining support unit 16, the time prediction unit 161, and the group determination unit 162. is.

In this case, the information processing device includes a computer 910 having at least one control device (eg processor 911) and at least one storage device (eg memory 912) as hardware for executing the above program. . The memory 912 stores, for example, the program 921 as the above program. Each function described in the above-described embodiments is realized by executing a program using the above-described control device and storage device.

The program described above may be recorded on one or more computer-readable recording media (for example, the recording media 931) instead of being temporary. The recording medium may or may not be included in the information processing apparatus described above. In the latter case, the above program may be supplied to the information processing device via any wired or wireless transmission medium.

Also, part or all of the functions of each control block described above can be realized by a logic circuit. For example, an integrated circuit in which logic circuits functioning as the control blocks described above are formed is also included in the scope of the present invention. In addition, it is also possible to implement the functions of the control blocks described above, for example, by a quantum computer.

Further, each process described in the above embodiments may be executed by AI (Artificial Intelligence). In this case, the AI may operate on the control device, or may operate on another device (for example, an edge computer or a cloud server).

The present invention is not limited to the above-described embodiments, but can be modified in various ways within the scope of the claims, and can be obtained by appropriately combining technical means disclosed in different embodiments. is also included in the technical scope of the present invention.

1 front-end system 2 office equipment 3 terminal equipment (information terminal)
10 secondment planning system 11 information acquisition unit (recovery target information acquisition unit)
12 search unit 13 travel time acquisition unit 14 situation information acquisition unit 15 output control unit 16 joining support unit 31 latest dispatch plan database 33 worker database 161 time prediction unit 162 group determination unit 910 computer (information processing device)
911 processor (control device)
912 memory (storage device)
921 program 931 recording medium

Claims (20)

a recovery target information acquisition unit that acquires information about multiple recovery targets with different locations where an event requiring recovery work has occurred;
status information indicating the status of said workers for determining those of said workers who are capable of handling said recovery work, said status information including at least information for specifying when it is possible to start handling; a status information acquisition unit to acquire;
A responsive group that includes one or more workers who are determined to be responsive workers based on the situation information, among a plurality of groups composed of one or more workers and performing the recovery work. a search unit for searching for an optimal or quasi-optimal solution of a temporary transfer plan, in which a combination of temporary temporary transfer targets that are the recovery targets to which the individual is scheduled to be temporary transferred and an order of temporary transfer are defined for each of the available groups;
The search unit estimates completion of completion of restoration of all of the seconded target, which is estimated by considering at least a total travel time for seconding to the seconded target and a total work time required for the recovery work of the seconded target. A secondment planning system that searches for a relatively early secondment plan among a plurality of patterns of secondment plans with different times as the optimal secondment plan. 2. The secondment according to claim 1, wherein the search unit searches for the optimal secondment plan for the available group including the available worker whose response start time is now among the available workers. planning system. The search unit searches for the optimal dispatch plan for the available group including the available workers among the available workers whose response start time is within the period from the present to the predetermined time. The secondment planning system according to claim 1, wherein The group to which the worker belongs is predetermined,
The situation information further includes information that can identify the worker's current location,
a travel time acquisition unit that acquires travel time required for travel between points;
a time prediction unit that predicts the earliest joining time at which the available worker joins the available group to which the available worker belongs,
The time prediction unit predicts the current location of the available worker with a meeting point on a route along which the available groups traveling in the order of dispatch defined in the optimal seconding plan searched by the search unit as a destination. 4. The dispatch planning system according to any one of claims 1 to 3, wherein said earliest merging time is predicted based on said travel time required for travel to a departure point during said response start possible time. The situation information further includes information that can identify the worker's current location,
a travel time acquisition unit that acquires travel time required for travel between points;
a group determination unit that determines the available group to which the available workers join,
The group determining unit determines the current location of the available worker as a destination at a meeting point on a route along which the available groups who are dispatched in the order of dispatch determined in the optimal seconding plan searched by the search unit move. The available group whose earliest merging time predicted based on the travel time required to move from the starting point to the starting point at the available start time is relatively early among the available groups is selected as a merging destination. The secondment planning system according to any one of claims 1 to 3, which determines. A transportation means used by the worker is predetermined for each worker,
6. The dispatch planning system according to claim 4, wherein said travel time acquisition unit acquires said travel time according to the type of said means of transportation of said available worker. The status information further includes information indicating means of transportation available to the worker,
7. The dispatch planning system according to any one of claims 4 to 6, wherein said travel time acquisition unit acquires said travel time according to the type of said transportation indicated by said situation information of said available worker. 8. The dispatch planning system according to any one of claims 1 to 7, wherein in each of said available groups, at least one of said workers identified as said available workers is a predetermined leader. The situation information further includes information that can identify the worker's current location,
9. The personnel transfer planning system according to claim 8, wherein each of said plurality of patterns of said personnel transfer plans uses the current location of said leader as the starting point of said available group to which said leader belongs. Each of the groups belongs to one of the offices that perform maintenance for the restoration target,
9. The staffing planning system according to any one of claims 1 to 8, wherein each of said plurality of patterns of said staffing plans has a location of said office to which said serviceable group belongs as a starting point of said serviceable group. . The search unit excludes one or more restoration targets relatively distant from the starting point of the supportable group, among the recovery targets, from the transfer targets of the supportable group. 11. The secondment planning system according to claim 9 or 10, which searches for . The situation information further includes information indicating the worker's current location,
further comprising a travel time acquisition unit that acquires travel time required for travel between points,
Each of the plurality of patterns of the secondment plan is an arrival time predicted based on the travel time required when the leader travels from the current location to the business office as the destination during the time when the response can be started. 11. The temporary staffing planning system according to claim 10, dependent on claim 8, wherein the available group to which the leader belongs is seconded to none of the recovery targets. At the start of the search, the search unit includes the new available workers not included in the past optimal secondment plan, including the available workers determined based on the situation information acquired after the previous search. 13. The secondment planning system according to any one of claims 1 to 12, wherein when a group exists, said search is performed by adding said available group. The search unit estimates, for each of the available groups, a time at which the restoration work for the seconded target whose seconded order is the last is completed for each of the plurality of patterns of the seconded plans, and among the estimated times, 14. The secondment planning system according to any one of claims 1 to 13, wherein the latest time of is set as said estimated completion time. 15. The temporary transfer plan system according to any one of claims 1 to 14, wherein said search unit generates each of said plurality of patterns of temporary transfer plans by alternation of generations according to a genetic algorithm. The information about the recovery target includes information indicating whether or not the user is confined in the recovery target,
16. The seconding plan according to any one of claims 1 to 15, wherein the seconding target for whom confinement of a user has occurred is earlier than the seconding target for which confinement has not occurred. The secondment planning system according to item 1. The information about the recovery target includes information indicating whether or not the user is confined in the recovery target,
A recovery priority is associated with the recovery target,
17. The dispatching plan system according to claim 1, wherein the dispatching plan is such that the higher the recovery priority, the earlier the dispatching order of the dispatching targets for which no user confinement has occurred. . The recovery target is elevator equipment,
18. The travel planning system of any one of claims 1-17, wherein the event is an outage or failure of the elevator equipment. A control method executed by one or more information processing devices,
a recovery target information acquisition step of acquiring information on a plurality of recovery targets with different locations where an event requiring recovery work has occurred;
status information indicating the status of said workers for determining those of said workers who are capable of handling said recovery work, said status information including at least information for specifying when it is possible to start handling; a status information acquisition step to be acquired;
A responsive group that includes one or more workers who are determined to be responsive workers based on the situation information, among a plurality of groups composed of one or more workers and performing the recovery work. a search step of searching for an optimal seconding plan that is an optimal solution or a quasi-optimal solution of a seconding plan in which a combination of seconded targets that are the recovery targets to which the individual is scheduled to be seconded and the seconding order are determined for each of the available groups;
In the searching step, completion estimation of completion of restoration of all of the seconded targets is estimated by taking into account at least the total travel time for seconding to the seconded target and the total work time required for the recovery work of the seconded target. A control method of searching for a relatively early dispatch plan as the optimum dispatch plan among a plurality of patterns of dispatch plans with different times. 2. A program for causing a computer to function as the secondment planning system according to claim 1, the program for causing the computer to function as the recovery target information acquisition unit, the situation information acquisition unit, and the search unit.

Images