JPWO2018100716A1 - Movement planning apparatus, movement planning method, and program - Google Patents

Abstract

Provided are an apparatus, a method, a program, and the like for deriving a more efficient movement plan of a resource that moves to change the arrangement of resources. The movement planning device according to one aspect is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement, and is a candidate for a movement procedure for a movement target person who is a part or all of the plurality of resources. And a plurality of resources when the candidate is executed. The candidate derivation means for deriving the candidate and the evaluation of the derived candidate are identified based on the time taken for the movement target person to move to each destination. Calculation means for calculating on the basis of the change over time of the profit generated by, and output means for outputting information based on the evaluation.

Description

  The present disclosure relates to plans for making things efficient.

  In a system related to a specific profit, a problem that maximizes the profit generated is called an optimization problem or a mathematical programming problem, and calculation methods for the problem are widely applied.

  For example, in a system in which workers produce products by sharing multiple processes, calculation processing to derive the optimal allocation of workers in each process in order to maximize production efficiency, that is, product production volume, is It is one of mathematical programming problems. The above calculation process is particularly called a production plan or a staffing plan. As a document related to the production plan, Patent Document 1 discloses an apparatus that assigns work to workers engaged in cargo work in a distribution warehouse. Patent Document 2 describes a method for leveling the work amount of workers.

  On the other hand, as one of mathematical programming problems, a transportation problem is known which deals with the movement of an object and the optimization of efficiency. The transportation problem (or “transportation planning problem”) is a problem of finding a transportation plan that minimizes the cost of transporting goods, for example, in a system that transports goods to a plurality of supply destinations where there are consumers of the goods. For example, Non-Patent Document 1 and Non-Patent Document 2 have a description regarding a solution to the transportation problem.

JP 2002-31445 A JP-A-3-217967

F. L. Hitchcock, “The distribution of a product from several sources to numerous localities”, Journal of Mathematics and Physics, vol.20, pp.224-230, 1941. Rubner, Yossi et al., “The earth mover's distance as a metric for image retrieval”, International journal of computer vision vol.40, no.2, pp.99-121, 2000.

  Although the optimal staffing can be determined by the staffing plan, the problem of determining which staff and how to move in order to achieve that optimal staffing is another matter. In other words, it is also important to examine a method for moving personnel (movement plan, movement procedure) in order to realize a desired personnel arrangement.

  Transportation plans address issues related to the movement of goods, but generally aim to minimize the costs associated with the movement itself. Therefore, the solution handled in the transportation plan is not necessarily the solution method in which the efficiency of the entire system is optimal. For example, a general transportation plan is not calculated from the viewpoint of increasing the sum of the utilities at each supplier in a case where the utility at the supplier increases as goods are delivered to the supplier earlier. Alternatively, for example, the transportation plan does not consider losses other than the cost of the movement itself, which are caused by the movement of the worker.

  In other words, generally known transportation plans do not take into account the effects of moving resources (things and people) that change according to the travel time, so that in terms of the overall efficiency of the utility achieved as a whole. An optimal solution is not provided. In any related literature, there is a content that has been fully studied about the case where the movement time of a resource that is moved to change the arrangement of resources affects the profit and efficiency of the system (system) that receives the utility from the resource. There is no disclosure.

  An object of the present disclosure is to provide an apparatus, a method, a program, and the like for deriving a more efficient movement plan for resources that are moved to change the arrangement of resources.

  The movement planning apparatus according to one aspect of the present invention is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement, and movement of a movement target person who is a part or all of the plurality of resources. Candidate deriving means for deriving a candidate for the procedure, and the evaluation for the derived candidate is specified based on the time taken for the movement target person to move to each destination, the case where the candidate is executed Calculation means for calculating based on changes over time in profits generated by a plurality of resources, and output means for outputting information based on the evaluation.

  The movement planning method according to an aspect of the present invention is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement, and movement of a movement target person who is a part or all of the plurality of resources. A candidate for a procedure is derived, and the evaluation of the derived candidate is specified based on the time taken for the movement target person to move to each destination, and the plurality of resources when the candidate is executed The calculation is performed based on the change over time of the generated profit, and information based on the evaluation is output.

  A program according to an aspect of the present invention is a procedure for changing a placement of a plurality of resources from a first placement to a second placement on a computer. A candidate derivation process for deriving a candidate for a movement procedure and an evaluation of the derived candidate are identified based on the time taken for the movement target person to move to each destination, when the candidate is executed A calculation process for calculating based on a change with time of the profit generated by the plurality of resources and an output process for outputting information based on the evaluation are executed. This program is stored in a computer-readable storage medium.

  The movement planning device according to one aspect of the present invention is a part of the plurality of resources, which is a procedure for changing a combination of situations in which each of the plurality of resources is placed from the first combination to the second combination. Alternatively, candidate deriving means for deriving candidates for the transition procedure of the status of the migration target person who is all the members, and evaluating the derived candidate based on the time taken for the migration target person to transition to the destination of each status The computer includes a calculation unit that calculates, based on a change over time in profits generated by the plurality of resources when the candidate is executed, and an output unit that outputs information based on the evaluation.

  According to the present invention, it is possible to derive a more efficient plan for moving resources to change the arrangement of resources.

It is a block diagram which shows the structure of the movement planning apparatus which concerns on 1st Embodiment. It is a schematic diagram which shows the example of a structure of the work system of a 1st case. It is a schematic diagram which shows the relationship between a division and a work flow. It is a figure which illustrates efficiency information. It is a schematic diagram which illustrates the movement time between divisions. It is a figure which illustrates travel time information. It is a figure which illustrates excess / deficiency information. It is a figure which illustrates the concept of the calculation by a calculation part. It is a figure which shows the example of a display of a movement method. It is an example of the data of the tree structure showing the path | route derived | led-out by the candidate derivation | leading-out part. It is a flowchart which shows the example of the procedure which produces | generates the data of a tree structure as shown in FIG. It is a schematic diagram which illustrates the movement time between the divisions of a 2nd case. It is a figure which shows the efficiency information of a 2nd case. It is a figure which illustrates the concept of the calculation by the calculation part in a 2nd case. It is a schematic diagram which illustrates the movement time between divisions in a 3rd case, and the time until the change of the work efficiency of a process affects the following process. It is a figure which shows an example of the calculation of the calculation part in a 3rd case. It is a figure which shows an example of the calculation of the calculation part in a 3rd case. It is a figure which shows an example of the calculation of the calculation part in a 3rd case. It is a figure which shows the efficiency information of a 4th case. It is a figure which shows an example of calculation of the calculation part in a 4th case. It is a figure which illustrates the result of calculation of the calculation part in the 4th case. It is a schematic diagram which shows the structure of the example of the application environment of the movement planning apparatus which concerns on 2nd Embodiment. It is a figure which shows the movement time to each disaster location of each rescue team of a 5th case. It is a figure which shows the loss per unit time in each disaster location of a 5th case. It is a block diagram which shows the structure of the movement plan apparatus which concerns on 3rd Embodiment. It is a flowchart which shows the flow of operation | movement of the movement planning apparatus which concerns on 3rd Embodiment. It is a block diagram which shows the structure of the movement plan apparatus which concerns on a modification. It is a block diagram which shows the example of the hardware which comprises each part of each embodiment.

  In the present disclosure, deriving a movement method (movement plan, movement procedure) in which resources move so that the arrangement of resources becomes a target arrangement is referred to as a “movement plan”.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

<< First Embodiment >>
First, a first embodiment of the present invention will be described. In the first embodiment, a movement planning device 11 that performs a movement plan regarding the movement of a worker in an environment including a system in which work is performed by a worker in a factory or a warehouse is assumed. As will be described later in [[Supplement]], the assumed environment is an example, and there may be an embodiment in which the movement planning device 11 is applied to an environment other than the environment described in the present embodiment.

  The movement planning device 11 derives a method for moving a worker, that is, a plan of which worker moves to where. In particular, in the example described below, the movement planning device 11 derives a movement method that is expected to be better from the viewpoint of the efficiency of the entire system affected by the movement of workers.

  FIG. 1 is a block diagram showing the configuration of the movement planning device 11. The movement planning device 11 includes a condition acquisition unit 110, a candidate derivation unit 111, a calculation unit 112, and an output unit 113.

  The condition acquisition unit 110 acquires information for executing the movement plan. Hereinafter, the information for executing the movement plan is also referred to as “condition”.

  The candidate deriving unit 111 derives a candidate for the worker movement method based on the information acquired by the condition acquiring unit 110.

  The calculation unit 112 calculates the evaluation for each candidate derived by the candidate deriving unit 111. Evaluation is a measure of the validity of the candidate being adopted. That is, a candidate with higher evaluation is expected to be more suitable as a moving method to be adopted. For example, the evaluation is an index of the profit efficiency (productivity, etc.) obtained in the entire work process when the moving procedure is executed based on the candidate.

  The output unit 113 outputs information based on the calculation result by the calculation unit 112.

  Hereinafter, a specific example of processing of each unit of the movement planning device 11 will be described by taking a specific case that can be a target of movement planning by the movement planning device 11 as an example. The cases described below are examples for promoting understanding, and do not necessarily indicate that the movement planning device 11 is applied only to these cases. As long as the same effect is achieved, various conditions and assumptions may be different.

[First case]
In the first case, a work environment E1 in which a picking work in a delivery work in a warehouse is performed is exemplified. FIG. 2 is a schematic diagram illustrating an example of the configuration of the work environment E1.

  In the work environment E1 according to the first case, a work called picking is performed on the container 4 carried by the conveyor 3. There are four sections 5A, 5B, 5C, and 5D, and a worker 2 is assigned to each section. The worker 2 may be a person or a movable robot.

  The conveyor 3 is divided into a main line and a pull-in line. The main line transports the container 4 from compartment to compartment. The pull-in line is provided corresponding to each section and plays a role of allowing the container 4 to flow into each section. The container 4 is transferred to a downstream process via all the sections.

  When the container 4 arrives in each section, the worker 2 picks (designated) an item to be input into the container 4 from, for example, a shelf existing in the section, inspects it, and inputs it into the container 4. This picking work is a so-called picking-type picking work. After the item is put in, the worker 2 returns the container 4 to the main line of the conveyor 3. The container 4 into which the item has been loaded moves to the next section along the main line.

  FIG. 3 is a schematic diagram showing the relationship between sections and work flows in the work environment E1. As shown in FIG. 3, in the work environment E1, work is performed on the container 4 in each section in the order of the section 5A → the section 5B → the section 5C → the section 5D. In the first case, the process in each section is affected by the process in the previous section. That is, in each process, it is assumed that the worker 2 cannot perform work with an efficiency exceeding the work efficiency in the previous process.

  In the first case, the work efficiency in each process is immediately reflected in the next process.

  FIG. 4 is a diagram illustrating a table showing the work efficiency when the number of workers is sufficient and the work efficiency when the number of workers is insufficient in each section. Hereinafter, information indicating the relationship between the number of workers in each section and efficiency as shown in FIG. 4 is referred to as “efficiency information”. In the first case, when the number of workers is sufficient in any section, the work efficiency is “5” as long as the work efficiency of the upstream process is “5” or more, and the number of workers is If it is insufficient, the work efficiency is assumed to be “3”. The work efficiency is, for example, the number of containers 4 that can be processed per unit time. Other indicators may be used for work efficiency. However, in the following description, it is assumed that the greater the value indicating the work efficiency, the better the work efficiency.

  In the first case, when the worker moves from one section to another section, the movement takes time according to the relationship between the sections. FIG. 5 is a diagram illustrating time taken for movement between the sections. In FIG. 5, the numbers attached to the lines connecting the sections indicate the time required for movement between the sections (hereinafter referred to as “movement time”) (the unit is “minute”). For example, according to FIG. 5, the travel time between the sections 5A and 5B is 3 minutes. The travel time between the sections 5B and 5C and the travel time between the sections 5C and 5D are also 3 minutes. The movement time between the sections 5A and 5C and the movement time between the sections 5B and 5D are 5 minutes. The movement time between the sections 5A and 5D is 7 minutes. Such information regarding the time required for movement between the sections is referred to as movement time information. The travel time information may be information that indirectly indicates the travel time, such as a travel distance.

  In addition, the movement time in this embodiment is the time required for the worker to move, that is, to work while changing the section where the work is performed. That is, the movement time may include a time for stopping the work for the movement and a time for preparing the work at the movement destination.

  In the present embodiment, it is assumed that the movement time between the sections is constant regardless of the direction, but the movement time between the sections may be different depending on the direction.

  FIG. 6 is a table showing the relationship between the travel times described above. In the table of FIG. 6, the time (for example, the time required for the cell corresponding to the movement source section (for example, “5C”) and the movement destination section (for example, “5D”) to move from the movement source to the movement destination (for example, “3”). The unit of travel time is “minute”.

  Now, it is assumed that there are sections in which workers are excessive and sections in which workers are insufficient. FIG. 7 shows an example of information indicating the excess or deficiency of the number of workers in each section (hereinafter, “excess / deficiency information”). In the example of FIG. 7, the number of workers in excess or shortage is shown with a plus sign when excessive and a minus sign when shortage. According to the example of FIG. 7, one worker is insufficient in the section 5A, while one worker is excessive in the section 5D. Further, there is no excess or deficiency of workers in the sections 5B and 5C.

  The excess or deficiency is a deviation from the target number of workers. The target number of workers is, for example, the number of workers in each section in the most efficient worker arrangement. The target number of workers in the first case is the number of workers whose work efficiency is “5” in any section. That is, the state where one worker is insufficient is a state where the work efficiency becomes “5” when one worker is added. The state where there is an excess of one worker is a state where the work efficiency can be maintained at “5” even if one worker is reduced.

  When excess and deficiency as shown in FIG. 7 occurs, the work efficiency is “3” in the section 5A. Also, in the sections 5B, 5C, and 5D that are subsequent processes of the section 5A, the work efficiency of the section 5A is affected, and the work efficiency is “3”. In order to improve the efficiency of the entire process, it is desirable to move one worker in the section 5D to the section 5A.

  The information described above is information used for the movement plan by the movement planning device 11 applied to the first case.

  The condition acquisition unit 110 acquires various pieces of information described above as conditions. That is, the condition acquisition unit 110 obtains the workflow information illustrated in FIG. 3, the efficiency information illustrated in FIG. 5, the travel time information illustrated in FIG. 6, and the excess / deficiency information illustrated in FIG. get. The above information may be input in advance to the condition acquisition unit 110, or may be derived by the condition acquisition unit 110.

  For example, the condition acquisition unit 110 may acquire a condition from a management system that monitors the work environment E1. The management system is, for example, a system that monitors the arrangement of workers, the flow of the container 4, the inventory status of items put into the container 4, and the like using a monitoring camera or a computer. There may be an administrator who monitors the situation of the worker and gives instructions regarding the work to the worker. Part or all of the information used by the movement planning device 11 may be input by this administrator.

  In addition, for example, the condition acquisition unit 110 may specify the sections where the worker is excessive and the sections where the worker is insufficient based on the acquired information. In order for the condition acquisition unit 110 to identify the sections where workers are excessive and insufficient, the condition acquisition unit 110 may be input with the target arrangement and the current arrangement. The condition acquisition unit 110 may derive a target arrangement. The condition acquisition unit 110 may specify the most efficient worker arrangement as the target arrangement based on the number of all workers in the work environment E1 and the efficiency information. It should be noted that the most efficient worker arrangement can be specified by, for example, a known production planning method.

  When the information is complete, the candidate deriving unit 111 derives candidates for the worker movement method based on the acquired information.

== Derivation of candidates ==
The worker movement method derived by the candidate deriving unit 111 is a movement method that satisfies the following requirements.
・ Movement method that makes the number of workers the target number of workers in all sections.
-The number of workers moving from a section must not exceed the number of workers that can move in that section.

  The target number of workers is the number of workers whose excess or deficiency is “± 0”. Based on the example of the first case, the candidate deriving unit 111 derives a method for moving the worker so that one worker is decreased from the section 5D and one worker is added in the section 5A. The candidate deriving unit 111 may specify a section where the number of workers should be increased and a section where the number of workers should be decreased based on excess / deficiency information, or may be specified based on the current arrangement and efficiency information.

  In deriving the movement method by the candidate deriving unit 111, there is a restriction that the number of workers moving from a section does not exceed the number of workers that can move in the section. The number of workers that can be moved in each section is determined by the following method.

  Currently, the work in the section 5A is rate-limiting because there are not enough workers in the section 5A. The section 5A is a so-called bottleneck for the efficiency of the entire process. That is, the work efficiency of the section 5A also affects the sections 5B, 5C, and 5D. The excess and deficiency of workers in the sections 5B, 5C, and 5D are ± 0, ± 0, and +1 from FIG. 7, respectively, but until the workers in the section 5A that is the bottleneck are satisfied, There is a substantial excess of one more person. Therefore, the number of movable workers in the sections 5B, 5C, and 5D is one person, one person, and two persons, respectively. In other words, even if one person leaves the sections 5B and 5C, the work efficiency does not change, so that one person can move from the sections 5B and 5C. Even if two people leave the section 5D, the work efficiency does not change, so it is allowed to move two persons from the section 5D.

  That is, the number of movable workers in the first case is obtained, for example, as a number obtained by adding the absolute value of the number of workers deficient in the section in which the number of workers is short to the number of excess or deficiency in the section.

  As described above, the candidate deriving unit 111 counts workers who are in positions where there is no change in the number of workers before and after execution of the arrangement change as workers who may move.

  However, if the calculated number of movable workers exceeds the number of workers currently in the section, the number of workers that can be moved is the number of workers currently in the section. In the first case, it is assumed that the number of workers movable in each section calculated as described above does not exceed the number of workers currently in the section.

Under the above conditions, the candidate deriving unit 111 uses, for example, the following procedure to reduce the number of workers from the section 5D and increase the number of workers in the section 5A by one. Derive candidates.
(1) A route for connecting the section 5D, which is an excessive section, and the section 5A, which is an insufficient section, is derived. However, it must not go through a section where there are no movable workers. Do not go through the same section more than once.
The routes derived under the above rules are “5D → 5A”, “5D → 5B → 5A”, “5D → 5B → 5C → 5A”, “5D → 5C → 5A”, and “5D → 5C”. → 5B → 5A ”.
(2) A movement method is derived in which one worker moves to a next section of the route from a section other than the end point of the derived path.
That is,
-Based on the route “5D → 5A”, a movement method (I) in which one person moves from the section 5D to the section 5A is derived.
Based on the route “5D → 5B → 5A”, a movement method (II) in which one person moves from the section 5D to the section 5B and one person moves from the section 5B to the section 5A is derived.
-Based on the route “5D → 5B → 5C → 5A”, there is a movement method (III) in which one person moves from the sections 5D, 5B, and 5C to the sections 5B, 5C, and 5A, respectively. Derived.
Based on the route “5D → 5C → 5A”, a movement method (IV) is derived in which one person moves from the section 5D to the section 5C and one person moves from the section 5C to the section 5A.
-Based on the route “5D → 5C → 5B → 5A”, there is a movement method (V) in which one person moves from each of the sections 5D, 5C, and 5B to the sections 5C, 5B, and 5A. Derived.

  In addition, it is assumed that the movement of the worker in each movement method is performed simultaneously. Depending on the case, the candidate deriving unit 111 may derive a moving method in which the worker moves at different timings as another candidate. In the first case, since it is meaningless for the worker to move at different timings, the candidate deriving unit 111 does not have to derive a movement method including such movement.

The candidate deriving unit 111 may exclude, from the candidates, movement methods that are clearly inefficient among the derived movement methods. In the first case, the transfer method (III) is clearly inefficient. This is because one worker can move from the section 5B to the section 5A within the time when one person moves from the section 5C to the section 5A. For example, the procedure for one worker to move from section 5B to section 5C is step a1, the procedure for one worker to move from section 5C to section 5A is step a2, and one person moves from section 5B to section 5A. The procedure for moving the worker is referred to as procedure b. At this time, when the procedure a1 and the procedure a2 are performed at the same time as the procedure a and the procedure a and the procedure b are compared, if the time required for the procedure a2 is equal to or longer than the time required for the procedure b, Procedure a is a less efficient procedure than procedure b. The reason can be explained based on the following assumptions.
Assumption: When focusing on only one worker who moves to a certain destination, the earlier the worker arrives at the destination, the greater the benefit that the worker brings to the destination (at least , Not worse than slow). In other words, the shorter the movement time is, the better it is for a movement where the movement source and the movement destination are decided by one worker.
Based on this premise, the procedure a1 is less efficient than the fictitious procedure a3 of “moving from the section 5B to the section 5C in 0 seconds”. Therefore, the procedure a is less efficient than the procedure in which the procedure a2 and the fictitious procedure a3 are performed simultaneously. The procedure in which the fictitious procedure a3 and the procedure a2 are performed at the same time is an imaginary operation in which one worker moves from the section 5B to the section 5C in 0 second and then moves from the section 5C to the section 5A. This is equivalent to the procedure c. This fictitious procedure c is less efficient than procedure b. This is because the travel time from the section 5C to the section 5A is not shorter than the travel time from the section 5B to the section 5A.

  As described above, when the moving time from the second section to the first section is not longer than the moving time from the third section to the first section, “from the second section to the third section” A movement method including a movement procedure of “one worker moves and one worker moves from the third section to the first section” is clearly inefficient (ie, the highest evaluation). It is obvious that it is not a candidate). Therefore, the candidate deriving unit 111 may exclude such a movement method from the candidates. In the example of the first case, the candidate deriving unit 111 may exclude the movement method (III) from the candidates.

  The candidate deriving unit 111 may exclude, from the calculation, a route from which a movement method that is obviously inefficient is derived in the step of deriving the route. In other words, if the travel time from the previous section to reach a section included in the route is longer or the same as the time to move directly from the previous section to that section, such route It is not necessary to derive the movement method from. The candidate deriving unit 111 does not have to derive such a route itself.

  An example of a specific method for deriving a route while excluding a self-inefficient route will be described later in [5] of [[Supplement]].

  In accordance with the above, the movement methods derived as candidates by the candidate deriving unit 111 are the movement methods (I), (II), (IV), and (V).

== Evaluation calculation ==
The calculation unit 112 calculates the evaluation of each candidate that has been derived. For example, as an evaluation, the calculation unit 112 calculates the efficiency of the entire process at an arbitrary time including the time from the start of movement to the completion of movement. The calculation unit 112 uses excess / deficiency information, travel time information, and efficiency information illustrated in FIG. 4 when calculating efficiency.

  FIG. 8 is a diagram illustrating the concept of contents calculated by the calculation unit 112. As illustrated in FIG. 8, the calculation unit 112 derives, for each candidate, a change over time in the efficiency of the entire process when the candidate is adopted.

  In the “candidate” column of the table of FIG. 8, four candidates derived by the candidate deriving unit 111 are described. In the column of “work efficiency” in the table of FIG. 8, the work efficiency of the entire process is described for each elapsed time from the start of movement of the worker when each candidate is adopted.

  Candidate (1) is a moving method in which one worker moves from section 5D to section 5A. When the candidate (1) moving method is executed, the number of workers in the section 5A, which is the bottleneck, is satisfied seven minutes after the worker starts moving. For this reason, the working efficiency in 0 to 7 minutes is “3”. When 7 minutes have elapsed, the number of workers in the section 5A is satisfied and the movement is completed, so the work efficiency is improved to “5”.

  Candidate (2) is a moving method in which one person moves from section 5D to section 5B, and one person moves from section 5B to section 5A. In the candidate (2) movement method, the number of workers in the section 5A, which is the bottleneck, is satisfied three minutes after the start of the movement of the workers. For this reason, the work efficiency in 0 to 3 minutes is “3”. Although the number of workers in section 5A is satisfied when 3 minutes have elapsed, the number of workers in section 5B is temporarily short of one person. For this reason, the section 5B becomes a bottleneck, and the work efficiency remains “3” until the number of workers in the section 5B is satisfied. The movement for satisfying the number of workers in the section 5B is the movement of the worker from the section 5D to the section 5B, and this movement is completed after 5 minutes from the start of the movement. Therefore, the work efficiency in 3 to 5 minutes is “3”, and the work efficiency after 5 minutes is “5”.

  Candidate (3) is a moving method in which one person moves from section 5D to section 5C and one person moves from section 5C to section 5A. In the candidate (3) movement method, the number of workers in the section 5A, which is the bottleneck, is satisfied five minutes after the worker starts moving. For this reason, the working efficiency in 0 to 5 minutes is “3”. During this time, the movement from the section 5D to the section 5C is performed at the same time. However, since the section 5A that is the bottleneck does not change, this movement does not affect the work efficiency. Since the movement is completed after the elapse of 5 minutes (the movement from the section 5D to the section 5C is also completed), the subsequent work efficiency is improved to “5”.

  The candidate (4) is a moving method in which one person moves from the sections 5D, 5C, and 5B to the sections 5C, 5B, and 5A, respectively. In the candidate (4) movement method, the number of workers in the section 5A, which is the bottleneck, is satisfied three minutes after the worker starts moving. For this reason, the work efficiency in 0 to 3 minutes is “3”. During this time, the movement from the section 5D to the section 5C and the movement from the section 5C to the section 5B are performed at the same time. However, since the section 5A that is the bottleneck does not change, this movement affects the work efficiency. do not do. Since the movement is completed when 3 minutes have elapsed (the movement from the section 5D to the section 5C and the movement from the section 5C to the section 5B are completed), the subsequent work efficiency is improved to “5”.

  As described above, the calculation unit 112 calculates the work efficiency for at least 7 minutes after the start of movement for each candidate. Note that the work efficiency after 7 minutes is the same for all candidates.

  The calculation unit 112 may obtain an average of work efficiency for 7 minutes from the start of movement for each candidate. When the average is calculated for the above example, the efficiencies of candidates (1) to (4) are 3.00, 3.57, 3.57, and 4.14, respectively. This average of 7-minute work efficiency is an example of evaluation of each candidate.

== Output of results ==
The output unit 113 outputs information based on the evaluation calculated by the calculation unit 112 as a result of the calculation process by the movement planning device 11.

  For example, the output unit 113 may output a list of the derived candidates and the evaluation of each candidate. The output evaluation may be a second evaluation generated based on the first evaluation calculated by the calculation unit 112. For example, the second evaluation may be a deviation value of each candidate based on the value of the first evaluation of each candidate. The second evaluation may be a symbol determined according to the height of the first evaluation, such as “S” and “A”.

  For example, the output unit 113 may output information specifying the candidate with the highest evaluation among the derived candidates as the “movement method to be executed”. In the first case, since the efficiency of the candidate (4) is the highest, the output unit 113 outputs information specifying the candidate (4) movement method as “movement method to be executed”. For example, the output unit 113 displays the moving method of the candidate (4) via the screen. Thereby, for example, an administrator who manages the work environment E1 looks at the screen and recognizes the movement method derived by the movement planning device 11.

  FIG. 9 is an example of a moving method display by the output unit 113. For example, as illustrated in FIG. 9, the movement method is represented by a list of sets of a movement source section, a movement destination section, and the number of workers to be moved. In the example of FIG. 9, one person should move from the section 5D to the section 5C, one person should move from the section 5C to the section 5B, and one person moved from the section 5B to the section 5A. It is shown that it should be. In the example of FIG. 9, one worker in each of the sections 5 </ b> B, 5 </ b> C, and 5 </ b> D is a “moving target person”.

  The output unit 113 may display the movement method as instructed. For example, the output unit 113 may display a text such as “Move one person from the section 5D to the section 5C”.

  Information output by the output unit 113 may be displayed on a screen, printed on paper, by voice, or by flashing lights.

  A person who receives the output (for example, an administrator) can determine a worker to be moved in each section based on the output information, and can issue a movement instruction to the determined worker.

  The output unit 113 may output a worker identifier (name, identification number, etc.) instead of the number of workers to be moved. That is, the output unit 113 may specify a person to be moved. For example, the output unit 113 may derive one of the workers in the section 5B and display the worker identifier in association with the display of the section 5C. By determining the worker to be moved by the output unit 113, the burden on the administrator to select which worker should be moved can be reduced.

  The output unit 113 may directly output an instruction to the worker so that the worker moves according to the derived movement plan. For example, the output unit 113 may instruct one of the workers in the section 5D to move to the section 5C. As the instruction method, various forms such as display of an identifier on a monitor installed in a section, instruction by voice, and output of information to an apparatus individually owned by a worker can be adopted. When the output unit 113 directly instructs the worker, the administrator does not need to select which worker is to be moved.

<Effect>
The movement planning apparatus 11 can derive an optimum movement method from the viewpoint of the efficiency of the entire process.

  Usually, when an operator leaves a section with movement, the work efficiency of the section decreases. However, if a bottleneck exists, the temporary work efficiency may not change even if the worker leaves. The movement planning apparatus 11 in the first case moves a section even if the section is not excessive, if it is determined that there is no influence on the entire process by temporarily reducing workers from the section. Extracted as a section where possible workers exist. Specifically, for example, the movement planning device 11 determines the number of movable workers in a section where the number of workers is not insufficient based on the number of insufficient sections. By doing so, the movement planning device 11 can derive a variety of worker movement methods for eliminating the shortage of workers.

  Then, the movement planning device 11 can devise an optimal movement method based on the work efficiency in a state where the movement method is being executed, that is, a so-called transient state. The reason is that the calculation unit 112 calculates the evaluation for each derived candidate by calculating the work efficiency during the execution of the movement method based on the efficiency information. The output unit 113 outputs the movement method based on the evaluation, so that the worker can move by the most efficient movement method.

  In particular, in an environment where work is continuously performed, the longer the time is spent in deriving the movement method, the longer the situation where work efficiency is poor. It is expected that the movement planning device 11 can derive an appropriate movement method in a sufficiently short time in such a situation. That is, according to the movement plan apparatus 11, the remarkable effect that a worker's movement can be appropriately controlled in real time especially with respect to the process in which work is in progress can be produced.

[[Supplement]]
[1] Aspect of Calculation Target In the first case, an environment including a system in which picking picking is performed is given as an example of the work environment E1, but the environment that the movement planning device 11 is subject to moving planning is a picking type. It is not limited to the environment including the system where picking is performed.

  For example, in a system in which relay-type picking is performed and a system in which cart-type picking is performed, the efficiency of the entire process changes depending on the method of moving the worker. Therefore, even in an environment including such a system, by applying the movement planning device 11, it is possible to provide a movement method in which the work efficiency of the entire process is more appropriate when the workers are rearranged.

  In addition, for various environments including multiple processes such as warehouse entry, factory production and assembly processes, plant production, loading and unloading at ports, and supply chain management including truck loading and unloading. The movement planning device 11 can be applied.

  That is, the movement planning device 11 may be applied to any case similar to the case described in the present disclosure.

[2] Evaluation The evaluation calculated by the calculation unit 112 is not limited to a numerical value that directly indicates work efficiency. For example, the calculation unit 112 may calculate the number of containers 4 in which the work of each section is completed in 7 minutes as an evaluation.

  In the first case, since it is premised that the work efficiency of the upstream process is immediately reflected in the downstream process, the work efficiency is high and the number of workers in all the sections is the target arrangement. Fast time is essentially equivalent. Therefore, the calculation unit 112 may obtain, for example, the reciprocal of the time taken for the number of workers in all the sections to be the target number of workers as the evaluation. Also in this case, it can be said that the higher the evaluation, that is, the shorter the time, the better the efficiency.

[3] Case where there are excess or deficiency of two or more persons In the first case, there is exemplified a case where the number of excessive workers and the number of insufficient workers are one each. An example of a candidate derivation method by the candidate derivation unit 111 in the case where there are two or more excess workers and two or less workers will be described.

  For example, the candidate deriving unit 111 may regard a problem that eliminates excess and deficiency as a combination of two or more problems that eliminate excess and deficiency. Specifically, it is as follows.

  As an example, in the work environment E1, it is assumed that one worker is insufficient in each of the sections 5A and 5B, and one worker is excessive in each of the sections 5C and 5D. Information representing such an excess / deficiency situation is used as the original excess / deficiency information.

  In this case, the candidate deriving unit 111 divides the original excess / deficiency information. That is, the candidate deriving unit 111 uses, for example, the original excess / deficiency information, the excess / deficiency information that “one worker is insufficient in the section 5A and one person is excessive in the section 5C”, and “the operation in the section 5B is performed. It is divided into excess and deficiency information that “there is a shortage of one person and an excess of one person in the section 5D”. Further, the candidate deriving unit 111 further converts the original excess / deficiency information into the excess / deficiency information that “one worker is insufficient in the section 5A and one person is excessive in the section 5D”, and “the worker is included in the section 5B. It is divided into excess and deficiency information that “one person is insufficient and one person is excessive in the section 5C”.

  The candidate deriving unit 111 derives a movement method based on each of the divided excess / deficiency information. The derivation method described above can be applied to the derivation of the movement method for the divided excess / deficiency information. Thereafter, the candidate derivation unit 111 creates a candidate for a movement method by combining the derived movement methods. Specifically, it is as follows.

  From the excess / deficiency information that “one worker is insufficient in the section 5A and one worker is excessive in the section 5C”, the movement method (1) 5C → 5A and (2) 5C → 5B, 5B → 5A Derived. From the excess / deficiency information that “one worker is insufficient in section 5B and one worker is excessive in section 5D”, the movement method (1) 5D → 5B, (2) 5D → 5A, 5A → 5B, ( 3) 5D → 5C, 5C → 5B and (4) 5D → 5C, 5C → 5A, 5A → 5B are derived. In the derivation of the above-mentioned route, the obviously inefficient route is excluded.

When the derived movement methods are combined, the following candidates (C1) to (C8) are obtained.
(C1) 5C → 5A, 5D → 5B
(C2) 5C → 5A, 5D → 5A, 5A → 5B
(C3) 5C → 5A, 5D → 5C, 5C → 5B
(C4) 5C → 5A, 5D → 5C, 5C → 5A, 5A → 5B
(C5) 5C → 5B, 5B → 5A, 5D → 5B
(C6) 5C → 5B, 5B → 5A, 5D → 5A, 5A → 5B
(C7) 5C → 5B, 5B → 5A, 5D → 5C, 5C → 5B
(C8) 5C → 5B, 5B → 5A, 5D → 5C, 5C → 5A, 5A → 5B
However, the candidates (C6) and (C8) include “5B → 5A” and “5A → 5B” at the same time, and the execution of this moving method is meaningless. Therefore, the candidate derivation unit 111 may exclude candidates (C6) and (C8) from the candidates.

  On the other hand, from the excess / deficiency information that “one worker is insufficient in the partition 5A and one worker is excessive in the partition 5D”, the movement method (1) 5D → 5A, (2) 5D → 5B, 5B → 5A , (3) 5D → 5C, 5C → 5A, and (4) 5D → 5C, 5C → 5B, 5B → 5A. The movement method (1) 5C → 5B is derived from the excess / deficiency information that “one worker is insufficient in the section 5B and one person is excessive in the section 5C”.

When the derived movement methods are combined, the following candidates (C9) to (C12) are obtained.
(C9) 5D → 5A, 5C → 5B
(C10) 5D → 5B, 5B → 5A, 5C → 5B
(C11) 5D → 5C, 5C → 5A, 5C → 5B
(C12) 5D → 5C, 5C → 5B, 5B → 5A, 5C → 5B
However, the candidate (C10) is the same as the candidate (C5), the candidate (C11) is the same as the candidate (C3), and the candidate (C12) is the same as the candidate (C7). Therefore, the candidate deriving unit 111 may exclude candidates (C10) to (C12) from the candidates. From the above, the derived candidates are seven (C1) to (C5), (C7), and (C9).

[4] Candidates to be derived The candidate derivation unit 111 does not necessarily have to derive all the movement methods that are most likely to be evaluated. In particular, in the case where the number of candidates is enormous, an upper limit may be provided for the number of movement methods derived by the candidate deriving unit 111 in order to reduce the time required for processing of each unit. That is, for example, the candidate deriving unit 111 may derive a predetermined number of movement methods.

  When the candidate deriving unit 111 derives all the movement methods that are most likely to be evaluated, the movement planning device 11 can derive the movement method having the highest evaluation. If the evaluation is an index of efficiency, the movement planning device 11 can derive the most efficient movement method.

  On the other hand, when the candidate deriving unit 111 derives a predetermined number of moving methods, the efficiency of the arrangement change based on the candidate with the highest evaluation among the derived candidates is not necessarily the best, but to some extent Expected to be good. This is because it can be said that there are at least one candidate whose evaluation is lower than that of the candidate, which is one less than the predetermined number. In other words, even in this case, it is sufficiently expected that the movement planning device 11 has an effect of obtaining a moving method that is somewhat efficient in a short time enough to continuously control the ongoing work system. can do.

[5] Route Derivation Method As already described, the candidate deriving unit 111 determines whether a candidate has an excessive section (hereinafter, “excess section”) and a short section (hereinafter, “insufficient section”). )) May be derived, and a movement method may be derived based on the route. A detailed example of the route deriving method will be described below.

  The route derived by the candidate deriving unit 111 can be represented by data having a tree structure as shown in FIG. 10 as an example. The data shown in FIG. 10 is a tree in which a shortage partition is a root node, all leaf nodes are excess partitions, and a node that is neither a shortage nor an excess partition is a node that connects a root node and a leaf node. With structure. The data shown in FIG. 10 represents four routes derived by the candidate deriving unit 111 in the first case example. For example, in data having a tree structure as shown in FIG. 10, a path from an arbitrary leaf node to a root node means one derived path. For example, the route “5D → 5C → 5B → 5A” is specified by tracing from the leftmost “5D” leaf node to the root node “5A”. That is, in such a tree structure, the parent node means the next movement destination, and the child node means the movement source of the worker who moves to the parent node. Note that all routes starting from different leaf nodes are different routes.

  The candidate deriving unit 111 may derive all the routes except the obviously inefficient route. Hereinafter, such a derivation method will be described. In the following, a method for deriving a route will be described by way of example in comparison with a procedure for generating data having a tree structure as shown in FIG. 10. The path may be derived by another algorithm that does not generate structural data.

  FIG. 11 is a flowchart showing an example of a procedure for generating data having a tree structure as shown in FIG. Note that the procedure described in this disclosure is merely an example, and may be changed as appropriate.

  First, the candidate deriving unit 111 identifies an excess partition and a lack partition (step S111). The excess and deficiency and the deficiency section can be identified from the excess and deficiency information, for example. Based on the example of the first case, the excess partition is the partition 5D, and the insufficient partition is the partition 5A.

  Next, the candidate deriving unit 111 identifies a section where the number of movable workers is one or more (step S112). In the subsequent processing, the “partition” that can be a node other than the root node is the section identified in the process of step S112. That is, the section specified here is a section that may be included in the extracted route.

  Next, the candidate deriving unit 111 sets the insufficient partition identified in step S111 as a root node (step S113).

  Then, the candidate deriving unit 111 generates a proximity partition of the insufficient partition and an excess partition as child nodes of the root node (step S114). This process is a process for identifying the movement source of the worker moving toward the root node (shortage section). In this description, “adjacent section of section X” is a section closer to the section X than the excess section, that is, a section whose travel time to the section X is shorter than the travel time from the excess section to the section X. Based on the example of the first case, the travel time from the section 5B to the shortage section 5A is shorter than the travel time from the excess section 5D to the shortage section 5A. Therefore, the section 5B is an adjacent section of the insufficient section 5A. The section 5C is also an adjacent section of the insufficient section 5A. Therefore, in the example of the first case, the candidate derivation unit 111 generates the sections 5B and 5C that are adjacent sections of the insufficient section and the section 5D that is the excess section as child nodes of the root node. That is, by this process, the candidate of the worker who moves to the section 5A is specified as the worker who is in the section 5B, 5C, or 5D.

  Next, the candidate deriving unit 111 generates an empty exclusion list for each of the generated child nodes other than the excess partition (step S115). The exclusion list is a list of partition identifiers respectively associated with nodes other than excess partitions. The exclusion list is used in processing from step S118 to step S120 described later. The exclusion list is a list of partition identifiers that are not child nodes of the partition having the exclusion list.

  Next, the candidate deriving unit 111 determines whether all the leaf nodes are excessive sections (step S116). If all the leaf nodes are excessive sections (YES in step S116), the tree structure is complete (derivation of all paths has been completed), so the candidate derivation unit 111 performs tree structure generation processing. Exit. If there is a leaf node that is not an excessive partition (NO in step S116), the process proceeds to step S117. That is, as long as there is a leaf node that is not an excessive partition, the candidate derivation unit 111 performs the processing after step S117. In the example of the first case, the leaf nodes that are not excessive partitions at this time are “5B” and “5C” which are child nodes of the root node.

  In step S117, the candidate derivation unit 111 selects a leaf node that is not an excessive partition. When there are a plurality of leaf nodes that are not excessive partitions, the candidate derivation unit 111 selects one of the plurality of leaf nodes. The selection method may be a method based on an arbitrary algorithm, such as a selection method based on random numbers, a selection method based on the depth of a node, a movement time between parent nodes, and the like. For example, the candidate deriving unit 111 may select a leaf node having the deepest depth among the leaf nodes that are not excessive partitions and having the longest movement time with the parent node. For example, it is assumed that the candidate deriving unit 111 selects “5C” that is a child node of the root node.

  Then, the candidate derivation unit 111 excludes the selected node from the adjacent nodes of the selected node, the identifier of the partition closer to the parent node than the selected node, and the identifier of the selected node. It adds to the list (step S118). In this example, the adjacent section of the section “5C” indicated by the selected node is “5B”, and the section 5B is closer to the parent node (section 5A) than the section 5C. Therefore, the candidate deriving unit 111 adds the identifier of the section 5B to the exclusion list of the selected node. In addition, the candidate deriving unit 111 also adds the identifier of the section (section 5C) indicated by the selected node to the exclusion list of the selected node.

  Then, the candidate deriving unit 111 generates, as a child node of the selected node, an adjacent partition (if any) of the selected node that does not have an identifier in the exclusion list of the selected node and an excess partition. (Step S119). In this example, the adjacent partition of the selected node is the partition 5B, but since the identifiers of the partition 5B and the partition 5C are described in the exclusion list of the selected node, the partition 5B is not generated as a child node. . The candidate derivation unit 111 generates only the excess partition 5D as a child node of the selected node.

  Then, the candidate deriving unit 111 generates an exclusion list having the same contents as the exclusion list of the selected node for each of the generated child nodes other than the excess partition (step S120). However, this process may be omitted if there is no generated child node other than the excess partition.

  Thereafter, the process returns to step S116.

  In this way, the candidate deriving unit 111 repeats the processing from step S116 to step S120 until all leaf nodes become excessive sections.

  Thereby, data having a tree structure as shown in FIG. 10 is generated. This data structure represents the route derived by the candidate deriving unit 111. The path represented by the data of this tree structure does not include an obviously inefficient path (for example, “5D → 5B → 5C → 5A” in the first case). This is because, in step S118, the identifier of a partition closer to the parent node than the selected node among the adjacent partitions of the selected node is added to the exclusion list. By this process, when the travel time from the second partition to the first partition is not longer than the travel time from the third partition to the first partition, the second partition passes through the third partition. The route to move to the first partition is not derived. The reason why such a route is obviously inefficient is as already described in the explanation of “== candidate derivation ==”.

  In other words, all the paths represented by the data in this tree structure are obviously inefficient paths. In other words, the path represented by the data of this tree structure always has a shorter moving time from the previous section of any section included in the path than the time required to move directly from the previous section to that arbitrary section. It is a route like this.

  Since the inefficient route is not derived obviously, the derived route and candidates can be reduced, and the processing time is shortened.

  In the process illustrated in FIG. 11, the candidate deriving unit 111 can derive all routes that are obviously not inefficient by the determination in step S <b> 116. As a modification, the candidate deriving unit 111 may derive a predetermined number of routes. That is, the determination in step S <b> 116 may be changed to the determination “whether the predetermined number of leaf nodes is an excessive partition”. Even in this case, calculation resources can be devoted to candidates that are expected to have a higher evaluation by not deriving an inefficient route.

  By searching for a route as described above, the candidate deriving unit 111 can derive a candidate that is most likely to be evaluated while omitting unnecessary processing. Even when the candidate deriving unit 111 does not derive all routes, a candidate that is expected to have a higher evaluation can be derived.

[6] Modification The movement planning device 11 may include a movement method reception unit that receives a movement method.
For example, the movement method reception unit receives an input of a movement method from a manager of the work environment. The input movement method is, for example, a movement method planned by the manager of the work environment.

  In this case, the calculation unit 112 calculates the evaluation of the accepted movement method. When the movement method reception unit receives a plurality of movement methods, the evaluation of each movement method is calculated. The output unit 113 outputs an evaluation of the accepted movement method. When evaluation of a plurality of movement methods is calculated, the output unit 113 may output each evaluation, or may output information that clearly indicates the movement method having the highest evaluation.

  With such a configuration, the person who has input the movement method to the movement planning device 11 can know the evaluation of the input movement method. When a plurality of movement methods are input, it is possible to know the movement method having the highest evaluation among them.

  The candidate deriving unit 111 may derive one or more other movement methods that give the same movement result as the accepted movement method. For example, if the accepted movement method is that one person moves from the section 5D to the section 5B, the number of workers in the section 5D decreases by one, and the number of workers in the section 5B increases by one. Another movement method may be derived. Then, the calculation unit 112 may calculate the evaluation of the movement method derived by the candidate derivation unit 111. When the evaluation of the derived movement method is higher than the evaluation of the accepted movement method, the output unit 113 may output information indicating the derived movement method.

  With such a configuration, a person who has input a movement method to the movement planning device 11 can know a movement method that is higher in evaluation than the input movement method, that is, more efficient.

  When all of the evaluations of the plurality of movement methods derived by the candidate deriving unit 111 are the same or lower than the evaluations of the accepted movement methods, the output unit 113 displays the number of the derived movement methods and the number of the movement methods. Information indicating that the evaluation did not exceed the evaluation of the accepted movement method may be output. The output unit 113 may output information indicating a deviation value of evaluation of the accepted movement method. In this case, the person who has input the movement method to the movement planning device 11 can know that the input movement method is a movement method that is efficient to some extent.

[Second case]
In the example shown in the first case, the candidate with the highest work efficiency value can be said to be the candidate with the shortest time until the excess or deficiency is resolved. However, when the work efficiency when there is a shortage of workers is different for each section, the candidate with the highest work efficiency value is not necessarily the same as the candidate with the shortest time until the excess or deficiency is resolved.

  In the second case, it is assumed that the work efficiency is different for each section. The configuration of the work environment E2 according to the second case may be the same as the configuration of the work environment E1. That is, conditions such as work contents and work flow may be the same as those in the first case. However, in the second case, the travel time information and the efficiency information are different from the travel time information and the efficiency information in the first case.

  FIG. 12 is a schematic diagram showing the movement time between the sections in the second case. According to FIG. 12, for example, the movement time between the sections 5D and 5B is 6 minutes, and the movement time between the sections 5C and 5A is 4 minutes.

  FIG. 13 is a diagram showing efficiency information in each section in the second case. In the second case, as shown in FIG. 13, the work efficiency when the number of workers is insufficient in the section 5A is “3”, while the work efficiency when the number of workers is insufficient in the sections 5B, 5C, and 5D is “4”. Is.

  An example of processing of the movement planning device 11 in the above example will be described below.

  First, the condition acquisition unit 110 acquires information necessary for the movement plan. That is, in the second case, the condition acquisition unit 110 performs the flow information illustrated in FIG. 3, the excess / shortage information illustrated in FIG. 7, the travel time information illustrated in FIG. 12, and the efficiency illustrated in FIG. Get information.

The candidate deriving unit 111 derives candidates for a movement method that improves the efficiency of the entire process (that is, eliminates excess or deficiency) based on the acquired information. The candidate derivation method may be the same as the derivation method described in the first case, for example. According to the derivation method described in the first case, the candidate derivation unit 111 derives the following four candidates.
Candidate (1): One worker moves from section 5D to section 5A.
Candidate (2): One person moves from the section 5D to the section 5B, and one person moves from the section 5B to the section 5A.
Candidate (3): One person moves from the section 5D to the section 5C, and one person moves from the section 5C to the section 5A.
Candidate (4): One person from each of the sections 5D, 5C, and 5B moves to the sections 5C, 5B, and 5A, respectively.

  When candidates are derived, the calculation unit 112 calculates an evaluation for each candidate.

  FIG. 14 is a diagram illustrating an example of calculation performed by the calculation unit 112. In the leftmost column of the table of FIG. 14, four candidates derived by the candidate deriving unit 111 are shown. As shown in the column “work efficiency” in the table of FIG. 14, the calculation unit 112 derives a change in work efficiency with time for each candidate.

  In the case of candidate (1), the work in the section 5A is a bottleneck until one worker from the section 5D reaches the section 5A. Therefore, the work efficiency from the start of movement to 5 minutes is “3”, and the work efficiency after 5 minutes is “5”.

  In the case of candidate (2), the work efficiency of the section 5A is improved after 2 minutes by the movement of the worker from the section 5B. However, since one worker is insufficient in the section 5B, the work efficiency is “4” from 2 minutes to 6 minutes later. Since one worker from the section 5D reaches the section 5B six minutes after the start of the movement, the work efficiency becomes “5” after six minutes.

  In the case of candidate (3), the work efficiency of the section 5A is improved after 4 minutes by the movement of the worker from the section 5C. At this point, since the movement of the worker from the section 5D to the section 5C has already been completed, the work efficiency becomes “5” after 4 minutes.

  In the case of the candidate (4), the work efficiency of the section 5A is improved after 2 minutes by the movement of the worker from the section 5B. However, since there is a shortage of one worker in the section 5B, the work efficiency is “4” from 2 minutes to 5 minutes later. Five minutes after the start of movement, one worker from the section 5C reaches the section 5B, and the state where the section 5B is a bottleneck is eliminated. At this point, since the movement of the worker from the section 5D to the section 5C has already been completed, the work efficiency becomes “5” after five minutes.

  From the above, for any candidate, the efficiency of the entire process becomes optimal after 6 minutes. Accordingly, the calculation unit 112 obtains an average of work efficiency from, for example, 6 minutes after the start of movement. As shown in the table of FIG. 14, the averages of the working efficiencies of the candidates (1) to (4) are 3.33, 3.67, 3.67, and 3.83, respectively. Therefore, it can be seen that the most efficient movement method is the candidate (4) movement method.

  The output unit 113 outputs information based on the calculation result of the calculation unit 112 as in the first case. For example, the output unit 113 may extract the candidate (4) movement method that is the most efficient movement method as the “movement method to be executed”.

  Thereby, the worker in the work environment E2 can move to eliminate excess and deficiency by the most efficient moving method.

  Incidentally, the candidate (4) identified as the most efficient moving method in the second case is not the moving method that solves the excess or deficiency the earliest, nor is the moving method that minimizes the total movement time of the workers. In the second case, the moving method that solves the excess or deficiency earliest is the candidate (3). As described above, the most efficient moving method and the moving method that solves the excess or deficiency earliest may not always coincide. Even in such a case, the movement planning device 11 can derive the most efficient movement method.

[[Supplement]]
The work flow illustrated in FIG. 3 may include a parallel process. The parallel process is a plurality of processes that are not dependent on each other. For example, when the process immediately after the work process in the section 5A and the process immediately after the work process in the section 5B are both work processes in the section 5C, the work process in the section 5A and the work process in the section 5B are parallel. It is a process. In this case, even if the work efficiency in the section 5A is “5”, if the work efficiency in the section 5B is “4”, the work efficiency in the section 5C is “4”. In other words, the work efficiency of the process downstream of the parallel process depends on the work efficiency of the process having the lowest work efficiency among the parallel processes. The movement planning device 11 can perform the same processing as the above-described processing based on the flow work information including a process having such a rule.

[Third case]
In the case described above, a premise is set that a change in work efficiency in each section is immediately reflected in the next process. In the third case, it is assumed that the change in work efficiency in each section is reflected in the next step after a predetermined time.

  The configuration of the work environment E3 according to the third case may be the same as the configuration of the work environment E1. That is, conditions such as work flow and efficiency information in the third case may be the same as the conditions in the first case.

  In the third case, the condition for the movement time between the sections is different from the condition in the first case. The third case is different from the first case in that information on the time until the subsequent process is affected when the work efficiency changes is included in the conditions of the movement plan.

  FIG. 15 is a schematic view illustrating the movement time between the sections and the time until the change in the work efficiency of the process in each section affects the next process. In FIG. 15, the numbers attached to the curves connecting the sections indicate the time (unit: “minute”) required to move between the sections. Also, the number written over the arrow from the section to the section indicates the time until the change in work efficiency in the section at the start point of the arrow affects the work efficiency in the section at the end point of the arrow. For example, according to FIG. 15, the time until the change in the work efficiency in the section 5A affects the work efficiency in the section 5B is 1 minute.

  Now, it is assumed that one worker is insufficient in the section 5A, and one worker is excessive in the section 5D. In this case, a specific procedure will be described in which the movement planning device 11 performs a movement plan for eliminating excess and deficiency.

  The condition acquisition unit 110 acquires information necessary for the movement plan.

  Candidate deriving unit 111 derives a candidate for a movement method based on the acquired information. The method of deriving the movement method may be the same as the method described in the description of the first case. The candidate deriving unit 111 derives four moving methods (same as the first case candidates) as moving method candidates.

  The calculation unit 112 calculates an evaluation for each derived candidate. The evaluation is, for example, an average of work efficiency for 10 minutes from the start of movement. At this time, the calculation unit 112 also uses the time until the work efficiency affects the next process for the calculation. Specifically, the calculation unit 112 performs the calculation in the following manner.

  Taking the candidate (1) as an example, the calculation method by the calculation unit 112 is illustrated. FIG. 16 is a diagram illustrating the concept of efficiency calculation for candidate (1). For example, as shown in FIG. 16, the calculation unit 112 calculates the production efficiency per minute.

  The numbers in the top column of the table indicate the elapsed time from the start of movement. Hereinafter, for convenience of explanation, “t” is defined as a variable representing elapsed time. In order to calculate the production efficiency per minute, the calculation unit 112 specifies the “over or shortage number” and “bottleneck” of workers in each area every minute. Note that, in the bottom column of the table of FIG. 16, information on the moving worker is shown as a reference.

  The outline of the calculation will be described with reference to the table of FIG. When the candidate (1) is adopted, one worker moves from the section 5D to the section 5A. Since the moving worker reaches the section 5A after 7 minutes, the excess / shortage number of the section 5A changes to “−1” from the start of the movement until 7 minutes (t = 0 to 7). do not do. During this time, the bottleneck is the section 5A, and thus the work efficiency is “3”. After 7 minutes, the excess / deficiency of the section 5A changes to “± 0”. However, since it takes one minute for the work efficiency improved in the section 5A to be reflected in the section 5B, the work efficiency of the entire process (the work efficiency in the section 5D) does not change. In the “bottleneck” column, “5A → 5B” is written, which indicates that the work efficiency of the section 5A has been improved, but before the work efficiency of the section 5A is reflected in 5B. Between t = 7 and t = 9, the movement of the worker is completed, but the change in work efficiency does not affect the section 5D, so the work efficiency remains “3”. Finally, at t = 10, the change in the work efficiency of the section 5A is reflected in the section 5D, and the bottleneck is completely eliminated. That is, “none” is written in the cell corresponding to “bottleneck” in the column of t = “10”, and the work efficiency is “5”.

  FIG. 17 is a diagram illustrating the concept of efficiency calculation for candidate (2). When candidate (2) is adopted, one worker moves from the block 5B to the block 5A over 3 minutes, and one worker moves from the block 5D to the block 5B over 5 minutes. Therefore, until 3 minutes after the start of movement, the number of the section 5A and the section 5B is insufficient, and the bottleneck is the section 5A. After 3 minutes, the number of workers in section 5A is satisfied. Therefore, the bottleneck is “5A → 5B”. In t = 4-5, since the number of workers in the section 5B is still insufficient, the section 5B becomes a bottleneck. At t = 5, the movement of the worker from the section 5D to the section 5B is completed, and the section 5B is no longer a bottleneck. Thereafter, the change in work efficiency in the section 5B is reflected in the section 5D over 2 minutes, and the bottleneck is completely eliminated at t = 7. That is, the working efficiency is “5” from t = 7.

  FIG. 18 is a diagram illustrating the concept of calculating efficiency for the candidate (4). When the candidate (4) is adopted, the movement from the section 5D to the section 5C takes 7 minutes. Therefore, until the time t = 6, the section 5C becomes a bottleneck even if the work efficiency of the sections 5A and 5B is improved. The work efficiency of the section 5C is improved at t = 7, and the improved work efficiency is reflected in the section 5D at t = 8. Therefore, the working efficiency is “5” from t = 8.

  Similarly, in the case of the candidate (3), the working efficiency is “3” from t = 7 to “5” from t = 8.

  According to the above calculation, the time required to reach the target arrangement is 10 minutes at the longest. For example, as an evaluation of each candidate, the calculation unit 112 calculates an average of efficiency for 10 minutes from the start of movement. Then, the evaluations of candidates (1) to (4) are calculated as 3.0, 3.6, 3.4, and 3.4, respectively.

  Therefore, in the third case, it is understood that the most efficient moving method is the candidate (2) moving method.

  The output unit 113 outputs information based on the evaluation as in the first case. For example, the output unit 113 outputs the moving method of the candidate (2).

  Note that the order of output of the combination of the movement source section, the movement destination section, and the number of workers to be moved (hereinafter referred to as “movement unit”) included in the output movement method is appropriately arranged. May be. For example, the output unit 113 may preferentially output a moving unit that is urgent for improving work efficiency among a plurality of moving units. In the third case, the movement from the section 5B to the section 5A does not affect the overall work efficiency even if it is delayed by one minute. However, the movement from the section 5D to the section 5B is a comprehensive work because the movement is delayed. Directly affects efficiency. Therefore, the output unit 113 may output the movement unit representing the movement from the section 5D to the section 5B in preference to the movement unit representing the movement from the section 5B to the section 5A.

  By doing so, an urgent movement unit can be executed quickly, and the expected efficiency can be achieved, especially when there is a lag in each movement instruction, such as when movement instructions are not performed simultaneously. . When the administrator gives a movement instruction, the administrator does not need to consider the order of the movement instructions, so the burden on the administrator is reduced.

  Furthermore, the output unit 113 may output the urgent movement unit in a mode different from the output mode of other movement units. Examples of the different modes include changing the display color and size of the moving unit, adding an announcement by voice, and the like, but the modes are not limited thereto. With such a configuration, an operator or a manager can easily recognize an urgent moving unit. Thereby, for example, the worker can understand that his / her movement is an urgent action. Thus, more efficient movement is easily achieved.

  Through the processing as described above, the movement planning device 11 provides a movement method that optimizes the efficiency of the entire process even when a change in work efficiency in the upstream process takes time to affect the work efficiency in the downstream process. it can.

  Incidentally, in the third case, the most efficient moving method can change depending on the condition of the reflection time of the change in work efficiency. For example, in the example illustrated in FIG. 15, if the reflection time of the change in work efficiency from the section 5B to the section 5C is 4 minutes, the candidate (4) is derived as the most efficient movement method. It is.

  As described above, it is expected that the movement planning apparatus 11 can derive the optimum solution, that is, the most efficient moving method in a sufficiently short time even for a more complicated case.

[4th case]
The case described above is a case where upstream production efficiency affects downstream production efficiency. In the fourth case, it is assumed that the upstream production efficiency does not affect the downstream production efficiency. In the fourth case, work in each section is performed regardless of the efficiency of work in other sections. There may be an upstream / downstream relationship in work in each section, but the upstream production efficiency does not affect the downstream production efficiency. In other words, it is assumed that the work targets exist infinitely in each section, and the work efficiency is not affected by the flow rate from the upstream. For example, this case applies when there is a sufficient amount of unprocessed containers 4 in each section of the work environment E1.

  As an example of a work environment that applies to the fourth case, a work environment E4 is assumed below. The work environment E4 is assumed to include four sections 5A, 5B, 5C, and 5D, like the work environment E1. The movement time between the sections is the same as the movement time in the first case.

  Workers are assigned to each section to perform production work. The production operation may be, for example, assembly of an article, or molding or processing of an article. The work in each section may be the same or different. However, a unified index is defined as an index of the results of production work. As an example, the production amount per unit time, that is, the number of products for which the work has been performed, is defined as an index of the production work result of each section.

  In the fourth case, it is assumed that the work efficiency changes more finely according to the number of workers. The table of FIG. 19 shows the relationship between the number of workers, the production amount per unit time (for example, 1 minute), and the production efficiency in each section of the fourth case. As shown in FIG. 19, in general, the production amount is not necessarily proportional to the number of workers. In the work, there is the most suitable number of workers, that is, the number of workers having the best work efficiency. Referring to the example of the table of FIG. 19, for example, when the number of workers is 6, the production amount is 14, the efficiency (production amount per worker) is 2.33, and the number of workers is 5. Is 12, the production volume is 12 and the efficiency is 2.4. However, if the number of workers is 4, the production amount is 10 and the efficiency is 2.5, which is more efficient than the case where the number of workers is 5 or more. When the number of workers is 3 or less, the efficiency is 2.33 (in the case of 3 people) or 1.5 (in the case of 2 people), and the efficiency is lowered. That is, in this example, it is assumed that the optimum number of workers performing work in each section is 4 each.

  The efficiency information as described above may be set based on the actual production status. For example, the condition acquisition unit 110 obtains efficiency information based on work performance logs acquired by the management system that manages the work environment E4, and information on work results that are aggregated and calculated based on the work management logs. It may be generated. With such a configuration, the condition acquisition unit 110 can calculate the influence of the change in the number of workers on the work efficiency with higher accuracy based on the work performance of each section. Therefore, a movement plan can be performed with higher accuracy.

  Now, it is assumed that the number of workers in the section 5A is 2, the number of workers in the section 5B is 4, the number of workers in the section 5C is 4, and the number of workers in the section 5D is 6. If an arrangement in which the number of workers in each section is four is the target arrangement, the number of workers in the section 5A is currently insufficient, and the number of workers in the section 5D is two.

  In this case, the movement planning device 11 plans a method in which workers move so that the number of workers in each section is four.

  The condition acquisition unit 110 acquires various pieces of information described above.

  Candidate deriving unit 111 derives candidates for which excess or deficiency is eliminated based on the acquired information.

The candidate deriving unit 111 first identifies the number of workers that can be moved. In a case such as the fourth case in which the production amount changes according to the number of workers, the number of movable workers in each section is calculated as follows, for example.
-The number of workers that can be moved is the upper limit of the number of workers that can be removed that satisfies the following conditions.
Condition: Efficiency in the case where the difference between the efficiency when the number of workers withdraws in the section and the efficiency in the case of the target number of workers is the current efficiency and the number of target workers in the shortage section It is smaller than the difference.

  In the case of the fourth case, the difference between the current efficiency of the shortage section 5A and the efficiency in the case of the target number of workers is 2.5−1.5 = 1. Therefore, the workers in each section can leave within a range where the efficiency does not fall below “1.5”, which is one smaller than “2.5”, which is the efficiency in the case of the number of target workers in each section. is there. That is, the number of movable workers in the sections 5B, 5C, and 5D is one person, one person, and three persons, respectively.

  If there are multiple shortage sections, the difference between the current efficiency and the target number of workers in the above conditions is the current efficiency and target number of workers in each of the shortage sections. It may be read as the sum of the differences from the efficiency.

  Then, the candidate deriving unit 111 derives a moving method candidate.

For example, the next candidate is finally derived based on the route deriving method described in the “when there are two or more surpluses or shortages” section of the present disclosure.
Candidate (C1): 5D → 5A, 5D → 5A
Candidate (C2): 5D → 5A, 5D → 5B, 5B → 5A
Candidate (C3): 5D → 5A, 5D → 5C, 5C → 5A
Candidate (C4): 5D → 5A, 5D → 5C, 5C → 5B, 5B → 5A
Candidate (C5): 5D → 5B, 5D → 5B, 5B → 5A, 5B → 5A
Candidate (C6): 5D → 5B, 5B → 5A, 5D → 5C, 5C → 5A
Candidate (C7): 5D → 5B, 5B → 5A, 5D → 5C, 5C → 5B, 5B → 5A
Candidate (C8): 5D → 5C, 5D → 5C, 5C → 5A, 5C → 5A
Candidate (C9): 5D → 5C, 5C → 5A, 5D → 5C, 5C → 5B, 5B → 5A
Candidate (C10): 5D → 5C, 5D → 5C, 5C → 5B, 5C → 5B, 5B → 5A, 5B → 5A
Among these candidates, the candidates (C5) and (C7) to (C10) do not satisfy the condition that the number of workers moving from the section does not exceed the number of movable workers in the section. Therefore, these candidates may be excluded from the candidates.

  The calculation unit 112 calculates an evaluation for each derived candidate. In the fourth case, for example, as an evaluation, the calculation unit 112 calculates the total production amount for 7 minutes from the start of movement when the candidate is executed.

  The reason for calculating the total production amount is 7 minutes because it takes 7 minutes at the longest to optimize the number of workers. That is, it can be said that 7 minutes is a sufficient time for comparison of candidates. However, the calculation unit 112 may calculate the total production amount for a time of 7 minutes or more. The calculation unit 112 may calculate the production efficiency for 7 minutes.

  Taking the candidate (C2) as an example, an example of calculation processing performed by the calculation unit 112 will be described. FIG. 20 is a diagram illustrating the concept of calculation processing performed by the calculation unit 112.

The candidate (C2) is a moving method in which one worker in the section 5D moves to the section 5A, another worker moves to the section 5B, and a worker in the section 5B moves to the section 5A. When the candidate (C2) is employed, the change in production over time is as follows.
-Until 3 minutes after the start of the movement of the workers, the production volume in section 5A is "3", the production volume in section 5B is "7", the production volume in section 5C is "10", and the production volume in section 5D The production amount is “10”. Therefore, the production amount is “30” per minute.
・ Since one worker arrives at section 5A after 3 minutes, the production volume in section 5A is "7" and the production volume is "34" per minute from 3 minutes to 5 minutes after the start. .
・ Since one worker reaches the section 5B after 5 minutes, the production volume in the section 5B is “10” and the production volume is “37” per minute from the start 5 minutes to the 7th minute. .
・ Since one worker reaches the section 5A after 7 minutes, the production amount becomes the optimum “40”.

  Therefore, the total production amount for 7 minutes in the case of the candidate (C2) is 30 × 3 + 34 × 2 + 37 × 2 = 232. The production efficiency is 33.1.

  The calculation unit 112 may calculate other candidate evaluations in the same manner.

  When the production amount varies finely or changes continuously, the calculation unit 112 may calculate an integral value of the production amount from 0 minutes to 7 minutes as an evaluation.

  FIG. 21 is a diagram showing a table summarizing changes over time in the production amounts of the candidates (C1) to (C4) and (C6) and the calculation results of the total production amount and the average production amount. In the column of “0 to 7 minutes (total)”, the total production amount corresponding to each candidate is described.

  The output unit 113 outputs information based on the calculation result by the calculation unit 112. For example, the output unit 113 may output information specifying a candidate with the highest evaluation (for example, the value of the total production amount). The content and method of output may be the same as the content and method described in the first case.

  According to FIG. 21, the candidate with the highest evaluation is the candidate (C2). The output unit 113 outputs the candidate with the highest evaluation, so that the worker can execute the moving method. That is, the worker can move so as to achieve the target arrangement by a moving method that maximizes the efficiency of the entire work environment.

  When there are a plurality of candidates having the highest evaluation, the output unit 113 may select any one candidate as the “movement method to be executed”. This selection may be based on a method of selecting at random or may be based on a preset item. For example, the output unit 113 may select a candidate having the smallest (or largest) total movement time of the mover among the movement candidates having the highest production efficiency. If a candidate having a small total travel time of a mobile person is adopted, the cost for travel (such as power consumption of the vehicle) can be suppressed. If a candidate having a large sum of movement time of the mover is employed, it is possible to increase the time given to each worker other than the time for performing the production work. In particular, in the fourth case, since it is assumed that all workers who are not moving always work, it may be meaningful for the workers to give more time for movement.

  In the fourth case, the movement planning device 11 can provide the most efficient movement method.

  The candidate deriving unit 111 can narrow down the candidates by determining the number of movable workers in each section. Thereby, the amount of calculation by the calculation unit 112 can be reduced, and the movement planning device 11 can derive an optimal movement method earlier.

[[Supplement]]
The efficiency information may be different for each section. Incidentally, in the fourth case, if the efficiency when the number of workers in the section 5B is 3 is “5”, the candidate extracted as the most efficient moving method is the candidate (C1). Furthermore, if the efficiency when the number of workers in each section is two is “2”, the candidate extracted as the most efficient movement method is the candidate (C3). As described above, the optimum movement method can be changed depending on the change of the conditions.

<< Second Embodiment >>
A second embodiment will be described. In the second embodiment, it is assumed that the movement planning device 12 is applied to an environment different from that of the first embodiment. For example, the movement planning device 12 may plan a method of moving a person or thing that maximizes the utility or profit in a system in which a scale of utility or profit generated by the movement of the person or thing is set. .

  FIG. 22 is a schematic diagram illustrating a configuration of an application environment E5 that is an example of an environment to which the movement planning device 12 according to the second embodiment is applied. The application environment E5 includes a movement planning device 12, a user 9 who uses the movement planning device 12, a movable body 7, and an area 8.

  In the application environment E5, the movement planning device 12 devises a moving method in which each movable body 7 moves to the area 8.

  The movable body 7 gives a specific benefit to the application environment E5 by moving to the area 8.

  The user 9 inputs information used for the movement plan to the movement planning device 12. The movement planning device 12 outputs the result of the movement plan. The user 9 issues a movement instruction to the plurality of movable bodies 7 based on the result output from the movement planning device 12. The movement instruction is an instruction including information as to which area 8 of the plurality of predetermined areas 8 the movable body 7 should move.

  The movement planning device 12 includes a condition acquisition unit 120, a candidate derivation unit 121, a calculation unit 122, and an output unit 123.

  The condition acquisition unit 120 acquires information for planning a movement plan, that is, a condition.

  The candidate deriving unit 121 derives a moving method candidate for the movable body 7 based on the information acquired by the condition acquiring unit 120.

  The calculation unit 122 calculates the evaluation of the candidate derived by the candidate deriving unit 121 based on the change over time in the profit caused by the arrangement change based on the candidate.

  The output unit 123 outputs information based on the evaluation.

  Hereinafter, a specific example of processing of each unit of the movement planning device 11 will be described by taking a specific case that can be a target of movement planning by the movement planning device 12 as an example.

[Fifth case]
Suppose that there are three places affected by a disaster, and there are three rescue teams that can deal with the disaster. Under this circumstance, the three rescue teams will move to different disaster locations to deal with disasters. In this case, the rescue team corresponds to the movable body 7, and the disaster area corresponds to the area 8.

  In the fifth case, the time required for the rescue team to move to each location varies depending on the rescue team. For example, it may be assumed that rescue teams are at different bases. It may be assumed that the transportation means used by the rescue team are different.

  In this description, for convenience of explanation, it is assumed that two of the three teams have the same travel time to each disaster location. That is, it is assumed that two of the three units are in the same base and have the same means of transportation. Assume that one of the three units is in a different base.

  FIG. 23 is a diagram illustrating a table showing the travel time of each rescue team to each disaster location in the fifth case. In the one direction of the table, “8A”, “8B”, and “8C”, which are identifiers of the three affected areas, are written as “destination”. In the one direction of the table, “7A”, “7B”, and “7C”, which are identifiers of each rescue team, are written as “moving persons”. The movement time is indicated numerically in the cell corresponding to each traveler and each destination. The unit of travel time is “minute”. According to the table of FIG. 23, for example, the travel time to the disaster location 8B by the rescue team 7A is 6 minutes.

  In the fifth case, each location suffers a certain loss per unit time until the rescue team moves to the location in charge. Assume that the magnitude of the loss per unit time is known in advance. FIG. 24 is a table showing the loss per unit time until the rescue team arrives at each location. For example, in the disaster area 8A, the loss per unit time until the rescue team arrives is “−3”. The value indicating the loss may be represented by a negative number as in the table of FIG. 24, for example. The value indicating the loss may be a value based on any index. However, it is assumed that the smaller the value, that is, the greater the absolute value, the greater the loss.

  When the rescue team moves to the affected area, there is no loss (that is, 0). In other words, the rescue team will benefit from the absolute value of the loss at that location.

  Under such conditions, the movement planning device 12 devises a rescue team movement method with the least loss as a whole, that is, a combination of movement destinations of each rescue team.

  The condition acquisition unit 120 acquires the various pieces of information described above.

  The candidate deriving unit 121 derives a candidate for a movement method based on the acquired information. In this example, the following three candidates are derived.

  Candidate (1): Rescue team 7A moves to disaster area 8A, and rescue teams 7B and 7C move to disaster areas 8B and 8C, respectively.

  Candidate (2): Rescue team 7A moves to disaster area 8B, and rescue teams 7B and 7C move to disaster areas 8A and 8C, respectively.

  Candidate (3): Rescue team 7A moves to disaster area 8C, and rescue teams 7B and 7C move to disaster areas 8A and 8B, respectively.

  Note that the rescue team 7B and the rescue team 7C are not distinguished from each other under the conditions of the present illustrative example, and thus are not distinguished.

  In order to derive the above candidates, the candidate deriving unit 121 may derive each combination of the rescue team and the disaster area.

  The calculation unit 122 calculates an evaluation for each derived candidate. The evaluation is, for example, the efficiency of utility when the candidate is adopted. The evaluation in the fifth case is, for example, the magnitude of loss that occurs at each disaster location. That is, for example, the calculation unit 122 calculates the sum of the magnitudes of the losses at each disaster location based on, for example, the change over time in the loss at each disaster location (when the loss disappears). The sum of the loss magnitudes at each disaster location is one of the measures that represent the overall profit efficiency.

  Under the conditions indicated in this description, the loss at each disaster location is the product of the time until the rescue team arrives and the loss per minute.

  In the case of candidate (1), the loss at the disaster location 8A is (−3) × 2 = −6, the loss at the disaster location 8B is (−8) × 7 = −56, and the loss at the disaster location 8C is (−5) ×. Since 9 = −45, the total loss is “−107”.

  In the case of candidate (2), the loss at the disaster location 8A is (−3) × 4 = −12, the loss at the disaster location 8B is (−8) × 6 = −48, and the loss at the disaster location 8C is (−5) ×. Since 9 = −45, the total loss is “−105”.

  In the case of candidate (3), the loss at the disaster location 8A is (−3) × 4 = −12, the loss at the disaster location 8B is (−8) × 7 = −56, and the loss at the disaster location 8C is (−5) ×. Since 8 = −40, the total loss is “−108”.

  The output unit 123 outputs information based on the evaluation. For example, the output unit 123 displays the total loss of each candidate as an evaluation. The larger the evaluation value, that is, the smaller the absolute value of the total loss value, the smaller the damage. That is, a candidate having a large evaluation value is a comprehensively efficient moving method with a large overall profit.

  The content and method of output by the output unit 123 may be the same as the content and method described in the first embodiment.

  The output unit 123 may output information that specifies a candidate having the smallest absolute value of the total sum of losses as a “movement method to be executed”. In the case of the above example, the candidate with the smallest sum of absolute values of loss is the candidate (2).

  By applying the movement planning device 12 to the fifth case, the rescue team can move so that the absolute value of the total sum of losses occurring at each disaster location is minimized.

  Incidentally, the candidate (2) is not the candidate with the lowest movement cost when the movement time is regarded as the cost, and is not the candidate with which the movement of each movable body is completed earliest. In the method of deriving the moving method having the smallest moving cost when the moving time is regarded as the cost, the candidate (1) is derived. In the method of deriving a movement method in which the movement of each movable body is completed earliest, candidate (3) is derived.

  It should be noted that various matters made in the description of the first embodiment may be applied to the present embodiment as much as possible and interpreted. For example, the candidate deriving unit 121 of the movement planning device 12 may not derive all candidates. In this case, the movement method output as the “movement method to be executed” may not necessarily be the optimal solution, but if the movement method is derived from among sufficient candidates, the movement method is somewhat efficient. Expected to be a method.

<< Third Embodiment >>
A third embodiment of the present invention will be described. In the third embodiment, the movement planning device 10 performs a movement plan.

  The movement planning device 10 plans a movement procedure for a movement target person who is a part or all of a plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from the first arrangement to the second arrangement.

  Note that the “resource” in the present disclosure is an entity that generates or obtains profit according to a given environment or changes the magnitude of a specific profit. For example, the resource may be a person or a robot.

  “Profit” in the present disclosure is not limited to monetization. The profit may be, for example, the production amount of goods, the reduction amount of loss, the satisfaction level of people, the happiness level, the occurrence frequency or probability of occurrence of a specific event, or the fluctuation rate of a specific value. Profit may be a parameter related to something of value that is quantified based on a defined scale.

  Information necessary for the planning of the movement procedure may be acquired from, for example, a unit (not shown) inside the movement planning apparatus 10 or an apparatus or user outside the movement planning apparatus 10.

  FIG. 25 is a block diagram showing the configuration of the movement planning device 10. The movement planning device 10 includes a candidate derivation unit 101, a calculation unit 102, and an output unit 103.

  The candidate deriving unit 101 derives a candidate for the movement procedure. An example of the candidate derivation unit 101 is a candidate derivation unit 111 and a candidate derivation unit 121.

  The calculation unit 102 calculates an evaluation for the derived candidate based on a change over time in profits generated by a plurality of resources when the candidate is executed. The change in profit over time is specified based on the time taken for the movement target person to move to each destination and the effect of the movement of the movement target person. The time required for movement is time for movement. That is, the time required for movement is the time from when the movement target person is actually placed until the profit is changed at the movement destination. The effect of movement of the movement target person is, for example, the magnitude of change in profit due to the movement of the movement target person being completed. An example of the calculation unit 102 is the calculation unit 112 and the calculation unit 122.

  The output unit 103 outputs information based on the evaluation. An example of the output unit 103 is the output unit 113 and the output unit 123.

  Next, the flow of operation of each part of the movement planning device 10 will be described with reference to the flowchart of FIG.

  First, the candidate deriving unit 101 derives a moving procedure candidate (step S261). Next, the calculation unit 102 calculates an evaluation for the derived candidate based on changes over time in profits generated by a plurality of resources when the candidate is executed (step S262). And the output part 103 outputs the information based on the said evaluation (step S263).

  According to the movement planning device 10 according to the third embodiment, information related to a resource movement procedure for changing the resource arrangement from the first arrangement to the second arrangement is output. The output unit 103 may output information specifying the candidate with the highest evaluation among the derived candidates as information based on the evaluation. Since the valuation is calculated based on the change in profit over time, a candidate with a higher valuation may be a moving procedure with a larger magnitude of profit. In this case, the resource can perform a transfer procedure with a larger profit.

  When the candidate deriving unit 101 derives all the moving procedures that are most likely to be evaluated, the output unit 103 can output the moving procedure having the maximum profit. Therefore, in this case, the resource can be changed from the first arrangement to the second arrangement in a procedure that maximizes the profit.

<Modification>
The movement planning apparatus 13, which is an apparatus provided with the reception unit 104 in the movement planning apparatus 10, will be described below. FIG. 27 is a block diagram showing the configuration of the movement planning device 13. The movement planning device 13 includes a reception unit 104, a candidate derivation unit 101, a calculation unit 102, and an output unit 103.

  The reception unit 104 receives an input of a movement procedure. An example of the reception unit 104 is the movement method reception unit described in [6] of [[Supplement]] of the first embodiment.

  Candidate derivation unit 101 derives a candidate for a movement procedure in which the arrangement after execution when the accepted movement procedure is executed is the second arrangement.

  The calculation unit 102 calculates the evaluation of the accepted moving procedure and the evaluation of the derived candidate.

  The output unit 103 outputs information based on the comparison between the accepted evaluation of the moving procedure and the derived candidate evaluation. An example of the information based on the comparison is the information described in [6] of [[Supplement]] of the first embodiment.

  With such a configuration, information relating to a movement procedure that can be used instead of the movement procedure input to the reception unit 104 of the movement planning device 13 is provided. For example, if the output unit 103 outputs a candidate with an evaluation higher than the evaluation of the accepted movement procedure, the resource can be rearranged with a movement procedure that is more efficient than the accepted movement procedure.

[[Supplement]]
The concept of “movement” described above may be interpreted as an evolution of the concept of “migration”. That is, the movement planning problem handled by the movement planning apparatus 11 does not necessarily have to be a problem related to “spatial position change”. For example, in the first embodiment, the concept that "the worker moves from the section 5A to the section 5B when changing the position of the worker from one position to another" When changing the combination from one combination to another, the concept may be read as “the worker shifts from the specific work A to the specific work B”. That is, even if the specific work A and the specific work B are work that can be executed at the same position in space, if the transition between the work takes time, the movement planning device 11 is appropriate. The problem of deriving the migration method can be handled as the same problem as the movement plan. Therefore, the concept of “movement” of the present disclosure is not only the meaning of “change of spatial position” but also “change of work contents” and “change of the situation where resources (workers, etc.) are placed”. , It may mean “change in the subject of benefit”. That is, “move” used in the present disclosure may be interpreted as including the meaning of “migration”.

(Hardware configuration realizing each part of the embodiment)
As described above, in each embodiment of the present invention described above, each component of each device represents a functional unit block.

  The processing of each component may be realized by, for example, reading and executing a program stored in a computer-readable storage medium that causes the computer system to execute the processing. The “computer-readable storage medium” includes, for example, portable media such as an optical disk, a magnetic disk, a magneto-optical disk, and a nonvolatile semiconductor memory, and a ROM (Read Only Memory) and a hard disk incorporated in a computer system. It is a storage device. "Computer-readable storage medium" is a medium that dynamically holds a program for a short time, such as a communication line when transmitting a program via a network such as the Internet or a communication line such as a telephone line, In this case, a program or a program that temporarily holds a program such as a volatile memory in a computer system corresponding to a server or client is also included. The program may be a program for realizing a part of the functions described above, and may be a program capable of realizing the functions described above in combination with a program already stored in a computer system.

The “computer system” is a system including a computer 900 as shown in FIG. 28 as an example. The computer 900 includes the following configuration.
CPU (Central Processing Unit) 901
・ ROM902
-RAM (Random Access Memory) 903
A program 904A and storage information 904B loaded into the RAM 903
A storage device 905 that stores the program 904A and storage information 904B
A drive device 907 that reads / writes from / to the storage medium 906
A communication interface 908 connected to the communication network 909
An input / output interface 910 for inputting / outputting data
-Bus 911 connecting each component
For example, each component of each device in each embodiment is realized by the CPU 901 loading the program 904A for realizing the function of the component into the RAM 903 and executing it. A program 904A for realizing the function of each component of each device is stored in advance in the storage device 905 or the ROM 902, for example. Then, the CPU 901 reads the program 904A as necessary. The storage device 905 is, for example, a hard disk. The program 904A may be supplied to the CPU 901 via the communication network 909, or may be stored in advance in the storage medium 906, read out to the drive device 907, and supplied to the CPU 901. Note that the storage medium 906 is a portable medium such as an optical disk, a magnetic disk, a magneto-optical disk, and a nonvolatile semiconductor memory.

  There are various modifications to the method of realizing each device. For example, each device may be realized by a possible combination of a separate computer 900 and a program for each component. A plurality of constituent elements included in each device may be realized by a possible combination of one computer 900 and a program.

  In addition, some or all of the components of each device may be realized by other general-purpose or dedicated circuits, computers, or combinations thereof. These may be configured by a single chip or may be configured by a plurality of chips connected via a bus.

  When some or all of the constituent elements of each device are realized by a plurality of computers, circuits, etc., the plurality of computers, circuits, etc. may be centrally arranged or distributedly arranged. For example, the computer, the circuit, and the like may be realized as a form in which each is connected via a communication network, such as a client and server system and a cloud computing system.

  As mentioned above, although this invention was demonstrated using embodiment, the technical scope of this invention is not limited to the range as described in the said embodiment. It will be apparent to those skilled in the art that various modifications or improvements can be added to the above embodiment. It is apparent from the scope of the claims that the embodiments added with such changes or improvements can be included in the technical scope of the present invention.

A part or all of the above embodiment may be described as in the following supplementary notes, but is not limited thereto.
[Appendix]
[Appendix 1]
Candidate deriving means for deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. A calculation means to calculate based on;
Output means for outputting information based on the evaluation;
A movement planning apparatus comprising:
[Appendix 2]
The rating is a value that depends on the profit generated by the resource at each of the destinations,
The calculation means, when the magnitude of the profit in at least one of the destinations is influenced by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged. In calculating the evaluation, the change over time is identified based on the magnitude of the profit based on the presence or absence of the influence.
The movement planning device according to attachment 1.
[Appendix 3]
The candidate deriving means does not lower the profit at the position even if the resource at the position is reduced in the first arrangement for at least one of the positions at which the plurality of resources are arranged in the first arrangement. In the case, the resource at the position is included as the resource that can be the transfer target person.
The movement planning device according to attachment 1 or 2.
[Appendix 4]
The candidate deriving means, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position are reduced and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
The movement planning device according to any one of appendices 1 to 3.
[Appendix 5]
The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The movement planning device according to any one of appendices 1 to 4.
[Appendix 6]
The output means outputs a movement instruction for the movement target person to move to the movement destination according to a procedure indicated by the candidate having the highest evaluation among the derived candidates.
The movement planning device according to any one of appendices 1 to 5.
[Appendix 7]
The candidate derivation means extracts the movement destination candidate and the movement target person candidate, generates the movement procedure by combining the movement target person candidate and the movement destination candidate, and combines the combination. The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The movement planning device according to any one of appendices 1 to 6.
[Appendix 8]
The candidate derivation means includes: a procedure for moving the first resource to the first destination; a procedure for moving the second resource from the first destination to the second destination; The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Does not derive the longer moving procedure as the candidate for which the evaluation is calculated by the calculating means,
The movement planning device according to any one of appendices 1 to 7.
[Appendix 9]
A receiving means for receiving an input of the moving procedure;
The candidate derivation means derives a candidate for the movement procedure in which the arrangement after execution when the accepted movement procedure is executed is the second arrangement,
The output means outputs information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The movement planning device according to any one of appendices 1 to 8.
[Appendix 10]
Efficiency information representing the relationship between the number of resources and the amount of profit; time information representing time taken for the resources to move to each of the positions where the plurality of resources are disposed in the second arrangement; The movement planning device according to any one of appendices 1 to 9, further comprising: condition acquisition means for acquiring information that can identify the first arrangement and the second arrangement.
[Appendix 11]
Procedure for migrating the status of a migration target person who is a part or all of the plurality of resources, which is a procedure for changing a combination of situations in which each of a plurality of resources is placed from a first combination to a second combination Candidate derivation means for deriving candidates,
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is specified based on the time taken for the transition target person to transition to the transition destination of each status. A calculation means for calculating based on the change;
Output means for outputting information based on the evaluation;
A movement planning apparatus comprising:
[Appendix 12]
Deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. Based on the calculation
Outputting information based on the evaluation;
Movement planning method.
[Appendix 13]
The rating is a value that depends on the profit generated by the resource at each of the destinations,
When calculating the evaluation when the magnitude of the profit in at least one of the destinations is affected by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged, Identifying the change over time based on the magnitude of the benefit based on the presence or absence of the effect;
The movement planning method according to attachment 12.
[Appendix 14]
In at least one of the positions where the plurality of resources are arranged in the first arrangement in the derivation of the candidates, even if the resources at the position are reduced in the first arrangement, the profit at the position is not lowered. In the case, the resource at the position is included as the resource that can be the transfer target person.
The movement planning method according to attachment 12 or 13.
[Appendix 15]
In the derivation of the candidates, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position are reduced and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
15. The movement planning method according to any one of appendices 12 to 14.
[Appendix 16]
The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The movement planning method according to any one of appendices 12 to 15.
[Appendix 17]
Outputting a movement instruction for the movement target person to move to the movement destination according to the procedure indicated by the candidate having the highest evaluation among the derived candidates.
The movement planning method according to any one of appendices 12 to 16.
[Appendix 18]
In the derivation of the candidates, the destination candidate and the candidate for the movement target are extracted, the movement procedure is generated by a combination of the candidate for the movement target and the candidate for the movement destination, and the combination The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The movement planning method according to any one of appendices 12 to 17.
[Appendix 19]
In the derivation of the candidates, a procedure in which the first resource moves to the first destination, a procedure in which the second resource moves from the first destination to the second destination, The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Do not derive the longer travel procedure as the candidate for which the evaluation is calculated,
The movement planning method according to any one of appendices 12 to 18.
[Appendix 20]
Receiving input of the travel procedure;
Deriving candidates for the movement procedure, wherein the second arrangement is an arrangement after execution when the accepted movement procedure is executed,
Calculating the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
Outputting information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The movement planning method according to any one of appendices 12 to 19.
[Appendix 21]
Efficiency information representing the relationship between the number of resources and the amount of profit; time information representing time taken for the resources to move to each of the positions where the plurality of resources are disposed in the second arrangement; The movement planning method according to any one of appendices 12 to 20, wherein information capable of specifying the first arrangement and the second arrangement is acquired.
[Appendix 22]
Procedure for migrating the status of a migration target person who is a part or all of the plurality of resources, which is a procedure for changing a combination of situations in which each of a plurality of resources is placed from a first combination to a second combination Derived candidates,
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is specified based on the time taken for the transition target person to transition to the transition destination of each status. Based on the changes,
Outputting information based on the evaluation;
Movement planning method.
[Appendix 23]
On the computer,
A candidate derivation process for deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. Based on the calculation process to calculate,
An output process for outputting information based on the evaluation;
A program that executes
[Appendix 24]
The rating is a value that depends on the profit generated by the resource at each of the destinations,
The calculation processing may be performed when the magnitude of the profit in at least one destination is affected by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged. In calculating the evaluation, the change over time is identified based on the magnitude of the profit based on the presence or absence of the influence.
The program according to attachment 23.
[Appendix 25]
In the candidate derivation process, for at least one of the positions where the plurality of resources are arranged in the first arrangement, even if the resources at the position are reduced in the first arrangement, the profit at the position is not lowered. In the case, the resource at the position is included as the resource that can be the transfer target person.
The program according to appendix 23 or 24.
[Appendix 26]
In the candidate derivation process, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position decrease and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
The program according to any one of appendices 23 to 25.
[Appendix 27]
The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The program according to any one of appendices 23 to 26.
[Appendix 28]
The output process outputs a movement instruction for the movement target person to move to the movement destination according to a procedure indicated by the candidate having the highest evaluation among the derived candidates.
The program according to any one of appendices 23 to 27.
[Appendix 29]
In the candidate derivation process, the destination candidate and the candidate for the movement target are extracted, the movement procedure is generated by a combination of the candidate for the movement target and the candidate for the movement destination, and the combination The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The program according to any one of appendices 23 to 28.
[Appendix 30]
The candidate derivation process includes a procedure for moving the first resource to the first destination, a procedure for moving the second resource from the first destination to the second destination, The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Does not derive the longer moving procedure as the candidate for which the evaluation is calculated by the calculation process,
The program according to any one of appendices 23 to 29.
[Appendix 31]
Causing the computer to further execute a reception process for receiving the input of the movement procedure;
The candidate derivation process derives a candidate for the movement procedure, wherein the arrangement after execution when the accepted movement procedure is executed is the second arrangement,
The output process outputs information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The program according to any one of appendices 23 to 30.
[Appendix 32]
In the computer, efficiency information representing the relationship between the number of resources and the amount of profit, and the time taken for the resources to move to each of the positions where the plurality of resources are arranged in the second arrangement The program according to any one of appendices 23 to 31, further executing a condition acquisition process for acquiring time information and information capable of specifying the first arrangement and the second arrangement.
[Appendix 33]
On the computer,
Procedure for transferring the status of a transfer target person who is part or all of the plurality of resources, which is a procedure for changing a combination of situations where each of a plurality of resources is placed from the first combination to the second combination A candidate derivation process for deriving candidates for
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is identified based on the time taken for the transition target person to transition to the transition destination of each status A calculation process to calculate based on the change,
An output process for outputting information based on the evaluation;
A program that executes
[Appendix 34]
A computer-readable storage medium for storing the program according to any one of appendices 23 to 33.

E1 Work environment E5 Applicable environment 2 Worker 3 Conveyor 4 Container 5A, 5B, 5C, 5D Section 7 Movable body 8 Area 9 User 10-13 Movement planning device 110, 120 Condition acquisition unit 101, 111, 121 Candidate derivation unit 102 , 112, 122 Calculation unit 103, 113, 123 Output unit 104 Reception unit 900 Computer 901 CPU
902 ROM
903 RAM
904A program 904B storage information 905 storage device 906 storage medium 907 drive device 908 communication interface 909 communication network 910 input / output interface 911 bus

Claims (33)

Candidate deriving means for deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. A calculation means to calculate based on;
Output means for outputting information based on the evaluation;
A movement planning apparatus comprising: The rating is a value that depends on the profit generated by the resource at each of the destinations,
The calculation means, when the magnitude of the profit in at least one of the destinations is influenced by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged. In calculating the evaluation, the change over time is identified based on the magnitude of the profit based on the presence or absence of the influence.
The movement planning device according to claim 1. The candidate deriving means does not lower the profit at the position even if the resource at the position is reduced in the first arrangement for at least one of the positions at which the plurality of resources are arranged in the first arrangement. In the case, the resource at the position is included as the resource that can be the transfer target person.
The movement planning apparatus according to claim 1 or 2. The candidate deriving means, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position are reduced and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
The movement planning device according to any one of claims 1 to 3. The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The movement planning device according to any one of claims 1 to 4. The output means outputs a movement instruction for the movement target person to move to the movement destination according to a procedure indicated by the candidate having the highest evaluation among the derived candidates.
The movement planning device according to any one of claims 1 to 5. The candidate derivation means extracts the movement destination candidate and the movement target person candidate, generates the movement procedure by combining the movement target person candidate and the movement destination candidate, and combines the combination. The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The movement planning device according to any one of claims 1 to 6. The candidate derivation means includes: a procedure for moving the first resource to the first destination; a procedure for moving the second resource from the first destination to the second destination; The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Does not derive the longer moving procedure as the candidate for which the evaluation is calculated by the calculating means,
The movement planning device according to any one of claims 1 to 7. A receiving means for receiving an input of the moving procedure;
The candidate derivation means derives a candidate for the movement procedure in which the arrangement after execution when the accepted movement procedure is executed is the second arrangement,
The output means outputs information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The movement planning device according to any one of claims 1 to 8.   Efficiency information representing the relationship between the number of resources and the amount of profit; time information representing time taken for the resources to move to each of the positions where the plurality of resources are disposed in the second arrangement; The movement planning device according to any one of claims 1 to 9, further comprising condition acquisition means for acquiring information capable of specifying the first arrangement and the second arrangement. Procedure for migrating the status of a migration target person who is a part or all of the plurality of resources, which is a procedure for changing a combination of situations in which each of a plurality of resources is placed from a first combination to a second combination Candidate derivation means for deriving candidates,
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is specified based on the time taken for the transition target person to transition to the transition destination of each status. A calculation means for calculating based on the change;
Output means for outputting information based on the evaluation;
A movement planning apparatus comprising: Deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. Based on the calculation
Outputting information based on the evaluation;
Movement planning method. The rating is a value that depends on the profit generated by the resource at each of the destinations,
When calculating the evaluation when the magnitude of the profit in at least one of the destinations is affected by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged, Identifying the change over time based on the magnitude of the benefit based on the presence or absence of the effect;
The movement planning method according to claim 12. In at least one of the positions where the plurality of resources are arranged in the first arrangement in the derivation of the candidates, even if the resources at the position are reduced in the first arrangement, the profit at the position is not lowered. In the case, the resource at the position is included as the resource that can be the transfer target person.
The movement planning method according to claim 12 or 13. In the derivation of the candidates, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position are reduced and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
The movement planning method according to any one of claims 12 to 14. The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The movement planning method according to any one of claims 12 to 15. Outputting a movement instruction for the movement target person to move to the movement destination according to the procedure indicated by the candidate having the highest evaluation among the derived candidates.
The movement planning method according to any one of claims 12 to 16. In the derivation of the candidates, the destination candidate and the candidate for the movement target are extracted, the movement procedure is generated by a combination of the candidate for the movement target and the candidate for the movement destination, and the combination The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The movement planning method according to any one of claims 12 to 17. In the derivation of the candidates, a procedure in which the first resource moves to the first destination, a procedure in which the second resource moves from the first destination to the second destination, The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Do not derive the longer travel procedure as the candidate for which the evaluation is calculated,
The movement planning method according to any one of claims 12 to 18. Receiving input of the travel procedure;
Deriving candidates for the movement procedure, wherein the second arrangement is an arrangement after execution when the accepted movement procedure is executed,
Calculating the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
Outputting information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The movement planning method according to any one of claims 12 to 19. Efficiency information representing the relationship between the number of resources and the amount of profit; time information representing time taken for the resources to move to each of the positions where the plurality of resources are disposed in the second arrangement; Obtaining information that can identify the first arrangement and the second arrangement;
The movement planning method according to any one of claims 12 to 20. Procedure for migrating the status of a migration target person who is a part or all of the plurality of resources, which is a procedure for changing a combination of situations in which each of a plurality of resources is placed from a first combination to a second combination Derived candidates,
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is specified based on the time taken for the transition target person to transition to the transition destination of each status. Based on the changes,
Outputting information based on the evaluation;
Movement planning method. On the computer,
A candidate derivation process for deriving candidates for a movement procedure of a movement target person who is a part or all of the plurality of resources, which is a procedure for changing the arrangement of a plurality of resources from a first arrangement to a second arrangement;
The evaluation with respect to the derived candidate is specified based on the time required for the movement of the movement target person to each movement destination, and the change over time of the profit generated by the plurality of resources when the candidate is executed. Based on the calculation process to calculate,
An output process for outputting information based on the evaluation;
The computer-readable storage medium which recorded the program which performs this. The rating is a value that depends on the profit generated by the resource at each of the destinations,
The calculation processing may be performed when the magnitude of the profit in at least one destination is affected by the magnitude of the profit generated in at least one of the positions where the plurality of resources are arranged. In calculating the evaluation, the change over time is identified based on the magnitude of the profit based on the presence or absence of the influence.
The storage medium according to claim 23. In the candidate derivation process, for at least one of the positions where the plurality of resources are arranged in the first arrangement, even if the resources at the position are reduced in the first arrangement, the profit at the position is not lowered. In the case, the resource at the position is included as the resource that can be the transfer target person.
The storage medium according to claim 23 or 24. In the candidate derivation process, for at least one of the positions where the plurality of resources are arranged in the first arrangement, the magnitude of the profit per resource when the resources at the position decrease and the second The difference between the amount of profit per resource in the arrangement of the first arrangement and the second arrangement in each of the positions where the number of resources increases between the first arrangement and the second arrangement. When the sum of the difference between the magnitude of profit per resource and the magnitude of profit per resource in the second arrangement is smaller, the resource at the position can be the person to be moved Included as a resource,
The storage medium according to any one of claims 23 to 25. The information based on the evaluation includes information indicating the candidate having the highest evaluation among the derived candidates.
The storage medium according to any one of claims 23 to 26. The output process outputs a movement instruction for the movement target person to move to the movement destination according to a procedure indicated by the candidate having the highest evaluation among the derived candidates.
The storage medium according to any one of claims 23 to 27. In the candidate derivation process, the destination candidate and the candidate for the movement target are extracted, the movement procedure is generated by a combination of the candidate for the movement target and the candidate for the movement destination, and the combination The movement procedure that is obvious that the evaluation is not the highest among the movement procedures that can be generated by the method is excluded based on the time taken to move each of the candidates for the movement target to the movement destination candidates. While deriving the moving procedure that can be generated by the combination as a candidate for the moving procedure,
The storage medium according to any one of claims 23 to 28. The candidate derivation process includes a procedure for moving the first resource to the first destination, a procedure for moving the second resource from the first destination to the second destination, The time required for the movement to the second destination by the second resource is the time required for the movement to the second destination by the first resource. Does not derive the longer moving procedure as the candidate for which the evaluation is calculated by the calculation process,
The storage medium according to any one of claims 23 to 29. A computer stores a program for further executing a reception process for receiving an input of the moving procedure,
The candidate derivation process derives a candidate for the movement procedure, wherein the arrangement after execution when the accepted movement procedure is executed is the second arrangement,
The output process outputs information based on a comparison between the evaluation of the accepted moving procedure and the evaluation of the derived candidate;
The storage medium according to any one of claims 23 to 30.   In the computer, the efficiency information indicating the relationship between the number of resources and the amount of profit, and the time taken for the resources to move to each of the positions where the plurality of resources are arranged in the second arrangement 32. The program according to any one of claims 23 to 31, wherein a program for further executing a condition acquisition process for acquiring time information and information capable of specifying the first arrangement and the second arrangement is stored. Storage media. On the computer,
Procedure for migrating the status of a migration target person who is a part or all of the plurality of resources, which is a procedure for changing a combination of situations in which each of a plurality of resources is placed from a first combination to a second combination A candidate derivation process for deriving candidates for
Over time of the profit generated by the plurality of resources when the candidate is executed, wherein the evaluation of the derived candidate is specified based on the time taken for the transition target person to transition to the transition destination of each status. A calculation process to calculate based on the change,
An output process for outputting information based on the evaluation;
The computer-readable storage medium which memorize | stores the program which performs this.

Images