JP6162264B2 - Resource management plan creation apparatus and method - Google Patents

Description

  The present invention relates to a resource management plan creation apparatus and method, and a program thereof, and more particularly to resource management plans for resources such as mobile media (vehicles, aircraft, etc.) and crew in transportation services such as railways and airlines. The present invention relates to a technique that enables creation in consideration of the end location.

  In transportation services such as railways and airlines, in parallel with the operation schedule management, maintenance work plans for resources used for operation (mobile media, etc.) and crew crew plans are also considered. For example, in a railway, since the cycle of vehicle inspection is legally determined, inspection work must be performed periodically so as to observe the inspection cycle while efficiently allocating vehicles to the train. In addition, since the continuous crew hours and working hours of the crew are legally determined, the crew must be assigned to the train crew while protecting legal efforts. Such a plan that considers the operation of resources is referred to as a “resource operation plan”.

  The railway resource management plan is based on the characteristics of individual vehicles, such as the type and performance of the vehicles, the timing of return at the station, the time to return to the vehicle base for inspection, etc. The vehicle to be assigned to the vehicle must be selected, which is difficult manually. Similarly, the crew's operation plan is to take a train from a vast number of combinations, taking into consideration the characteristics of individual crew members such as the crew's working conditions and crew history, transit time and timing at the station, and break time. You must select a crew member. However, the creation of a resource management plan for railways has not been sufficiently systematized for both the vehicle and the crew, and is carried out manually by relying on the experience of skilled workers.

  Thus, various ideas for automatically creating a resource management plan have been proposed. For example, Patent Literature 1 and Non-Patent Literature 1 disclose that there is means for re-creating a resource operation plan that also considers the inspection period for train schedules that have been changed to recover from turbulence when trains are disrupted. ing. Further, Patent Document 2 discloses that a part capable of performing an unscheduled inspection work is found based on a train connection interval and has a means for creating a resource management plan in which a temporary inspection work is inserted. . Patent Document 3 discloses that a means for accepting a desired pattern from a user regarding a train turnaround or a vehicle assigned to a train and creating a resource management plan that takes into account the user's intention regarding the connection of the train is disclosed. .

JP 2010-58771 A JP 2005-259052 A JP 2003-154939 A

Sato, Keisuke, Fukumura, Naoto, Cargo Locomotive Operation Reorganization Problem in Time of Diamond Disorder IPSJ SIG Notes 2009 (19), 141-144, 2009-02-26

  In creating a resource management plan, it is important not only to satisfy the characteristics and operation schedule of the vehicle and crew as described above, but also to ensure regularity of operation (referred to as an operation pattern). For example, in the case of railways, a vehicle that is undergoing a large inspection is left as a spare vehicle at the vehicle base for one day before the inspection, or a spare vehicle for leveling the distance traveled and the number of days traveled between multiple vehicles. Dwelling period is deliberately included in the plan. Such regularity is an important factor not only for carrying out maintenance work on a regular basis, but also for enabling the site to perform work as usual in carrying out maintenance work and vehicle storage work. Similarly, there are operation patterns for crew members such as taking regular holidays and equalizing crew hours.

  If the plan is changed when the operation is disrupted, the operation end location of the resource (referred to as “staying place”) is not changed from the original plan within the day in order not to destroy the operation pattern after the next day, or at least It is important not to change the number of resources that will be terminated at the same location from the original plan. For example, in a railway, a vehicle that has been used for one day is stored in the station where the operation is completed or in the nearest vehicle base, and the operation is started from that location on the next day. When the operation is disrupted, if the station where the vehicle ends operation (referred to as the operation end station) changes, the next day will be allocated a train that is different from the original plan. Execution omission occurs. In order to prevent these problems, railway operators have taken measures such as returning trains whose operation ends have been changed to the original planned station as forwards as necessary. It is the cause. All of the techniques disclosed in the above documents are intended to create an operation plan so that the operation can be efficiently performed within the time range to be planned, and do not take into account the conditions of staying places.

  An object of the present invention is to provide a resource operation plan creation apparatus and method for creating an operation plan that does not change the operation end location from the original plan, and a program therefor.

The resource management plan creation device according to the present invention is preferably a storage unit that stores operation schedule information including original route information, operation information, resource information, route information, mergeable place information, and merge candidate information; Obtaining schedule information, creating a transportation route node for attributes included in each of the plurality of transportation routes included in the operation schedule information, and creating a path connecting between transportation route nodes to which the same resource can be allocated. In addition, an operation start node and an operation end node for each resource are generated, and an operation start node and an operation end node are determined based on attributes represented by the operation start node and the operation end node. Create multiple paths to be connected and easily select the path that has the same operation end node as the path of the original operation plan. Each of the network creation unit for setting the weight value, the merge candidate determination unit for determining a candidate path to which each resource is allocated among the plurality of paths based on the operation schedule information, and the merge candidate determination unit Based on the path determined to be a resource allocation candidate, the first network model is changed, and a merge candidate reflection unit that creates a second network model, based on the second network model and the weight value, A plan creation unit that extracts a combination of a plurality of paths including a path to which the operation start node is connected, and creates a new operation plan, and the merge candidate determination unit includes the operation information, the resource information, Based on the route information, calculate the number of transportation routes with each node in the current operation plan as the operation end node, and further, based on the original route information The number of transportation processes in which each node in the operation plan is the operation end node is calculated, and the calculated number of transportation processes in the current operation plan is compared with the number of transportation processes in the original operation plan, and the calculation is performed. When it is determined that the number of transport strokes in the current operation plan is different from the number of transport strokes in the original operation plan, a path that is a merge candidate is determined based on the mergeable location information and the merge candidate information. Configured as a resource management plan creation device.

In the resource management plan creation method according to the present invention, preferably, the operation schedule information of the resource is acquired, the transportation process node is created for the attribute included in each of the plurality of transportation processes included in the operation schedule information, and the same resource is used. A path connecting between allocatable transport process nodes is created to create a first network model of the transport process, and an operation start node and an operation end node of each resource are created, and the operation start node and the operation Create multiple paths that connect the operation start node and operation end node based on the attribute represented by the end node, and the path is in the path that has the same operation end node as the path of the original operation plan. A weight value is set so that it can be easily selected, and based on the operation schedule information, a path that is a candidate for assigning each resource among the plurality of paths is determined. , Based on the path where it is determined that the candidate assigning each resource, creating a second network model by changing the first network model based on said second network model and the weight value, the operational A resource operation plan creation method is characterized in that a combination of a plurality of paths including a path to which a start node is connected is extracted and a new operation plan is created.

  Furthermore, a program for creating a resource management plan according to the present invention is configured as a program that can execute the resource management plan creation on a computer.

  According to the present invention, it is possible to create an operation plan that does not change the operation end location of resources or the number of resources detained at the operation end location from the original plan.

It is a block diagram of the resource management plan preparation apparatus by one Example of this invention. It is a flowchart which shows the basic processing order of a resource management plan creation apparatus. It is a figure which shows the example of the operation schedule of a train. It is a figure which shows the example of allocation of the train to each organization in the train operation schedule. It is a figure which shows the structure of a mergeable place information record, and the example of data which belongs to the record. It is a figure which shows the structure of a merge candidate information record, and the data example which belongs to the record. It is a figure which shows the example of the network model showing an operation plan. It is a figure which shows the example of the network model showing the operation plan which added the merge train. It is a figure showing an example of the solution of an operation plan by a network model. It is a figure which shows the example of the output screen of a resource management plan preparation apparatus. It is a flowchart which shows the preparation procedure of a network model. It is a flowchart which shows the determination procedure of a merge candidate. It is a figure which shows the example of a suspension. It is a figure which shows the example of a suspension. It is a flowchart which shows the preparation procedure of an operation plan. It is a flowchart which shows the determination procedure of a merge candidate. It is a figure which shows the example of the operation schedule of a train. It is a figure which shows the example of allocation of the train to each organization in the train operation schedule. It is a flowchart which shows the determination procedure of a merge candidate. It is a flowchart which shows the preparation procedure of an operation plan.

  Embodiments of the present invention will be described below with reference to the drawings, taking vehicle operation in a railway as an example.

FIG. 1 is a block diagram illustrating a configuration example of a resource management plan creation device. The resource management plan creation apparatus 1000 is realized in a computer having a memory 1001, a storage unit 1100, a display unit 1200, an input unit 1201, a processing unit (CPU) 1202, a communication unit 1203, and a data bus 1204 connecting them. This resource management plan creation device 1000 is connected to an external terminal device or the like via a communication network.

  The display unit 1200 is a visual output unit of information such as a liquid crystal display, and displays an execution status and an execution result processed by the resource management plan creation apparatus 1000 to notify the user. The input unit 1201 is a device for inputting instructions to a computer such as a keyboard and a mouse, and accepts input from a user. The processing device 1202 executes various programs stored in the memory 1001. The communication unit 1203 exchanges various data and commands with other devices via a LAN (Local Area Network) or the like. The storage unit 1100 stores various data for the resource management plan creation apparatus 1000 to execute processing. The memory 1001 holds various programs 1002 executed by the resource management plan creation apparatus 1000 and temporary data.

  The storage unit 1100 stores original route information 1, operation information 2, resource information 3, route information 4, mergeable location information 5, and merge candidate information 6. A program 1002 is stored in the memory 1001 and the program 1002 is executed by the processing device 1202, so that an operation schedule reading unit 1003, a network creation unit 1004, a merge candidate determination unit 1005, a merge candidate reflection unit 1006, and a plan creation unit Each function unit 1007 is realized. The operation schedule reading unit 1003 reads the operation information 2 stored in the storage unit 1100. The network creation unit 1004 creates a network model representing a resource operation plan based on the operation information read by the operation schedule reading unit 1003. Details regarding this network model are described in FIG.

  The merge candidate determination unit 1005 calculates an operation end station of each resource based on the operation information read by the operation schedule reading unit 1003, and determines a route to be a candidate for assigning a plurality of resources based on the calculated station. The merge candidate reflection unit 1006 changes the network model created by the network creation unit 1004 based on the path determined by the merge candidate determination unit 1005 as a candidate to which a plurality of resources are allocated. Details of the network model after the change will be described with reference to FIG. The plan creation unit 1007 creates a constraint condition based on the network model created by the network creation unit 1004 and modified by the merge candidate reflection unit 1006, creates a resource operation plan to satisfy the created constraint condition, The created resource management plan is presented to the user via the display unit 1200.

  FIG. 2 is a flowchart showing a basic processing procedure of the resource management plan creation device 1000. First, an outline of the operation procedure will be described. The operation schedule reading unit 1003 reads the operation information 2 stored in the storage unit 1100 (S201). Then, the network creation unit 1004 creates a network model representing an operation plan for resources such as vehicles based on the operation schedule read by the operation schedule reading unit 1003 (S202). The network model to be created will be described in detail with reference to FIG. 6, and the network model creation method will be described in detail with reference to FIG.

  Based on the operation schedule read in S201 and the mergeable place information 5 stored in the storage unit 1100, the merge candidate determination unit 1005 determines a path (referred to as a merge candidate) that is a candidate to allocate a plurality of resources (S203). ). For example, in the case of railways, trains that are candidates for merged trains are determined. Here, the merged train is a train that combines a plurality of trains and travels as one train. The organization means a group of a plurality of vehicles assigned to a train. The method for determining the merge candidate will be described in detail with reference to FIG. The merge candidate determination unit 1005 determines whether there is a train determined as a merge candidate in S203, and if there is one or more candidates, executes a process S205 that reflects the merge candidate in the network model created in S202, When there is no merge candidate, processing S206 for creating a resource management plan is executed (S204).

  The merge candidate reflecting unit 1006 adds a node and a link representing the merge candidate train determined in S203 to the network model created in S202 (S205). The network model to which the merge candidates are added will be described in detail with reference to FIG. The plan creation unit 1007 creates a mathematical model formulated as a transportation plan problem based on the network model created in the series of steps S201 to S205, and creates a resource management plan that satisfies the conditions expressed by the mathematical model ( S206). Here, the mathematical model to be created and the plan creation procedure will be described in detail with reference to FIG. The plan creation unit 1007 displays the resource management plan result created in S206 on the display unit 1200 (S207) to inform the user. At this time, if a plurality of plan results are created in S206, all of them are displayed.

  Next, various types of information 1 to 6 handled in the present embodiment will be described, and then details of the processing units 1003 to 1007 of the resource management plan creation apparatus 1000 will be described. The original route information 1 is information related to the route planned before the operation is started, and the items are configured by adding the starting station and the ending station of each train to the items of the subsequent route information 4. . The operation information 2 defines the process for each minimum unit of the transport service. For example, the minimum unit of transportation service on a railroad is a train, and is defined by a station where the train stops or passes from the first station to the last station, arrival time / departure time or passage time of each station.

  Resource information 3 defines resources used for transportation services. For example, the resource information in the railway is a vehicle or a crew member. For example, the information that defines the vehicle includes the vehicle name or identification number for uniquely identifying the vehicle, the presence or absence of maintenance work (such as inspection or cleaning) scheduled to be performed on the day of operation, the time when the maintenance work can be performed, It is represented by a route identification number for uniquely identifying the implementation location and the transportation service (corresponding to a train in the railway) assigned to the vehicle.

  The route information 4 defines in what order one resource executes the minimum unit of transportation service. For example, in the case of a railway, the route information is a list of train information assigned to one train in consideration of loopback operation of the train and storage / drawing to the vehicle base (FIG. 3A). Here, the train information is a train name or a train ID that uniquely identifies a train. For example, FIG. 3B shows how a train is assigned to each of the three trains. That is, one train is assigned to the train 1, the train 4, and the train 8. Similarly, another train is assigned to train 2, train 5, train 7 and train 9, and another train is assigned to train 3, train 6 and train 10, respectively.

  The mergeable place information 5 defines a place where work for merging or separating a plurality of resources can be performed. For example, in the case of a railroad, information on a place where a plurality of trains can be merged or separated or a station connected to a depot is defined as mergeable place information. Taking a railway as an example, an example of mergeable place information 5 is shown in FIG. The target line section 51 stores an ID or line section name that uniquely identifies a line section to be defined. The mergeable location 52 stores an ID or a station name that uniquely identifies a station that belongs to the line identified by the target line 51 and that can perform the merge operation. The separable place 53 stores an ID or a station name that uniquely identifies a station that belongs to the line identified by the target line 51 and that can perform the separation work. For example, the record 54 indicates that among the stations belonging to the line A, the merge work can be executed at the A station and the C station, and the separation work can be executed at the C station.

  The merge candidate information 6 stores paths determined by the merge candidate determination unit 1005 as merge candidates, or stores merge candidates when merge candidates are determined in advance. For example, in the railway, it is information defining trains that are candidates for merging. FIG. 5 shows an example of merge candidate information. The merged section 61 stores the distance between stations that run as merged trains. The merge candidate 62 stores trains that are merge candidates. The mergeable number 63 stores the maximum number of formations that can be merged as a merged train. For example, the record 64 indicates that between the merged sections A station to C station, it is possible to additionally merge up to 2 trains in the original train and run as the train 5.

  3A and 3B will be used to describe the target business in the present embodiment, and FIG. 6 will be used to explain the resource management plan model. After that, details of functions and operations of the respective processing units of the resource management plan creation apparatus 1000 will be described with reference to FIGS. In the present embodiment, it is assumed that the operation of organizing the operation of the vehicle performed when the railway operation is disturbed. The vehicle operation organization is a task of changing the allocation of vehicles to the train in accordance with the changed operation schedule when the train operation schedule is suddenly changed due to an accident or a vehicle failure. Vehicle allocation changing means includes means for changing the train assigned at the turn-back station, means for temporarily drawing a spare train detained at the vehicle base, and means for temporarily storing the vehicle in the vehicle base. In addition, the vehicle is required by law to perform periodic inspections according to the distance traveled and the number of days traveled. In the vehicle operation arrangement, taking into consideration that the inspection determined so as not to exceed the inspection cycle is taken into consideration, the vehicle assignment is changed by combining the above-described means.

  <Description of Business> FIG. 3 shows a diagram used in a railway transportation service and data used as an example in this embodiment. FIG. 3A shows an example of a train operation schedule. The train operation schedule is created based on the operation information 2. The vertical axis 31 in FIG. 3A represents a station, and the horizontal axis 32 represents time. One train is represented by drawing a line from the first station to the last station of the train according to the time. For example, the thick line 33 represents one train that starts from the station C at 6:00 and ends at the station A around 6:30.

  A line segment that connects two train lines like a line segment 34 represents a train group assigned to one train. For example, in the example of FIG. 3B, it means that the train 1, the train 4, and the train 8 are connected as a series of train groups, and one train travels in this order. A symbol represented by “◯” as in symbol 35 represents a timing at which the train is pulled out from the vehicle base. For example, the symbol 35 represents that the train is pulled out from the vehicle base adjacent to the station C in accordance with the departure of the train 1. A symbol represented by “Δ” like symbol 36 represents a timing at which the train is stored in the vehicle base. For example, the symbol 36 indicates that the train assigned to the train 6 is stored in the vehicle base adjacent to the station A after the train 6 arrives.

  FIG. 3B shows the assignment of trains to each train. This train assignment is created based on the resource information 3 and the route information 4. FIG. 3B is represented by a horizontal axis 41, a composition name 42, and allocation information 43. The axis 41 represents time. The organization name 42 represents a name for uniquely identifying the organization. The assignment information 43 represents the assignment of trains to the formation shown in the formation 42. Each assigned train is represented by one horizontal bar (for example, horizontal bar 44), and a train name (for example, train name 45) is displayed near the horizontal bar. In addition, in the case of a schedule in which maintenance work such as cleaning or inspection is scheduled, a symbol representing the scheduled work is displayed. For example, the symbol 46 represents that the maintenance work called the inspection A is scheduled to be performed after the formation C travels as the train 6.

  A series of route information will be described using the record 47 as an example. The record 47 represents a route assigned to the formation C, and the formation C represents the traveling as the train 10 after traveling as the train 6 after traveling as the train 3 and performing the operation of inspection A. ing. 3A, the train 6 is stored in a vehicle base adjacent to the station A after traveling, and the train 10 is to be pulled out from the vehicle base adjacent to the vehicle base A. Therefore, the train set C can be read as it is temporarily stored in the vehicle base after traveling the train 3 and the train 6, and then pulled out from the vehicle base again and travels as the train 10.

  <Network Model> FIG. 6 shows a network model of the resource operation plan. In the example shown in FIG. 6, some links are omitted for easy viewing. FIG. 6 is a network model representing candidates that can be created as a route, and includes a formation node, a train node, a termination node, a connection link, and a termination link.

  (1) A knitting node A knitting node is a node representing a knitting to which a route is assigned. One organization node is set for each organization. The knitting node is the start time of the time zone in which the knitting can be used, the end time of the time zone in which the knitting can be used, the position detained at the start of operation (adjacent or detained station of the depot), The starting station of the route of the plan and the ending station of the route of the original plan are attributes.

(2) Train node The train node represents a train included in the operation schedule. One train node is set for each train. The train node has a train start station, end station, start time, and end time as attributes.

  (3) End node The end node represents the end of the path. One terminal node is set per organization. The terminal node has an organization name or organization ID that uniquely identifies the organization and an end station of the route planned in the original plan as attributes. For example, the end node 61 represents the end of the route of the formation A. In the example shown in FIG. 3B, the end of the route of the original plan of the formation A is the train 8, and the train 8 ends at the station A in the example shown in FIG. Therefore, the value of the attribute of the terminal station of the terminal node 61 is “station A”.

  (4) Connection link A connection link is a directional link that connects train nodes, between train nodes and train nodes, and between train nodes and terminal nodes, and is created as follows.

  (How to connect the connection link between train nodes) The connection link between train nodes is created so that the connection between the time and the station is established based on the start station, start time, end station, and end time of the train represented by the train node. To do. For example, the train node 63 represents the train 1, the first station is station C, the last station is station A, the first time is 6 o'clock, and the last time is 6:30. The node 64 represents the train 4. The first station is station A, the last station is station C, the first train time is 6:40, and the last train time is 7:05. When these two train nodes are compared, the terminal station of the node 63 is equal to the starting station of the node 64, so the connection of places is established. In addition, since the end time of the node 63 is earlier than the start time of the node 64, time connection is established. Therefore, a connection link from the node 63 to the node 64 can be created. Similarly, connection links can be created from the node 63 toward the node representing the train 5, the node representing the train 3, and the node representing the train 10.

  In the connection link between trains continuously assigned to the same organization in the original resource management plan, a weight that is more easily selected as a solution than the other connection links is set. For example, as will be described later, in the present embodiment, a route is created by searching for a circuit that reduces the link weight on the network shown in FIG. Therefore, a small weight is set for the connection link between trains that are continuously assigned to the same train in the original resource management plan. This makes it possible to obtain a plan with as few changes as possible from the original plan. In the following description, weights that are easily selected as connection links have the same meaning.

  (How to connect a connection link between a train node and a train node) A connection link between a train node and a train node represents the train's first station, first train time, last station, last train time, and train node. Based on the start time and end time of the time period in which the composition can be used, and the position of the composition at the start of operation, the time and place are connected. For example, since the available time zone of the knitting represented by the knitting node 62 (knitting A) is 6:00 and the start position is the station C, a train representing a train that starts from the knitting node 62 after 6 pm Create a connection link towards the node. That is, connection links are created toward train nodes representing train 1, train 2, train 6, and train 8, respectively. For connection links that show the same allocation as the original resource management plan, a weight that is more easily selected as a solution than other links is set.

  (How to connect the connection link between the train node and the terminal node) The connection link between the train node and the terminal node is created from the train node that can be set as the final train of the route toward the terminal node. A train that can be set as a final train on a route is basically a train that has a station adjacent to a depot or a station that can be detained in the station premises until the next day as a terminal station. If this is not the case, it is not desirable because it will run forward to store the vehicle in the depot. For the connection link that connects the train node representing the train that is the end of the route in the original plan and the end node, a weight that is more easily selected as a solution than the other links is set.

  (5) End link The end link is a link for constraining the route so as to end the route at the point where the organization was scheduled in the original resource management plan. For the end link, links are created from one end node toward all formation nodes, and weights are set based on restrictions on the route end point. That is, the value of the terminal station on the original resource management plan held by the terminal node is compared with the value of the terminal station on the resource management plan held by the organization node. A weight value is set to a termination link connecting the termination node and the corresponding composition node so that the termination link is more easily selected than the termination link extending from the corresponding termination node to another composition node.

  For example, it is assumed that a link having a smaller weight is easily selected. At this time, the terminal node 61 represents the terminal of the route of the formation A, and the terminal station of the original plan is the station A. The node representing the formation A is the formation node 62, and the terminal station of the original plan is the station A. Since the terminal station of the terminal node 61 and the terminal station of the train node 62 are the same, a value smaller than the link extending from the terminal node 61 to another train node is set for the terminal link connecting the terminal node 61 and the train node 62. Further, the end node 65 represents the end of the route of the formation B. From FIG. 3B, the end of the route of the formation B is the train 9, so the terminal station is the station C. Since the end of the route of the formation C is also the station C, the end node 65 has the same value for both the end link with the formation node 67 representing the formation B and the end link with the formation node 68 representing the formation C. Set the weight. By setting the weight of the end link, even when the train assigned at the end of the route is different from the original resource operation plan, it is possible to increase the possibility that the same train is assigned to the end station.

  In the present embodiment, the network model as described above is a basic, and when there are merge candidates, the network model is changed according to the merge candidates. Then, a resource management plan is created based on the network model. Next, the details of the processing procedure of the resource management plan creation apparatus 1000 will be described with reference to FIG. In S <b> 201, the operation schedule reading unit 1003 reads the operation information 2 stored in the storage unit 1100. In S202, the network creation unit 1004 creates the network model shown in FIG. 6 based on the operation information read in S201. Details of the procedure for creating the network model will be described later with reference to FIG.

  In S <b> 203, the merge candidate determination unit 1005 reads the mergeable place information 5 stored in the storage unit 1100, determines a train that is a merge candidate, and stores it in the merge candidate information 6 of the storage unit 1100. The determination of trains that are candidates for merging will be described later with reference to FIG. In S204, the merge candidate determination unit 1005 proceeds to reflect the merge candidate (S205) if there is a merge candidate, and proceeds to create a resource management plan (S206) if there is no merge candidate. In S205, the merge candidate reflection unit 1006 adds a node and a link representing the merge candidate stored in the merge candidate information 6 of the storage unit 1100 to the network model created in S202.

  Here, a method of reflecting the merge candidates on the network model will be described with reference to FIG. Hereinafter, a case where the train 3 and the train 4 are suspended in the operation schedule read in S201 and the merge candidate determination unit 1005 creates a determination result as illustrated in FIG. 4 will be described as an example. . Since the train 3 and the train 4 are closed, in S202, a node in which the nodes representing the train 3 and the train 4 are deleted from the network shown in FIG. 6 and all the links connected to these are deleted is created. Is done. In S205, a node 91 representing the train 5 (see FIG. 4) which is a merge candidate is detected from this network, and this node is duplicated as many as the number that can be merged and added to the network model. In this case, duplicating a node means creating a new node and assigning the same attribute value as the attribute of the node as the duplication source to the newly created node. Here, in the example of FIG. 4, the train 5 can be merged up to a maximum of two trains. Therefore, as shown in FIG. 7, two nodes representing the train 5 are duplicated and added to the network model (the node 92 and the node). 93). After adding the node, create a link that connects the duplicated node to other nodes. There are the following two methods for creating links.

  (1) When there is only one merge candidate train The link is created so as to connect to the same node as the node to which the replication source node is connected. For example, in the example of FIG. 7, the node 91 includes a train node “train 1”, a train node “train 2”, a link having a train node “train C” as connection sources, a train node “train 8”, and a train node. “Train 7”, train node “train 6”, and termination node “end C” are connected to the respective links. Therefore, similarly, the nodes 92 and 93, which are duplicates of the node 91, are linked to the train node “train 1”, the train node “train 2”, and the train node “train C”, respectively, and the train node “ The train 8 ", the train node" train 7 ", the train node" train 6 ", and the end node" end C "are connected by links.

  (2) When there are multiple merge candidate trains: Create a link with the start train of the merge candidate as the connection destination in the same way as the node at the copy source, and the link with the end train of the merge candidate as the connection source. Create like a node. For the train between the start candidate train and the end train of the merge candidate, a link is created so that only a link connecting the merge candidates exists. For example, if the merge candidate is “train 5 → train 8 → train 10”, the link with the replication node of train 5 as the connection destination is created in the same manner as the link with train 5 as the connection destination, A link having the replication node of the train 10 as a connection source is created in the same manner as a link having the train 10 as a connection source. Then, the link having the replication node of the train 5 as the connection source is created only toward the replication node of the train 8, and the link having the replication node of the train 8 as the connection source is created only toward the replication node of the train 10.

  An example of the solution of the resource management plan expressed using this network model is shown in FIG. In FIG. 8, after the formation A travels as the train 1, the train A travels as a part of the merged train 5, travels as the train 8, and then ends the operation. Similarly, the formation C travels as a part of the merged train 5, travels as the train 6, travels as the train 10, and then ends the operation. In S206, the plan creation unit 1007 creates a resource operation plan based on the network model created by executing S201 to S0205. The detailed procedure will be described with reference to FIG.

  In S207, the plan creation unit 1007 presents the plan created in S206 to the user. FIG. 9 shows an example of the output screen. On the output screen 111, an operation schedule diagram 112 and an allocation diagram 113 are displayed. This screen is created by the plan creation unit 1007 and displayed on the display unit 1200. The way of viewing the operation schedule diagram 112 and the allocation diagram 113 is as shown in the description of FIGS. 3A and 3B, respectively. In the example of the network model shown in FIG. 8, the train 5 is supposed to travel with the formation A and the formation C combined with the original train 5. For this reason, in the operation schedule diagram 112 showing the operation plan represented by this network model, a train line 115 and a train line 116 representing the merge are drawn in parallel with the train line 114 corresponding to the original train 5. In addition, in the allocation chart 113, the line segment 117, the line segment 118, and the line segment 119 representing the train 5 are shown in the rows representing the train allocation to the train A, the train B, and the train C, respectively. In addition, the number of the corresponding train is located near the line representing the train. For example, the label 120 indicates that when the train A travels as the train 5, the train travels from the first vehicle to the second vehicle of the six-car train.

  Next, details of creation of a network model in S202, determination of merge candidates in S203, and creation of a resource operation plan in S206 will be described. FIG. 10 shows a procedure for creating a network model in S202. In S <b> 121, the network creation unit 1004 reads the route information 4 stored in the storage unit 1100. In S122, the network creation unit 1004 reads the resource information 3 stored in the storage unit 1100. In S123, the network creation unit 1004 creates a train node that represents each train by separating the route information read in S121 into trains, extracts attributes of each train from the route information, and extracts the train nodes of the train. Assign to a node. The details of the train node and the attributes assigned to the train node are as shown in the network model of FIG. Furthermore, in S123, the identification information used as the train name of the train on the route information is given as the identification information of the train node of the train.

  In S124, the network creation unit 1004 creates a composition node and a terminal node based on the resource information read in S122, and assigns identification information and attributes of the node to each node. Details of these nodes (such as attributes of the nodes) are as shown in the network model of FIG. In S125, the network creation unit 1004 selects one node from the nodes created in S123 and S124. In S126, the network creation unit 1004 determines whether the node selected in S125 is a termination node. If the node is a termination node, the network creation unit 1004 proceeds to create a termination link in S127. If not, the network creation unit 1004 proceeds to create a connection link in S129. .

  In S127 and S128, the network creation unit 1004 creates a termination link as follows. In S127, a termination link is created from the node selected in S125 to the train node having the same termination station as the “end station in the original plan” which is one of the attributes of the node (termination link 1). Further, a termination link is created from the node selected in S125 toward the remaining train node (termination link 2). In S128, weights are set for the termination link 1 and the termination link 2 created in S127. Here, a weight value is set for the end link 1 so that it is easier to select than the end link 2 in the creation of the resource operation plan.

  In S129, the network creation unit 1004 creates a connection link from the node selected in S125 to a node that can be connected based on a comparison of the first departure station, first departure time, last arrival station, and last arrival time. The details are as shown in the network model of FIG. In S1210, the network creation unit 1004 sets a weight for the connection link created in S129. Here, when two nodes connected by a link are continuously assigned to the same organization in the original plan, for the link, another node connected to at least one of the two nodes is connected. A weight value is set so that the resource management plan can be selected more easily than the link. In S1211, the network creation unit 1004 determines whether or not the processing of S127 to S128 or S129 to S1210 has been performed on all the nodes created in S123 and S124, and if so, the series of processing ends. If not, the process proceeds to S125.

  Next, the procedure for determining merge candidates in S203 will be described with reference to FIG. In S1301, the merge candidate determination unit 1005 reads the operation information 2, the resource information 3, and the route information 4 from the storage unit 1100, and for each station, the number of trains in which the station is the operation end station (referred to as the number of late arrivals). X is calculated. Here, when the line segments and the assignable trains differ depending on the vehicle type, the calculation is performed separately for each vehicle type, and the subsequent processing is also performed separately for each vehicle type. In S <b> 1302, the merge candidate determination unit 1005 calculates the number Y of staying at each station in the original plan. Specifically, the original route information 1 is read from the storage unit 1100, and the number of overnight stays is calculated for each station.

  When determining the operation end station of each train, operation is not connected to the assigned route, that is, the end station of the train assigned earlier and the start of the train assigned later in the trains assigned following the same train When the stations are different or when the assigned train departs earlier than the end time of the previously assigned train, even trains that are correctly connected are handled as operations for the train. Therefore, the operation end station is the last terminal station of the train group to which the operation is correctly connected among the trains assigned to the train.

  In S1303, the merge candidate determination unit 1005 determines whether or not the number of stays X calculated in S1301 is different from the number of stays Y calculated in S1302. As a result of the determination, if both values are different, S1304 is executed, and if they are equal, the process is terminated as it is. In S1304, the merge candidate determination unit 1005 creates a section candidate for merging resources. For example, in the case of a railway, a combination of a start station and an end station between stations that run the merged train is created. The creation of candidates for the merged section differs depending on whether the operation end station of each train is matched with the original plan or the number of overnight stays at each operation end station is matched with the original plan. Thereafter, the plan shown in FIG. 3 is the original plan, and as shown in FIG. 12, the train 3 (the train line 61, the horizontal bar 63) and the train 4 (the train line 62, the horizontal bar 64) are suspended. Are shown for each case.

  (1) When the operation end station of each composition is combined with the original plan For each composition, the operation end station (S1) in the operation information 2 read from the storage unit in S1301 and the operation end station (S2) in the original plan ) And detect different knitting. For each detected organization, a combination of the start station and end station of the merged section is created with S1 as the merged station start station and S2 as the merged station end station. In addition, even if the operation end station does not change, if the route includes a suspension, the merged section can be determined by setting the suspension start station as the start station of the merged section and the suspension end station as the end station of the merged section. Add the start station / end station combination.

  An example of suspension will be described with reference to FIGS. 12A and 12B. Because train 3 and train 4 are suspended, the operation end of train A is changed from train 8 to train 1, but the end stations of train 8 and train 1 are both A stations, so the operation end station does not change. . On the other hand, formation C cannot be exited from the vehicle base because the operation start train has been suspended, and the operation end station has changed from station C, which is the terminal station of train 10, to station A. Therefore, a combination in which A station is the start station of the merged section and C station is the end station of the merged section is created as one of the merged section candidates. In addition to this, formation A does not change the operation end station, but includes a suspension on the route, so station A, which is the start station of the suspension section, is the start station of the merged section, station C, which is the termination station of the suspension section Is added as one of the candidates for the merged section.

  (2) When the number of overnight stays is matched with the original plan Using a station where the number of overnight stays calculated in S1301 and the number of overnight stays calculated in S1302 are different, a set of stations where the number of overnight stays is zero is created. Out of the stations belonging to the set, the station with the larger number of overnight stays than the original plan is set as the start station of the merged section, and the station with the less number of delayed stays than the original plan is set as the end station of the merged section. Create a combination of end stations. In addition, if there is a formation that includes a suspension in the route among the formations that are determined not to change the operation end station in S1303, the suspension start station is the start station of the merged section, and the suspension end station Is added as the end station of the merged section.

  Referring to FIG. 12, as explained in (1) above, the operation end station of formation C has been changed from C station to A station, and the number of overnight stays at A station is increased by one from the original plan, The station at C station is one less than the original plan. Therefore, a combination in which A station is the start station of the merged section and C station is the end station of the merged section is created as one of the merged section candidates. In addition to this, formation A does not change the operation end station, but includes a suspension on the route, so station A, which is the start station of the suspension section, is the start station of the merged section, station C, which is the termination station of the suspension section Is added as one of the candidates for the merged section.

  In S1305, the merge candidate determination unit 1005 selects one combination that has not been processed yet from the combination of the start station and end station of the merge section generated in S1304. In S1306, the merge candidate determination unit 1005 reads the mergeable place information 5 stored in the storage unit 1100, and starts from the station that is the start station selected in S1305 and is a station that can be merged. A route is generated that travels by arriving at the station that is the end station selected in S1305 and that can be separated. Here, whether or not the station can be merged is obtained by using the mergeable place information 5 to obtain the mergeable place 52 using the currently processed line as a search key for the target line 51 and processing the obtained result. Judge by whether or not the station is included. Similarly, whether or not the station is separable depends on whether or not the separable place 53 is acquired by using the currently processed line section as a search key for the target line section 51 and the processing result includes the station being processed. judge. In addition, when there are multiple routes including the same train and one includes the other, depending on the conditions to be considered when inserting the merged train, the route may be selected as follows, for example: Good.

  (1) When keeping the number of merged trains as small as possible Select the route with the smallest number of trains included in the route and create only that route. (2) When the trains are once merged, the route with the largest number of trains included in the route is selected and created only when the train is merged as close to the end of operation as possible.

  If the assignable trains are different depending on the vehicle type, the route is created so that only the same assignable trains are included in the same route. The created route is stored in the merge candidate information 6 (FIG. 5) in the storage unit 1100. Specifically, the combination of the start station and end station of the merge section selected in S1305 is stored in the merge section 61 of the merge candidate information 6, and the train IDs or train names of all trains included in the created route are merged. Store in candidate 62. Further, the number 63 that can be merged stores the number of times the same combination appears in the set of combinations created in S1304.

  As shown in S1304 above, in the example shown in FIG. 12, the combination of the start station and end station of the merged section has two combinations where the start station is “A station” and the end station is “C station”. is there. Further, as a route traveling from the A station to the C station, from the operation information of FIG. 12A, the route I: train 5, route II: train 5 → train 6 → train 10, route III: train 5 → train 8 → train There are 10 types. However, Route II and Route III include Route I, and the number of trains on Route I is the smallest. Therefore, in this embodiment, “train 5” is created as a route. As described above, the merge candidate information 6 stores “A station → C station” in the merge section 61, “train 5” in the merge candidate 62, and “2” in the mergeable number 63.

  Next, the procedure for creating the resource operation plan in S206 will be described with reference to FIG. In S1401, the plan creation unit 1007 temporarily excludes a termination link having a weight greater than a certain value from the network model created by the series of processes in S201 to S205. This is to increase the possibility of creating a plan so that the end station of the route of each train is the same as the original plan.

  In S1402, the plan creation unit 1007 searches for a circuit (that is, a route returning to the departure node without passing through any node other than the departure node more than once) based on the network model obtained as a result of the processing in S1401. . The circuit created here is a closed circuit starting from the knitting node, passing through the terminal node, and returning to the knitting node from the shape of the network model.

  In S1403, the plan creation unit 1007 generates a constraint condition for searching for a solution in the subsequent S1404 based on the mergeable place information 5 and the merge candidate information 6 stored in the storage unit 1100. In S1404, a search is made for a combination (referred to as a set of tours) of a tour that covers all train nodes only once and covers all merged train nodes only once at most once from the plurality of created tours. Here, it is a condition that the merged train node covers “at most once” and does not necessarily need to be covered. That is, it searches for a solution of the following set partitioning problem.

<Constant>

<Decision variable>

<Objective function>

<Restrictions>

  The objective function means finding a set of tours that minimizes the sum of the weights. Condition (1) is included in only one tour at most in each set of tours in the solution. Condition (2) means that the number of times a node other than the merged train appears in the circuit set as a solution is equal to the number of nodes other than the merged train. By combining condition (1) and condition (2), in the circuit set that is the solution, nodes other than the merged train are included only once in one circuit, and nodes of the merged train are not included in the circuit. Even if it is included, it is included only once.

  Condition (3) means that there are as many tours as the number of trains included in the tour set to be a solution. Note that a tour that includes two or more organization nodes may be generated in the tour created in S1404. Therefore, it is necessary to set the condition (3) so as not to select such a tour.

  The condition (4) is a condition (separation condition) for performing the resource merging work and the separation work in a place where each work is possible. In the above-described S1306, this separation / merging condition is considered by creating a path having a mergeable start point and a path having a separable place as a merge candidate when creating a merge candidate path. . However, this process is intended to limit undesirable separation and merging by continuously assigning merged train nodes to the same route, and may be undesirable depending on the route to which the original train node to be merged is assigned. May occur. For example, if the merge candidate is “Train 5 → Train 6 → Train 10”, the nodes representing train 5, train 6 and train 10 are duplicated to create a merge train node, and merge train node 5 → merge train A link is created so as to be continuously connected to the node 6 → the merge train node 10. However, there is no restriction between train node 5 → train node 6 → train node 10 as it is. For this reason, the merged train node 5 → the merged train node 6 → the merged train node 10 is assigned the same route (route I), that is, the same train without separation or merger in the middle. 5 → Train node 7 → Train 9 ”. Then, after the train I travels as the merged train, the route I is separated at the terminal station of the train 5 because the merger is separated as the train 6, merges with another train, and then travels as the merged train 6. Will be. In order to avoid such a situation, a restriction is imposed on the original train node as the merger partner according to the condition (4).

  The merge train nodes must be assigned to the same route continuously, whereas the train node that becomes the merge partner only has the same route for all the train nodes included in the merge candidates when the merge train node is merged. Assign to. For example, in the above-mentioned example, only when “the merge train node 5 → the merge train node 6 → the merge train node 10” is included in the solution circuit, “the train node 5 → the train node 6 → the train node 10” is also solved. It must be included in the circuit. Hereinafter, how the condition (4) represents this condition will be described.

  The left term of the subtraction of condition (4) is a node representing a train other than the merged train among nodes representing trains included in the kth merge candidate, and represents the number of nodes included in circuit j. The right term of the subtraction of the condition (4) is a node representing a merged train among nodes representing trains included in the kth merge candidate, and represents the number of nodes included in the circuit 1. The nodes representing trains included in the merge candidates are the merge train node created by the merge candidate reflection unit 1006 based on the merge candidates 62 of the merge candidate information 6 and the original train node. Note that the link connected to the merge train node is created so as not to break the linkage of trains that are merge candidates (see the explanation of S205). The right term of subtraction is either 0 or N pk Take the value of Further, among the nodes included in the merge candidates, no link is created between the merged train node and the original train node, so the number of nodes included in the circuit is actually up to N pk at the maximum. For this reason, the value of the left term is 0 or more and N pk or less. Therefore, when the circuit 1 does not include the merged train, that is, when the right term of the subtraction is 0, the condition (4) is satisfied regardless of the value of the left term of the subtraction, and the circuit 1 includes the merged train. That is, when the right term of subtraction is N pk, condition (4) is satisfied only when the value of the left term of subtraction is N pk, that is, when circuit j includes all train nodes that are candidates for merging. N pk is the number of “trains” included in the kth merge candidate. For example, the merge candidate of record 64 in FIG. 5 is only “train 5”, so N pk is “1”. If the candidate is “train 5 → train 6 → train 10”, it is “3”.

  In addition, when formulating by the set partitioning problem, there is a case where a condition that one knitting is assigned to only one route may be added. However, in the network model of the present invention, the knitting is also expressed as a node. It is included in the above conditions. Each of the tours included in the tour set obtained here becomes a route assigned to the train represented by the train node included in the tour.

  In S1405, the plan creation unit 1007 determines whether or not a solution has been obtained by the search in S1404. If it is obtained, the process proceeds to S1406, and if not, the process proceeds to determination in S1407. In step S1406, the plan creation unit 1007 stores the solution obtained in step S1404 in the storage unit 1100 as a resource operation plan candidate. At this time, the plan creation unit 1007 creates a resource operation plan candidate by allocating each path included in the solution obtained in S1404 to the composition corresponding to the composition node included in the path. When the merge train node is included in the solution, the plan creation unit 1007 extracts the train node and the merge train node that are merged with the merge train node, and arrives at the station where the merged train and merge train are merged. Are compared, and the position (from what car to what car) where each train (extracted train and merged train) is merged is calculated. At this time, if the travel direction after the merger does not change from the travel direction before the merger, the position is calculated so that the arrival order is the front vehicle in the early order, and if the travel direction is changed, the position is the front vehicle in the late arrival order. The position is calculated as follows.

  In S1407, the plan creation unit 1007 determines whether the solution obtained in S1404 includes a termination link having a weight greater than a certain value. If included, the process proceeds to S1408. If not included, the process is performed. finish. The constant value of the weight here is the same value as the constant value used in S1401. This is a process for the purpose of determining whether or not the solution includes a composition in which the end station of the route is different from the end station of the original plan. In S1408, the plan creation unit 1007 returns the link excluded in S1401 to the network model, and proceeds to S1402.

In Example 1, a resource operation plan including a merged train was created in order to match the operation end location or the number of overnight stays with the original plan. In the second embodiment, an example of creating a resource operation plan that does not change the operation end location or the number of overnight stays from the original plan by setting a forwarding train is shown. In the following description, parts different from the first embodiment will be described.

  FIG. 16 is a detailed flow of S203 “judgment candidate determination” in the first embodiment. S1301 to S1305 are as described in the first embodiment. In S1506, the merge candidate determination unit 1005 newly generates a forward train that passes the start location of the merge section candidate selected in S1305 as the start station, the end location as the end station, and all the intermediate stations pass therethrough, and the storage unit 1100. Stored in the merge candidate information 6. Step S1307 is as described in the first embodiment.

  In this embodiment, S203 of the first embodiment is replaced with the flow as described above, and when the merge candidate is reflected in the network model in S205, if the merge candidate is a forward train, it is added to the network model as a forward train node. Then, links with other nodes are generated in consideration of the connection between the first station and the last station of the train.

  Further, the conditions to be considered in the search in S1404 are as follows instead of the condition (2) in the first embodiment.

In Example 1, merge candidates were created based on the operation end location. In the third embodiment, an example is shown in which the designation of the start location and the end location of the merge section is received from the user, and a merge candidate that realizes the accepted merge section is created. In the following, portions different from the first embodiment will be described.

  FIG. 14 is a detailed flow of S203 “Determination of merge candidates” in the first embodiment. In step S <b> 1701, the merge candidate determination unit 1005 receives input of the start location and end location of the merge section from the user via the input unit 1201. At this time, based on the operation schedule read in S201, the route information and resource information read in S121 and S122, an operation schedule diagram and a train allocation diagram as shown in FIG. 15 are displayed. The configuration of FIG. 15 is as shown in FIG. 9 of the first embodiment. In addition to FIG. 9 of the first embodiment, FIG. 15 displays the number of staying at each station (65, 66 in FIG. 15A) and the operation end location (67, 68, 69 in FIG. 15B) of each train.

  In S1702, the merge candidate determination unit 1005 creates a route that is a merge candidate based on the start location and end location of the merge section received in S1701. This process is the same as the process of S1306 in the first embodiment. According to the present embodiment, the resource operation plan can be created by replacing S203 of the first embodiment with the flow as described above, and otherwise performing in the same manner as in the first embodiment.

In Example 1, the resource management plan was created without considering the merging order when merging a plurality of resources. In the fourth embodiment, an example in which a resource management plan that is closer to practical use is created by considering the merge order calculated from the arrival order of trains will be shown.

  FIG. 17 is a detailed flow of S206 “Create resource management plan” in the first embodiment. S1401 to S1404 are as described in the first embodiment. In S1605, the plan creation unit 1007 performs the following processing on the merged train included in the solution created in S1404.

  (1) In the case of a newly added merged train For the merged train added in S205 “Reflecting merged candidates” in Example 1, the times at which the formations of the other parties to be merged arrive are compared, and the arrivals are in ascending order. Allocate an earlier or later number in the organization position. Whether to assign from an early number or from a later number can be changed in advance. Here, the knitting position is a numerical value representing from what number to what number of all the numbers constituting the train.

  (2) In the case of a merged train included in the original plan For the merged train set from the original plan, compare the arrival time of each of the merged opponents and organize them in order of arrival. Temporarily assign a number with an earlier or later position. If the knitting position allocated in the original plan is compared with the knitting position allocated in the original plan, if the knitting position is different, the replacement stored in the storage unit 1100 indicates whether or not replacement is possible at the station where the corresponding train is merged The determination is made based on the availability information 7, and if the replacement is impossible, the temporarily assigned knitting position is set as the knitting position of the corresponding train. Steps S1406 to S1409 are as described in the first embodiment. According to the present embodiment, the resource operation plan can be created by replacing S206 of the first embodiment with the flow as described above and performing the other operations in the same manner as in the first embodiment.

1000: Resource operation plan creation device, 1001: Memory, 1002: Program, 1003: Operation schedule reading unit, 1004: Network creation unit, 1005: Merge candidate determination unit, 1006: Merge candidate reflection unit, 1007: Plan creation unit, 1100 : Storage unit, 1200: display unit, 1201: input unit, 1202: processing device, 1203: communication unit, 1204: data path

Claims (3)

A storage unit for storing operation schedule information including original route information, operation information, resource information, route information, mergeable place information, and merge candidate information ;
Obtaining the operation schedule information, creating a transportation process node for attributes included in each of the plurality of transportation processes included in the operation schedule information, and creating a path connecting between the transportation process nodes to which the same resource can be allocated A first network model of a transport process is created, and an operation start node and an operation end node for each resource are created. Based on attributes represented by the operation start node and the operation end node, an operation start node and an operation end node Creating a plurality of paths, and setting a weight value so that the path having the same operation end node as the path of the original operation plan among the plurality of paths is easily selected,
Based on the operation schedule information, a merge candidate determination unit that determines a path to be a candidate for assigning each resource among the plurality of paths;
Based on the path determined as a candidate for allocating each resource in the merge candidate determination unit, the first network model is changed, and a merge candidate reflection unit that creates a second network model;
A plan creation unit for extracting a combination of a plurality of paths including a path to which the operation start node is connected based on the second network model and the weight value, and creating a new operation plan ;
The merge candidate determination unit calculates the number of transportation processes in which each node in the current operation plan is an operation end node based on the operation information, the resource information, and the route information, and further, based on the original route information. Calculate the number of transport strokes with each node in the original operation plan as the operation end node, and compare and determine the calculated number of transport strokes of the current operation plan and the number of transport strokes of the original operation plan,
When it is determined that the calculated number of transportation schedules of the current operation plan is different from the number of transportation schedules of the original operation plan, a path to be a merge candidate is determined based on the mergeable place information and the merge candidate information. A resource management plan creation device characterized by The resource operation plan creation device according to claim 1, wherein the operation start node has, as attributes, at least an operation start location of each resource, a time zone in which each resource can be used, and information for identifying the resource,
The operation end node has at least attributes for identifying the operation end location and the resource,
The network creation unit creates a path connecting the operation start node and the operation end node based on the attribute value of the operation end location of the operation end node and the attribute value of the end location of another node constituting the network model. The resource management plan creation device, wherein the second network model is created by changing the first network model by the merge candidate reflection unit. The resource management plan creation device according to claim 2, wherein the network creation unit establishes connection between time and place based on an attribute value of an operation start node and an attribute value of another node constituting the network model. Create a path that connects the node representing the transportation process and the operation start node,
By creating a path that connects the node representing the transportation process and the operation end node so that the attribute value of the operation end location of the operation end node matches the attribute value of the end location of the other nodes that make up the network model. A path connecting the operation start node and the operation end node having the same resource identification information as an attribute is created, and the second network model is created by changing the first network model by the merge candidate reflection unit. A resource management plan creation device characterized by that.

Images