Vehicle operation management support device, vehicle operation management support program, and vehicle operation management support method

Abstract

To provide a vehicle operation arrangement support device that creates vehicle operation arrangement which does not change the number of car compositions from an original plan and has a different combination of the number of car compositions.SOLUTION: A vehicle operation arrangement support device: creates, on the basis of an operation schedule, a network model in which a connection link is used to connect train nodes that are scheduled to run with the same composition, and an adapter node is interposed between the train nodes that are scheduled to run after changing the composition; adds a connection link between the nodes that are not shown in the operation schedule but can be connected; creates a route candidate from the network model after adding the connection link; creates a split-and-merger conditional chart including information of the number of car compositions and whether train lines that are lines of two or more successive train nodes are included in each of the route candidates; and creates, as optimum vehicle operation arrangement, the combination of routes with the smallest number of violations within the scope satisfying constraint conditions including the split-and-merger conditional chart.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present invention relates to a vehicle operation arrangement support device, a vehicle operation arrangement support program, and vehicle operation arrangement, and particularly relates to a technology that enables creation of vehicle operations with different combinations of train formation numbers without changing the original planned train formation number.

Background Art

[0002] When a transportation failure occurs in railway transportation services, the operation schedule changes, and accordingly, it becomes necessary to change the allocation of vehicles to trains (referred to as vehicle operation). The task of changing vehicle operation in this way is called vehicle operation arrangement. When implementing vehicle operation arrangement, various elements such as vehicle types, turnaround stations, layover stations, inspections, etc. must be considered, and manual work requires a huge amount of effort and time. Therefore, various technologies for automatically creating vehicle operation arrangements have been proposed. For example, Patent Document 1 describes a method for creating a vehicle operation that does not change the layover locations of vehicles from the vehicle operation plan.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] The aforementioned technology creates combined trains with the aim of aligning vehicle stabling locations, and therefore does not consider the number of cars in a train. Here, a combined train is a train that runs as a single train by combining multiple train sets. A train set refers to a group of vehicles assigned to a train, and the number of cars in a train set refers to the number of vehicles that make up the train set. If the number of cars in a train set differs from the vehicle operation plan, it may be possible that the expected transport capacity cannot be secured, or that there will be excessive transport capacity. Therefore, a method is needed to change the vehicle operation without changing the number of cars in the train set from the vehicle operation plan.

[0005] Therefore, the present invention aims to provide a vehicle operation reorganization support device, method, and program that create vehicle operations with different combinations of train car lengths without changing the total number of train cars in a train set from the vehicle operation plan. [Means for solving the problem]

[0006] To achieve the above objective, one representative vehicle operation management support device of the present invention is a vehicle operation management support device implemented by a computer having an output unit that outputs information, an input unit that inputs information, and a processing unit that executes a program, wherein the processing unit, by executing a program, reads information indicating the operation schedule of railway transport services, and creates a network model in which train nodes scheduled to run with the same formation are connected by connecting links and adapter nodes are interposed between train nodes scheduled to run with a changed formation, and applies the above to the network model created based on the operation schedule. The system is characterized by operating as follows: a network creation unit that adds connection links between connectable nodes that are not shown in the operation schedule and creates route candidates from the network model with the added connection links; a split-merging condition table creation unit that, based on the route candidates, creates a split-merging condition table that includes whether or not a train sequence, which is a sequence of two or more consecutive train nodes, is included in each route candidate and information on the number of train sets that make up the train sequence; and a vehicle operation creation unit that calculates a pre-set number of violations for each route candidate and creates the optimal vehicle operation arrangement by selecting the route combination with the smallest number of violations within the range that satisfies the constraints including the split-merging condition table. Furthermore, one representative vehicle operation management support program of the present invention is characterized by causing a computer to execute the following steps: a data reading step of reading information indicating the operation schedule of railway transport services; a network creation step of creating a network model in which train nodes scheduled to run with the same formation are connected by connecting links based on the operation schedule, and adapter nodes are interposed between train nodes scheduled to run with a changed formation; adding connecting links to the network model created based on the operation schedule between connectable nodes not shown in the operation schedule, and creating route candidates from the network model with the added connecting links; a split-merging condition table creation step of creating a split-merging condition table in which, for train sequences which are sequences of two or more consecutive train nodes, the train sequence is included in each route candidate and information on the number of formations that make up the trains included in the train sequence; and a vehicle operation creation step of calculating a predetermined number of violations for each route candidate and creating the optimal vehicle operation management by selecting the combination of routes with the smallest number of violations within the range that satisfies the constraints including the split-merging condition table. Furthermore, one representative vehicle operation management support method of the present invention is characterized by including: a data reading step in which a computer reads information indicating the operation schedule of a railway transport service; a network creation step in which the computer creates a network model in which, based on the operation schedule, connecting train nodes that are scheduled to run with the same formation with connecting links and interposing adapter nodes between train nodes that are scheduled to run with a changed formation, and adding connecting links to the network model created based on the operation schedule between connectable nodes that are not shown in the operation schedule, and creating route candidates from the network model in which the connecting links have been added; a split-merging condition table creation step in which the computer creates a split-merging condition table in which, based on the route candidates, for train sequences which are sequences of two or more consecutive train nodes, the information including whether or not the train sequence is included in each route candidate and the number of formations that make up the trains included in the train sequence; and a vehicle operation creation step in which the computer calculates a predetermined number of violations for each route candidate and creates the combination of routes with the smallest number of violations as the optimal vehicle operation management within the range that satisfies the constraints including the split-merging condition table. [Effects of the Invention]

[0007] According to the present invention, it is possible to create train operations with different combinations of train car lengths without changing the total number of cars in the train. [Brief explanation of the drawing]

[0008] [Figure 1] Block diagram showing an example configuration of a vehicle operation management support system. [Figure 2] A train operation diagram showing the train's operating schedule. [Figure 3] A vehicle operation sequence table showing the allocation of trains to each train set. [Figure 4] Vehicle operation network model [Figure 5] A flowchart illustrating the basic processing procedures of the vehicle operation management support system. [Figure 6]A flowchart illustrating the steps for creating a network model. [Figure 7] A flowchart showing the procedure for creating a merger / division conditions table. [Figure 8] A flowchart showing the procedure for creating vehicle operation schedules. [Figure 9] Diagram explaining the division and merger conditions table [Figure 10] Example of a division / merger conditions table [Modes for carrying out the invention]

[0009] Hereinafter, embodiments of the present invention will be described with reference to the drawings. [Examples]

[0010] Figure 1 is a block diagram showing an example configuration of a vehicle operation management support device. The vehicle operation management support device 1 is implemented in a computer having a communication unit 10, a display unit 11, an input unit 12, a processing unit 13, a memory 20, a storage unit 30, and a data path 40 connecting them.

[0011] The communication unit 10 communicates with external systems such as the vehicle management system 3 and the operation management system 4 via the network 2. The operation management system determines the operation details based on the output of this system and controls the train 5 by controlling signals and switches.

[0012] The display unit 11 is a visible output unit for information such as a liquid crystal display, and it displays the execution status and execution results processed by the vehicle operation management support device 1 to inform the user. The input unit 12 is a device for inputting instructions to the computer, such as a keyboard or grid, and it accepts input from the user. The processing unit 13 executes various programs stored in the memory 20. The storage unit 30 stores various data for the vehicle operation management support device 1 to execute. The memory 20 holds various programs 21 that the vehicle operation management support device 1 executes, as well as temporary data.

[0013] The storage unit 30 stores train schedule information 31, vehicle operation information 32, formation information 33, and setting conditions 34. The memory 20 stores a program 21, and when the program 21 is executed by the processing unit 13, the functions of the data reading unit 22, the network creation unit 23, the split-merge condition table creation unit 24, and the vehicle operation creation unit 25 are realized.

[0014] The data reading unit 22 reads the train schedule information 31, vehicle operation information 32, formation information 33, and setting conditions 34 stored in the storage unit 30.

[0015] The network creation unit 23 creates a network model representing vehicle operation based on the data read by the data reading unit 22. Details regarding this network model will be described in FIG. 4. Also, the network creation unit 23 creates a route candidate from the network model. Details regarding the route will be described later, but it indicates the route along which a certain formation travels. The network creation unit 23 creates a network model of the route from the established operation schedule, and creates the possible routes when a change occurs in the operation schedule as route candidates.

[0016] The split-merge condition table creation unit 24 creates a split-merge condition table required for formulating the constraint conditions regarding the formations in the merged state based on the data read by the data reading unit 22. Details regarding this split-merge condition table will be described in FIG. 7.

[0017] The vehicle operation creation unit 25 creates constraint conditions based on the route candidates created by the network creation unit 23, creates vehicle operation arrangements that satisfy the created constraint conditions, and presents the created vehicle operation arrangements to the user via the display unit 11.

[0018] Next, various types of information (train schedule information 31, vehicle operation information 32, formation information 33, and setting conditions 34) handled in this embodiment will be described.

[0019] Train schedule information 31 is information created as planned operation by the operation management system 4, and consists of an operation schedule including information such as train number, train type, departure station, destination station, arrival and departure times at each station, and track number used for all lines on which trains belonging to the managed train depot operate.

[0020] Vehicle operation information 32 is information created as planned operation by the operation management system 4, and consists of operation schedules such as operation number, start station, end station, and inspection information for all lines on which trains belonging to the managed vehicle depot operate.

[0021] The train formation information 33 is information created by the vehicle management system 3 and consists of allocation information, mileage, and inspection information for all train formations belonging to the managed vehicle depot.

[0022] Setting condition 34 sets the weight to be multiplied by each violation when the vehicle operation creation unit 25 calculates the number of violations of the constraint conditions. A higher weight indicates a more serious violation. The user can set the value of this weight via the input unit 12.

[0023] <Description of duties> Next, using Figures 2 and 3, we will explain the vehicle operation adjustment work targeted in this embodiment. Vehicle operation adjustment is the work of changing the allocation of vehicles to trains in accordance with the changed operating schedule when a transportation disruption occurs due to an accident or vehicle malfunction and the operating schedule is changed. Means of vehicle operation adjustment include changing the train to which vehicles are allocated at the turnaround station, temporarily retrieving reserve vehicles stored in the vehicle depot, and temporarily storing vehicles in the vehicle depot. In addition, since periodic inspections of vehicles are mandated by law according to the mileage and number of days in operation, vehicle operation adjustment is carried out by combining the above means while taking into consideration the implementation of such inspections.

[0024] Figure 2 shows a train operation diagram T1 representing the train schedule. In the train operation diagram T1, the vertical axis 41 represents stations, and the horizontal axis 42 represents time. A single train is represented by drawing lines from the starting station to the ending station according to the time. For example, train line 43 represents a train that departs from station C at 6:00 and arrives at station A around 6:30.

[0025] A line segment connecting two train lines, like line segment 44, represents a group of trains assigned to a single train set. For example, in the example in Figure 2, trains 1, 4, and 6 are connected as a series of trains, meaning that a single train set runs in this order. Similarly, trains 2, 4, and 6 are connected as a series of trains, and a single train set runs in this order. That is, trains 1 and 2 are merged at station A, and then run as trains 4 and 6.

[0026] Figure 3 shows a vehicle operation sequence table T2 that represents the allocation of trains to each train set. The vehicle operation sequence table T2 consists of a horizontal axis 51, a train set name 52, and allocation information 53. The horizontal axis 51 represents time. The train set name 52 represents a name that uniquely identifies the train set. The allocation information 53 represents the allocation of trains to the train set indicated by the train set name 52. Each train to be allocated is represented by a single horizontal bar (for example, horizontal bar 54), and the train name, the number of cars in the train set, and, in the case of combined trains, the train set position are displayed near the horizontal bar. The train set position is a number that indicates which car it will run as out of the total number of cars that make up the train. As shown in Figure 3, train set A runs as train 1, and then becomes the 1st to 10th cars of train 4 and train 6. Similarly, train set B runs as train 2, and then becomes the 11th to 15th cars of train 4 and train 6.

[0027] <Network Model> Figure 4 shows a network model of vehicle operation. Note that some links have been omitted in the example shown in Figure 4 for clarity. Figure 4 is a network model representing possible routes, and consists of formation nodes, train nodes, termination nodes, adapter nodes, and connecting links.

[0028] (1) Organization node A train formation node represents a train formation to which a route has been assigned. One formation node is set for each train formation. A train formation node has attributes such as the vehicle type, the number of cars in the formation, the original planned start location, and the original planned start time.

[0029] (2) Terminal node The terminal node represents the end of a route. The terminal node has attributes such as the vehicle type, the number of cars in the train, and the location where the original plan ended operations.

[0030] (3) Train node A train node represents a train included in the operating schedule. One train node is set up for each train. A train node has attributes such as the train's vehicle type, number of cars in the train, departure station, destination station, departure time, end time, and operation type. The operation type is an attribute that represents the status of the train and can be one of the following states: turnaround, relay, split, or merged.

[0031] (4) Adapter node Adapter nodes are nodes introduced to manage changes in train status, such as splitting and merging. They are inserted between train nodes where splitting or merging occurs and the train's composition changes. The method for creating adapter nodes will be described in detail later. Within the range of trains sandwiched by adapter nodes, splitting or merging does not occur, and the composition and number of cars in the train remain unchanged. Adapter nodes have attributes such as vehicle type, operating location, a list of the number of cars in the preceding train, a list of the number of cars in the following train, the start time of operation, and the end time of operation.

[0032] (How to create an adapter node) The system checks each train node and subsequent train nodes, creates connection links between train nodes where the same train formation and number of cars are guaranteed (e.g., for turnaround or relay runs), creates adapter nodes between other train nodes, and then creates connection links between the train nodes and adapter nodes.

[0033] (5) Connection links A connection link is a directed link that connects train nodes, train formation nodes, terminal nodes, and adapter nodes. After creating the adapter node, connection links are created between the train formation node and the train node, and between the train node and the terminal node.

[0034] Next, the processing procedure of the vehicle operation management support device 1 will be explained using Figure 5.

[0035] Figure 5 is a flowchart showing the basic processing procedure of the vehicle operation management support device 1. First, an overview of the operation procedure will be explained. In S101, the data reading unit 22 reads the train schedule information 31, vehicle operation information 32, train formation information 33, and setting conditions 34 stored in the storage unit 30. In S102, the network creation unit 23 creates a network model representing vehicle operation based on the data read by the data reading unit 22. That is, the network model created in S102 shows the route corresponding to the planned vehicle operation. Details of the network model creation procedure will be explained later using Figure 6.

[0036] In S103, connection links are added to the network model created in S102, based on the vehicle type, number of cars in the train, and time attributes of each node, so that the same vehicle can be assigned to each node. In S104, route candidates are created that start from the train node and end at the terminal node without passing through the same node more than once. In this way, S103 adds connection links that are not planned but are possible, and S104 creates route candidates that may be selected if the operation schedule changes.

[0037] In S105, the splitting and merging condition table creation unit 24 creates a splitting and merging condition table based on the route candidates created in S104, which is necessary for formulating the constraints on the merged train formations. The details of the procedure for creating the splitting and merging condition table will be explained later with reference to Figure 7.

[0038] In S106, the vehicle operation creation unit 25 calculates the number of violations set in the setting condition 34 based on the route candidates created in S104, and uses mathematical optimization with the split-merging condition table etc. created by the split-merging condition table creation unit 24 as constraints to create the set of routes with the fewest violations as the optimal vehicle operation arrangement.

[0039] In S107, the results of the vehicle operation reorganization created by the vehicle operation creation unit 25 are presented to the user via the display unit 11.

[0040] Next, we will explain the details of creating the network in S102. Figure 6 shows the procedure for creating the network model in S102. In S201, the network creation unit 23 creates train formation nodes based on the train schedule information, vehicle operation information, and formation information read in S101. The details of the formation nodes and the attributes assigned to them are as shown in the network model in Figure 4.

[0041] In S202, the network creation unit 23 creates terminal nodes based on the train schedule information, vehicle operation information, and train formation information read in S101. Details of the terminal nodes and the attributes assigned to them are shown in the network model in Figure 4. In S203, the network creation unit 23 creates train nodes based on the train schedule information, vehicle operation information, and train formation information read in S101. Details of the train nodes and the attributes assigned to them are shown in the network model in Figure 4.

[0042] In S204, the network creation unit 23 selects one train node from those created in S203. In S205, the network creation unit 23 checks the operational status of the preceding and succeeding train nodes of the train node selected in S204. If it is a turnaround or relay, it proceeds to S206 and creates a connection link between the train nodes. If the operational status is a split or merge, it proceeds to S208 and creates an adapter node between the train nodes, and then proceeds to S209 and creates a connection link between the train node and the adapter node. Details of the adapter node and the attributes assigned to the adapter node are as shown in the network model in Figure 4.

[0043] In S207, the network creation unit 23 determines whether the processing in S206 or S208-S209 has been performed for all train nodes created in S203. If it has been performed, it proceeds to S210; otherwise, it proceeds to S204.

[0044] In S210, the network creation unit 23 creates a connection link between the train formation node and the train node. In S211, the network creation unit 23 creates a connection link between the train node and the terminal node.

[0045] Next, using Figure 7, we will explain the procedure for creating the division and merger conditions table for S105.

[0046] In S301, the splitting and merging condition table creation unit 24 reads the route candidates created in S104. In S302, the splitting and merging condition table creation unit 24 selects one of the route candidates read in S301. In S303, the splitting and merging condition table creation unit 24 determines whether the size of the train sequence of the route selected in S302 is 2 or more. If it is 2 or more, it proceeds to S304; otherwise, it proceeds to S306. Here, the size of the train sequence is the number of consecutive train nodes. As already explained, splitting and merging do not occur within a series of trains sandwiched between adapter nodes, and the combination of train formations and the number of cars in each formation remain unchanged. That is, if the train nodes are consecutive, it is guaranteed that the formations are identical between them. Therefore, the size of the train sequence indicates how many times (as multiple trains) the same formation will run.

[0047] In S304, the splitting and merging condition table creation unit 24 determines whether the target train sequence is already registered in the train sequence dictionary. If it is registered, it proceeds to S306; otherwise, it proceeds to S305. In S305, the splitting and merging condition table creation unit 24 registers the target train sequence in the train sequence dictionary. The train sequence to be registered is identified, for example, by a combination of train identification information and its order.

[0048] In S306, the split / merge condition table creation unit 24 determines whether the processing in S303 to S305 has been performed for all route candidates read in S301. If it has been performed, it proceeds to S307; otherwise, it proceeds to S302.

[0049] In S307, the split-merging condition table creation unit 24 creates a split-merging condition table based on the route candidates read in S301 and the train arrangement dictionary created in S305. The number of rows in this split-merging condition table is the number of train arrangements registered in the train arrangement dictionary, and the number of columns is the number of route candidates plus one column to store the number of cars in the train formation L. Details of the split-merging condition table will be explained later with reference to Figure 9. As an example, the split-merging condition table creation unit 24 obtains the size of the train arrangement dictionary and creates a split-merging condition table for each size.

[0050] In S308, the split-merging condition table creation unit 24 initializes the values ​​of each element in the split-merging condition table created in S307 to 0. In S309, the split-merging condition table creation unit 24 updates the corresponding elements in the split-merging condition table to 1 based on the route candidates read in S301 and the train arrangement dictionary created in S305. In S310, the split-merging condition table creation unit 24 updates the value of the train formation number L in the split-merging condition table based on the train arrangement dictionary created in S305.

[0051] Next, we will explain the splitting and merging conditions table. Figure 9 shows the splitting and merging conditions table. Row 61 represents the number of train sequences. The subscripted train sequence k is a character used to distinguish each train sequence, and A is a set of consecutive trains of length 2 or more that consist of multiple formations and run, along with their corresponding subscripts. Column 62 represents the number of route candidates. The subscripted route candidate j is a character used to distinguish each route candidate, and S represents a set of subscripts corresponding to route candidates. Element b of (k,j) in the splitting and merging conditions table. kj 64 indicates whether train sequence k is included in route j; it is 1 if included, and 0 if not. However, only the longest train sequence is used. For example, in the case of a route where a merged train runs in the order "train 1 → train 2 → train 3", only the train sequence "train 1 → train 2 → train 3" is treated as included in the route, while "train 1 → train 2" and "train 2 → train 3" are treated as not included in the route.

[0052] The rightmost column L63 in the split / merger conditions table is the column that represents the number of train sets that make up a train included in the train sequence, and element L k This represents the number of train sets that make up the trains included in train sequence k.

[0053] Figure 10 shows a concrete example of a split / merger condition table. For example, if train sequence k1 is included in route candidates j1 and j2, then as shown in 71, element b 11 and b 12The value of becomes 1, and the values ​​of the other elements related to train sequence k1 become 0. Also, if the number of train sets that make up the trains included in train sequence k1 is 2, the value of element L1 becomes 2, as shown in 72.

[0054] Next, using Figure 8, we will explain the procedure for creating vehicle operations in S106.

[0055] In S401, the vehicle operation creation unit 25 reads the route candidates created in S104. In S402, the vehicle operation creation unit 25 selects one route from the route candidates read in S401. In S403, the vehicle operation creation unit 25 calculates the number of violations included in the selected route. Here, violations are those set by the user via the input unit 12 and held as setting conditions 34 in the storage unit 30, such as mismatches in the train set's stabling locations or mismatches in the track number during turnaround.

[0056] In S404, the vehicle operation creation unit 25 determines whether the processing in S403 has been performed on all route candidates read in S401. If it has been performed, it proceeds to S405; otherwise, it proceeds to S402.

[0057] In S405, the vehicle operation creation unit 25 generates constraint conditions for searching for a solution in the subsequent S406, based on the setting conditions 34 stored in the memory unit 30 and the division and merge condition table created by the division and merge condition table creation unit 24.

[0058] In S406, the vehicle operation creation unit 25 searches among the created route candidates for the set of routes that minimizes the sum of the number of route violations calculated in S403, while satisfying the following constraints: each train set is included in only one route, the sum of the number of cars in the train sets assigned to each train is less than or equal to the number of cars in the train set determined for each train, and multiple train sets in a merged state are assigned to the same train while in a merged state. In other words, it searches for a solution to the following set partitioning problem.

[0059] <Constants>

number

[0060] <Decision Firm>

number

[0061] <Objective Function>

number

[0062] <Restrictions>

number

number

number

[0063] The objective function means finding the set of routes that minimize the total number of violations. (1) This means that in the set of solution routes, each train set is included in only one route. (2) This means that in the set of solution routes, the sum of the number of cars in the train sets assigned to each train is less than or equal to the number of cars assigned to each train. For example, if there is a train with 15 cars, it cannot be assigned by merging train set D (10 cars) and train set E (10 cars), but it can be assigned by merging train set D (10 cars) and train set F (5 cars). (3) This means that multiple train sets in a merged state will be assigned to the same train while they are merged. This is a constraint to prevent undesirable splitting or merging from occurring.

[0064] As described above, the disclosed vehicle operation management support device 1 is a vehicle operation management support device 1 implemented by a computer having a display unit 11 as an output unit that outputs information, an input unit 12 that inputs information, and a processing unit 13 that executes a program. The processing unit 13 executes a program 21 and includes a data reading unit 22 that reads information indicating the operation schedule of railway transport services, and a network model that connects train nodes scheduled to run with the same formation using connecting links and interposes adapter nodes between train nodes scheduled to run with a changed formation based on the operation schedule. Dell operates as follows: a network creation unit 23 that adds connection links between connectable nodes that are not shown in the aforementioned operating schedule and creates route candidates from the network model with the added connection links; a split-merging condition table creation unit 24 that, based on the route candidates, creates a split-merging condition table that includes whether or not the train sequence, which is a sequence of two or more consecutive train nodes, is included in each route candidate and information on the number of train sets that make up the train sequence; and a vehicle operation creation unit 25 that calculates a pre-set number of violations for each route candidate and creates the optimal vehicle operation arrangement by selecting the route combination with the smallest number of violations within the range that satisfies the constraints including the split-merging condition table. Therefore, it is possible to create train operations with different combinations of train car lengths without changing the total number of cars in each train.

[0065] Furthermore, the network model includes train nodes, train formation nodes, terminal nodes, and adapter nodes, wherein each train node has at least the following attributes for each of the multiple transport journeys included in the operation schedule: vehicle type, number of cars in the formation, starting location, starting time, ending location, and ending time; each train formation node has at least the following attributes: vehicle type, number of cars in the formation, operation start location, and operation start time for each formation; each terminal node has at least the following attributes: vehicle type, number of cars in the formation, operation end location, and vehicle type; each adapter node is created between train nodes other than those where the same formation and number of cars are guaranteed, and has at least the following attributes: vehicle type, operation location, a list of the number of cars in the formation constituting the preceding train, a list of the number of cars in the formation constituting the following train, operation start time, and operation end time; the network creation unit 23 creates connection links between the adapter node and the preceding train node, and between the adapter node and the following train node, and creates connection links between each node based on the operation schedule, thereby creating a network model corresponding to the operation schedule. Furthermore, the network creation unit 23 adds connection links to the network model corresponding to the operation schedule, based on the attributes of each node's vehicle type, number of cars in the train, and time, between nodes to which the same vehicle can be assigned. Based on the network model to which the connection links have been added, it searches for candidate routes that start from the train formation node and end at the terminal node without passing through the same node more than once. Therefore, by using the information used for the operation schedule to create various nodes and connecting them, a simple network model can be created to determine possible routes when the operation is changed.

[0066] Furthermore, the network creation unit 23 makes the number of train formations variable by introducing the adapter nodes, and creates a network model by creating connection links between nodes with the same number of train formations; the splitting and merging condition table creation unit 24 adds constraints to prevent undesirable splitting and / or merging; and the vehicle operation creation unit 25 creates an integer programming problem and finds a solution to create a vehicle operation plan that satisfies the condition that the number of train formations does not change from the original plan. Therefore, it is possible to propose an optimal plan for reorganizing train operations, taking into account the constraints related to train operations.

[0067] Furthermore, the network creation unit 23 does not pre-set the number of train sets that make up a train, and can allocate trains with any number of train sets. Furthermore, the network creation unit 23 does not pre-set locations where trains will merge, but allows trains to merge at any location. Therefore, we can explore and propose the optimal plan for reorganizing train operations, including the number of train sets and the locations where trains are merged.

[0068] Furthermore, the aforementioned constraints may include at least one of the following: each train set is included in only one route; the sum of the number of cars in the train sets assigned to each train is less than or equal to the number of cars specified for each train; and multiple train sets in a combined state are assigned to the same train while in a combined state. By using these constraints, it is possible to explore and present an optimal vehicle operation plan that aligns with actual operational realities.

[0069] It should be noted that the present invention is not limited to the embodiments described above, and various modifications are included. For example, the embodiments described above are explained in detail to make the present invention easier to understand, and are not necessarily limited to those having all the configurations described. Furthermore, it is possible to replace or add configurations, not just delete them. [Explanation of Symbols]

[0070] 1: Vehicle operation management support device, 2: Network, 3: Vehicle management system, 4: Operation management system, 5: Train, 10: Communication unit, 11: Display unit, 12: Input unit, 13: Processing unit, 20: Memory, 21: Program, 22: Data reading unit, 23: Network creation unit, 24: Split / merger condition table creation unit, 25: Vehicle operation creation unit, 30: Storage unit, 31: Train timetable information, 32: Vehicle operation information, 33: Train formation information, 34: Setting conditions, 40: Data path, T1: Vehicle operation diagram (drawing), T2: Vehicle operation sequence table (diagram)

Claims

1. A vehicle operation management support device implemented by a computer having an output unit that outputs information, an input unit that inputs information, and a processing unit that executes a program, The aforementioned processing unit, by executing a program, A data reading unit that reads information showing the operating schedule of railway transport services, Based on the aforementioned operating schedule, a network creation unit creates a network model by connecting train nodes that are scheduled to run with the same train set using connecting links, and by interposing adapter nodes between train nodes that are scheduled to run with a changed train set. The network creation unit then adds connecting links to the network model created based on the aforementioned operating schedule, between connectable nodes that are not shown in the aforementioned operating schedule, and creates route candidates from the network model with the added connecting links. Based on the aforementioned route candidates, a division and merge condition table creation unit creates a division and merge condition table for train sequences, which are sequences of two or more consecutive train nodes, including information on whether the aforementioned train sequence is included in each route candidate and the number of train formations that make up the train sequence. A vehicle operation creation unit calculates a predetermined number of violations for each candidate route, and within the range that satisfies the constraints including the division and merger conditions table, creates the optimal vehicle operation arrangement by selecting the route combination with the fewest violations. A vehicle operation management support device characterized by operating as such.

2. The aforementioned network model includes train nodes, train formation nodes, termination nodes, and adapter nodes. The aforementioned train node has, for each of the multiple transport routes included in the aforementioned operating schedule, at least the vehicle type, number of cars in the train, departure location, departure time, destination location, and destination time of the transport route as attributes, The aforementioned train set node has at least the following attributes: the vehicle type, the number of cars in the train set, the location where operation begins, and the time when operation begins. The aforementioned terminal node has at least the following attributes: vehicle type, number of cars in the train, location where operation ends, and vehicle type. The adapter node is created between train nodes other than those where the same train set and number of cars are guaranteed, and has at least the following attributes: vehicle type, operating location, list of the number of cars in the train set constituting the preceding train, list of the number of cars in the train set constituting the following train, start time of operation, and end time of operation. The vehicle operation management support device according to claim 1, characterized in that the network creation unit creates connection links between the adapter node and the preceding train node, and between the adapter node and the following train node, and creates connection links between each node based on the operation schedule to create a network model corresponding to the operation schedule.

3. The aforementioned network creation unit, For the network model corresponding to the aforementioned operating schedule, connection links are added between nodes that can be assigned the same vehicle based on the vehicle type, number of cars in the train, and time attributes of each node. The vehicle operation coordination support device according to claim 2, characterized in that it searches for candidate routes that start from a formation node and end at a terminal node without passing through the same node more than once, based on the network model with the aforementioned connection links added.

4. The vehicle operation management support device according to claim 1, wherein the network creation unit does not pre-set the number of train sets that make up the train, and can allocate trains with any number of train sets.

5. The vehicle operation management support device according to claim 1, wherein the network creation unit does not pre-set locations where trains will merge, but allows trains to merge at any location.

6. On the computer, A data reading step that reads information showing the operating schedule of rail transport services, Based on the aforementioned operating schedule, a network model is created by connecting train nodes where the same train set is scheduled to run with connecting links, and by interposing adapter nodes between train nodes where the train set is scheduled to run with a changed configuration; connecting links are added to the network model created based on the aforementioned operating schedule between connectable nodes not shown in the aforementioned operating schedule; and route candidates are created from the network model with the added connecting links. Based on the aforementioned route candidates, a splitting and merging condition table is created for each train sequence, which is a sequence of two or more consecutive train nodes, including information on whether the train sequence is included in each route candidate and the number of train formations that make up the train sequence. A vehicle operation creation step involves calculating a predetermined number of violations for each candidate route, and creating the optimal vehicle operation arrangement by selecting the route combination with the fewest violations within the range that satisfies the constraints including the division and merger conditions table, A vehicle operation management support program characterized by its ability to perform certain actions.

7. A data reading step in which the computer reads information indicating the operating schedule of rail transport services, The computer creates a network model in which, based on the operation schedule, it connects train nodes that are scheduled to run with the same formation using connecting links, and connects adapter nodes between train nodes that are scheduled to run with a changed formation, and adds connecting links to the network model created based on the operation schedule between connectable nodes that are not shown in the operation schedule, and creates route candidates from the network model with the added connecting links, The computer, based on the route candidates, creates a splitting and merging condition table for each train sequence, which is a sequence of two or more consecutive train nodes, including information on whether the train sequence is included in each route candidate and the number of train formations that make up the train sequence. The vehicle operation creation step involves the computer calculating a predetermined number of violations for each candidate route, and creating the optimal vehicle operation arrangement by selecting the route combination with the fewest violations within the range that satisfies the constraints including the division and merger conditions table, A vehicle operation management support method characterized by including the following.

Images