JP5020199B2 - Program and vehicle operation arrangement plan creation device - Google Patents

Description

  The present invention relates to a vehicle operation arrangement plan creation device and the like.

  In the railroad, a vehicle operation plan, which is a vehicle operation plan including a vehicle use sequence and vehicle maintenance management, is defined in order to realize the created plan diagram (train diagram). This vehicle operation plan is created in consideration of various restrictions such as periodically inspecting a vehicle such as a work inspection. On the other hand, for example, it has been desired to create an efficient vehicle operation plan that reduces the cost of vehicle operation, such as reducing the number of periodic inspections as much as possible.

Therefore, for example, an apparatus disclosed in Patent Document 1 is known as an apparatus for automatically creating an efficient vehicle operation plan in consideration of vehicle inspection. In such a vehicle operation plan creation device, an inspectable arc capable of performing vehicle inspection is selected between train connections, and in a vehicle operation network that represents a plan diagram, it is a circuit that passes all nodes only once. Thus, a circuit including all selected inspectable arcs is searched. This is because a multi-day operation route is operated in rotation, and the vehicle operation plan is a set of routes created by dividing the connection pattern that connects all trains that make up the train diagram cyclically every day. It is because it is expressed as.
JP 2005-25952 A

  By the way, when the schedule is disrupted, the operation is organized in order to restore the disrupted diagram to the normal schedule (planned schedule). In accordance with this operation arrangement, it is necessary to organize the vehicle operation to modify and change the vehicle operation plan. is there. The driving arrangement is performed by setting a part or all of the plan schedule as a target period according to the situation of the disturbance of the schedule, and the target period of the vehicle operation arrangement is adjusted to the target period of the driving arrangement. That is, the target period of the vehicle operation organization differs depending on the situation of the diamond disturbance. For this reason, a method for creating a vehicle operation plan disclosed in the above-described Patent Document 1, such as searching for a connection pattern (tour circuit) in which all trains constituting a train diagram in a vehicle operation network are connected cyclically, It cannot be applied to the vehicle operation plan as it is. Also in the vehicle operation arrangement, as in the case of the vehicle operation plan, it is desired to create an efficient vehicle operation arrangement plan in consideration of periodic inspections. The present invention has been made in view of the above circumstances, and an object thereof is to realize an efficient vehicle operation arrangement plan in consideration of periodic inspection of vehicles.

The first invention for solving the above-described problems is
A program for causing a computer to create a vehicle operation rearrangement plan for a target train in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by arc,
A number-of-replications determination means for determining the number of replicas for replicating the operation control basic network based on the total number N of predetermined nodes included in the operation control basic network;
An extended network generating means for generating the number of copies of the duplicated network that duplicates the operation organizing basic network and generating an extended network combined with the operation organizing basic network;
For each of the check nodes included in the extended network, the destination node of the arc having the check node as the original node is duplicated corresponding to the number n (≦ N) of the predetermined nodes that satisfy the check deadline by checking the check node. Arc changing means to change to the corresponding destination node in the network,
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
As a program for causing the computer to function.

As another invention,
A vehicle operation rearrangement plan creation device for creating a vehicle operation rearrangement plan for a target schedule in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by an arc;
Based on the total number N of predetermined nodes included in the operation organization basic network, the number of replicas determining means for determining the number of replicas to duplicate the operation organization basic network;
An extended network generating means for generating the number of copies of the duplicated network obtained by duplicating the operational organization basic network, and creating an extended network combined with the operational organization basic network;
For each of the check nodes included in the extended network, the destination node of the arc having the check node as the original node is duplicated corresponding to the number n (≦ N) of the predetermined nodes that satisfy the check deadline by checking the check node. Arc changing means for changing to the corresponding destination node in the network;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means; and
You may comprise the vehicle operation arrangement plan preparation apparatus provided with.

  According to the first invention and the like, an operation rearranging basic network based on the target diagram is generated, and a duplicate network that duplicates the operation rearranging basic network is based on the total number N of predetermined nodes included in the operation rearranging basic network. A number of copies are created, and an extended network is created that is combined with the basic operation management network. Next, in this extended network, for each check node, the destination node of the arc having the check node as the original node is changed to the corresponding destination node in the replication network corresponding to the number n of predetermined nodes that satisfy the check deadline condition. The Then, a route from the origination node of the operation organization basic network to any destination node of the extended network is searched as a vehicle operation route candidate, and an operation organization plan is created by combining the searched vehicle operation route candidates.

  That is, by generating a vehicle operation network including a train node and an inspection node, it is possible to search for vehicle operation route candidates that satisfy the inspection deadline condition. In addition, as a method for searching for vehicle operation route candidates that satisfy the inspection deadline condition, an extended network is generated by duplicating the operation organizing basic network, and the inspection node satisfies the inspection deadline condition by checking the destination node of the arc of each inspection node. After changing to the corresponding destination node in the replication network corresponding to the predetermined number of nodes, the route search is performed in the extended network. In this method, each replication network corresponds to the number n of predetermined nodes that satisfy the inspection deadline condition. In addition, the arc of each check node corresponds to the corresponding destination node in the replication network corresponding to the predetermined number of nodes satisfying the check deadline by the check node, that is, the destination in the replication network corresponding to the check deadline condition of the check node. It has been changed to a node. That is, the change of the inspection deadline is expressed by the change of the arc of the work inspection node, and the changed inspection deadline is expressed by the replication network including the changed destination node.

  By the way, the search for the vehicle operation route must be performed in consideration of the inspection deadline by the vehicle inspection. Specifically, in the basic operation management network, it is necessary to select the next inspection node before the inspection deadline is reached, and to perform a route search while updating the inspection time limit every time an inspection node is selected. However, since the change in the inspection deadline is expressed by changing the arc of the work inspection node as in the present invention, the route search can be performed without distinguishing between the train node and the inspection node in each replicated network. It is possible to simplify the search for vehicle operation route candidates that satisfy the inspection deadline conditions.

As a second invention, there is provided a program according to the first invention,
The extended network generation means generates the extended network using the train node and the arrival node included in the operation organization basic network as the predetermined nodes when the organization target period is longer than the inspection cycle of vehicle inspection,
The arc changing means calculates the number n of the predetermined nodes using the train node and the arrival node satisfying the inspection deadline by the inspection of the inspection node as the predetermined node, and determines the arc destination node having the inspection node as the original node. Change to the corresponding destination node in the replication network corresponding to the calculated number n.
As described above, a program for causing the computer to function may be configured.

  According to the second invention, when the organizing target period is longer than the inspection period of the vehicle inspection, the train node and the arrival node are set as predetermined nodes, and the total number N of train nodes and arrival nodes included in the operation organizing basic network Only the duplicate network is duplicated to generate an extended network. Then, the destination node of the arc whose origin is each inspection node is changed to the corresponding destination node in the replication network corresponding to the number n of train nodes and arrival nodes that satisfy the inspection deadline by inspection of the inspection node. .

A third invention is a program according to the first or second invention,
The extended network generation means generates the extended network using the destination node included in the operation organization basic network as the predetermined node when the organization target period is equal to or less than an inspection cycle of vehicle inspection,
The arc changing means calculates the number n of the predetermined nodes by using the arrival node satisfying the inspection deadline by the inspection of the inspection node as the predetermined node, and calculates the destination node of the arc having the inspection node as the original node Change to the corresponding destination node in the replication network corresponding to the number n,
As described above, a program for causing the computer to function may be configured.

  According to the third aspect of the invention, when the organizing target period is equal to or shorter than the inspection period of the vehicle inspection, the duplicating network having the destination node as the predetermined node and the total number N of the destination nodes included in the operation organizing basic network is duplicated. An extended network is generated. Then, the destination node of the arc having each check node as the original node is changed to the corresponding destination node in the replication network corresponding to the number n of arrival nodes that satisfy the check deadline by checking the check node.

  When the target period for operation rearrangement is equal to or shorter than the inspection period, at least one inspection is performed during the rearrangement target period, so that all train nodes in the operation rearrangement target period satisfy the inspection deadline condition. For this reason, it is not necessary to consider a replication network corresponding to the number of train nodes satisfying the inspection deadline as a replication network to which the arc is changed, and only a replication network corresponding to the number of arrival nodes satisfying the inspection deadline may be considered. . Thereby, the number N of duplication networks can be reduced, and the amount of calculation required for searching for vehicle operation route candidates can be reduced.

The fourth invention is:
A program for causing a computer to create a vehicle operation rearrangement plan for a target train in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by arc,
An expanded network generating means for generating a duplicate network, which is a duplicate of the operational organization basic network, by the total number N of the inspection nodes included in the operational organization basic network, and generating an extended network combined with the operational organization basic network;
Arc changing means for changing, for each check node included in the extended network, a destination node of an arc having the check node as a source node to a corresponding destination node in a replication network corresponding to the check node;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
As a program for causing the computer to function.

As another invention,
A vehicle operation rearrangement plan creation device for creating a vehicle operation rearrangement plan for a target schedule in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by an arc;
An expanded network generation means for generating a total number N of the inspection nodes included in the operational arrangement basic network, and generating an extended network combined with the operational arrangement basic network;
For each check node included in the extended network, an arc changing means for changing a destination node of an arc having the check node as a source node to a corresponding destination node in a replication network corresponding to the check node;
A route search means for searching for a route of an arc from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means; and
You may comprise the vehicle operation arrangement plan preparation apparatus provided with.

  According to the fourth invention and the like, an operation organizing basic network based on the target diagram is generated, and a duplicate network that duplicates the operation organizing basic network is generated by the total number N of inspection nodes included in the operation organizing basic network. Then, an extended network combined with the basic operation management network is generated. Next, in this extended network, for each check node, the destination node of the arc having the check node as the original node is changed to the corresponding destination node in the replication network corresponding to the check node. Then, a route from the origination node of the operation organization basic network to any destination node of the extended network is searched as a vehicle operation route candidate, and an operation organization plan is created by combining the searched vehicle operation route candidates.

  That is, by generating a vehicle operation network including a train node and an inspection node, it is possible to search for vehicle operation route candidates that satisfy the inspection deadline condition. In addition, as a search method for vehicle operation route candidates that satisfy the inspection deadline, the operation management basic network is duplicated to generate an extended network, and the arc destination node of each inspection node corresponds to the inspection node in the replication network After changing to the destination node, route search is performed in the extended network. In this method, each of the N replicated networks corresponds to each check node, and the arc of each check node is changed to the previous node in the replicated network corresponding to the check node. That is, the change of the inspection deadline is expressed by the change of the arc of the work inspection node.

  By the way, the search for the vehicle operation route must be performed in consideration of the inspection deadline by the vehicle inspection. Specifically, in the basic operation management network, it is necessary to select the next inspection node before the inspection deadline is reached, and to perform a route search while updating the inspection time limit every time an inspection node is selected. However, since the change in the inspection deadline is expressed by changing the arc of the work inspection node as in the present invention, the route search can be performed without distinguishing between the train node and the inspection node in each replicated network. It is possible to simplify the search for vehicle operation route candidates that satisfy the inspection deadline conditions.

A fifth invention is a program according to any one of the first to fourth inventions,
In each replicated network, an arc cutting means for cutting an arc connected to a node that does not satisfy the inspection deadline condition even by inspection of the inspection node by changing / connecting an arc from an inspection node of another network A program for causing the computer to function may be configured.

  According to the fifth aspect of the present invention, each replicated network is connected to a node that does not satisfy the inspection deadline condition even by inspection of the inspection node by changing / connecting an arc from the inspection node of another network. The broken arc is cut. That is, the arc is connected only to the node that satisfies the inspection deadline condition. Thereby, it is possible to easily select a node satisfying the inspection deadline and perform a route search without considering the inspection deadline condition by the inspection node.

A sixth invention is a program according to any one of the first to fifth inventions,
The train schedule is an operation arrangement diagram in which the arrangement target period is operated and arranged,
The operation organizing plan creating means is
Provisional operation arrangement plan creating means for creating a provisional operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
Evaluation means for evaluating the provisional operation arrangement plan based on the difference between the vehicle operation route candidate included in the provisional operation arrangement plan and the vehicle operation route before operation arrangement;
The provisional operation arrangement plan creation means and the evaluation means are repeatedly executed, and the provisional operation arrangement plan with the highest evaluation is set as the operation arrangement plan.
As described above, a program for causing the computer to function may be configured.

  According to the sixth aspect of the present invention, the provision of the provisional operation rearrangement plan by combining the searched vehicle operation route candidates, the vehicle operation route candidates included in the provisional operation rearrangement plan, and the vehicle operation route before the operation rearrangement The evaluation of the provisional operation arrangement plan based on the difference is repeatedly executed, and the provisional operation arrangement plan having the highest evaluation is set as the operation arrangement plan. Thereby, the operation arrangement plan that is best at that time is created.

As a seventh invention, there is provided a program according to the sixth invention,
The evaluation means uses a plurality of evaluation indexes including at least an evaluation index related to job switching and an evaluation index related to the execution of temporary inspection, and the vehicle operation route candidates included in the provisional operation arrangement plan and the vehicle before operation arrangement You may comprise the program for functioning the said computer so that evaluation based on the difference with an operation course may be performed.

  According to the seventh aspect of the present invention, the vehicle operation route candidates included in the provisional operation rearrangement plan and the pre-operational rearrangement using a plurality of evaluation indexes including the evaluation index related to the work switching and the evaluation index related to the temporary inspection. An evaluation based on the difference from the vehicle operation route is performed.

As an eighth invention, there is provided a program according to the seventh invention,
Causing the computer to function as an evaluation value variable means for changing an evaluation value for each of the evaluation indexes according to a user's operation input;
The evaluation means evaluates according to the variable evaluation value;
As described above, a program for causing the computer to function may be configured.

  According to the eighth aspect, the evaluation value for each evaluation index is varied according to the user's operation input, and the provisional operation arrangement plan is evaluated according to the varied evaluation value. That is, if the evaluation value of each evaluation index is varied, the evaluation of each operation route changes, and as a result, the evaluation of the provisional operation arrangement plan to be created changes. From the viewpoint of the user, it is possible to arbitrarily set the evaluation value of each evaluation index. For example, by setting the evaluation value of a desired evaluation index to be larger than the evaluation values of other evaluation indices, It is possible to obtain an operation arrangement plan that is best when the evaluation index is emphasized. In addition, since the preparation of the provisional operation rearrangement plan is repeatedly executed, it is possible to obtain a plurality of provisional operation rearrangement plans with different evaluation indexes that are regarded as important.

  According to the present invention, by generating a vehicle operation network including a train node and an inspection node, it is possible to search for a vehicle operation route candidate that satisfies the inspection deadline condition. In addition, as a method for searching for vehicle operation route candidates that satisfy the inspection deadline condition, an extended network is generated by duplicating the operation organizing basic network, and the inspection node satisfies the inspection deadline condition by checking the destination node of each inspection node arc. After changing to the corresponding destination node in the replication network corresponding to the predetermined number of nodes, the route search is performed in the extended network. In this method, each replication network corresponds to the number n of predetermined nodes that satisfy the inspection deadline condition. In addition, the arc of each check node corresponds to the corresponding destination node in the replication network corresponding to the predetermined number of nodes satisfying the check deadline by the check node, that is, the destination in the replication network corresponding to the check deadline condition of the check node. It has been changed to a node. That is, the change of the inspection deadline is expressed by the change of the arc of the work inspection node, and the changed inspection deadline is expressed by the replication network including the changed destination node. Thereby, in each replication network, a route search can be performed without distinguishing between a train node and an inspection node, and a search for a vehicle operation route candidate that satisfies the inspection deadline condition can be simplified.

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

[principle]
The vehicle operation arrangement plan creation device automatically generates a vehicle operation change plan (vehicle operation arrangement plan) that changes the vehicle operation plan according to the operation arrangement diagram (operation arrangement plan) that is created when a train disruption occurs. It is a device to create automatically. The vehicle operation plan is a vehicle operation schedule in which vehicles are assigned to all trains constituting a train diagram. The vehicle operation rearrangement plan is a vehicle operation plan for the operation rearrangement diagram at the time of diamond disturbance. In the vehicle operation arrangement plan creation device of the present embodiment, the provisional operation arrangement creation process for creating a provisional vehicle operation arrangement plan (provisional operation arrangement plan) is repeatedly executed, and finally the provisional operation arrangement in which the evaluation is the best. A draft is output.

  In the present embodiment, the vehicle operation rearrangement plan is created by modeling the vehicle operation rearrangement plan creation problem into an “additionally restricted set partitioning problem”. The creation of a vehicle operation plan using the set constraint problem with additional constraints will be described with a simple example.

  FIG. 1 is a diagram illustrating an example of a driving arrangement diagram. The train schedule is expressed by “train streak” representing the operation of the train, with the horizontal axis representing time t and the vertical axis representing stations A, B, and C. Each train line has a corresponding train number. In addition, three vehicles a, b, and c are assigned to the vehicle operation for this driving arrangement diagram.

  First, operational route candidates (route candidates) are set for each of the vehicles allocated to the driving arrangement diagram. Here, the operation route is a combination of one or a plurality of trains that can be assigned to one vehicle. The operation route candidate is an operation route starting from the station where the target vehicle exists at the start of the target period. The route candidates set here may not include all possible routes.

  In the case of FIG. 1, the route candidates for each vehicle are set as shown in FIG. That is, for the vehicle a, four route candidates starting from the A station are set, for the vehicle b, three route candidates starting from the B station are set, and for the vehicle c, starting from the C station Four route candidates are set.

  Subsequently, each of the path candidates is evaluated according to a predetermined evaluation criterion, and an evaluation value (path evaluation value) is calculated. That is, it is determined whether each of the route candidates satisfies a plurality of predetermined evaluation indexes, and the sum of the index values of the evaluation indexes determined to satisfy is calculated as the route evaluation value of the route candidate. This evaluation index is about a change from the vehicle operation route (planned route) defined in the operation plan. Specifically, a part or all of the route candidates are changed to a vehicle operation different from the corresponding vehicle. "Change next work", "Change in work" changed to the work of another vehicle in the middle of work, "Other ward" which is a work of a vehicle of a different type from the vehicle to which the changed work corresponds “Type switching” and “Temporary work inspection” in which a temporary work inspection that is not implemented in the operation plan is performed. Here, “switching during work” and “switching other ward type” are evaluation indexes that are further determined when performing “next work switching”. The index value is a positive integer. That is, the smaller the route evaluation value, the more “good” the route candidate.

  Next, a “variable X” is assigned to each of these route candidates, and a model expression modeled into a set partitioning problem with additional constraints is generated. The variable X is a variable indicating whether or not the corresponding route candidate is selected (selection right or wrong). “1” indicates that the corresponding route candidate is selected, and “0” indicates that it is not selected. Then, a model formula of the set constraint problem with additional constraints is calculated using these route candidates as a subset and all trains in the target period of the operation scheduling diagram as elements.

“Group division” means that “all trains are covered by an operation route of one vehicle”. For example, in the case of FIG. 2, this model formula is the following formula (1).

Further, “additional constraint” means “only one operation route can be selected by one vehicle”. For example, in the case of FIG. 2, this model equation is expressed by the following equation (2).

  Then, a solution is calculated for each model equation of the set partitioning problem and the additional constraint that minimizes the sum of the path evaluation values. At this time, the solution is calculated by setting the range of the variable X to “0.0 ≦ X ≦ 1.0”. Further, as a method of solving the model formula, a known method such as a Simplex method can be used.

  If the calculated solution satisfies a predetermined operation organization condition, a combination of route candidates whose corresponding variable X has a value “1” is taken as an operation organization plan. Here, the operation management condition is that the value of the variable X is “0” or “1”, respectively. Then, the sum of the route evaluation values of the respective route candidates constituting this operation rearrangement plan is set as the overall evaluation value of the operation rearrangement plan. Note that if the calculated solution does not satisfy the operation arrangement condition (that is, the calculated variable X includes at least one value other than “0” or “1”), the operation arrangement plan is not created. The creation of an operation arrangement plan by modeling into a set partitioning problem with additional constraints is performed in this way.

  In preparation of the above-mentioned operation arrangement plan, the setting of the route candidate for each vehicle must take into account the work inspection (one of the periodic inspections of the vehicle). In other words, the operation path of each vehicle is set such that a work inspection for the vehicle is performed without exceeding a predetermined inspection cycle (for example, 72 hours). The setting of a route candidate that satisfies the restrictions on the work inspection will be described.

  FIG. 3 is a diagram illustrating an example of a driving arrangement plan (train schedule). FIG. 4 is a train diagram network that represents a diagram portion of the operation organization target period in the operation organization plan. The train diagram network is configured by arranging train nodes RN representing trains constituting the train diagram at a time t in the horizontal direction and connecting connectable train nodes RN with each other by an arc. In the train diagram network, a departure node SN representing a departure station of a target vehicle (that is, a station at the start of the operation organizing target period) is set as a start node, and the vehicle is used as an end node. A destination node EN that represents a destination station (that is, a station that should arrive at the end of the operation organizing target period) is set.

  The destination node EN is determined according to the vehicle operation for the train schedule after the operation organizing target period. That is, the vehicle operation during the operation organization target period must be connected to the vehicle operation after the operation organization target period. The number of destination nodes EN is equal to the number of vehicles assigned to the diagram part of the operation organizing target period. In the figure, a departure node SN representing the B station which is the departure station of the target vehicle and three arrival nodes EN1 to EN3 representing the A station to the C station which can be the arrival stations of the vehicle are set.

  Next, an operation organizing basic network in which a work inspection node representing a work inspection that can be performed is added to the train diagram network is generated. FIG. 5 is a diagram showing an operation organization basic network based on the train diagram network of FIG.

  A predetermined time (for example, 1 hour) is required to perform the work inspection. For this reason, the work inspection node TN has a time interval between connected trains (the time from the arrival time of the previous train and the departure time of the subsequent train) at the station where the work inspection is determined to be possible. Is added between train nodes RN that is longer than the required time.

  For example, in the train diagram shown in FIG. 3, work inspection is possible at the A and C stations. Then, in the operation organization basic network shown in FIG. 5, a work inspection node TN1 is added between a train node RN1 representing one train connected to a station A and a train node RN5 representing five trains, and a train representing three trains. A work inspection node TN2 is added between the node RN3 and the arrival node EN1 representing the A station. In addition, since the connection time interval is short between 3 trains and 5 trains, work inspection cannot be performed. Further, a work inspection node TN3 is added between the train node RN2 representing two trains connected at the C station and the arrival node EN3 representing the C station.

  In this way, in the operation control basic network generated by adding the operation inspection node TN to the train diagram network, a route from the source node SN to any destination node EN is searched, and the operation route candidate of the vehicle is determined. Is done. At this time, the route search is performed so as to satisfy a predetermined inspection cycle of work inspection.

  In the present embodiment, the route search considering the inspection period of the work inspection is performed as follows. First, as shown in FIG. 6, a plurality of duplicate networks CM are created by duplicating the operation organizing basic network BM, and together with the operation organizing basic network BM, an extension network EM is formed. The number of duplicate networks CM to be generated is determined by the train node RN and the destination node EN included in the basic operation management network. Specifically, (N−n) replicated networks, which are the difference between the total number N of train nodes RN and destination nodes EM included in the operation organization basic network BM and the “number n of reachable nodes” of the source node SN. CM is generated. Then, labels “n” to “N” are attached to the networks constituting the extended network EM. More specifically, the operation organizing basic network BM is labeled “n” equal to the number n of reachable nodes of the originating node SN, and each of the duplicate networks CM is labeled “n + 1” to “N”.

  Here, the number of reachable nodes n is the number of train nodes RN and destination nodes EN that satisfy the “inspection deadline condition” by performing the corresponding work inspection. The inspection deadline condition is a condition for satisfying the inspection cycle of the work inspection, and specifically, is a condition of a deadline (inspection deadline) at which the next work inspection must be performed. That is, the reachable node number n means the number of train nodes RN and arrival nodes EN that can be reached from the source node SN without performing the next operation inspection by performing the operation inspection.

  The reachable node number n of the source node SN is determined as the number of train nodes RN and destination nodes EN that satisfy the inspection deadline by the work inspection that is performed immediately before the source node SN in the train operation before the operation organizing target period. .

  FIG. 7 is a diagram illustrating the reachable node number n of the source node SN. In the figure, the inspection deadline by the operation inspection a expressed by the operation inspection node TNa immediately before the originating node SN is within the operation organizing target period and is determined between the train node RN2 and the train node RN3. That is, the two train nodes RN1 and RN2 satisfy the time limit condition, and the reachable node number n of the source node SN is “2”.

  In FIG. 6, the total number N of train nodes RN and destination nodes EM included in the operation organization basic network BM is “9”, and the reachable node number n of the source node SN is “2”. Therefore, 7 (= 9-2) duplicate network CMs are generated. The operation organizing basic network BM is labeled “2”, and each duplicated network CM is labeled “3” to “9”.

  Subsequently, in this extended network EM, arc replacement is performed with each work inspection node TN as a source node. FIG. 8 is a diagram for explaining the replacement of arcs in each inspection node TN in the extended network EM in FIG. As shown in FIG. 8, the destination node of the arc having each work inspection node TN as the original node is changed to the previous node in the duplicate network CM with the label equal to the reachable node number n based on the work inspection node TN.

  The reachable node number n based on the work inspection node TN is determined as the number of train nodes RN and arrival nodes EN that satisfy the inspection deadline by performing the work inspection corresponding to the work inspection node TN.

  Here, the determination of whether or not the inspection deadline condition is satisfied differs depending on whether the train node RN or the arrival node EN. That is, for the train node RN, if it is before the inspection deadline, the train node RN is determined to satisfy the inspection deadline condition, and if the inspection deadline is exceeded, the train node RN is determined not to satisfy the inspection deadline condition. .

  FIG. 9 is a diagram illustrating determination of a train node RN that satisfies the inspection deadline condition. In the figure, the inspection deadline determined by the execution of the work inspection corresponding to the work inspection node TN is within the operation organizing target period and is determined between the train node RN4 and the train node RN5. That is, it is determined that the four train nodes RN1 to RN4 included between the start of the operation organizing target period and the inspection deadline satisfy the inspection deadline condition, and the other train nodes RN5 and RN6 do not satisfy the inspection deadline condition. Is done.

  In addition, for the arrival node EN, if the work inspection performed immediately after the arrival node EN in the vehicle operation after the operation organizing period is before the inspection deadline, the arrival node EN is determined to satisfy the inspection deadline condition. If the inspection deadline is exceeded, it is determined that the destination node EN does not satisfy the inspection deadline condition. This is because the train schedule and vehicle operation are determined after the operation rearrangement target period, and the vehicle operation during the operation rearrangement target period must be connected to the predetermined vehicle operation.

  FIG. 10 is a diagram illustrating determination of a destination node EN that satisfies the inspection deadline condition. In the figure, the inspection deadline determined by the operation inspection node TNa is after the operation organizing period, and the operation inspection x expressed by the operation inspection node TNx immediately after the arrival node EN1 and the operation inspection immediately after the arrival node EN2. It is defined between the work inspection y expressed by the node TNy and the work inspection z expressed by the work inspection node TNz immediately after the arrival node EN3. That is, the work inspection x is performed before the inspection deadline, and the work inspections y and z are performed after the inspection deadline. Therefore, it is determined that the arrival node EN1 satisfies the inspection deadline condition and the arrival nodes EN2 and EN3 do not satisfy the inspection deadline condition.

  Then, the reachable node number n based on each work inspection node TN in the operation organizing basic network BM shown in FIG. 8 is as shown in FIGS. FIG. 11 is a diagram for explaining the reachable node number n based on the work inspection node TN1. In the figure, the inspection deadline due to the execution of the operation inspection corresponding to the operation inspection node TN1 is within the operation organizing target period and is determined after the train node RN6. That is, the six train nodes RN1 to RN6 satisfy the inspection deadline condition, and the reachable node number n based on the work inspection node TN1 is “6”.

  FIG. 12 is a diagram for explaining the reachable node number n based on the work inspection node TN2. In the figure, the inspection deadline due to the execution of the operation inspection corresponding to the operation inspection node TN2 is after the operation organizing target period, and the operation inspection x expressed by the operation inspection node TNx immediately after the arrival node EN2, and the arrival node It is determined between the work inspection y expressed by the work inspection node TNy immediately after EN2. That is, six train nodes RN1 to RN6 and one arrival node EN1 satisfy the inspection deadline condition, and the reachable node number n based on the work inspection node TN2 is “7”.

  FIG. 13 is a diagram for explaining the reachable node number n based on the work inspection node TN3. In the figure, the inspection deadline due to the execution of the operation inspection corresponding to the operation inspection node TN3 is determined after the operation inspection z expressed by the operation inspection node TNz immediately after the destination node EN3 after the operation organizing target period. . That is, the six train nodes RN1 to RN6 and the three arrival nodes EN satisfy the inspection deadline condition, and the reachable node number n based on the work inspection node TN3 is “9”.

  As will be described later, the route search in the extended network EM is performed starting from the originating node SN of the operation organizing basic network BM. For this reason, it is not necessary to perform arc replacement for all the operation inspection nodes TN of each replication network CM. In other words, the arc of each operation inspection node TN is replaced in the operation management basic network BM, and each of the operation inspection nodes TN subsequent to the previous node of the replaced arc is replaced in each of the replication networks CM to which this arc has been replaced. What is necessary is just to replace the arc.

That is, in FIG. 8, the reachable node number n of the source node SN is “2”. Further, the reachable node numbers n of the work inspection nodes TN1 to TN3 are “6”, “ 7 ”, and “9”, respectively. Therefore, in the extended network EM shown in the figure, in the operation organizing basic network BM (label “2”), the destination node of the arc whose origin node is the work inspection node TN1 is the train node of the duplicate network CM labeled “6”. It has been replaced with RN3. Also, previous node of the arc to the source node the handiwork check node TN2 has been replaced on the train node RN 4 replicates network CM labeled "7". Further, the destination node of the arc whose origin node is the work inspection node TN3 is replaced with the destination node EN2 of the duplicate network CM labeled “9”. Furthermore, in each of the duplicate networks CM labeled “6” and “7”, the arc of the work inspection node TN3 is replaced with the destination node EN of the duplicate network CM labeled “9”.

  In this way, in the extended network EM in which the arc of the work inspection node TN is replaced, a route that reaches any destination node EN is searched from the originating node SN of the operation organizing basic network BM.

  Further, in this route search, in order to consider the inspection period of the work inspection, every time the work inspection node TN is selected, the arc toward the node after the inspection deadline determined by the corresponding work inspection is cut. FIG. 14 is a diagram for explaining the cutting of the arc during the route search. As shown in the figure, each time a work inspection node TN is selected, a copy network CM to which the arc of the work inspection node TN is replaced (that is, a copy of a label equal to the reachable node number n of the work inspection node TN). In the network CM), the arc directed to the node that does not satisfy the inspection deadline condition is cut by performing the inspection corresponding to the inspection node TN.

  That is, for the train node RN, the arc toward the train node RN after the inspection deadline is cut. On the other hand, as shown in FIG. 15, for the arrival node EN, an arc directed to the arrival node EN whose work inspection is performed immediately after the inspection deadline is cut. In the figure, the inspection deadline due to the execution of the operation inspection corresponding to the operation inspection node TN1 is determined after the operation organizing target period. Since the work inspection x expressed by the work inspection node TNx immediately after the arrival node EN1 is performed before the inspection deadline, the arrival node EN1 satisfies the inspection deadline condition. The destination node EN2. Since the work inspections y and z expressed by the work inspection nodes TNy and Tnz immediately after each EN3 are performed after the inspection deadline, the destination nodes EN2 and EN3 do not satisfy the inspection deadline conditions. Accordingly, in this case, the arcs directed to the destination nodes EN2 and EN3 are cut off.

  In FIG. 14, first, in the operation organizing basic network BM (label “2”), train nodes RN3 to RN6 that do not satisfy the inspection deadline condition (exceeding the inspection deadline) by the work inspection performed immediately before the originating node SN, Arcs directed to inspection nodes TN2 and TN3 and destination nodes EN1 to EN3 are cut off.

  Next, when the inspection node TN1 is selected and transition is made to the replication network CM labeled “6”, the arrival nodes EN1 to EN3 that do not satisfy the inspection deadline condition by the inspection node TN1 in the replication network CM labeled “6” respectively. The arc toward is cut off.

Further, when the operation inspection node TN2 is selected in the replication network CM with the label “ 6 ” and the transition is made to the replication network CM with the label “ 7 ”, the operation is similarly performed in the replication network CM with the label “ 7 ”. The arc toward each node that does not satisfy the inspection deadline condition by the inspection node TN2 (exceeds the inspection deadline) is cut. The same applies when the work inspection node TN3 is selected.

  By the way, when the inspection cycle of the work inspection is longer than the target period for operation arrangement, the extended network EM can be configured with a smaller number of duplicate networks CM. That is, by performing at least one operation inspection within the operation organization target period, the operation inspection deadline due to the operation inspection is determined after the operation organization target period. That is, all train nodes RN satisfy the inspection deadline conditions of all work inspection nodes TN within the operation organization target period, and the reachable node number n is equal to or greater than the total number of train nodes RN within the operation organization target period.

  FIG. 16 is a diagram for explaining arc replacement in the extended network EM when the work inspection cycle is longer than the operation organization target period. In the figure, the reachable node number n of the source node SN is “2”, and the label of the operation organizing basic network BM is “2”. Further, the total number of train nodes RN within the operation organization target period is “6”. That is, the reachable node number n of each work inspection node TN within the operation organization target period is always “6” or more. That is, the inspection deadlines for the operation inspections corresponding to the operation inspection nodes TN1 to TN3 are all determined after the operation organizing target period, and the reachable node numbers n are “7”, “8”, “9”, respectively. It is.

  That is, the arc replacement destination of each of the inspection nodes TN1 to TN3 is the duplicate network CM of any of the labels “7” to “9”, and is replaced with the duplicate network CM of the labels “3” to “5”. There is nothing. For this reason, when the “work inspection period is longer than the operation organizing target period”, the reachable node number n of the work inspection node TN is set to “the train node RN and destination node EN satisfying the inspection deadline by the work inspection node TN”. Instead of “number”, “the number of destination nodes EN that satisfy the inspection deadline by the work inspection node TN”.

  Also, the number of duplicate networks CM to be generated is (M−n), which is the difference between the total number M of the destination nodes EN and the number n of reachable nodes of the operation organizing basic network BM. Then, in the extended network EM composed of the operation organizing basic network BM and (M−n) duplicate network CMs, the label of the operation organizing basic network BM is the reachable node number n of the source node SN, and each label of the duplication network CM. Are “n + 1” to “M”.

  FIG. 17 is a diagram illustrating a case where the reachable node number n is “the number of destination nodes EN that satisfy the inspection deadline condition” in the extended network EM illustrated in FIG. 16. In FIG. 17, the number of destination nodes EN is “3”. In addition, the inspection deadline by the work inspection performed immediately before the originating node SN is determined within the operation organizing target period, and the reachable node number n of the originating node SN is “0”. Accordingly, 3 (= 3-0) duplicate network CMs are generated and combined with the operation organizing basic network BM to form an extended network EM. The operation organizing basic network BM is labeled “0”, and “1” to “3” are assigned to each of the three replication networks CM.

  Furthermore, the reachable node numbers n of the work inspection nodes TN1 to TN3 are “1”, “2”, and “3”, respectively. Therefore, in the operation organizing basic network BM, the arcs of the operation inspection nodes TN1 to TN3 are duplicated in the duplicated networks CM having the labels “1”, “2”, and “3” equal to the reachable node number n of the operation inspection node TN. It has been replaced.

  In the present embodiment, the user can arbitrarily set and change the evaluation criteria used to create the vehicle operation arrangement plan. This user operation will be described with reference to the display screen.

  First, an “evaluation standard setting screen” for setting an evaluation standard is displayed. FIG. 18 shows an example of the evaluation criteria setting screen. According to the figure, the evaluation criterion setting screen is provided with a slider S for changing / setting the index value of each of the plurality of evaluation indexes, and the current index indicated by the slider S. The value V is displayed. On the evaluation standard setting screen, the user moves (slides) the slider S by, for example, operating the mouse, and changes the index value V of the corresponding evaluation index. When the start icon IC1 is selected, the index value of each evaluation index is set to a changed value. Thereafter, the provisional arrangement plan creation process is started, and an “executing screen” indicating that the process is being executed is displayed. If the creation of the operation arrangement plan itself is to be ended, the cancel icon IC2 is selected.

  FIG. 19 shows an example of a running screen. According to the figure, a message M indicating that a vehicle operation arrangement plan is being created is displayed on the running screen, and the names and comprehensive evaluation values of the created provisional operation arrangement plans are listed one after another. Is displayed. In the figure, three provisional operation arrangement plans 1 to 3 are created. The comprehensive evaluation value of this provisional operation arrangement plan is based on the index value of each evaluation index set on the above-described evaluation standard setting screen. When the interruption icon IC3 is selected on this screen during execution, the provisional arrangement plan creation process being executed is temporarily interrupted, and an “evaluation standard resetting screen” for resetting the evaluation standard is displayed. Note that the end icon IC4 is selected to end the provisional arrangement plan creation process.

  FIG. 20 shows an example of the evaluation criteria resetting screen. According to the figure, the evaluation standard reset screen is provided with a slider S for setting an index value for each of a plurality of evaluation indexes, as well as the current index value, as in the evaluation standard setting screen. It is displayed. Similar to the evaluation criterion setting screen, the user moves the slider S to change the index value V of each evaluation index. Then, when the resume icon IC5 is selected, the index value of each evaluation index is reset to the changed value, the temporarily arranged temporary arrangement plan creation process is resumed, and the in-execution screen illustrated in FIG. It will be displayed again. The operation arrangement plan creation process after the restart is executed based on the reset evaluation reference value.

[Constitution]
FIG. 21 is a block diagram illustrating a configuration of the vehicle operation arrangement plan creation device 1. As shown in FIG. 1, the vehicle operation arrangement plan creation device 1 is realized by a computer, for example, and includes a CPU 10, an input unit 20, a display unit 30, a communication unit 40, and a storage unit 50.

  Based on the program and data stored in the storage unit 50, the data input from the input unit 20, and the like, the CPU 10 performs instructions and data transfer to each unit constituting the vehicle operation arrangement plan creation device 1, and arranges the vehicle operation. The overall control of the plan creation apparatus 1 is performed. In addition, the CPU 10 performs an operation arrangement plan creation process in accordance with the vehicle operation arrangement program 510 to create a vehicle operation arrangement plan for the operation arrangement diagram (operation arrangement plan). The operation arrangement diagram is stored in the operation arrangement plan data 523.

  Specifically, first, an evaluation reference value is set. That is, the evaluation standard setting screen shown as an example in FIG. 18 is displayed on the display unit 30, and the index value of each evaluation index is set in accordance with a user operation instruction input from the input unit 20. The set evaluation reference value is stored in the evaluation reference data 524. Moreover, according to the user's operation instruction input from the input part 20, the area, period, vehicle, etc. which become the object of vehicle operation organization are set.

  FIG. 22 shows an example of the data configuration of the evaluation reference data 524. According to the figure, the evaluation reference data 524 stores the current index value 524b in association with each of a plurality of predetermined evaluation indices 524a.

  Thereafter, for example, the CPU 10 causes the display unit 30 to display a running screen whose example is shown in FIG. 19 and starts the provisional arrangement plan creation process. First, for each target vehicle, a predetermined number of operational route candidates (route candidates) are set. That is, a train diagram network is generated based on the diagram portion of the operation organization target period of the operation organization diagram. At this time, the originating node SN is a station at the start of the operation organization target period of the target vehicle, and the destination node EN is a station to which the vehicle should arrive at the end of the operation organization target period. Next, an operation organization basic network BM is generated by adding a feasible work inspection node TN to this train diagram network. Then, a duplicate network CM is created by duplicating the operation organizing basic network BM, and the expanded network EM is formed together with the operation organizing basic network BM.

  That is, when the operation organizing target period is longer than the operation inspection cycle, the reachable node number n is set to satisfy the inspection deadline condition by the corresponding operation inspection for each of the originating node SN and the operation inspection node TN of the operation organizing basic network BM. Set as the total number of train nodes RN and destination nodes EN. Then, (N−n) replicated network CMs equal to the difference between the total number N of train nodes RN and destination nodes EN within the operation organization target period and the reachable node number n of the originating node are generated, and the operation organization basic The extended network EM is combined with the network BM. Further, a label “n” equal to the number n of reachable nodes of the operation organizing basic network BM is attached to the operation organizing basic network BM, and labels “n + 1” to “N” are attached to the duplicate networks CM.

On the other hand, when the operation organizing target period is equal to or shorter than the operation inspection cycle, the reachable node number n is set to satisfy the inspection deadline condition by the corresponding operation inspection for each of the originating node SN and the operation inspection node TN of the operation organizing basic network BM. Set as the total number of destination nodes EN.
Then, (M−n) duplicated network CMs equal to the difference between the number M of the destination nodes EN and the number n of reachable nodes of the source node SN are generated, and together with the operation organizing basic network BM, To do. Further, a label “n” equal to the number n of reachable nodes of the operation organizing basic network BM is attached to the operation organizing basic network BM, and labels “n + 1” to “M” are attached to the duplicate networks CM.

  When the extended network EM is generated, subsequently, for each work inspection node TN, a duplicated network having a label equal to the reachable node number n of the work inspection node TN is set as the destination node of the arc whose origin is the work inspection node TN. Change to CM.

  Thereafter, in the extended network EM in which the arc of the work inspection node TN is replaced, a route search from the originating node SN of the operation organizing basic network BM to any destination node EN is performed. When the inspection node TN is selected, in the duplicate network CM with the label equal to the reachable node number n of the inspection node TN (that is, the duplicate network CM to which the arc of the inspection node TN is replaced) The arc toward each node that does not meet the inspection deadline for the inspection corresponding to the inspection node TN is cut.

  When the operational route candidates for each vehicle are set, next, the route evaluation value of each set route candidate is calculated. That is, for each route candidate, the planned route of the corresponding vehicle is compared to determine whether each evaluation index is satisfied, and the sum of the index values of the evaluation indexes determined to be satisfied is set as the route evaluation value of the route candidate. . Here, the planned route of the vehicle is an operation route of each vehicle constituting the vehicle operation plan, and is stored in the vehicle operation plan data 522. This vehicle operation plan corresponds to the plan diagram stored in the plan diagram data 521.

  Data on the set route candidate is stored in the route candidate data 525. FIG. 23 shows an example of the data configuration of the route candidate data 525. According to the figure, the route candidate data 525 stores a set route candidate 525b, a route evaluation value 525c, and a variable 525d in association with each other for the vehicle 525a to be organized. The variable 525d is a variable X assigned when modeling as a set partition problem with additional constraints.

  Then, from these route candidates, a combination in which one vehicle is assigned to all trains in the target range, and a combination that minimizes the sum of the route evaluation values, is selected from the operation schedule. That is, as described above, the variable X is assigned to each route candidate set for each vehicle, a model expression modeled in a set partition problem with additional constraints is calculated, and a solution of this model expression is calculated. Next, it is determined whether the calculated solution satisfies the operation organization condition. That is, if all the calculated values of the variable X are “1” or “0”, it is determined that the operation organization condition is satisfied, and if it is any other value, it is determined that the operation organization condition is not satisfied. If it is determined that the operation organization condition is satisfied, a combination of route candidates whose value of the variable X is “1” is set as a temporary operation organization plan, and the sum of the route evaluation values of the respective route candidates constituting the provisional operation organization plan is calculated. Therefore, it will be a comprehensive evaluation of the provisional operation arrangement plan. Then, the created provisional operation arrangement plan is associated with the current evaluation standard as provisional arrangement plan data 527 and added to the vehicle operation arrangement plan data 526.

  FIG. 24 shows an example of the data configuration of the provisional arrangement plan data 527. According to the figure, the provisional arrangement plan data 527 is created for each created provisional operation arrangement plan, and includes an operation arrangement plan 528, a comprehensive evaluation value 528d, and an evaluation standard 529. The operation arrangement plan 528 is a combination of operation paths constituting the operation arrangement plan. For each vehicle 528a subject to operation arrangement, the operation path 528b and the path evaluation value 528c are stored in association with each other. Yes. The comprehensive evaluation value 528d is a comprehensive evaluation value of the operation arrangement plan, and is the sum of the route evaluation values of the operation paths constituting the operation arrangement plan. The evaluation standard 529 is an evaluation standard when the operation organizing plan is created, and an index value 529b is stored in association with each evaluation index 529a.

  The CPU 10 repeatedly executes the above provisional arrangement plan creation process. Each time this temporary arrangement plan creation process is repeated, the route candidate set for each train is changed. That is, in the first (first) provisional arrangement plan creation process, a predetermined number of route candidates are set for each vehicle, but in the second and subsequent provisional arrangement plan creation processes, a predetermined number of route candidates are added for each vehicle. , Increase the number of path candidates for each iteration. At this time, the route candidate to be added is a route different from the route candidates already set for the vehicle. As a result, it is expected to create the best provisional operational arrangement plan.

  Further, the CPU 10 determines whether the provisional operation arrangement plan created this time has been “improved” in comparison with the most recently created provisional operation arrangement plan in the second and subsequent provisional arrangement proposal creation processing. Specifically, if the comprehensive evaluation value of this provisional operation arrangement plan is smaller than the comprehensive evaluation value of the latest provisional operation arrangement plan, it is judged as “improved”; ”And a predetermined counter is incremented by“ 1 ”(counting up). In other words, this counter counts the number of times that the created provisional operation arrangement plan has not been improved compared to the most recently created provisional operation arrangement plan. Then, when the counter value reaches a predetermined value, the provisional arrangement plan creation process is ended.

  In addition, during the execution of the provisional arrangement plan creation process, the CPU 10 temporarily suspends the provisional arrangement proposal creation process that is being executed when the user inputs a process suspension instruction from the input unit 20. Next, for example, an evaluation standard resetting screen illustrated in FIG. 20 is displayed on the display unit 30, and the index value of each evaluation index is changed in accordance with a user operation instruction input from the input unit 20. When the user inputs a “resume” instruction for the provisional arrangement plan creation process by the user, the index value of each evaluation index is reset to the changed value, and the provisional arrangement plan that has been suspended is temporarily created. Resume processing. At this time, the calculation is resumed from the calculation of the route evaluation value of each of the route candidates set in the vehicle regardless of the progress state before the temporary interruption. In addition, when the user inputs an “end” instruction for the provisional arrangement plan creation process from the input unit 20, the CPU 10 ends the repetition of the provisional arrangement plan creation process.

Returning to FIG. 21, the input unit 20 is an input device realized by, for example, a keyboard, a mouse, a touch panel, various switches, and the like, and outputs an input signal corresponding to an operation input to the CPU 10.
The display unit 30 is a display device realized by, for example, an LCD (Liquid Crystal Display), an ELD (Electronic Luminescent Display), or the like, and displays various screens based on display signals input from the CPU 10. The communication unit 40 is a communication device realized by, for example, a wireless communication module, a router, a modem, a TA, a cable communication cable jack, a control circuit, and the like, and performs data communication with an external device.

  The storage unit 50 is a system program for realizing various functions for the CPU 10 to control the vehicle operation arrangement plan creation device 1 in an integrated manner, and a program for executing the vehicle operation arrangement plan creation processing of the present embodiment. In addition to storing data and data, it is used as a work area for the CPU 10 and temporarily stores calculation results executed by the CPU 10 according to various programs and input signals from the input unit 20. In the present embodiment, the storage unit 50 stores a vehicle operation organization program 510 as a program, and as data, plan diagram data 521, vehicle operation plan data 522, operation organization plan data 523, and evaluation reference data. 524, route candidate data 525, and vehicle operation arrangement plan data 526 are stored.

[Process flow]
FIG. 25 is a flowchart for explaining the flow of the vehicle operation arrangement plan creation process. According to the figure, the CPU 10 first inputs and sets evaluation criteria. That is, an evaluation standard setting screen for the user to set an evaluation standard is displayed on the display unit 30, and an evaluation value of each evaluation index is set in accordance with a user operation instruction input from the input unit 20 (step A1). . Next, an operation route candidate calculation process (see FIG. 26) is performed to set a predetermined number a of route candidates for each vehicle (step A3), and a route evaluation value is calculated for each of the set route candidates (step A5).

  Thereafter, the provisional arrangement plan creation process is repeated. In other words, a variable X is assigned to each route candidate set for each vehicle, and a model expression modeled into a set partitioning problem with additional constraints is calculated (step A7). Next, a solution of a model formula that minimizes the sum of values obtained by multiplying the route evaluation value of each route candidate by the value of the variable X corresponding to the route candidate is calculated (step A9). Then, it is determined whether or not the calculated solution satisfies the operation organization condition, and if satisfied (step A11: YES), a set of route candidates whose value of the variable X is “1” is set as a provisional operation organization plan. Further, the sum of the route evaluation values of the route candidates whose value of the variable X is “1” is calculated and used as the comprehensive evaluation value of the created provisional operation arrangement plan (step A13). Then, the created provisional operation arrangement plan is stored in association with the calculated comprehensive evaluation value (step A15). Up to here is the provisional arrangement plan creation process.

  When the provisional arrangement plan creation process is completed, a route candidate calculation process (see FIG. 26) is subsequently performed, and a predetermined number b of new route candidates are additionally set for each vehicle (step A17). An evaluation value is calculated (step A19). Thereafter, processing similar to the above-described provisional arrangement plan creation processing (steps A7 to A15) is performed (step A21).

  If a provisional operation arrangement plan is created in this provisional arrangement proposal creation process (step A23: YES), the provisional operation arrangement plan created this time is improved compared to the most recently created provisional operation arrangement plan. Determine whether it was done. That is, if the total evaluation value of the current provisional operation arrangement plan is larger than the comprehensive evaluation value of the latest provisional operation arrangement plan, it is determined as “improved”; otherwise, it is determined as “not improved”.

  If it is determined that the process has been improved (step A25: YES), it is subsequently determined whether or not the process abort time has been reached. If the process abort time has not been reached (step A31: NO), the process returns to step A17. If the process abort time has been reached (step A31: YES), the provisional arrangement plan creation process is repeated.

  On the other hand, if it is determined that the created provisional operation arrangement plan has not been improved (step A25: NO), a predetermined counter is counted up (step A27). Next, the counter value is compared with a predetermined threshold value, and if the counter value has not reached the threshold value (step A29: NO), it is subsequently determined whether or not the processing abort time has been reached. If the process abort time has not been reached (step A31: NO), the process returns to step A17. If the process abort time has been reached (step A31: YES), the provisional arrangement plan creation process is repeated. On the other hand, if the counter value has reached the predetermined threshold (step A29: YES), the provisional arrangement plan creation process is repeated.

  After the repetition of the provisional arrangement plan creation processing is completed, the stored and stored provisional operation arrangement plans are displayed together with a comprehensive evaluation value (step A33), and if any of these is selected by the user (step A35) : YES), the selected provisional operation arrangement plan is displayed in detail (step A37). When the above processing is performed, the operation arrangement plan creation processing is terminated.

  FIG. 26 is a flowchart for explaining the flow of the route candidate setting process. According to the figure, the CPU 10 repeats the process of the loop A for each vehicle subject to operation organization.

  In the loop A, first, a train diagram network based on the diagram portion of the operation organizing target period of the operation organizing plan is generated. At this time, the source node SN and destination node EN corresponding to the target vehicle are set (step B1). Next, an operation inspection node TN that can be implemented is added to the train diagram network to generate an operation organization basic network BM (step B3). Also, the number of inspections of the route candidates for the target vehicle is initially set to “0” (step B5).

Subsequently, the inspection cycle of the operation inspection is compared with the operation organization target period. If the operation inspection cycle is shorter than the operation organization target period (step B7: YES), the arrival node SN and the operation inspection node TN are reached. The number of possible nodes n is set as the number of train nodes RN and arrival nodes EN that do not satisfy the inspection deadline conditions for the corresponding work inspection (step B9). Next, the total number N of train nodes RN and destination nodes EN included in the operation organization basic network BM is calculated (step B11). Then, (N− n ) duplicated network CMs which are the difference between the total number N and the reachable node number n of the source node SN are generated, and the expanded network EM is combined with the operation organization basic network BM, and the operation organization is performed. The basic network BM is labeled “n” which is equal to the reachable node number n of the source node SN, and “n + 1” to “N” are labeled to each of the duplicate networks CM (step B13).

On the other hand, if the work inspection cycle is equal to or longer than the operation organization target period (step B7: NO), for each of the originating node SN and the work inspection node TN, the reachable node number n is the arrival node that satisfies the inspection deadline condition for the relevant work inspection. Set as the number of ENs (step B15). Next, the number M of destination nodes EN included in the operation organization basic network BM is calculated (step B17). Then, (M− n ) duplicated network CMs, which are the difference between the total number M and the reachable node number n of the source node, are generated and combined with the basic operation management network BM to form an extended network EM. The basic network BM is labeled “n” which is equal to the reachable node number n of the source node SN, and “n + 1” to “M” are labeled to each of the duplicate networks CM (step B19).

  When the extended network is generated, the CPU 10 subsequently corresponds to the duplicate network CM having a label equal to the number of reachable nodes n of the work inspection node TN with an arc having each work inspection node TN as the original node in the extended network. The node is replaced with the destination node (step B21).

  Then, in this extended network, a route search process for searching for a route to reach any destination node EN from the originating node SN of the operation organizing basic network BM is performed (step B23). At this time, every time a work inspection node TN is selected, the duplicate network CM of the node ahead of the arc having the work inspection node TN as the original node (that is, a copy of a label equal to the number n of reachable nodes of the work inspection node TN) In the network CM), a route search is performed by cutting an arc toward a node that does not meet the inspection deadline for the operation inspection corresponding to the operation inspection node TN.

  If a new route is searched by this route search (step B25: YES), the searched route is added to the route candidate of the target vehicle (step B27), and the value obtained by adding “1” to the number of searches (Step B29). Subsequently, it is determined whether the number of searches has reached a predetermined number. If the predetermined number has not been reached (step B31: NO), the process returns to step B23, and a route search is performed again.

  On the other hand, if a new route is not searched (step B25: NO) or if the number of searches reaches a predetermined number (step B31: YES), the process of loop A for the target vehicle is terminated. Then, when a predetermined number of route candidates are calculated for all of the target vehicles for operation rearrangement by performing the process of Loop A, the operation route candidate calculation processing is terminated.

  FIG. 27 is a flowchart for explaining the flow of the interrupt process executed in parallel with the operation arrangement plan creation process. According to the figure, if the execution interruption instruction by the user is input from the input unit 20 (step C1: YES), the CPU 10 temporarily interrupts the operation arrangement plan creation process being executed (step C3). Next, an evaluation standard reset screen for the user to reset the evaluation standard is displayed on the display unit 30, and the evaluation value of each evaluation index is changed in accordance with a user change instruction input from the input unit 20 (step C5). ). Then, if a restart instruction by the user is input from the input unit 20 (step C7: YES), the evaluation value of each evaluation index is reset to the changed value (step C9). When the above processing is performed, the operation arrangement plan creation processing that has been temporarily suspended is resumed from step A1 or A19.

[Action / Effect]
As described above, according to the present embodiment, the provisional operation arrangement plan creation process is repeatedly executed, and the operation route candidates of each vehicle are changed (added) each time the process is repeated. That is, a plurality of provisional operation arrangement plans are sequentially created, stored, and stored, whereby an optimum vehicle operation arrangement plan can be obtained within a limited time.

  In addition, every time a provisional operation arrangement plan is created, it is determined whether it has been improved compared to the most recently created provisional operation arrangement plan, and when the number of times determined as “not improved” reaches a predetermined number of times, The creation of the provisional operation arrangement plan ends. As a result, even if the preparation of the provisional operation arrangement plan is repeated, the creation of the vehicle operation arrangement plan can be terminated when it is determined that further improvement cannot be expected.

  In the process of creating the provisional operation arrangement plan, an operation arrangement basic network BM is generated by adding the operation inspection node TN representing the operation inspection to the train schedule network based on the operation arrangement plan, and based on this operation arrangement basic network BM. A route candidate for each vehicle is calculated. Thereby, it is possible to calculate a route candidate in consideration of the work inspection.

  Further, in the route search using the operation organizing basic network BM, a plurality of duplicate networks CM that duplicate the operation organizing basic network BM are generated, and the arc destination node of each operation inspection node TN is set as the node of the operation inspection node TN. It is changed to the corresponding destination node of the duplicate network CM corresponding to the number of reachable nodes (the number n of nodes satisfying the inspection deadline condition by executing the corresponding work inspection). That is, the change of the inspection deadline is expressed by the change of the arc of the work inspection node TN, and the changed inspection deadline is expressed by the duplicate network CM including the changed destination node. Thereby, in each duplicated network CM, it is possible to perform a route search without distinguishing between the train node RN and the work inspection node TN, and therefore it becomes easy to search for a vehicle operation route candidate considering the work inspection.

Further, the user can arbitrarily set the evaluation criteria, and even when the provisional operation arrangement plan is being created, the creation processing can be temporarily suspended to reset the evaluation criteria.
This makes it possible to create a vehicle operation arrangement plan that places importance on the evaluation index desired by the user, and creates a plurality of provisional operation arrangement plans that differ in the evaluation index that is emphasized. It is possible to select a desired operation arrangement plan.

[Modification]
It should be noted that embodiments to which the present invention can be applied are not limited to the above-described embodiments, and can of course be changed as appropriate without departing from the spirit of the present invention.

(A) Index Value For example, in the above-described embodiment, the index value is “positive integer”, but it may be “decimal value” or “negative value”. In the case of a negative value, the better the route evaluation value, the better the route. Therefore, when calculating the solution of the model formula modeled in the set partition problem with additional constraints, the solution that maximizes the total sum C of the route evaluation values is calculated.

(B) Normalization of the index value Further, the index value of each evaluation index may be normalized and used so as to represent a relative value with other index values. Specifically, the index value of each evaluation index is normalized based on the ratio of the index values of all the evaluation indices to the total sum, and the path evaluation value of each path candidate is calculated based on the normalized index value. To do.

(C) Generation of duplicate network CM In the above-described embodiment, the duplicate network CM obtained by duplicating the operation organization basic network BM is set in accordance with the number N of train nodes RN and destination nodes EN included in the operation organization basic network BM. It is also possible to generate as many duplicate networks CM as the number of operation inspection nodes TN included in the operation organizing basic network BM.

  Specifically, as shown in FIG. 28, a number of duplicate network CMs equal to the number N of work inspection nodes TN are generated, and one operation inspection included in the operation organizing basic network BM is generated for each of the generated duplicate networks CM. The node TN is associated. Next, as shown in FIG. 29, the arc of each work inspection node TN of the operation organization basic network BM is replaced with the corresponding destination node of the corresponding duplicate network CM. Then, in each replication network CM, an arc that reaches a node that does not satisfy the inspection deadline condition by the operation inspection corresponding to the corresponding operation inspection node TN is cut. Thereafter, a route from the source node SN of the operation organizing basic network to any destination node EN is searched. That is, since one duplicate network CM is associated with one work inspection node TN, there is no need to cut an arc during a route search. Thereby, in each network, a route search can be performed without distinguishing between the train node RN and the work inspection node TN, and a route from the source node SN to the destination node EN can be easily searched.

An example of a train schedule. An example of the route candidate with respect to the train diagram of FIG. An example of a driving arrangement plan. The figure which shows the train diagram network with respect to the driving arrangement plan of FIG. The figure which shows the operation arrangement | positioning basic network with respect to the operation arrangement plan of FIG. Explanatory drawing of the production | generation of a replication network. An example of the number of reachable nodes of the source node. Explanatory drawing of the change of the arc of a work inspection node. Explanatory drawing of determination of the train node which satisfy | fills an inspection time limit. Explanatory drawing of determination of the arrival node which satisfy | fills a test | inspection time limit. An example of the number of reachable nodes of a work inspection node. An example of the number of reachable nodes of a work inspection node. An example of the number of reachable nodes of a work inspection node. Explanatory drawing of the cutting | disconnection of an arc. Explanatory drawing of the cutting | disconnection of the arc which goes to a destination node. Explanatory drawing of the change of an arc when a work inspection period is longer than the operation arrangement | positioning object period. Explanatory drawing of an extended network when a test cycle is longer than the operation organization target period. An example of an evaluation standard setting screen. An example of a running screen. An example of an evaluation standard reset screen. The internal block diagram of a vehicle operation arrangement plan creation apparatus. The data structural example of evaluation criteria data. The data structural example of route candidate data. The data structural example of provisional arrangement plan data. The flowchart of operation arrangement plan creation processing. The flowchart of the route candidate calculation process performed during an operation arrangement plan creation process. The flowchart of the interruption process performed in parallel with the operation arrangement plan creation process. Explanatory drawing of another Example concerning the production | generation of a replication network. Explanatory drawing of another Example concerning the production | generation of a replication network.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Vehicle operation arrangement plan preparation apparatus 10 CPU, 20 Input part, 30 Display part, 40 Communication part 50 Storage part 510 Vehicle operation arrangement program 521 Plan schedule data 522 Vehicle operation plan data 523 Operation arrangement plan data 524 Evaluation reference data 525 Route candidate data 526 Vehicle operation arrangement plan data, 527 Provisional arrangement plan data SN Originating node, EN arrival node, RN train node, TN inspection node BM Operation arrangement basic network, CM replication network, EM expansion network

Claims (11)

A program for causing a computer to create a vehicle operation rearrangement plan for a target train in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by arc,
A number- of- replications determination means for determining the number of copies to be replicated in the basic operation management network based on the total number of predetermined nodes included in the basic operation management network;
Replication network that replicates the operation organized basic network generates said number of replication, comprising: means for generating an extended network combined with the operational organize basic network, the organizing period is longer than the test period of the vehicle inspection, First extended network generation means for generating the extended network with the train node and the arrival node included in the operation organization basic network as the predetermined nodes ;
For a check node, respectively included in the extended network generated by the first extended network generation means calculates the number of nodes n of the inspection date satisfy trains node and the destination node by inspection of the check nodes, the check nodes First arc changing means for changing a destination node of the arc as the source node to a corresponding destination node in the replication network corresponding to the calculated number n ;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
A program for causing the computer to function as A program for causing a computer to create a vehicle operation rearrangement plan for a target train in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by arc,
A number- of- replications determination means for determining the number of copies to be replicated in the basic operation management network based on the total number of predetermined nodes included in the basic operation management network;
The replication network that replicates the operation organized basic network generates said number of replication, comprising: means for generating an extended network combined with the operational organize basic network, when the organizing period is less than the inspection cycle of the vehicle inspection, Second extended network generation means for generating the extended network with the destination node included in the operation organizing basic network as the predetermined node ;
For each check node included in the extended network generated by the second extended network generation means, the number n of nodes arriving at the check deadline condition is calculated by checking the check node, and the check node is defined as the original node. Second arc changing means for changing a destination node of the arc to be changed to a corresponding destination node in the replication network corresponding to the calculated number n ,
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
A program for causing the computer to function as A means for generating the number of replicas that duplicates the operation organization basic network and generating an extended network combined with the operation organization basic network , wherein the organization target period is equal to or less than an inspection period of vehicle inspection, Second extended network generation means for generating the extended network with the destination node included in the operation organizing basic network as the predetermined node;
For each check node included in the extended network generated by the second extended network generation means, the number m of destination nodes that satisfy the check deadline condition is calculated by checking the check node, and the check node is determined as the original node. Second arc changing means for changing the arc destination node to a corresponding destination node in the replication network corresponding to the calculated number m ;
Program according to claim 1 for further functions the computer as. A program for causing a computer to create a vehicle operation rearrangement plan for a target train in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by arc,
The replication network that replicates the operation organizing basic network, wherein the generated total content check node included in the operational organize basic network, extended network generation means for generating an expanded network combined with the operational organize basic network,
Arc changing means for changing, for each check node included in the extended network, a destination node of an arc having the check node as a source node to a corresponding destination node in a replication network corresponding to the check node;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
A program for causing the computer to function as   In each replicated network, an arc cutting means for cutting an arc connected to a node that does not satisfy the inspection deadline condition even by inspection of the inspection node by changing / connecting an arc from an inspection node of another network The program as described in any one of Claims 1-4 for functioning the said computer as. The train schedule is an operation arrangement diagram in which the arrangement target period is operated and arranged,
The operation organizing plan creating means is
Provisional operation arrangement plan creating means for creating a provisional operation arrangement plan by combining the vehicle operation route candidates searched by the route search means;
Evaluation means for evaluating the provisional operation arrangement plan based on the difference between the vehicle operation route candidate included in the provisional operation arrangement plan and the vehicle operation route before operation arrangement;
The provisional operation arrangement plan creation means and the evaluation means are repeatedly executed, and the provisional operation arrangement plan with the highest evaluation is set as the operation arrangement plan.
The program according to any one of claims 1 to 5 for causing the computer to function as described above.   The evaluation means uses a plurality of evaluation indexes including at least an evaluation index related to job switching and an evaluation index related to the execution of temporary inspection, and the vehicle operation route candidates included in the provisional operation arrangement plan and the vehicle before operation arrangement The program according to claim 6 for causing the computer to function so as to perform evaluation based on a difference from an operation route. Causing the computer to function as an evaluation value variable means for changing an evaluation value for each of the evaluation indexes according to a user's operation input;
The evaluation means evaluates according to the variable evaluation value;
The program according to claim 7 for causing the computer to function as described above. A vehicle operation rearrangement plan creation device for creating a vehicle operation rearrangement plan for a target schedule in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by an arc;
Based on the total number N of predetermined nodes included in the operation organization basic network, the number of replicas determining means for determining the number of replicas to duplicate the operation organization basic network;
Replication network that replicates the operation organized basic network generates said number of replication, comprising: means for generating an extended network combined with the operational organize basic network, the organizing period is longer than the test period of the vehicle inspection, First extended network generation means for generating the extended network with the train node and destination node included in the operation organization basic network as the predetermined nodes ;
For a check node, respectively included in the extended network generated by the first extended network generation means calculates the number of nodes n of the inspection date satisfy trains node and the destination node by inspection of the check nodes, the check nodes A first arc changing means for changing a destination node of the arc as the source node to a corresponding destination node in the replication network corresponding to the calculated number n ;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means; and
A vehicle operation arrangement plan creation device comprising: A vehicle operation rearrangement plan creation device for creating a vehicle operation rearrangement plan for a target schedule in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by an arc;
Based on the total number of predetermined nodes included in the operation organization basic network, the number of replicas determining means for determining the number of replicas to duplicate the operation organization basic network;
A means for generating the number of replicas that duplicates the operation organization basic network and generating an extended network combined with the operation organization basic network, wherein the organization target period is equal to or less than an inspection period of vehicle inspection, Second extended network generation means for generating the extended network using the destination node included in the operation organizing basic network as the predetermined node;
For each check node included in the extended network generated by the second extended network generation means, the number n of nodes arriving at the check deadline condition is calculated by checking the check node, and the check node is defined as the original node. Second arc changing means for changing the arc destination node to the corresponding destination node in the replication network corresponding to the calculated number n;
A route search means for searching an arc route from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means; and
A vehicle operation arrangement plan creation device comprising: A vehicle operation rearrangement plan creation device for creating a vehicle operation rearrangement plan for a target schedule in a given rearrangement target period of a predetermined train schedule,
Based on the target diagram, a departure node representing a departure station of each vehicle in the rearrangement target period, a destination node of a station to which any vehicle should end in the rearrangement target period, and a train representing each train in the rearrangement target period Node, and an inspection node representing a vehicle inspection at the destination station of a train whose destination is a vehicle inspectable station, and after the calculated nodes, nodes connectable based on the target diagram Basic network generation means for generating an operation organization basic network connected by an arc;
Replication network that replicates the operation organizing basic network, and enhanced network generation means for said generated total content check node included in the operational organize basic network, to generate an extended network combined with the operational organize basic network,
For each check node included in the extended network, an arc changing means for changing a destination node of an arc having the check node as a source node to a corresponding destination node in a replication network corresponding to the check node;
A route search means for searching for a route of an arc from a source node of the operation organization basic network to any destination node of the extended network as a vehicle operation route candidate;
An operation arrangement plan creating means for creating an operation arrangement plan by combining the vehicle operation route candidates searched by the route search means; and
A vehicle operation arrangement plan creation device comprising:

Images