JP7308119B2 - Vehicle operation plan generation method, vehicle operation plan generation device, and program - Google Patents

Description

The present invention relates to a vehicle operation plan generation method, a vehicle operation plan generation device, and a program.

Railway companies generally revise diagrams (hereinafter referred to as diagrams) in order to respond to changes in track equipment and vehicle equipment and to improve transportation services. A diagram is a diagram that expresses the operation plan of a transportation system, and is also called an operation chart.

When implementing a timetable revision, it is required to generate not only the departure and arrival times of each train at each station, but also various basic plans such as a yard work plan and a crew operation plan. The yard work plan is a plan for the arrival/departure tracks and travel routes in each station yard, and the rolling stock operation plan is a rolling stock allocation plan for each train. The crew operation plan is a plan for deciding which trains to put the drivers and conductors on in what order. In addition, on routes where vehicles of different railway companies operate through each other, it is necessary to adjust the vehicles allocated to each train so that the traveling kilometers of the vehicles of each company are balanced.

Since many of the various plans described above are large-scale and complex problems, they are generally generated by specialized experts spending a great deal of time and effort. Patent documents 1 to 3, for example, disclose conventional techniques related to formulating a vehicle operation plan.

JP-A-2003-154939 JP-A-2005-259052 Japanese Patent Application Laid-Open No. 2003-306147

However, even if the rolling stock operation plan can be generated without any problems based on the train departure and arrival information shown in the timetable proposal, there are cases where it contains unsuitable parts (for example, parts that cannot comply with the restrictions related to the police box) in terms of actual operation. rice field. The work of finding inadequate parts of the rolling stock operation plan, correcting the timetable according to the inadequate parts, and reflecting it in the on-site work plan and rolling stock operation plan was done manually by people with experience and knowledge. Therefore, formulating a vehicle operation plan was complicated and took a long time.

SUMMARY OF THE INVENTION An object of the present invention is to provide a vehicle operation plan generation method, a vehicle operation plan generation device, and a program that can facilitate formulation of a vehicle operation plan by reducing the burden of timetable correction work.

In one of the embodiments of the present invention, an information processing device includes:
Receiving data of a proposed train schedule and data indicating changeable portions of the proposed timetable,
Using the data of the timetable plan, obtaining a feasible solution for a vehicle operation plan based on the timetable plan by mathematical programming,
When the feasible solution cannot be obtained, using the data indicating the changeable part, correcting the timetable plan,
Using mathematical programming, find a feasible solution for the vehicle operation plan based on the revised timetable plan,
Output data of vehicle operation plan based on the obtained feasible solution,
It is a vehicle operation plan generation method including.

In the rolling stock operation plan generation method, the information processing device further displays a screen prompting the input of the data of the changeable parts together with the data of the timetable plan or when the feasible solution cannot be obtained. A configuration including:

In the rolling stock operation plan generating method, the information processing device displays an editing screen for the timetable plan, and converts data indicating correction points of the timetable plan generated using the editing screen into data indicating the changeable points. Arrangements may be employed further comprising storing as .

In the rolling stock operation plan generation method, the information processing device uses data of the timetable proposal to create a model of the rolling stock operation plan, including nodes indicating events related to the rolling stock operation plan and weights connecting the nodes. and the modifiable points are represented by additional arcs that are arcs added to the network, and the additional arcs are selected to find the feasible solution. may be adopted.

A configuration may be adopted in which the changeable location is represented by the additional arc and a dummy node connected to a node in the network by the additional arc. In this case, a configuration may be adopted in which nodes in the network are used for solving the feasible solution, and the dummy nodes can be used or not used in solving the solution.

Further, a configuration may be adopted in which a weight indicating a priority of use of the additional arc in solving the feasible solution is set to the additional arc. Also, the feasible solution may be calculated by mixed integer programming using the network.

In the vehicle operation plan generation method, the information processing device may obtain a feasible solution for the vehicle operation plan based on the timetable plan and vehicle information related to vehicles used for operation of the timetable plan. . Further, the information processing device may employ a configuration that obtains a feasible solution for a vehicle operation plan based on the timetable plan and inspection information related to inspections of vehicles used for operation of the timetable plan. Further, the information processing device obtains a feasible solution of the rolling stock operation plan in consideration of the mileage information indicating the mileage between stations for each operating company when the timetable plan includes through operations of a plurality of operating companies. , configuration may be employed.

One of the embodiments of the present invention includes processing for receiving data of a train timetable plan and data indicating changeable locations in the timetable plan, and using the data of the timetable plan to operate rolling stock based on the timetable plan. A process of obtaining a feasible solution of the plan by mathematical programming, a process of correcting the timetable plan using the data indicating the changeable parts when the feasible solution cannot be found, and the corrected timetable plan. A vehicle operation plan generation including a control unit that executes a process of obtaining a feasible solution of the vehicle operation plan based on mathematical programming and a process of outputting data of the vehicle operation plan based on the obtained feasible solution It is a device.

One embodiment of the present invention provides a computer with
a step of receiving data of a train timetable proposal and data indicating changeable portions of the timetable proposal;
a step of obtaining a feasible solution for a rolling stock operation plan based on the timetable proposal by mathematical programming using data of the timetable proposal;
a step of correcting the timetable plan using the data indicating the changeable locations when the feasible solution cannot be obtained;
a step of obtaining a feasible solution for a rolling stock operation plan based on the revised timetable plan by mathematical programming;
a step of outputting vehicle operation plan data based on the obtained feasible solution;
is a program that executes

ADVANTAGE OF THE INVENTION According to this invention, the burden of correction work of a timetable can be reduced, and formulation of a vehicle operation plan can be facilitated.

FIG. 1 shows an example of the work. FIG. 2 shows an example of alternation. FIG. 3 shows an example of rearrangement of actions by modifying diamonds. 4A is an explanatory diagram of method 1, FIG. 4B is an explanatory diagram of method 2, and FIG. 4C is an explanatory diagram of method 3. FIG. 5A is an explanatory diagram of method 4, FIG. 5B is an explanatory diagram of method 5, and FIG. 5C is an explanatory diagram of method 6. FIG. FIG. 6 shows a process performed by the vehicle operation plan generation device according to the embodiment. 7A and 7B are explanatory diagrams of train diagram generation. 8A and 8B are explanatory diagrams of train diagram generation. FIG. 9 is an explanatory diagram of train diagram generation. 1 shows a hardware configuration example of an information processing device (computer) that operates as a vehicle operation plan generation device. FIG. 11 is a flow chart showing an example of train schedule generation processing. FIG. 12 is a diagram for explaining a vehicle information file. FIG. 13 is a diagram for explaining a file of inspection information. FIG. 14 is a diagram for explaining a file of mileage constant information. FIG. 15 is a diagram for explaining the file of the number of overnight stays in the base. FIG. 16 shows a display example of the menu screen. FIG. 17 shows a display example of the change editing screen. FIG. 18 shows a screen display example when the optimum solution is found. FIG. 19 shows an example of kilometer output data (table). FIG. 20 shows a screen display example when the optimum solution is not found. FIG. 21A shows an example of work, and FIG. 21B is a diagram showing work as a vehicle operation network. 22A to 22C show setting examples of dummy nodes and additional arcs. 23A-C show examples of setting dummy nodes and additional arcs. FIG. 24A shows the network before cleaning and FIG. 24B shows the network after cleaning. FIG. 25 shows an output example of A43. FIG. 26 shows an example alternating output without constraints during an example response run. FIG. 27 shows an example of designating a nighttime detention location. FIG. 28 shows an example utilizing forward train calculation. FIG. 29 shows the actions of E64 and E65 extracted from FIG. FIG. 30 shows Tables 4-7.

BEST MODE FOR CARRYING OUT THE INVENTION An embodiment of the present invention will be described below based on the drawings. The configurations of the following embodiments are examples, and the present invention is not limited to the configurations of the embodiments.

<Formulation of draft train schedule>
The train schedule is the most basic plan for operating trains. It is no exaggeration to say that all information related to train operations is linked to train schedules. Therefore, in timetable revision, changing the timetable means not only changing the departure and arrival times of trains, but also recreating all related plans.

A train schedule contains a variety of information. Initial timetable proposals are mainly examined and generated in the following three phases.
(1) First, what kind of train is to be run in which section and how long. The start and end stations, approximate operation intervals (for example, 10 minutes or 30 minutes), and the number of operations are examined for each time zone.
(2) Next, while considering the time required for each train and the connection between each train, take into consideration the number of platforms that can be used at each station, etc. Consider each.
(3) After the above considerations have been completed, consider the number of trains that can be used and where they can be accommodated. .

Once the draft initial train schedule is formulated, a rolling stock operation plan is formulated to determine which trains the owned rolling stock will be assigned to and in what order. In addition, the work of formulating various plans associated with the train schedule, such as the operation plan for crew members such as drivers and conductors, will begin. In order to make all the plans associated with the train schedule come true, we will proceed with the formulation of the plan while making corrections to the initial schedule plan as necessary. Then, when the final timetable for all plans is completed, timetable revisions can be implemented.

<Overview of rolling stock operation plan>
There are roughly two types of vehicle operation plans. The first is called a work (or operation), a plan that shows the daily movements of a vehicle. FIG. 1 shows an example of the work. In FIG. 1, a vehicle leaves station B at 6:07 as train 9122 and arrives at station A at 6:35:40. After that, take the 1701 train that departs at 6:41:30 and heads for C station. After that, the same method is applied to each train, and on this day, at 19:52, train 9236 entered the garage at E station and finished the day's work.

The second is called koban (or operational order). A koban is represented by a diagram called a bar diagram in which the actions and actions are arranged in order. Police boxes are divided into groups (hereinafter referred to as "operation groups") divided by a predetermined classification method such as the same vehicle type and management classification, such as a group of 6-car trains, a group of 10-car trains, and a group of express trains. called).

FIG. 2 shows an example of alternation. In the example shown in FIG. 2, there are eight operation patterns (work) from A11 operation to A18 operation. The operation pattern for the day following the A11 operation will be the A12 operation, and the next day will proceed to the A13 operation. The operation pattern on the day after the A18 operation returns to the A11 operation. In addition, inspection is performed in the A11 operation and the A13 operation. In this way, the koban is designed so that each vehicle can go through each task within the koban one day at a time, starting with the first task, and then return to the first task of the next day after completing the last task. to generate

A number of considerations are required when generating a vehicle trip plan. Matters include the number of trains to which the vehicle is allocated (e.g., a train stopping at a station with only six platforms cannot be allocated a 10-car train), and the base to which each vehicle belongs ( Important inspections and maintenance work must be done at the base to which they belong), various inspection cycles (train inspections and monthly inspections), nighttime storage locations (whether it is possible to store them), number of trains that can be stored, etc.

The initial timetable proposal is based on the number of vehicles for the day, such as the next destination of the vehicle (which train should be allocated after which train), the origin of the vehicle (where should the vehicle be forwarded from and which train should be allocated), etc. It is generated with awareness of the work that is the movement of However, the generation of the initial timetable plan does not consider the police box. For this reason, it may not be possible to comply with the constraints necessary for generating a police box simply by rearranging the activities generated at the stage of the initial timetable proposal.

For example, it is assumed that the initial timetable plan sets the operation in which a vehicle leaving a place where only one vehicle is parked in the morning is parked at the same place after finishing the day's work. The vehicle in this assumption will be permanently used for the above-mentioned work unless it is temporarily operated as a forwarding train or the like. Therefore, a police box cannot be established.

FIG. 3 shows an example of rearrangement of actions by modifying diamonds. Assume that the police box shown on the left side of FIG. In FIG. 3, the letters "ken" indicate inspections, and A to E indicate station names. At the police box on the left side, the vehicle is inspected on the first day, then on the fifth day, and then on the fifth day. However, if the inspection cycle is set to within 4 days, the police on the left side of FIG. 3 does not hold. Furthermore, the tasks cannot be rearranged so as to satisfy the constraint of the inspection period.

In the case shown on the left side of FIG. 3, it is required to change the schedule and modify the plan to meet inspection period constraints. For example, if it is possible to modify the timetable to change the departure location from C station to E station on the 4th day and change the departure location from E station to C station on the 6th day, as shown on the right side of FIG. The jobs are rearranged to generate an alternation that satisfies the inspection period. In this way, in the timetable revision, we modify part of the draft train schedule and examine whether or not a police box that satisfies all the constraints can be made from the modified work, and repeat this process until all the constraints are satisfied. .

<Modification of draft train schedule according to vehicle operation plan>
It may be necessary to modify the schedule in order to complete the rolling stock operation plan. The following method is mainly used as a method of modifying diamonds.

(Method 1) Change the delivery location/receipt location.
FIG. 4A is an illustration of Method 1. FIG. In the left diagram of FIG. 4A, the forwarding train a departs from B station, and the forwarding train b departs from A station. In the right figure, the departure locations are changed so that the forwarding train a departs from A station and the forwarding train b departs from B station. In FIGS. 4A-C and 5A-C, a circle indicates an exit, and a triangle indicates an entry. In addition, diagonal straight lines connecting stations indicate trains, and straight lines in which rectangles are inserted indicate out-of-service trains.

(Method 2) Change the appropriate train at the turn-around station.
FIG. 4B is an explanatory diagram of Method 2. FIG. In the left diagram of FIG. 4B, the vehicle of the train b is assigned to the return train c, and the vehicle of the train a is assigned to the return train d. In the right diagram of FIG. 4B, a change has been made in which the vehicles of train a are assigned to the return train c, and the vehicles of train b are assigned to the return train d.

(Method 3) Change the time of the forwarding train and change the appropriate train at the return station.
FIG. 4C is an illustration of Method 3. FIG. In the left diagram of FIG. 4C, a forwarding train b heading from B station to C station passes a return train c from C station. The vehicle of the train a is used for the train c, and the forwarding train b is used for the return train d from the C station. In the right diagram of FIG. 4C, the departure time is changed so that the forwarding train b arrives at C station earlier than the train a. In addition, a change has been made in which the cars of the forwarding train b are used for the return train c, and the cars of the train a are used for the return train d.

(Method 4) Operate additional forwarding trains.
FIG. 5A is an illustration of Method 4. FIG. In the left diagram of FIG. 5A, the train a arriving at the B station is assigned to the turn-around train d. In the right diagram of FIG. 5A, forwarding train b arrives at B station after train a. Train a becomes forwarding train c, and forwarding train b is assigned to train d at C station.

(Method 5) Replace a vehicle by adding an entry/exit.
FIG. 5B is an illustration of Method 5. FIG. In the left diagram of FIG. 5B, the train a arriving at the B station is assigned to the turn-around train b. In the right diagram of FIG. 5B, the train a is changed to enter the B station, and the train b leaves the B station.

(Method 6) Change the starting station or terminal station of the train.
FIG. 5C is an illustration of Method 6. FIG. In the left diagram of FIG. 5C, the train a arriving at C station is assigned to the return train d, and the train b arriving at B station is assigned to the return train c. In the right diagram of FIG. 5C, the starting station of train c is changed from B station to C station by allocating the vehicle of train a arriving at C station to train c. Also, the starting station of train d is changed from station C to station B by allocating the vehicle of train b arriving at station B to train d.

In addition to the methods 1 to 6 described above, a train is deleted (method 7) in unavoidable cases. By combining the methods 1 to 7, the initial timetable proposal is revised while going back and forth between the timetable revision and the creation of the work of the vehicle and the police turn.

Initial timetable proposals are ideally generated with a focus on daily operations in terms of transport services required. For this reason, it is preferable to make as few changes as possible from the initial timetable plan due to the circumstances of the police station of the vehicle. On the other hand, when the number of owned vehicles is large and the number of locations where vehicles are kept at night is diverse, it is rare to generate a police box that satisfies the constraints by modifying the timetable once, and there are many locations that require modification. For this reason, the task of generating a police box is extremely difficult, and at present, even an expert needs a lot of time and effort to study it.

<Challenge>
In research on vehicle operation plans, there is a plan called the basic plan (work and police box) that is formulated at the time of timetable revision, and a plan that decides which train set is appropriated for each work every day after the basic plan is formulated (recurrence here). Various studies have been conducted on the concept of planning. However, in previous studies, rolling stock operation planning and changes in station arrival/departure lines and timetables have been treated as separate issues. For this reason, there is no method that fully considers the effect on the train timetable due to the change of the departure/arrival number, which is necessary for the creation of the rolling stock operation plan.

<Overview of equipment>
A vehicle operation plan generating device according to an embodiment will be described below. The rolling stock operation plan generating device according to the embodiment simultaneously handles the formulation of rolling stock operation plans in the actual timetable revision work and the correction of the train schedule accompanying the formulation of the rolling stock operation plans, and calculates the optimum solution that can be executed on the actual route using mathematical programming. is automatically generated in a relatively short time using Mathematical programming is a method of maximizing or minimizing an objective function under given constraints based on a mathematical method, and an exact mathematical solution can be obtained.

FIG. 6 shows a process performed by the vehicle operation plan generation device according to the embodiment. In this process, first, a timetable plan is formulated. In the timetable planning process, in accordance with the actual timetable revision work process, train departure and arrival times, station premises number lines, replacement plans (designation of return trains, out-of-service trains, etc.), and all information necessary for at least one day's operation A set timetable plan (referred to as an initial timetable plan) is prepared and input to the rolling stock operation plan generator (S1).

Subsequently, information of locations where it can be determined that changes from the initial timetable proposal are possible (changeable locations) is set (S2). The setting of the changeable part information may be done manually or automatically. The information on the changeable parts may be set statically in advance, or may be input after the fact when there is no solution.

From the two pieces of information, the initial timetable plan and the changeable locations, the operations and police boxes of a plurality of operation groups that satisfy various constraints such as inspection intervals are automatically generated. At this time, it is preferable to minimize changes from the initial timetable plan. In addition, when a plurality of railway companies (operating companies) are conducting mutual direct operation, the running kilometers of direct trains are automatically adjusted (S3). If there is a feasible solution in S3, the schedule is determined (S4).

7A and B, FIGS. 8A and B, and FIG. 9 are explanatory diagrams of train diagram generation and correction. In FIG. 7A, A station, B station, and C station are indicated by straight lines. In FIG. 7A, a straight line indicates the flow of time in a day, and time flows from left to right on the page. A diagonal straight line is drawn between the departure time at the starting station and the arrival time at the terminal station. This straight line indicates a train. In this way, the diagram indicates the departure and arrival times of trains from each station, and the running section of the train. With respect to the diagram of FIG. 7A, there is one overnight detention at each of A station and C station. A station and C station have two platforms. There is a garage at B station.

FIG. 7B shows the task formulation work. A white circle indicates "outgoing" and a triangle indicates "entering". A white circle indicating "departure" is added to the first trains of each of A station, B station, and C station. The first trains at A station and C station are assigned the cars that are stored (stored) at A station and C station at night, respectively. The first train at station B is assigned a vehicle leaving the garage. Also, the first train heading from B station to A station is assigned a vehicle leaving the garage. In addition, when it is possible to allocate a vehicle for turn-around operation to the first train at each station, the arrival time and turn-around departure time are connected by a curve.

In FIG. 7B, after allocating vehicles for turn-around operation, there are trains that have no vehicles to allocate and trains that have no route to return to the garage (curves indicating turn-arounds are indicated by dashed lines). In FIG. 8A, as indicated by the thick line, trains with no cars assigned from station C are operated (forwarded) from the garage, and trains that have arrived at stations A and C but do not have a route to return to the garage are returned to the garage. A service (forwarding) is added, and the arrival time of the train and the departure time of the forwarding train are connected by a curve.

Next, as shown in FIG. 8B, alternating boxes (bar diamonds) are generated from the diamond shown in FIG. 8A. FIG. 8B shows a police box in which six works are extracted from the diagram shown in FIG. 8A and the exit stations are arranged in the order of A station→B station→C station. However, the police box shown in FIG. 8B has the following problems.
(1) Since vehicle "1" leaves station A and enters station A, it is not possible to create a circulating police box simply by rearranging vehicles "1" to "6".

Therefore, by correcting the diagram as shown in FIG. 9, the police box is established. The corrected part is indicated by a dashed line, and the one before correction is indicated by a dashed-dotted line. Regarding the above problem (1), car "1" will be changed to enter the garage at B station, car "5" will be allocated to the return train from station A to station C, and will be detained at station A at night. do.

The vehicle operation plan generation device according to the embodiment stores the data of the initial timetable plan shown in FIG. Can be set or input. The vehicle operation plan generation device automatically generates a vehicle operation plan (work and police box) by mathematical programming using information indicating the initial timetable plan. At this time, if there is an actually operable (no problem) police box, that is, if there is a feasible solution, the initial timetable proposal is determined as the final timetable. On the other hand, when there is no feasible solution (when the police box includes the problem shown in FIG. 8B), the vehicle operation plan generation device automatically corrects the timetable using the data of the changeable locations. run to If all the problems are solved by the modification, the modification diagram at that time is decided as the final diagram.

As described above, according to the rolling stock operation plan generation device, when a feasible solution is not derived in the production of the rolling stock operation plan based on the initial timetable proposal, the timetable is corrected using the data indicating the locations where work can be changed. , can establish a police box. Details of the vehicle operation plan generation device will be described below.

<<Hardware configuration>>
FIG. 10 shows a hardware configuration example of an information processing device (computer) that operates as a vehicle operation plan generation device. A general-purpose or dedicated computer such as a personal computer, a workstation, or a server machine can be applied to the information processing apparatus 10, for example. Further, the information processing apparatus 10 may be a fixed terminal or a mobile terminal (smart device such as a smart phone or a tablet terminal).

In the example shown in FIG. 10, an information processing apparatus 10 includes a CPU (Central Processing Unit) 11, a storage device 12, and a communication interface (communication IF), which are interconnected via a bus 1.
) 13 , an input device 14 and a display 15 . The CPU 11 is an example of a “controller” and a “processor”.

The storage device 12 includes a main storage device and an auxiliary storage device. The main memory is used as a storage area for data and programs, a work area for the CPU 11, a buffer area for communication data, and the like. The main memory is RAM (Random Access Memory) or a combination of RAM and ROM (Read Only Memory). Auxiliary storage devices are used as storage areas for data and programs. Auxiliary storage devices include hard disk drives, SSDs (Solid State Drives),
It includes EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory, and the like.

The communication IF 13 is, for example, a LAN (Local Area Network) card, and controls connection with a network (for example, the Internet) and transmission/reception of data. The communication IF 13 may be connected to a network by wire, or may be connected wirelessly according to a predetermined wireless communication standard such as a wireless LAN.

The input device 14 is a key, button, pointing device, touch panel, or the like used to input information. The display 15 displays (outputs) information. An input device 14 and a display 15 form a user interface (UI) 16 . The information processing device 10 may also include a voice input device (microphone) and a voice output device (speaker).

The CPU 11 can perform the following processes by executing programs stored in the storage device 12 .
(1) Process for accepting data of a timetable plan (initial timetable plan or modified timetable plan) (2) Processing for finding a feasible solution for a rolling stock operation plan based on a timetable plan by mathematical programming (3) Finding possible changes to a timetable plan (4) If there is no feasible solution for the vehicle operation plan for the timetable plan, the process of correcting the timetable plan using data indicating changeable locations (5) Mathematical programming for the corrected timetable plan Process for finding a feasible solution (6) Process for outputting vehicle operation plan data based on a revised timetable plan when a feasible solution is found

Some or all of the processing performed by the CPU 11 is performed by a plurality of CPUs, a multi-core CPU, a processor other than the CPU (DSP, GPU, etc.), an integrated circuit (FPGA (Field Programmable Gate Array) or ASIC (Application Specific Integrated Circuit) etc.), a combination of a processor and hardware (SoC (System-on-a-Chip), MCU (Micro Control Unit), etc.).

<<Example of train diagram generation processing>>
FIG. 11 is a flow chart showing an example of train schedule generation processing. The train schedule generating process is performed by the CPU 11 executing a program stored in the storage device 12 . As input data, the timetable plan (timetable plan data), vehicle information (vehicle operation group data), inspection information (inspection data), and mileage information (mileage data between stations) are input to the information processing device 10 using the input device 14. It is input and stored in the storage device 12 . If necessary, parking vehicle information indicating the number of parked vehicles in the base is further input and stored.

The file recording the timetable plan (initial timetable plan) includes the following information items (parameters). However, it is not always essential to include all. The file format of the timetable proposal is, for example, a text CSV file format, but is not limited to this file format.
・Station name ・Train number ・Car operation code ・Use track number ・Arrival time (hh:mm:ss)
・Departure time (hh:mm:ss)
・Operation (stopping, passing, turning back, changing the same direction type, leaving, entering)
・Previous train number (when the operation is "turnaround, same direction type change" at the starting station)
・Following train number (when the operation at the terminal station is "turnaround, same direction type change")

FIG. 12 is a diagram for explaining a vehicle information file. The vehicle information file is, for example, a CSV file in text format, but is not limited to this. A file has a tabular format consisting of one or more records. Elements (information items) in the record include the following.
・The number of affiliated companies (expressed as an integer, for example) and the number of operating groups (expressed as an integer, for example)
・Affiliation company information for each operation group (for example, expressed as an array of integers) and the maximum number of available trains (for example, expressed as an array of integers)

FIG. 13 is a diagram for explaining a file of inspection information. The inspection information file is, for example, a CSV file in text format, but is not limited to this. A file has a tabular format consisting of one or more records. The records include a record containing the number of days of alternating inspection cycle and the number of days of work inspection cycle as elements, and a record of inspection possible places. The number of days for the regular inspection cycle and the number of days for the daily inspection cycle are specified by specifying the number of days (integers). In addition, when the number of days of the periodic inspection cycle is one for each operation group, the number of days of the periodic inspection cycle is unnecessary. The inspection location is represented by the inspection location base name (character string), line number (character string), inspection start time (hh:mm:ss), and inspection end time (hh:mm:ss). A record of inspectable locations is prepared for each inspectable location.

FIG. 14 is a diagram illustrating a file of mileage information. The mileage information indicates mileage information between stations for each railway company. The mileage information file is, for example, a CSV file in text format, but is not limited to this. A file has a tabular format consisting of one or more records. The record includes the starting station name, the ending station name, and the kilometerage for each company as elements. A record is prepared for each combination of the starting station name and the terminal station name.

FIG. 15 is a diagram for explaining the file of the number of overnight stays in the base. The file of the number of overnight stays in the base is, for example, a CSV file in text format, but is not limited to this. The number of overnight stays at the base is the number of vehicles (trains, train sets) staying in the station (vehicle depot) at the end of the day's operation. A file contains a table of one or more records. The record has element information such as base name, track number, operation group number, and number of trains.

FIG. 16 shows an example of a menu screen (data input screen) displayed on the display 15. As shown in FIG. In FIG. 12, the menu screen has display columns for displaying the file names of timetable plan, vehicle information, inspection information, mileage information, lodging vehicle information, and changeable information, and selection buttons. Each file is stored in the storage device 12 .

When each display field is selected, a list of files recording the corresponding information is displayed in a pull-down menu. When one of the file names in the list is selected using the input device 14, the selected file name is displayed in the display column, and when the select button is pressed in that state, the file displayed in the display column is confirmed as input data. It will be in the selected state.

The menu screen also has a display field and a selection button for selecting an output destination folder for the train schedule (vehicle operation plan) file, and can select a storage destination for the train schedule information file. .

Furthermore, the menu screen has a changeable part edit button. When the changeable portion edit button is pressed, the display 15 displays a changeable portion editing screen (FIG. 17). The edit screen displays a diagram based on the initial diagram (or modified diagram). The user can use the UI 16 to edit the diagram (adding trains, changing connections, deleting trains, etc.). Then, when the completion button ("Complete" button) on the edit screen is pressed, a changeable information file indicating changeable portions (indicated by broken lines) is generated and stored. At this time, a file showing the edited diamond may be generated and stored in the storage device 12 . Using the changeable information display field and selection button on the menu screen, the file of the changeable portion can be called and selected. It is also possible to call up and select a corrected timetable plan file using the timetable plan display field and selection button. The menu screen corresponds to one of the screens for prompting the input of data of changeable parts.

The menu screen has an execution button (“Execute” button). When the execution button is pressed in a state in which timetable plan, vehicle information, inspection information, mileage information, mooring vehicle information (option), and changeable information (option) are selected, the CPU 11 solves the vehicle operation plan. Start the desired process (calculation). That is, in the flowchart of FIG. 11, S11 (node creation), S12 (arc creation), S13 (node/arc rearrangement), S14 (optimization implementation), S15 (optimal solution presence/absence determination), S16 (data output), Each process of S17 (input of changeable part) is performed.

The CPU 11 automatically generates a vehicle operating model network through the processes of S11 to S13, and finds a solution as a mixed integer programming problem in S14. If it is determined that the solution has been found (Yes in S15), a dialog box showing the discovery of the optimal solution as shown in FIG. Generates and outputs a report showing various traveled kilometer data by job, police box, and affiliated company. The ledger is stored in the storage device 12 in a predetermined file format.

In the output of work and police box (book table), the nodes to be used (described later) and their order are output for each operation group. Based on this information, a new operation number is given to the work and the police box, and information indicating the work and the police box is output in the form of an operation table and a bar diagram. At this time, the distance traveled and the distance traveled for each task, the distance traveled for each operation group, and the like may be calculated and output, and may be included in the output.

FIG. 19 shows an example of kilometer output data (table). For example, for each railroad company, it displays the train kilometers within the company's own line, the vehicle traveled kilometers, the traveled kilometers difference, and the traveled kilometers within the lines of other companies.

In addition, if there is a timetable correction, it is also possible to output or store information indicating the location. The information on the diagram correction locations is expressed by, for example, listing the usage locations of additional arcs (described later). An additional arc can be expressed by outputting the information of the preceding node and the succeeding node of the arc in association with each other. For example, "○○ train arrives at 〇〇 station → 〇〇 train departs from 〇〇 station", "〇〇 train arrives at 〇〇 station → enters at 〇〇 station", "departs from 〇〇 station → 〇〇 train departs from 〇〇 station". A notation such as Arcs may be represented graphically.

If it is determined in S15 that no solution can be obtained (No in S15), a dialog box indicating that there is no optimal solution as shown in FIG. ) is displayed on the display 15 . At this time, if you press the "Edit changeable part" button in the dialog box, the edit screen of the changeable part (Fig. 17) is called, the diamond is corrected, and changeable information (additional arcs, dummy nodes) is generated.・Can be memorized.

In this way, when there is no solution that satisfies various constraints (establishment conditions) such as a job or a police station, the fact that there is no solution is displayed, so that the user is quickly notified or clearly indicated that there is no solution. be able to. If there is no solution, by manually (or automatically) adding any part that can be changed from the initial timetable plan, a workable solution can be found quickly.

<<Details of processing>>
Details of the processing of S11 to S16 will be described below.
(Vehicle operation model and solution method)
The vehicle operation plan generation device of the embodiment automatically generates a vehicle operation model using a timetable plan (initial timetable or revised timetable plan). A rolling stock operation plan model (rolling stock operation model) is a network (called a rolling stock operation network) that uses arcs with nodes and weights to represent the information necessary to generate a timetable plan, that is, a rolling stock operation plan. . The CPU 11 generates a vehicle operation network from various input data input using the menu screen (S11, S12). Subsequently, the CPU 11 sorts out the nodes and arcs by processing such as omitting unnecessary nodes (S13), reduces the complexity of the vehicle operation network to a certain extent, and then applies various constraints (mathematical calculations) using mixed integer programming. Arcs that satisfy the constraints in the planning method) are selected (S14), data are organized based on the results, and output as a rolling stock operation plan (S16).

(nodes and arcs)
Among the input data, the events related to the vehicle operation plan, that is, the events of departure, train, entry, and inspection are expressed as nodes. A node holds information on the start station, start time, end station, and end time of an event. A connection relation between events is represented by an arc. The arc holds information on train kilometers and forwarding kilometers for each company belonging to the node on the starting point side as weights. In addition, the arc holds the number of days required to cross from the starting node to the ending node (“0” if it is the same day, “1” or more if it spans the next day or later) as information on the number of days. do.

FIG. 21A shows an example of a vehicle's daily activity. A, B, and C in FIG. 21A indicate stations, ◯ indicates departure, Δ indicates arrival, and 0001 to 0004 indicate train numbers. In the example of work shown in FIG. 21A, the 0001 train departs from A station, is allocated to the return train (0002 train) at C station, and enters at B station. Before leaving the shed as the 0003 train, an inspection is carried out in the premises of the B station, and after the 0003 train is turned over to the 0004 train at the C station, the 0003 train is put into the shed at the A station, and the day's work ends.

FIG. 21B is a diagram showing the work of FIG. 21A as a vehicle operation network. In the vehicle operation network, the work is divided into 9 nodes numbered 1 to 9, and transitions between nodes are indicated by directed arcs (arrows). Nodes "1" to "9" are transited by arcs during the current day. Therefore, the weight representing the number of elapsed days is "0", and the arc connecting node "9" to node "1" is the next day. Therefore, "1" is set to the weight representing the number of days. In addition, the arc "2" → "3", the arc "3" → "4", the arc "7" → "8" connected after the train node
, arc "8"→"9", information such as train kilometers and forwarding kilometers in the case of forwarding are set as weights.

(Setting of changeable parts)
In the rolling stock operation plan generation device of the embodiment, it is possible to manually or automatically set the parts determined to be changeable from the initial timetable plan. Modifiable locations are represented by dummy nodes and additional arcs. The changeable locations may be generated at the same time as the initial timetable proposal, or may be generated in response to the result that there is no solution for the initial timetable proposal. Generation can be manual or automatic.

For ordinary nodes, one incoming arc and one outgoing arc are always set, and solutions are sought so that they do not drop out as constituent elements of the train schedule. However, the dummy node is set as a node that relaxes this constraint and may or may not be used for solving (the use or non-use can be selected). In setting dummy nodes and additional arcs, if possible, changes that should not be used are set to a large additional cost as the weight of the additional arcs to be connected. If the change is easy or there is no problem at all, it is possible to set the additional cost to 0 or a small value to make it easier or harder to be selected when automatically generating a plan. Thus, additional arcs may be weighted to indicate their priority for selection (use) in solving.

22A-C and 23A-C show setting examples of dummy nodes and additional arcs. 22A and 22B are used to represent the change of the delivery location/receipt location in FIG. 4A. If train a and train b can be changed in a one-to-one relationship, as shown in FIG. Set an arc directly from node "3") to train a (node "2").

If train a can depart from station A, and train b can exit from station B, then the exit node of station A (node “7”) and the exit node of station B (node “8 ”) as a dummy node and setting additional arcs from node “7” to node “1” and from node “8” to node “3”.

To express Figure 4B (appropriate train change at turn-around station) and Figure 5C (train start or end station change), add from a train to c train and from b train to d train, as shown in Figure 22C Set arc. Similarly, FIG. 23A shows a setting example of additional arcs corresponding to FIG. 4C (time change of forwarding train and change of assigned train at turn-around station).

5A, as shown in FIG. 23B, dummy nodes "3" and "4" indicating departure and arrival at A station are added, and the entry node at A station (node "1") is added to train a (node "1"). (node "4"), set an additional arc from the A station departure node (node "3") to the d train (node "2"). FIG. 5B (replacement of vehicles due to a mound for entering and exiting the warehouse) can be expressed by setting as shown in FIG. 23C.

In addition, when the set additional arc is used, if the train kilometer or the forwarding kilometer changes, it is possible to reflect it in various kilometer calculations by setting the difference value for each item of the arc. be.

(initial network generation)
After setting the input initial timetable plan and changeable information (if input), the CPU 11 constructs a vehicle operation network for solving the problem. In the initial rolling stock operation network, the CPU 11 generates as nodes each event of all departures, trains, warehousing, and inspections (S11). Subsequently, with respect to the dummy nodes included in the initial timetable plan and the changeable information, arcs are generated that connect each node from the exit to the train, from the train to the train, and from the train to the entry according to the information specified in the input data (S12 ). After that, the entry and exit of each premises are arranged in chronological order, the accommodation status of the vehicles is grasped, and an arc is generated toward the exit event that can be exited within 24 hours from the entry time. Also, arcs are generated in the same way for inspections that start after the arrival time and for delivery that is set after the inspection end time. Additionally, additional arcs are created between nodes to complete the initial vehicle operations network.

(Network organization)
FIG. 24A shows an example network before menstruation, and FIG. 24B shows an example network after organization. The CPU 11 organizes the nodes and arcs in order to reduce the number of variable elements and shorten the time taken to solve the mixed integer programming problem for the work and the alternation (S13). Among the ones generated in the initial network, for those that have only one arc (this arc is called arc ab) going out from a node (node A), the next node (node B and to). Therefore, node A and arc ab are deleted and integrated into node B. Specifically, the end point of the arc group that was in node A is changed to node B, and various weights of arc ab are added to each of the corresponding arc groups. In addition, the content of node A is additionally recorded in node B.

(formulation)
Table 1 below shows the definitions of sets.

For Table 1, let N be the set of all nodes. N includes an outgoing node Ns, a train node Nt, an incoming node Ne, an inspection node Nm, a police inspection node Nml, and a dummy node Nd, all of which are included. Also, Nout _i is a set of nodes following node i, Nin _i
is defined as the set of nodes preceding node i. In addition, in order to deal with direct operation across a plurality of railway companies (operating companies), a set of operating companies is defined as R, a set of operating vehicle groups is defined as G, and the start node of each operating group is defined as _Sg . Nr is a set of nodes for which a specific node passage date must be set when generating a police box, and Nrm and Nrml are a set of nodes for which the execution dates of a daily inspection and a police box inspection need to be specified, respectively. Define.

Table 2 shows definitions of constants.

With respect to Table 2, we define parameters that adjust the importance of the objective function from α to ε. W _ij , Wu _ij , Wd _ij , and Wt ^r _ij define the elapsed days, additional cost, forwarding kilometers, and r company's train kilometers when using an arc from node i to node j. _Cg indicates the maximum number of trainsets that can be allocated to each operating group, _and ^Rrg indicates which company the operating group belongs to with a variable of 0 or 1. In addition, ^Adr is defined when there is an adjustment mileage other than train operation, and is used when direct train mileage adjustment is made. In Dm, the number of days in the daily inspection cycle, in Dml, the number of days in the regular inspection cycle, P _i when there is a specified passing date in the police, _Pmi when the day of the daily inspection is specified, and in the case of a regular inspection defines Pml _i as the number of days since each examination date. M defines a sufficiently large value.

Table 3 shows definitions of variables.

ua ^g _ij is a variable indicating that the vehicle of operation group g continues from node i to j, and s _i and d _i indicate the passage number and passage days within the police box of node i, respectively. db _i and da _i indicate the number of days elapsed since the previous inspection of node i. dlb _i and dla _i indicate the number of days elapsed since the previous inspection of node i. node i
is a check node, db _i resets to 1. Also reset dlb _i to 1 if node i is an alternating check node. un ^g _i and um ^g _i are variables indicating that node i and check node i are assigned to operation group g, respectively. tc ^r and to ^r are the total number of train kilometers traveled on all sections and the total number of kilometers traveled on the lines of other companies for vehicles belonging to company ^r . Define as a variable.

(objective function)
Equation (1) representing the objective function is shown below.

Using formula (1), the number of trains used, the additional arc usage cost, and the sum of forwarding kilometers multiplied by respective weighting coefficients α, β, and γ, as well as the unbalance of the traveling kilometers of each company's vehicles, are minimized. subtract the total train-kilometer ^ttr of trains running on each company's line from the vehicle-running-kilometer ^tcr belonging to each company, add the adjustment km ^Adr , and multiply the result by a weighting factor δ. The objective function is to minimize the sum of the values obtained by multiplying to ^r by the weighting factor ε in order to give priority to running.

(Constraint expression)
Expressions (2) to (18) are shown below.

Equation (2) calculates the total train kilometers for each company, and Equation (3) calculates all traveled kilometers of each company's vehicles including those on other companies' lines. Formula (4) is used to calculate the running train kilometer on each company's line for each company's affiliation. Formula (5) specifies the maximum number of trains that can be assigned to each operation group. Formulas (6) and (7) constrain that the sum of the number of inspections for each group is greater than or equal to a certain number and less than or equal to a certain number.

Equations (8) and (9) indicate that the exit node, train node, and entrance node other than the dummy node always have one incoming arc and one outgoing arc. As for the dummy node, the number of arcs in the equations (10) and (11) is always limited to one or less. In equation (12), it is guaranteed that the entry and exit arcs are 1 when the dummy node is used, and 0 when the dummy node is not used.

As for the check nodes, it is guaranteed that the number of arcs is 1 when used, and 0 when no arcs are used, in equations (13) and (14). Equation (15) indicates that each node can belong to only one operation group. At the same time, it is described by equations (16) and (17) that the groups of arcs entering and exiting each node are the same. Equation (18) shows that each check node can be used in no more than one group, and Equation (19) shows that it is in the same group as the corresponding normal node.

In equations (20) and (21), each group connects each node to form a patrol route. If the node is the starting node of the police box, use equation (20) to set the passage number by using equation (21). Similarly, the number of days elapsed within the police box is calculated using equations (22) and (23).

Formula (24) is used to calculate the number of days that have passed since the previous check node. From the previous node's check date (db _i ), the weight W _ij defined for the arc is added to da _j . Substitute and calculate. If the node is an inspection node, the number of days elapsed since inspection from the previous node is calculated using the above formula. After that, db, which is the reference date for the succeeding node, is reset and 1 is substituted according to equation (27). If the node is not a check node, the same value as da is substituted by expression (26). Similarly, the alternating inspection cycle is calculated by equations (25), (29), and (29).

Formula (30) and Formula (31) are used to ensure that the inspection cycle days do not exceed the specified number of days, and Formula (32)
, Equation (33) gives a restriction so that the number of alternating inspection cycle days does not exceed the specified number of days. If it is necessary to pass through a specific node on a specific day from the initial conditions, such as when setting the same staying place for the weekday timetable and the weekend/holiday timetable, the formula (34) is used for setting.

Similarly, when specifying the number of days elapsed since the daily inspection, the formula (35) is used, and for the regular inspection, the formula (36) is used. In equation (37), the start node of each operation group is set, in equation (38) the passage number of the start node is set to 0, and in equation (39) the number of elapsed days is set to 1 (first day). The range of possible values for each variable is set by expression (40).

<Application example>
<<Application example 1>>
As an application example 1, as the most basic example, an example of generating a police box for two groups (a total of 26 trains, 8 trains and 18 trains) will be shown. This time, direct trains to other companies' lines were not included, and vehicle travel kilometers and forwarding kilometers were also excluded from consideration. There are 598 trains, with 57 departure and arrival points, 9 overnight detention points, and 3 points where inspections are possible within the work schedule. In addition, 56 additional arcs were set as changed parts, and solutions were obtained by the vehicle operation plan generation device (information processing device 10). At the initial stage of generating the vehicle operation network, after it was expressed as 750 nodes and 1921 arcs, the network was organized and solved by mathematical programming using 130 nodes and 1301 arcs. . In this example, the solution was obtained in about 13 seconds. By using four additional arcs, an alternation that satisfies the constraints could be obtained.

FIG. 25 shows an output example of A43 operation among the obtained vehicle operation plans. In the work table, when the work assigned in the initial schedule differs from that of the previous train, italic and emphasized characters are used, and when the work differs from the predetermined work, the work assigned in the initial schedule plan is displayed in normal characters. Regarding the A43 work obtained, the 9100 train that was assigned to the A14 work in the initial schedule plan left Sagami-Ono station, entered Sagami-Ono station at 9:31, and after leaving the station again, arrived at Ebina station at 15. : In stock at 50 minutes. After that, train 9297, which was assigned to A37 instead of A14, departed at 22:21, and after arriving at Odawara station, it was decided to change the operation of the train to turn back due to an additional arc, and it was assigned to A32. The train 9204 is selected for a route to Ashigara Station. At the locations where the additional arcs set as the changeable locations are selected, there is a discrepancy in the time when returning to Odawara station, and it can be seen that the timetable needs to be corrected.

<<Application execution example>>
As an application example, an example of a setting method assuming a schedule for weekends and holidays and a method of utilizing the forwarding train kilometer calculation function will be presented. The assumed timetable consists of 33 trains consisting of 2 groups of 6 trains (E61 to E66) and 27 trains (E11 to E37).

First, only the initial timetable plan is used to generate each node for departure, train, entry, and inspection. After the examination at E61, night detention after E62 was Ohno, Kaisei, Seijo, Karakida, and Seijo.

Next, assuming a schedule for weekends and holidays, and assuming that it is necessary to detain at night in the same place as the schedule for weekdays, it is necessary to designate a detention place for each task in the police box. In this case, the leaving, train, and entering nodes are generated so that the departure at 4:05 and the arrival at the same station at 4:10 (that is, the train before the first train) are generated for the storage location and the number of trains stored. Specify the date of passing through the police box for each node.

In this way, although trains are not actually operated, by setting nodes as trains and expressing them on the rolling stock operation network, it is possible to obtain an operation plan that passes through these nodes without fail, and the target rolling stock operation plan can be obtained. can be obtained. The results obtained are shown in FIG. In Fig. 27, it was possible to obtain a police box reflecting the designated detention locations of Ashigara, Odawara, Odawara, Karakida, and Seijo for nighttime detention after E62.

FIG. 28 shows an execution example using the forwarding train kilometer calculation function based on the rolling stock operation plan of FIG. FIG. 29 shows a part of the work table of E64 and E65 in FIG. After the E64 train 3516 arrives at Shinjuku, it is possible to turn back to the E65 train 3017. Also shown here are 9801 trains and 9802
The train is a deadhead train. In this case, set an additional arc from train 3516 to train 3017, designate train 9801, train 9801 entering Seijo, leaving train 9802, and train 9802 as dummy nodes. A solution is obtained in the processing unit 10 .

If it is possible to generate a police box without driving the forwarding train, the term (Equation 1) in the objective function selects a solution with a small forwarding train kilometer, so that the forwarding train A reduction of kilos is possible. As shown in Fig. 28, the obtained results confirmed that by changing the departure train at Odawara of E64 and E65, a police box was generated without operating the out-of-service train, and the function was effective. rice field.

<<Example of execution including direct trains>>
The vehicle operation plan generation device according to the embodiment has a function of calculating and adjusting the traveled kilometers of vehicles belonging to each company when mutual direct operation is performed. Here, as a small-scale example, it is assumed that each of the three companies consists of 17 trainsets, 6, 6 and 5, with 206 trains, 29 departure and arrival points, and 7 overnight storage points. .

In this execution example, no additional arcs or dummy nodes are set, and the initial timetable plan is used to obtain police boxes that can be generated only by replacing vehicles in the garage. In order to minimize the difference in the distance traveled by each company, δ in Equation 1 can be set to an arbitrary value. You can get a police box that says

In this execution example, in addition to the initial schedule proposal, when the difference in vehicle traveled kilometers is set to a minimum by setting δ and ε to 1 or 0, a balance type (small difference in vehicle traveled kilometers and Fig. 30 (Tables 4 to 7) shows the mileage of each company and each operation group when setting the inner mileage to be small.

From Tables 4 and 5, it can be seen that the total absolute value of the mileage overrun and underrun at the police station in the initial timetable proposal was 1668.4km, but as a result of recreating the police station, it was able to be reduced to 284.4km. In addition, in the balanced type shown in Table 6, although the absolute value increased by 31.2 km from the result of giving top priority to the vehicle traveling kilometer, the traveling kilometer on the other company's line could be reduced by 43.8 km. became a police box that runs more in its own lane. As shown in Table 7, when the highest priority is given to driving on the company's own line, the distance traveled by vehicles on other companies' lines is 3481.2 km, which is the smallest value compared to other police boxes. rice field.

The vehicle operation plan generation device according to the embodiment can perform the following.
・It is possible to automatically create work and police boxes in vehicle operation from the timetable plan.
• Generate modifiable information and use the modifiable information to modify the timetable proposal.
・It is possible to automatically create a diagram that considers the priority of changeable parts.
・You can automatically create a plan without changing the parts of the timetable plan that you do not want to change.
・It is possible to automatically create a plan that considers various inspection cycles.
・Automatically create plans for multiple operation groups at the same time.
・It is possible to automatically create plans for operation groups that span multiple companies at the same time.
・It is possible to minimize the difference in the mileage of vehicles belonging to multiple companies.
・When operating across multiple companies, it is possible to maximize the number of kilometers traveled within the own lane of the company's vehicle.
- The fact that there is no feasible solution can be notified (reported) to the user in a short period of time.
・Optimal solution can be derived by mixed integer programming.

According to the vehicle operation plan generation device according to the embodiment, by correcting the timetable plan with changeable information (additional arcs and dummy nodes), the feasible (constraint-satisfying) timetable and vehicle operation plan (work and police box) can be obtained. In addition, it is possible to automatically generate a plan that considers the inspection cycle of multiple operation groups and that also considers the adjustment of vehicle kilometers in the case of mutual direct operation, using the mixed integer programming method.

In other words, rather than a model in which train timetable generation and rolling stock operation planning are separated, the model will contribute to practical use by creating a model that is close to the actual timetable revision business process of completing the rolling stock operation plan while correcting the initial timetable draft. Solutions can now be automatically obtained at a practical speed. In addition, since this device uses mathematical programming, it has relatively high responsiveness when there is no solution compared to heuristic solution methods, and when a solution exists, an optimal solution is guaranteed. There is a feature.

In addition, as shown in the execution example, according to the rolling stock operation plan generation device, it is possible to correspond to all weekday schedules, Saturday and holiday schedules, and mutual direct operation schedules, improving productivity in revision work and And it can contribute to the improvement of the quality of rolling stock operation planning. The configurations of the embodiments described above can be combined as appropriate.

10... Information processing device 11... CPU
12... Storage device 13... Communication interface 14... Input device 15... Display

Claims (13)

The information processing device
Receiving data of a proposed train schedule and data indicating changeable portions of the proposed timetable,
Using the data of the timetable plan, obtaining a feasible solution for a vehicle operation plan based on the timetable plan by mathematical programming,
When the feasible solution cannot be obtained, using the data indicating the changeable part, correcting the timetable plan,
Using mathematical programming, find a feasible solution for the vehicle operation plan based on the revised timetable plan,
Output data of vehicle operation plan based on the obtained feasible solution,
A vehicle operation plan generation method comprising: 2. The information processing device according to claim 1, further comprising displaying a screen for prompting the input of data of the changeable part together with the data of the timetable proposal or when the feasible solution cannot be obtained. Vehicle operation plan generation method. The information processing device
Displaying the edit screen of the timetable plan,
2. The rolling stock operation plan generation method according to claim 1, further comprising storing data indicating correction points of the timetable draft generated using the editing screen as data indicating the changeable points. The information processing device uses the data of the timetable plan to create a model of the rolling stock operation plan, which is a network composed of nodes indicating events related to the rolling stock operation plan and weighted arcs connecting the nodes. to generate
The modifiable location is represented by an additional arc that is an arc added to the network,
4. The vehicle operation plan generation method according to any one of claims 1 to 3, wherein said additional arcs are selected to obtain said feasible solution. 5. The vehicle operation plan generation method according to claim 4, wherein said changeable locations are represented by said additional arcs and dummy nodes connected to nodes in said network by said additional arcs. 6. The vehicle operation plan generation method according to claim 5, wherein nodes in the network are used in solving the feasible solution, and the use or non-use of the dummy node in solving the solution can be selected. 7. The rolling stock operation plan generation method according to claim 4, wherein weights indicating the priority of using said additional arcs in solving said feasible solutions are set for said additional arcs. 8. The rolling stock operation plan generation method according to claim 4, wherein said feasible solution is calculated by mixed integer programming using said network. 9. The vehicle operation according to any one of claims 1 to 8, wherein the information processing device obtains a feasible solution for a vehicle operation plan based on the timetable plan and vehicle information related to vehicles used for operation of the timetable plan. Plan generation method. 10. The information processing device according to any one of claims 1 to 9, wherein the information processing device obtains a feasible solution for a vehicle operation plan based on the timetable plan and inspection information related to inspections of vehicles used for operation of the timetable plan. Vehicle operation plan generation method. wherein said information processing device obtains a feasible solution of a rolling stock operation plan in consideration of mileage information indicating mileage between stations for each operating company when said timetable plan includes through operations of a plurality of operating companies. 11. The vehicle operation plan generating method according to any one of 1 to 10. A process of receiving data of a train timetable plan and data indicating changeable locations in the timetable plan, and using the timetable plan data to find a feasible solution for a rolling stock operation plan based on the timetable plan by mathematical programming. A process for obtaining, a process for correcting the timetable plan using the data indicating the changeable locations when the feasible solution cannot be found, and an executable solution for the rolling stock operation plan based on the corrected timetable plan. A vehicle operation plan generating device including a control unit that executes a process of obtaining by mathematical programming and a process of outputting data of a vehicle operation plan based on the obtained feasible solution. to the computer,
a step of receiving data of a train timetable proposal and data indicating changeable portions of the timetable proposal;
a step of obtaining a feasible solution for a rolling stock operation plan based on the timetable proposal by mathematical programming using data of the timetable proposal;
a step of correcting the timetable plan using the data indicating the changeable locations when the feasible solution cannot be obtained;
a step of obtaining a feasible solution for a rolling stock operation plan based on the revised timetable plan by mathematical programming;
a step of outputting vehicle operation plan data based on the obtained feasible solution;
program to run.

Images