Plan creation support method and plan creation support system

Abstract

To enable a plan to be quickly made while forming an agreement between persons concerned of planning.SOLUTION: A plan creation support method creates an arrangement plan for searching an arrangement route for connecting respective start points and end points of a plurality of linear objects in a prescribed area on the basis of linear object information including information related to the respective start points and end points of the plurality of linear objects, a plurality of requests to be a constraint condition when a business operator arranges the plurality of linear objects in the prescribed area, and area information for regulating the prescribed area. It calculates a basic request achievement degree indicating a degree at which the arrangement plan satisfies the plurality of requests, and calculates a second request achievement degree indicating a degree at which the arrangement plan satisfies a plurality of requests obtained by excluding each request in each request if each request is excluded from the plurality of requests. It calculates a request influence degree being an evaluation index showing how much the second request achievement degree is improved to the request achievement degree in each request on the basis of the second request achievement degree and the basis request achievement degree of each request.SELECTED DRAWING: Figure 8

Description

[Technical Field]

[0001] The present invention relates to a planning support method and a planning support system. [Background technology]

[0002] For example, infrastructure development requires the construction of multiple supply lines for electricity, gas, etc., and development plans must be drawn up that take into account the requirements of each business. However, each business entity has its own unique requirements, and drawing up plans to take them all into account takes a lot of time and effort.

[0003] As a method for supporting consensus building regarding the requirements of such stakeholders, for example, Patent Document 1 discloses a technology that identifies stakeholders in the placement locations of a new design proposal in a virtual space corresponding to real space, and supports consensus building using the placement locations and the related areas of the stakeholders. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Patent Publication No. 2024-39429 Summary of the Invention [Problem to be solved by the invention]

[0005] However, the above-mentioned conventional technology only detects conflicting requirements in a given plan, and does not formulate a plan while adjusting the requirements, and therefore has the problem of not being able to formulate a plan while building consensus among the parties involved in the planning.

[0006] The present invention has been made in view of the above-mentioned problems, and has as its object to make it possible to formulate a plan while forming a consensus among the parties involved in the planning. [Means for solving the problem]

[0007] In order to achieve the above object, the present invention provides a planning support method executed by a planning support system that supports the creation of an arrangement plan for arranging a plurality of linear objects in a predetermined area, the planning support system having a processor and a memory, wherein the processor searches for an arrangement route connecting the start points and end points of each of the plurality of linear objects in the predetermined area based on linear object information including information on start points and end points of each of the plurality of linear objects, a plurality of requirements that are constraints when an operator arranges the plurality of linear objects in the predetermined area, and area information that defines the predetermined area, and generates an arrangement plan including the arrangement route. The method is characterized by comprising the steps of: creating a deployment plan; calculating a basic requirement achievement level, which is an evaluation index of the degree to which the deployment plan satisfies the multiple requirements, based on the deployment plan and the multiple requirements; calculating a second requirement achievement level for each requirement, which is an evaluation index of the degree to which the deployment plan satisfies the multiple requirements excluding each requirement, based on the deployment plan and the multiple requirements; and calculating a requirement influence level for each requirement, which is an evaluation index of how much the second requirement achievement level improves relative to the basic requirement achievement level, based on the second requirement achievement level and the basic requirement achievement level for each requirement. [Effects of the Invention]

[0008] According to the present invention, a plan can be formulated while forming a consensus among the parties involved in the plan formulation. [Brief explanation of the drawings]

[0009] [Figure 1] FIG. 1 is a diagram showing the configuration of a planning support system. [Figure 2] FIG. 2 is a diagram showing an outline of area information. [Figure 3A] FIG. 4 is a diagram showing the configuration of linear object information. [Figure 3B] FIG. 1 is a diagram showing an outline of the arrangement of linear objects. [Figure 4] FIG. 2 is a diagram showing the configuration of placement plan information. [Figure 5] FIG. 4 is a diagram showing the configuration of request information. [Figure 6] FIG. 10 is a diagram showing the configuration of request impact information. [Figure 7] 10 is a flowchart showing a request compromise proposal presentation process. [Figure 8] 10 is a flowchart showing a request review recommendation degree calculation process. [Figure 9] FIG. 10 is a diagram showing a request addition screen. [Figure 10] FIG. 10 is a diagram showing a request addition screen including a request fulfillment determination result. [Figure 11] FIG. 10 is a diagram showing a request compromise proposal presentation screen. DETAILED DESCRIPTION OF THE INVENTION

[0010] In the following description, a "processor" may refer to one or more processor devices. The at least one processor device may typically be a microprocessor device such as a CPU (Central Processing Unit), but may also be another type of processor device such as a GPU (Graphics Processing Unit). The at least one processor device may be a single-core or multi-core. The at least one processor device may also be a processor core. The at least one processor device may also be a processor device in a broader sense, such as a hardware circuit that performs part or all of the processing (e.g., an FPGA (Field-Programmable Gate Array), a CPLD (Complex Programmable Logic Device), or an ASIC (Application Specific Integrated Circuit)).

[0011] In the following description, "memory" refers to one or more memory devices, which are an example of one or more storage devices, and may typically be a primary storage device. At least one memory device in the memory may be a volatile memory device or a non-volatile memory device.

[0012] In the following description, a "storage device" is an example of one or more persistent storage devices. A persistent storage device may typically be a non-volatile storage device (e.g., an auxiliary storage device), specifically, for example, a hard disk drive (HDD), a solid state drive (SSD), or a non-volatile memory express (NVMe) drive.

[0013] In the following description, information that provides an output for an input may be described in table format using expressions such as "xxx information." This information may be data of any structure (e.g., structured data or unstructured data), or may be a learning model such as a neural network that generates an output for an input, a genetic algorithm, or a random forest. In the following description, the structure of each table is an example, and one table may be divided into two or more tables, or all or part of two or more tables may be one table.

[0014] In the following description, an "interface device" may refer to one or more communication interface devices. The one or more communication interface devices may be one or more homogeneous communication interface devices (e.g., one or more NICs (Network Interface Cards)), or two or more heterogeneous communication interface devices (e.g., an NIC and an HBA (Host Bus Adapter)).

[0015] In the following description, processing may be described using a "program" as the subject. A program is executed by a processor to perform a predetermined process using a storage device and / or an interface device, etc., as appropriate. Therefore, the subject of processing may be the processor (or a device such as a controller having the processor). A program may be installed in a device such as a computer from a program source. The program source may be, for example, a program distribution server or a computer-readable (e.g., non-transitory) recording medium. In the following description, two or more programs may be realized as one program, or one program may be realized as two or more programs.

[0016] (Configuration of planning support system 10) FIG. 1 is a diagram showing the configuration of a planning support system 10. The planning support system 10 supports a user in creating an arrangement plan for arranging multiple linear objects within a specified area so as to satisfy constraints. A linear object is a pipe, cable, or the like that has a start point, an end point, and an intermediate portion connecting the start point and the end point. The user is a person involved in an organization such as a business operator that arranges each linear object within a specified area.

[0017] The planning support system 10 has an input unit 11, a control unit 12, a storage unit 13, and an output unit 14. The input unit 11 is an input device such as a keyboard. The output unit 14 is an output device such as a display. The input unit 11 and the output unit 14 may be provided in a terminal device (not shown) connected via a network (not shown).

[0018] The control unit 12 is a processor that cooperates with a memory. The control unit 12 executes programs stored in a predetermined storage area such as the storage unit 13, thereby realizing a placement plan creation unit 121, a requirement achievement level calculation unit 122, a requirement influence level calculation unit 123, and a requirement review recommendation level calculation unit 124.

[0019] The placement plan creating unit 121 creates placement plan information 133 using area information 131 and linear object information 132 as input.

[0020] The request achievement level calculation unit 122 calculates a basic request achievement level A indicating the degree of fulfillment of the request information 134 in the allocation plan information 133. The request achievement level calculation unit 122 also calculates a second request achievement level B indicating the degree of fulfillment of the request information 134 in the allocation plan information 133 when each request in the request information 134 is ignored.

[0021] The request impact calculation unit 123 calculates a request impact C by subtracting the second request achievement degree B from the basic request achievement degree A for each request in the request information 134.

[0022] The request review recommendation degree calculation unit 124 calculates the request review recommendation degree Z / C by dividing the request degree Z, which represents the importance of each request as a numerical value, by the request influence degree C calculated by the request influence degree calculation unit 123 for each request in the request information 134.

[0023] The storage unit 13 is an external storage device such as a storage, etc. The storage unit 13 stores area information 131, linear object information 132, placement plan information 133, requirement information 134, and requirement impact information 135.

[0024] FIG. 2 is a diagram showing an outline of the area information 131. The area information 131 is information that defines an area in which multiple linear objects are arranged. The area information 131 includes information on the boundaries of the area, the size of the area, and the coordinate system within the area. For example, as shown in FIG. 2, the area information 131 is schematically represented by a grid area formed by connecting grids in which both end points and intermediate portions of linear objects are arranged. However, FIG. 2 is merely an example, and the area information 131 is not limited to the format shown in FIG. 2.

[0025] 3A is a diagram showing the configuration of linear object information 132. Linear object information 132 has the following items: "ID," "operator," "start point position," "start point altitude," "end point coordinates," "end point altitude," and "cost (yen / m)."

[0026] "ID" is identification information for each linear object included in the linear object information 132. "Operator" is an entity that installs each linear object in an area defined in the area information 131, such as an operator. "Starting point position" is the two-dimensional component of the grid coordinates of the area where the starting point of each linear object is located. "Starting point altitude" is the three-dimensional component of the grid coordinates of the area where the starting point of each linear object is located. "Ending point position" is the two-dimensional component of the grid coordinates of the area where the ending point of each linear object is located. "Ending point altitude" is the three-dimensional component of the grid coordinates of the area where the ending point of each linear object is located. "Cost (yen / m)" is the cost associated with installing each linear object, and can be an item that defines the requirements included in the requirement information 134. The item that "can be an item that defines the requirements included in the requirement information 134" is not limited to "cost (yen / m)" but can also be other items such as the required construction period per unit distance.

[0027] Fig. 3B is a diagram showing an overview of the placement of linear objects. The start point and end point of each linear object are placed in an area defined by area information 131 according to linear object information 132. Symbols such as "●", "x", and "▲" in Fig. 3 indicate the start point and end point of a linear object. Placement plan information 133 of the linear object is created by searching for a placement route for the intermediate part so as to satisfy the requirements of requirement information 134, and connecting the start point and end point of the linear object with the placement route.

[0028] Fig. 4 is a diagram showing the configuration of the placement plan information 133. The placement plan information 133 is created by connecting the start points and end points of linear objects via intermediate portions from the state shown in Fig. 3B so as to satisfy the requirements of the requirement information 134. The placement plan information 133 may include a plurality of patterns of placement plans with different routing patterns for the intermediate portions connecting the start points and end points of linear objects.

[0029] FIG. 5 is a diagram showing the configuration of the request information 134. The request information 134 has the following items: "Request ID," "Request Content," "Request Level Z," and "Operator ID." The "Request ID" is identification information for the "Request Content." The "Request Content" is the specific content of the request (constraints imposed when laying a linear object identified by the linear object ID).

[0030] "Request Level Z" represents the importance of the "Request Content" as a numerical value. "Provider ID" is the identification information of the provider requesting the corresponding "Request Content" at the corresponding "Request Level." Multiple providers identified by "Provider ID" may be associated with one combination of "Request Content" and "Request Level" identified by "Request ID."

[0031] The request identified by "request ID"="default" shown in FIG. 5 has "request level Z"="absolute", that is, it is a request that must be absolutely satisfied for all businesses.

[0032] 6 is a diagram showing the configuration of the requirement impact information 135. The requirement impact information 135 has the following items: "requirement impact ID," "requirement ID," "plan ID," "requirement level Z," "second requirement achievement level," "requirement impact C," and "requirement review recommendation level C / Z." "requirement level Z" and "second requirement achievement level" may be omitted.

[0033] "Requirement Impact ID" is identification information for "Requirement Impact C" for each "Requirement ID" and "Plan ID." "Requirement ID" is identification information for the requirement that "Requirement Impact C" targets. "Plan ID" is identification information for the linear object placement plan to which the "requirement" that "Requirement Impact C" targets is applied. "Requirement Level Z" is information that represents the importance of the requirement identified by "Requirement ID" as a numerical value.

[0034] The "second requirement achievement level B" is the requirement achievement level when the requirement identified by the "requirement ID" is excluded from the deployment plan identified by the "plan ID".

[0035] Here, "basic requirement achievement level A" is the "total requirement levels of requirements satisfied in the target placement plan" in placement plan information 133 of requirement information 134, which is input using placement plan information 133 and requirement information 134. "The total requirement levels of requirements satisfied in the target placement plan" is the sum of the requirement levels up to the first unsatisfied requirement when satisfying the satisfied requirements in descending order of requirement level.

[0036] The "level of basic requirement achievement A" is not limited to the above, and may be "the number of requirements fulfilled in the target layout plan." Alternatively, the level of basic requirement achievement A may be "the sum of the results obtained by multiplying the degree of requirement fulfilled in the target layout plan by a weighting coefficient for each operator." Alternatively, the level of basic requirement achievement A may be "the sum of the results obtained by adding or multiplying the degree of requirement fulfilled in the target layout plan by an index corresponding to the length of each linear object or the installation cost of the linear object according to the length."

[0037] "Second requirement fulfillment level B" indicates the degree of fulfillment of the requirement information 134 in the deployment plan information 133 when each requirement in the requirement information 134 is ignored. The second requirement fulfillment level B is calculated in the same manner as the basic requirement fulfillment level A, but when the deployment plan information 133 and the requirement information 134 are input and a certain requirement in the requirement information 134 is ignored, it is the "total degree of fulfillment of the requirements fulfilled in the target deployment plan" in the deployment plan information 133. The "second requirement fulfillment level B" is based on the same calculation criteria as the "basic requirement fulfillment level A." For example, if the "basic requirement fulfillment level A" is the "total of requirements fulfilled in the target deployment plan," then the "second requirement fulfillment level B" is also the "total of requirements fulfilled in the target deployment plan." Furthermore, if the "basic requirement fulfillment level A" is the "number of requirements fulfilled in the target deployment plan," then the "second requirement fulfillment level B" is also the "number of requirements fulfilled in the target deployment plan."

[0038] "Requirement impact C" is the calculation result of (basic requirement achievement A - second requirement achievement B) for each "requirement impact ID." "Requirement review recommendation C / Z" is the calculation result of "requirement impact C" / "requirement Z" for each "requirement impact ID." The larger the "requirement review recommendation C / Z" value, the more unimportant the requirement is, but it is preventing other requirements from being fulfilled, and the higher the priority it should be given to compromise on. The requirement review recommendation indicates the priority of the requirement recommended for review when creating a deployment plan.

[0039] For example, if the "requirement level Z" in Figure 6 is Z1=2, Z2=3, Z3=1, Z4=3, and the "requirement impact C" is C1=2, C2=2, C3=5, C4=0, then the "requirement review recommendation level C / Z" is C1 / Z1=1, C2 / Z2=2 / 3, C3 / Z3=5, and C4 / Z4=0. Therefore, as the "requirement impact ID" is 3 corresponding to "C3 / Z3=5," the requirement with "requirement ID" = 3 is proposed as the requirement that should be compromised first in the deployment plan with "plan ID" = 1. Next, as the "requirement impact ID" is 1 corresponding to "C3 / Z3=1," the requirement with "requirement ID" = 1 is proposed as the requirement that should be compromised second in the deployment plan with "plan ID" = 1.

[0040] Furthermore, the larger the "requirement impact C" value, the more it hinders the fulfillment of other requirements. Therefore, by looking at the "requirement impact C," it is possible to identify requirements that should be prioritized and compromised. "requirement impact C" is the "requirement review recommendation level C / Z" where all requirements have a requirement level Z=1.

[0041] (Request compromise proposal processing) 7 is a flowchart showing the requirements compromise proposal presentation process, which is executed in response to a user instruction.

[0042] First, in step S11, the layout plan creation unit 121 of the plan creation support system 10 accepts input of area information 131, linear object information 132, and request information 134 via the input unit 11. Next, in step S12, the layout plan creation unit 121, request achievement level calculation unit 122, request influence level calculation unit 123, and request review recommendation level calculation unit 124 execute a review recommendation level calculation process based on the information accepted as input in step S11. Details of the review recommendation level calculation process will be described later with reference to FIG. 8.

[0043] Next, in step S13, the requirement review recommendation degree calculation unit 124 presents to the user a requirement compromise proposal based on the review recommendation degree calculated in step S12. The requirement compromise proposal is displayed as shown in a requirement compromise proposal presentation screen 14D2 (FIG. 11). The requirement compromise proposal presentation screen 14D2 will be described in detail later.

[0044] (Request review recommendation degree calculation process) 8 is a flowchart showing the request review recommendation degree calculation process. In the request review recommendation degree calculation process, a request from a user for the initial deployment plan information 133 that is created first is accepted. The request may be accepted from a stage before the initial deployment plan information 133 is created. In the request review recommendation degree calculation process, a request review recommendation degree is calculated as a basis for presenting a compromise proposal so that the final deployment plan information 133 is created while compromising on the accepted requests of multiple users.

[0045] First, in step S12a, the placement plan creation unit 121 creates a placement plan for placing the target linear object specified by the linear object information 132 in the area specified by the area information 131 using all the requirements in the requirement information 134.

[0046] In step S12a, the placement plan creation unit 121 determines a search order for placement routes for each linear object when creating placement plan information 133, so that requests with larger values ​​of the request level Z included in the request information 134 are preferentially satisfied. Then, the placement plan creation unit 121 searches for placement routes for each linear object based on the determined search order, and creates placement plan information 133.

[0047] Next, in step S12b, the allocation plan creation unit 121 displays a request addition screen 14D1 (FIG. 9) described below on the output unit 14, and waits for input of a request to be added to the request information 134. Next, in step S12c, the allocation plan creation unit 121 determines whether an additional request has been input via the request addition screen 14D1. If there is an additional request (step S12c YES), the allocation plan creation unit 121 proceeds to the process of step S12d, and if there is no additional request (step S12c NO), the allocation plan creation unit 121 proceeds to the process of step S12e.

[0048] In step S12d, the allocation plan creating unit 121 accepts the addition request.

[0049] Next, in step S12e, the allocation plan creation unit 121 determines whether the execute button 14D14 (FIG. 9) on the request addition screen 14D1 has been pressed. If the execute button 14D14 has been pressed (YES in step S12e), the allocation plan creation unit 121 proceeds to step S12f, and if the execute button 14D14 has not been pressed (NO in step S12e), the allocation plan creation unit 121 repeats step S12e.

[0050] In step S12f, the allocation plan creation unit 121 recreates the allocation plan information 133 so as to satisfy the request information 134 including the request added in step S12d, similar to step S12a. Note that execution of step S12f is canceled if there is no request added in step S12d.

[0051] Next, in step S12g, the requirement achievement level calculation unit 122 calculates the basic requirement achievement level A, which is the requirement achievement level in the allocation plan created in step S12a or S12f.

[0052] Next, in step S12h, the placement plan creation unit 121 creates placement plans for placing target linear objects defined in the linear object information 132 in areas defined in the area information 131 when requests are removed one by one from the request information 134. If there are requests added in step S12d, the request information 134 considered in step S12h also includes the additional requests.

[0053] Next, in step S12i, the requirement achievement level calculation unit 122 calculates the second requirement achievement level B for each requirement, which is the requirement achievement level in each allocation plan when each requirement calculated in step S12h is excluded.

[0054] Next, in step S12j, the request impact calculation unit 123 calculates the request impact C for each request, which is the result of subtracting each second request achievement level B in the deployment plan when each request is excluded from the basic request achievement level A calculated in step S12g.

[0055] Next, in step S12k, the request review recommendation degree calculation unit 124 calculates a request review recommendation degree C / Z for each request by dividing the request influence degree C calculated in step S12e by the request degree Z.

[0056] Next, in step S12l, the requirements review recommendation degree calculation unit 124 displays the requirements fulfillment determination result D12 for each requirement on the requirements addition screen 14D1 (see FIG. 10). When the requirements compromise proposal presentation screen button 14D15 on the requirements addition screen 14D1 is pressed, the requirements review recommendation degree calculation unit 124 shifts the process to step S13 of the requirements compromise proposal presentation process (FIG. 7).

[0057] (Request addition screen) 9 is a diagram showing a requirement addition screen 14D1. The requirement addition screen 14D1 is displayed on the output unit 14. A display area 14D11 of the requirement addition screen 14D1 displays, for example, the placement plan created in step S12a (FIG. 8) based on the area information 131, linear object information 132, and requirement information 134 inputted in step S11 (FIG. 7). A display area 14D12 of the requirement addition screen 14D1 displays all requirements included in the requirement information 134 given to the placement plan displayed in the display area 14D11.

[0058] A new requirement is added to the display area 14D12 by editing a template selected from the requirement templates 13D13 and pressing the add requirement button D120. When adding a new requirement, by inputting a requirement level in the "requirement level" input field of the add requirement button D120 and pressing the add requirement button D120, the requirement level input in the "requirement level" input field is assigned to the new requirement.

[0059] When the execute button 14D14 is pressed, the result becomes YES in step S12e (FIG. 8), and the placement plan is re-created based on the current request as in step S12f.

[0060] It is also possible to incorporate new requirements written freely into the planning support system 10 by using a generation AI such as a language model.

[0061] (Request addition screen 14D1 including request fulfillment determination result D12) 10 is a diagram showing a requirement addition screen 14D1 including a requirement fulfillment determination result D12. As shown in FIG. 10, the requirement addition screen 14D1 displays one of three states for each requirement displayed in the display area 14D12. That is, the allocation plan displayed in the display area 14D11 "fulfills" the requirement ("○" in the requirement fulfillment determination result D12), "may be fulfilled by relaxing the conditions" ("△" in the requirement fulfillment determination result D12), or "does not fulfill" the requirement ("X" in the requirement fulfillment determination result D12).

[0062] (Required compromise proposal presentation screen 14D2) 11 is a diagram showing a requirements compromise proposal presentation screen 14D2. The requirements compromise proposal presentation screen 14D2 is displayed on the output unit 14 after transition from the requirements addition screen 14D1 when the requirements compromise proposal presentation screen button 14D15 is pressed on the requirements addition screen 14D1.

[0063] The requirements compromise proposal presentation screen 14D2 displays a relaxation request D1231 for a requirement D123 for which the requirement fulfillment judgment result D12 on the requirements addition screen 14D1 is "△". The relaxation request D1231 means that the requirement is relaxed from "three or fewer bends" to "five or fewer bends". If the user accepts the relaxation request D1231, an accept button D123a is pressed. On the other hand, if the user rejects the relaxation request D1231, a reject button D123b is pressed.

[0064] Furthermore, the requirements compromise proposal presentation screen 14D2 displays a requirement deletion D1241 for a requirement D124 for which the requirement satisfaction determination result D12 on the requirements addition screen 14D1 is "X". The requirement deletion D1241 means that the requirement D1244 is deleted after giving up on being satisfied through compromise. If the requirement deletion D1241 is accepted by the user, an accept button D124a is pressed. On the other hand, if the requirement deletion D1241 is rejected by the user, a reject button D124b is pressed.

[0065] When the user presses either the accept button D123a or the reject button D123b, or either the accept button D124a or the reject button D124b, and then presses the request addition screen button 14D21, the output unit 14 transitions to the request addition screen 14D1 (FIG. 9).

[0066] Then, on the requirement addition screen 14D1 after the transition, the requirement D123 is replaced with a relaxed requirement D1231, and the requirement D124 is deleted. When the execute button 14D14 is pressed, the allocation plan is recreated based on the requirement information 134 that reflects the relaxation of the conditions of the requirement D123 and the deletion of the requirement D124 (step S12f (FIG. 8)).

[0067] The number of requirements to be reviewed and displayed on the requirements compromise proposal presentation screen 14D2 is not particularly limited. However, a predetermined number of requirements with high requirements impact may be displayed on the requirements compromise proposal presentation screen 14D2 as requirements to be reviewed. Alternatively, the number of requirements to be reviewed and displayed on the requirements compromise proposal presentation screen 14D2 may be the same for each user, or the requirements to be reviewed may be selected and displayed so that the difference in the total requirement levels is kept within a predetermined range. In this case, a deployment plan for accepting the compromise requirements proposal may be displayed.

[0068] (Effects of the embodiment) In the above-described embodiment, a basic requirement fulfillment level is calculated as an evaluation index of the degree to which a deployment plan satisfies multiple requirements. A second requirement fulfillment level is calculated for each requirement as an evaluation index of the degree to which the deployment plan satisfies multiple requirements excluding each requirement when each requirement is excluded from the multiple requirements. Then, a requirement influence level is calculated for each requirement as an evaluation index of how much the second requirement fulfillment level improves relative to the basic requirement fulfillment level, based on the second requirement fulfillment level and the basic requirement fulfillment level for each requirement. Furthermore, a requirement review recommendation level is calculated for each request, based on the requirement level and the requirement influence level for each requirement, indicating the priority of each requirement recommended as a requirement to be reviewed when creating a deployment plan. Therefore, according to the embodiment, based on the requirement influence level or the requirement review recommendation level, requirements that are more appropriately reviewed and requirement compromise proposals are presented to the user. The deployment plan can be optimized by repeatedly compromising on the user's requirements and relaxing conditions based on the requirement compromise proposals.

[0069] (Modification of the embodiment) (1) Regarding the viewing of information such as Request Information 134 All users may be able to view other users' requirement information 134, requirement addition screen 14D1, and requirement compromise proposal presentation screen 14D2, or may be able to view only their own requirement information 134, requirement addition screen 14D1, and requirement compromise proposal presentation screen 14D2. The administrator of the planning support system 10 may also change the scope of information disclosure depending on the phase of planning. For example, planning may initially proceed without disclosing each other's requirements, and then, once compromise requirement proposals are accepted on the requirement compromise proposal presentation screen 14D2, each user's compromise details may be presented. By controlling the scope of information disclosure in this way, requirement compromise and deployment plan creation can be efficiently performed.

[0070] (2) Regarding the re-creation of the layout plan information 133 after the acceptance of the compromise request proposal The re-creation of the placement plan information 133 after each user's compromise proposal is accepted via the requirement compromise proposal presentation screen 14D2 may be performed as follows: That is, based on either or both of the requirement level and requirement impact level of each requirement, a search order for placement routes for each linear object when creating the placement plan information 133 may be determined, and placement routes for each linear object may be searched for based on this search order to create the placement plan information 133. This allows requirements with high requirement levels or requirement impact levels to be satisfied preferentially, and requirements that are more likely to accept compromise or relaxation of conditions to be presented efficiently as targets for review.

[0071] (3) How to calculate the recommendation level for reviewing requirements In the above-described embodiment, the requirement impact and requirement reassessment recommendation level are calculated for one placement plan. However, since a placement plan is not necessarily the best placement plan, calculating the requirement impact and requirement reassessment recommendation level based on one placement plan does not necessarily result in the best requirement reassessment recommendation level. Therefore, multiple placement plans may be created, the requirement impact level for each requirement may be calculated for each placement plan, the average of the requirement impact levels for each requirement calculated for each placement plan may be calculated, and the requirement reassessment recommendation level for each requirement may be calculated based on the average requirement impact level. This allows for the calculation of an averagely better requirement reassessment recommendation level and the presentation of a more appropriate requirement compromise.

[0072] (4) How to select requests to be submitted for review In the above-described embodiment, requests presented as review targets are selected from those with the highest request impact or request reassessment recommendation level. However, doing so may result in a request from a certain operator being unilaterally required to be compromised, resulting in unfairness among operators. Therefore, when selecting a request to be reviewed from among multiple requests, the request impact or request reassessment recommendation level for each request is calculated when the request is excluded from the multiple requests, and the total of the calculated request impact or request reassessment recommendation levels for each operator is calculated. The request to be reviewed may then be selected so that the total of the calculated request impact or request reassessment recommendation levels for each operator is most even. In this way, even if a certain operator accepts compromise or relaxation of conditions for a certain request, the total of the request impact or request reassessment recommendation levels for each operator based on the request information 134 after the compromise or relaxation of conditions is equalized, thereby reducing unfairness among operators.

[0073] The present invention is not limited to the above-described embodiments, and includes various modifications. Furthermore, the above-described embodiments have been described in detail to clearly explain the present invention, and are not necessarily limited to those having all of the described configurations. Furthermore, not only are such configurations removed, but replacement or addition of configurations is also possible. Furthermore, forms in which some or all of the above-described embodiments are appropriately combined to be consistent are also included in the embodiments of the present invention.

[0074] Furthermore, the above-described configurations, functions, processing units, processing means, etc. may be partially or entirely implemented in hardware, for example, by designing them as integrated circuits. The present invention can also be implemented by software program code that implements the functions of the embodiments. In this case, a recording medium on which the program code is recorded is provided to a computer, and a processor within the computer reads the program code stored in the recording medium.

[0075] In this case, the program code itself read from the recording medium will realize the functions of the above-described embodiment, and the program code itself and the recording medium on which it is stored constitute the present invention. Examples of recording media for supplying such program code include flexible disks, CD-ROMs, DVD-ROMs, hard disks, SSDs (Solid State Drives), optical disks, magneto-optical disks, CD-Rs, magnetic tapes, non-volatile memory cards, ROMs, etc.

[0076] Furthermore, the program code that realizes the functions described in this embodiment can be implemented in a wide range of program or script languages, such as assembler, C / C++, perl, Shell, PHP, and Java (registered trademark).

[0077] In the above-described embodiment, the control lines and information lines are those that are considered necessary for the explanation, and not all control lines and information lines in the product are necessarily shown. All components may be interconnected. [Explanation of symbols]

[0078] 10: Planning support system, 12: Control unit, 13: Memory unit, 14: Output unit, 14D1: Requirement addition screen, 121: Placement plan creation unit, 122: Requirement achievement level calculation unit, 123: Requirement influence calculation unit, 124: Recommendation level calculation unit, 131: Area information, 132: Linear object information, 133: Placement plan information, 134: Requirement information, 135: Requirement influence information.

Claims

1. A planning support method executed by a planning support system that supports creation of an arrangement plan for arranging a plurality of linear objects in a predetermined area, comprising: The planning support system includes a processor and a memory, the processor: based on linear object information including information on the start points and end points of each of the plurality of linear objects, a plurality of requirements that are constraints when an operator places the plurality of linear objects in the predetermined area, and area information that defines the predetermined area, searching for a placement route that connects the start points and end points of each of the plurality of linear objects in the predetermined area, and creating the placement plan including the placement route; Calculating a basic requirement achievement level, which is an evaluation index of the degree to which the allocation plan satisfies the plurality of requirements, based on the allocation plan and the plurality of requirements; calculating, for each request based on the allocation plan and the plurality of requests, a second request achievement level which is an evaluation index of the degree to which the allocation plan satisfies the plurality of requests excluding each of the requests when the request is excluded from the plurality of requests; A requirement influence degree, which is an evaluation index indicating how much the second requirement achievement degree improves relative to the basic requirement achievement degree, is calculated for each requirement based on the second requirement achievement degree and the basic requirement achievement degree for each requirement. A planning support method comprising the steps of:

2. 2. The planning support method according to claim 1, a requirement level indicating the importance of each of the plurality of requirements is assigned to each of the plurality of requirements, the processor: A request review recommendation level indicating a priority for recommending each of the requests as a request to be reviewed when creating the allocation plan is calculated for each of the requests based on the request level and the request impact level for each of the requests.

10. A planning support method comprising the steps of:

3. 2. The planning support method according to claim 1, a requirement level indicating the importance of each of the plurality of requirements is assigned to each of the plurality of requirements, the processor: Calculating the basic requirement achievement level and the second requirement achievement level based on the allocation plan, the plurality of requirements, and the requirement levels. A planning support method comprising:

4. 2. The planning support method according to claim 1, a requirement level indicating the importance of each of the plurality of requirements is assigned to each of the plurality of requirements, the processor: determining a search order for the placement path for each of the linear objects when creating the placement plan based on either or both of the request level and the request influence level; The placement plan is created by searching for the placement path for each linear object based on the search order. A planning support method comprising:

5. 2. The planning support method according to claim 1, the processor: Creating a plurality of said layout plans; Calculating the request impact for each of the requests for each of the allocation plans; Calculating an average of the request impact degrees for each of the requests calculated for each of the allocation plans; Calculating the degree of recommendation to reconsider each of the requests based on an average of the request impact degrees for each of the requests. A planning support method comprising the steps of:

6. 3. The planning support method according to claim 1 or 2, Each of the plurality of requests is assigned with identification information of the business entity making the request, the processor: When selecting a request as the request to be reviewed from among the plurality of requests, calculating the request impact degree or the request review recommendation degree for each of the requests when the certain request is excluded from the plurality of requests; Calculating the total of the request impact degree or the request review recommendation degree for each of the requests calculated for each of the business operators; The certain request is selected so that the calculated total of the request impact degree or the request review recommendation degree for each of the requests is most uniform for each of the businesses. A planning support method comprising the steps of:

7. A planning support system that supports the creation of an arrangement plan for arranging a plurality of linear objects in a predetermined area, The planning support system includes a processor and a memory, The processor: based on linear object information including information on the start points and end points of each of the plurality of linear objects, a plurality of requirements that are constraints when an operator places the plurality of linear objects in the predetermined area, and area information that defines the predetermined area, searching for a placement route that connects the start points and end points of each of the plurality of linear objects in the predetermined area, and creating the placement plan including the placement route; Calculating a basic requirement achievement level, which is an evaluation index of the degree to which the allocation plan satisfies the plurality of requirements, based on the allocation plan and the plurality of requirements; calculating, for each request based on the allocation plan and the plurality of requests, a second request achievement level which is an evaluation index of the degree to which the allocation plan satisfies the plurality of requests excluding each of the requests when the request is excluded from the plurality of requests; A requirement influence degree, which is an evaluation index indicating how much the second requirement achievement degree improves relative to the basic requirement achievement degree, is calculated for each requirement based on the second requirement achievement degree and the basic requirement achievement degree for each requirement. A planning support system characterized by:

Images