Information processing device, information processing method, and program

Abstract

To provide technology that enables rapid restoration of the originally planned operation status when a train schedule is disrupted.SOLUTION: An information processing device for assigning vehicles when a train schedule is disrupted comprises: an acquisition unit that acquires operation-related information including a vehicle operation plan on the basis of an execution instruction for vehicle assignment; a division processing unit that divides the acquired vehicle operation plan in accordance with predetermined conditions; a combination processing unit and an assignment processing unit that generate a new vehicle operation plan on the basis of the divided vehicle operation plan and assign vehicles to the vehicle operation plan; and an output unit that outputs information regarding the new vehicle operation plan in which vehicle assignment has been performed.SELECTED DRAWING: Figure 2

Description

[Technical Field]

[0001] The present invention relates to an information processing device, an information processing method, and a program. [Background technology]

[0002] In the railway industry, vehicle allocation is performed to allocate actual vehicles according to a vehicle operation plan. Daily train operations are carried out by determining which vehicles (setups) to actually allocate according to the planned vehicle operation plan. Patent Document 1 discloses a vehicle allocation candidate extraction method for extracting candidates for vehicles to be allocated to an operation, and discloses a technology for calculating priority information indicating the ease of allocation for each train based on the operation schedule for the next day and the current vehicle inspection status for multiple vehicles. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Japanese Patent Application Laid-Open No. 2014-151849 Summary of the Invention [Problem to be solved by the invention]

[0004] When train schedules are disrupted due to accidents, breakdowns, or other problems, an emergency train schedule (restoration schedule) must be created quickly and train operations must be restored to normal as quickly as possible. In the case of vehicle breakdowns, spare vehicles may be allocated as substitutes, but it may not always be possible to return all vehicles to their originally scheduled depots, and the effects of the disruption may persist in train operations the following day and beyond.

[0005] The present invention has been made in consideration of these circumstances, and aims to provide technology that enables trains to quickly return to the originally planned operational state when a disruption occurs in the train schedule. [Means for solving the problem]

[0006] The information processing device of the present invention is an information processing device that allocates vehicles when a disruption occurs in a train schedule, and is characterized by having an acquisition means that acquires information related to operations including a vehicle operation plan based on an instruction to execute the vehicle allocation, a division means that divides the acquired vehicle operation plan in accordance with predetermined conditions, a processing means that generates a new vehicle operation plan based on the divided vehicle operation plan and allocates vehicles to the vehicle operation plan, and an output means that outputs information related to the new vehicle operation plan to which vehicles have been allocated. [Effects of the Invention]

[0007] According to the present invention, when a train schedule is disrupted, it is possible to quickly return to the originally planned operating state. [Brief explanation of the drawings]

[0008] [Figure 1] FIG. 1 illustrates an example of a hardware configuration of an information processing device. [Figure 2] FIG. 2 is a diagram illustrating an example of a functional configuration of an information processing device. [Figure 3] 10 is a flowchart illustrating an example of processing by the information processing device. [Figure 4] FIG. 10 is a diagram illustrating an example of an operation plan. [Figure 5] FIG. 10 is a diagram illustrating processing by a division processing unit. [Figure 6] FIG. 10 is a diagram illustrating processing by a combining processing unit. [Figure 7] FIG. 10 is a diagram illustrating an example of a created operation plan. [Figure 8] FIG. 10 is a diagram illustrating an example of a created operation plan. DETAILED DESCRIPTION OF THE INVENTION

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

[0010] 1 is a diagram showing an example of the hardware configuration of an information processing device 100 according to one embodiment of the present invention. The information processing device 100 includes a CPU 101, a ROM 102, a RAM 103, an auxiliary storage device 104, an output device 105, an input device 106, and a network I / F 107. The CPU 101, the ROM 102, the RAM 103, the auxiliary storage device 104, the output device 105, the input device 106, and the network I / F 107 are communicatively connected via a system bus 108.

[0011] The CPU (Central Processing Unit) 101 is a central processing unit that controls various operations of the information processing device 100. For example, the CPU 101 may control the operation of the entire information processing device 100. The ROM (Read Only Memory) 102 stores control programs, boot programs, etc. that can be executed by the CPU 101. The RAM (Random Access Memory) 103 is the main storage memory of the CPU 101 and is used as a work area or a temporary storage area for expanding various programs.

[0012] The auxiliary storage device 104 stores various data and programs. The auxiliary storage device 104 is realized by a storage device capable of temporarily or permanently storing various data, such as a non-volatile memory represented by an HDD (Hard Disk Drive) or an SSD (Solid State Drive).

[0013] The output device 105 is a device that outputs various types of information and is used to present various types of information to a user. For example, the output device 105 is realized by a display device such as a display. The output device 105 presents information to a user by displaying various types of display information. As another example, the output device 105 may be realized by an audio output device that outputs sounds such as voices and electronic sounds. In this case, the output device 105 presents information to a user by outputting sounds such as voices and electronic sounds. Furthermore, the device used as the output device 105 may be changed as appropriate depending on the medium used to present information to a user.

[0014] The input device 106 is used to receive various instructions from the user. For example, the input device 106 includes input devices such as a mouse, a keyboard, and a touch panel. As another example, the input device 106 may include a sound collection device such as a microphone, which collects the voice uttered by the user. In this case, various analysis processes such as acoustic analysis and natural language processing are performed on the collected voice, and the content indicated by this voice is recognized as an instruction from the user. Furthermore, the device used as the input device 106 may be changed as appropriate depending on the method for recognizing an instruction from the user. Furthermore, multiple types of devices may be used as the input device 106.

[0015] The network I / F 107 is used for communication with external devices via a network. The device used as the network I / F 107 may be changed as appropriate depending on the type of communication path and the communication method used.

[0016] The CPU 101 expands a program stored in the ROM 102 or the auxiliary storage device 104 into the RAM 103 and executes this program, thereby realizing each function of the information processing device 100 shown in Figure 2 and each process of the flowchart shown in Figure 3.

[0017] 2 is a diagram showing an example of the functional configuration of the information processing device 100 according to this embodiment. The information processing device 100 includes a receiving unit 201, an acquiring unit 202, a plan generating unit 203, a storage unit 207, an evaluating unit 208, and an output unit 209.

[0018] The reception unit 201 receives an instruction to execute vehicle allocation for allocating vehicles according to a vehicle operation plan. For example, the reception unit 201 receives an instruction to execute vehicle allocation when a train schedule is disrupted due to a fault such as a vehicle breakdown.

[0019] The acquisition unit 202 acquires information about train operations stored in a storage device (not shown) etc. For example, when the reception unit 201 receives an instruction to execute vehicle allocation, the acquisition unit 202 acquires information about the initially planned vehicle operation plan, information about vehicles (formations), etc.

[0020] The plan generation unit 203 generates a revised plan for returning the train to the originally planned berth (scheduled berth) from a state in which a disruption has occurred in the train schedule, based on the information on train operations acquired by the acquisition unit 202. The plan generation unit 203 generates a revised plan for returning the train to the originally planned berth (scheduled berth) by reconfiguring the vehicle operation plan and allocating vehicles based on information on the originally planned vehicle operation plan, information on vehicles (setups), etc. The plan generation unit 203 has a division processing unit 204, a combination processing unit 205, and an allocation processing unit 206.

[0021] The division processing unit 204 divides the acquired rolling stock schedule in accordance with predetermined conditions. For example, the division processing unit 204 divides the rolling stock schedule using rolling stock yards (car depots) as division sections (division points). Note that rolling stock yards are just one example, and the division processing unit 204 may divide the rolling stock schedule using locations (portions) where rolling stock (formations) can be stored as division sections, and may also divide the rolling stock schedule by sidings or the like in addition to rolling stock yards.

[0022] The combining processor 205 combines, in accordance with predetermined conditions, the vehicle operation plans divided by the dividing processor 204 to regenerate a vehicle operation plan. For example, the combining processor 205 searches for a solution that increases the degree of agreement between the originally planned stopping place (scheduled stopping place) and the stopping place based on the divided vehicle operation plan, by mathematical optimization, and generates a new vehicle operation plan.

[0023] The allocation processing unit 206 performs vehicle allocation, which allocates actual vehicles (setups) to the new vehicle operation plan generated by the combination processing unit 205. This vehicle operation plan with vehicles allocated by the allocation processing unit 206 becomes a revised plan for returning the train schedule to the originally planned berth (scheduled berth) after a disruption has occurred in the train schedule.

[0024] The storage unit 207 stores various data used in processing by the information processing device 100, various data obtained as processing results, etc. For example, the storage unit 207 stores information related to train operations acquired by the acquisition unit 202. Furthermore, for example, the storage unit 207 stores a plan amendment for returning to the originally planned staying place (scheduled staying place) generated by the plan generation unit 203, an evaluation result by the evaluation unit 208 of the amendment, etc.

[0025] The evaluation unit 208 evaluates, in accordance with predetermined evaluation criteria, the proposed revision of the plan, which is generated by the plan generation unit 203, for returning the train schedule from a state in which a disruption has occurred to the originally planned staying area (scheduled staying area). The evaluation unit 208 evaluates the proposed revision of the plan, for example, with respect to the degree of agreement with the originally planned staying area (scheduled staying area), the number of divisions relative to the originally planned vehicle operation plan, etc. The evaluation items in the evaluation unit 208 may include, for example, the following items. -Number of vehicle operations changed from the original plan -Increase in the number of vehicles operated compared to the original plan -Reduced number of spare vehicles - Inspection date for inspection vehicles has changed Change in mileage of vehicles (trains) with upcoming inspection dates Furthermore, one or more of the above-mentioned evaluation items may be applied to perform the evaluation by scoring.

[0026] The output unit 209 outputs to the user information (such as the plan amendment and the evaluation result of the amendment) on the plan amendment for returning the generated train schedule from a state in which a disruption has occurred to the originally planned staying place (scheduled staying place). The output unit 209 presents to the user, for example, via the output device 105, the plan amendment for returning the train schedule to the originally planned staying place (scheduled staying place) and the evaluation result of the amendment.

[0027] Fig. 3 is a flowchart showing an example of processing by the information processing device 100 according to this embodiment. The processing of the flowchart shown in Fig. 3 is started when a train schedule is disrupted due to an obstacle such as a vehicle breakdown, and the reception unit 201 receives an instruction to execute vehicle allocation.

[0028] In the following explanation, the case where the originally planned operation status is as shown in Figure 4 will be explained as an example. Figure 4 is a diagram for explaining an example of a train operation plan. Figure 4 shows a train formation as part of the train operation plan. <1> ~Organization <9> In the processing by the information processing device 100 described later, the number of target trains is not limited to nine, and the number of target trains can be any number.

[0029] In the example shown in Figure 4, <1> is planned to be operated under Operation A, and <3> is planned to be operated by Operation B, and the formation <4> It is planned to be operated as Operation C. <5> Operation D is planned, and the formation <6> is planned to be operated under Operation E, and the formation <8> However, operation is planned for Operation F, and the formation <9> However, it is planned to be operated in Operation G. <2> is kept in depot A as a standby spare car, and the formation <7> are planned to be kept at Depot B as standby spare cars. <1> , organization <2> , and organization <3> The planned resting place is the car depot A near station A, and the formation <4> , organization <6> , organization <7> , and organization <9> The planned resting place is Depot B near Station B. <5> The planned resting place of the train is the car depot C near station C, and the train <8> The planned storage location is vehicle depot D near station D.

[0030] In addition, the initial plan was to organize <2> is planned to be operated by Operation B, and the formation <3> is planned for operation C, and <4> It is planned to be operated as Operation D. <5> is planned to be operated under Operation E, and the formation <7> However, operation is planned for Operation F, and the formation <8> is planned for operation in Operation G, and <9> However, it is planned to be operated under Operation H. <1> is kept in depot A as a standby spare car, and the formation <6> are planned to be kept at Depot B as standby spare cars. <1> and organization <2> The planned resting place is set as Depot A, and the formation <3> , organization <5> , organization <6> , and organization <9> The planned resting place is Depot B. <4> The planned resting place is Vehicle Depot C, <7> and organization <8> The planned storage location is Vehicle Depot D.

[0031] When the processing of the flowchart shown in FIG. 3 starts, in step S301, the acquisition unit 202 acquires information related to train operations (operation information) from a storage device (not shown) or the like. For example, the acquisition unit 202 acquires information including an operation plan and planned berthing locations for each formation (car) as shown in FIG. 4. In this example, as an example, it is assumed that, upon receipt of a single instruction to execute car allocation, a plan revision proposal is created to return the train to the originally planned berthing location (planned berthing location) as much as possible within the current day (1 day), the next day (2 days), and the day after (3 days) after a disruption in the train schedule. In this case, in step S301, the acquisition unit 202 acquires information including the car operation plans for the current day, the next day, and the day after, and the planned berthing locations at the end of each period. The acquired train operation information is stored in the memory unit 207.

[0032] In step S302, the division processing unit 204 divides the rolling stock schedule in the train operation information acquired in step S301 in accordance with predetermined conditions. The division processing unit 204 reads the train operation information from the storage unit 207, and divides the rolling stock schedule by setting locations where rolling stock (formation sets) can be stored as division sections (division points). In this example, the division processing unit 204 divides the rolling stock schedule by setting depots as division sections. For example, in the case of rolling stock schedules such as operations A to H illustrated in FIG. 4, the division processing unit 204 divides the rolling stock schedule as shown in FIG. 5. In other words, the division processing unit 204 divides operation A into operations 501 and 502 by depot A where the trains are stored along the way, and divides operation B into operations 511 and 512 by depot A where the trains are stored along the way. Furthermore, the division processing unit 204 divides operation C into operations 521 and 522 due to vehicle depot B, which is parked along the way, and divides operation H into operations 571 and 572 due to vehicle depot A, which is parked along the way. Note that operations D, E, F, and G are not parked along the way, and therefore are not divided as shown in operations 531, 541, 551, and 561. Furthermore, operations as spare vehicles are also included in the vehicle operation plan after division.

[0033] In step S303, the merging processor 205 merges the vehicle scheduling plans divided in step S302 in accordance with predetermined conditions to regenerate a vehicle scheduling plan. For example, based on the divided vehicle scheduling plans, the merging processor 205 uses mathematical optimization to search for a solution that more closely matches (highly matches) the originally planned stopping locations (scheduled stopping locations), and generates a new vehicle scheduling plan. The process of regenerating a vehicle scheduling plan based on the divided vehicle scheduling plans in step S303 will be described below.

[0034] The connection processing unit 205 regards each operation included in the divided vehicle operation plan as a train node (T), and connects connectable train nodes with arcs to generate a network as shown in Fig. 6. This network includes, as train nodes, spare vehicles (spare 1, spare 2, etc.) reserved as substitute vehicles, inspection vehicles (inspection 1, etc.) for which vehicle inspections are performed, and vehicles that did not end up operating but can be operated as deadheads. All operations must be assigned one-to-one to one of the formations (vehicles). In the example shown in Fig. 6, formations are used as start nodes and end nodes in the network. <1> ~Organization <5> In addition, arcs connecting to train nodes are provided for the number of connectable train sets so that the difference between the connection destinations in the original plan and the re-created connection destinations can be distinguished.

[0035] Then, the cost of the arc is set as follows according to the train nodes that connect to form a desirable path: It is most desirable to return to the normal train schedule using the originally planned vehicle operation plan. However, in this embodiment, since it is not possible to return to the normal train schedule if the operation remains as originally planned, a new operation is created by dividing and recombining the originally planned vehicle operation plan. The number of points where the operation is divided and recombined (switching points) is preferably small, as this represents a change from the original plan. Therefore, if the connection differs from the originally planned one, it is determined to be a switch and a cost is assigned. If the connection to the vehicle inspection differs from the original plan, the necessary inspections for the formation (vehicle) will not be carried out, which will result in serious safety issues. Therefore, if the connection to the vehicle inspection differs from the original plan, large costs will be incurred. In addition, the harbor can be determined from the connection from the train to the terminal train. In order to return to the normal train schedule, it is preferable to return the harbor to the scheduled harbor as soon as possible. Therefore, if the harbor is different from the scheduled harbor, a cost is assigned. In addition, connecting a train that was not included in the originally planned vehicle operation will result in the train being operated as a deadhead train, reducing the efficiency of the operation plan. Therefore, costs are assigned when connecting with trains that were not included in the originally planned operation.

[0036] The cost is set in this way, and the combination processing unit 205 searches for a solution by mathematical optimization using the following equation (1) as the objective function and equations (2) to (8) as constraints.

[0037]

number

[0038] In formula (1), the cost of the evaluation index is minimized to output a "desirable assignment plan." As mentioned above, each arc is assigned a cost according to the connection, and desirability is expressed as the sum of (arc cost) x (presence or absence of arc). In formula (1), the first term represents the cost from the starting train set, the second term represents the cost from train node to train node, and the third term represents the cost to the ending train set.

[0039]

number

[0040] Equation (2) indicates that one arc is selected to exit from the starting train, and equation (3) indicates that one arc is selected to enter the ending train.

[0041]

number

[0042] Equations (4) and (5) correspond to the condition that trains and inspection cars must be incorporated into vehicle operations, and indicate that one arc is selected to enter and one arc is selected to exit the train node.

[0043]

number

[0044] Equations (6) and (7) correspond to the conditions when trains that are not scheduled to run and spare cars are incorporated into vehicle operations, and indicate that 0 or 1 arc is selected to enter and exit the train node.

[0045]

number

[0046] Equation (8) shows the law of conservation of network flow, which means that the number of arcs entering a train node is equal to the number of arcs leaving it.

[0047]

number

[0048] The mathematical optimization problem expressed by the above-mentioned formulas (1) to (8) can be treated as a mixed integer optimization problem (MIP), and a solution can be obtained by inputting formulas (1) to (8) into an MIP solver and solving them, for example. However, as the number of train formations (cars) and the number of train nodes increases, the number of combinations increases, and it may take a long time to find a solution. In that case, it is possible to obtain a solution by using a solver to solve the problem as a set partitioning problem, which is a combinatorial optimization problem that finds the combination with the best evaluation value among combinations of subsets that contain all elements of a given set exactly once.

[0049] After a new rolling stock operation plan is regenerated as described above, in step S304, the allocation processing unit 206 performs rolling stock allocation, which allocates actual rolling stock (formation) to the new rolling stock operation plan generated in step S303. The rolling stock operation plan for which rolling stock allocation has been performed in step S304 is stored in the storage unit 207 as a revised train operation plan for returning the train to the originally planned depot (scheduled depot) after the train schedule has been disrupted.

[0050] In step S305, the evaluation unit 208 evaluates the proposed revision of the train operation plan for returning to the originally planned berth (scheduled berth), which has been created by executing the processes in steps S302 to S304. The evaluation unit 208 reads out the proposed revision of the train operation plan after vehicle allocation in step S304 from the storage unit 207, and evaluates it on the evaluation items described above (for example, the degree of agreement with the scheduled berth and the number of divisions relative to the originally planned vehicle operation plan). The evaluation result in step S306 is stored in the storage unit 207.

[0051] In step S306, the output unit 209 reads out information about the newly created train operation plan from the storage unit 207 and outputs it to the user. The output unit 209 outputs to the user the proposed revision to the train operation plan after vehicle allocation read out from the storage unit 207, the evaluation result of the proposed revision by the evaluation unit 208, etc. Then, the processing of the flowchart shown in Fig. 3 ends.

[0052] In the above example, when the reception unit 201 receives a single instruction to execute vehicle allocation, a plan revision proposal is created for returning the train to the originally planned rest stop (scheduled rest stop) as much as possible within the same day (1 day), the next day (2 days), and the day after (3 days) after the train schedule disruption. However, this is just one example, and the period for creating a plan revision proposal for returning the train to the originally planned rest stop (scheduled rest stop) is arbitrary.

[0053] Alternatively, control may be performed such that a revised plan is first created for returning to the originally planned resting place (scheduled resting place) for just that day (one day), and then, depending on the evaluation by the evaluation unit 208 in step S305, a revised plan is created for returning to the originally planned resting place (scheduled resting place) by successively extending the period by one day thereafter. For example, if the evaluation by the evaluation unit 208 in step S305 determines that all vehicles (formations) have returned to the originally planned resting place, or if the evaluation result satisfies a predetermined condition (for example, the scored evaluation score is equal to or greater than a threshold), control may be performed such that the vehicle operation plan is not regenerated for subsequent days.

[0054] For example, in the example shown in Figure 4, due to a malfunction or other problem in the section Station A → Depot A → Station A during operation B, <3> Reserve vehicle formation <2> In this case, as shown in Figure 7, in the subsequent operation, <2> and organization <3> Both of them are able to return to their scheduled resting place, depot A. In such a case, it is not necessary to regenerate the vehicle operation plan for the following days, so the original plan can be used for operation.

[0055] On the other hand, in the example shown in Figure 4, due to a fault or other problem at station B during operation D, <5> Reserve vehicle formation <7> In this case, as shown in Figure 8, the train configuration for the day is <5> The location of the train changed from Depot C to Depot B, and the train formation for that day <7> However, the location where the vehicle is to be parked has changed from vehicle depot B to vehicle depot C, and the vehicle is unable to return to the scheduled location. In such a case, the vehicle operation plan may be regenerated for the subsequent days, and a search may be made for a revised plan that will return all vehicles to the originally planned location.

[0056] 3 in response to receiving an instruction to execute vehicle allocation, the receiving unit 201 may execute the processes of steps S301 and S302, and then repeatedly execute the processes of steps S303 to S306. By repeatedly executing the processes of steps S303 to S306, multiple revision plans can be obtained, and the user can select a revision plan for an operation plan with a higher evaluation. In the above description, the processing in step S303 and the processing in step S304 are performed sequentially, but the processing in step S303 and the processing in step S304 may be performed simultaneously using a solver or the like.

[0057] As described above, according to this embodiment, when a disruption occurs in the train schedule, the originally planned rolling stock schedule is divided. Then, the divided rolling stock schedules are combined based on predetermined conditions to generate a new rolling stock schedule and allocate rolling stock. In this way, by dividing the originally planned rolling stock schedule when generating a new rolling stock schedule, the variation in operations increases and the possibility of returning rolling stock to the originally planned basin (scheduled basin) increases. As a result, when a disruption occurs in the train schedule, it becomes possible to quickly return rolling stock to the originally planned basin (scheduled basin) and restore the originally planned operating state.

[0058] It should be noted that the above-described embodiments are merely examples of specific embodiments of the present invention, and the technical scope of the present invention should not be construed as being limited by these embodiments. In other words, the present invention can be embodied in various forms without departing from its technical concept or main features. [Explanation of symbols]

[0059] 100 Information processing device 101 CPU 102 ROM 103 RAM 104 Auxiliary storage 105 Output Device 106 Input Device 107 Network I / F 201 Reception 202 Acquisition Department 203 Plan Generation Unit 204 Division Processing Unit 205 Joint processing section 206 Allocation processing unit 207 Memory section 208 Evaluation Department 209 Output section

Claims

1. An information processing device that assigns vehicles when a train schedule is disrupted, an acquisition means for acquiring information regarding operation including a vehicle operation plan based on an instruction to execute the vehicle allocation; A division means for dividing the acquired rolling stock operation plan in accordance with a predetermined condition; A processing means for generating a new rolling stock schedule based on the divided rolling stock schedule and allocating rolling stock to the rolling stock schedule; and outputting information relating to the new vehicle operation plan to which vehicles have been assigned.

2. 2. The information processing apparatus according to claim 1, wherein the dividing unit divides the rolling stock schedule into portions in which rolling stock can be parked in the rolling stock schedule.

3. 3. The information processing device according to claim 2, wherein the portion in which the vehicle can be parked includes a vehicle depot.

4. an evaluation means for evaluating the new vehicle operation plan to which vehicles have been assigned; 2. The information processing apparatus according to claim 1, wherein the output means outputs a result of the evaluation by the evaluation means.

5. The information processing device according to claim 1, characterized in that the processing means combines the divided vehicle operation plans to generate the new vehicle operation plan so as to increase the degree of correspondence between the originally planned stopping points and the stopping points in the new vehicle operation plan.

6. The processing means includes: a combining means for combining the divided rolling stock scheduling plans based on a predetermined condition to generate the new rolling stock scheduling plan; 2. The information processing apparatus according to claim 1, further comprising allocation means for allocating vehicles to the newly generated vehicle operation plan.

7. The processing means includes:

2. The information processing apparatus according to claim 1, further comprising: a process for generating the new rolling stock scheduling plan based on the divided rolling stock scheduling plan; and a process for allocating rolling stock to the rolling stock scheduling plan, simultaneously.

8. The information processing device according to claim 1 , wherein the processing means generates the new rolling stock operation plan by searching for a solution according to predetermined conditions through mathematical optimization based on the divided rolling stock operation plan.

9. 9. The information processing apparatus according to claim 8, wherein the processing means sets a solution obtained by solving the problem as a mixed integer optimization problem as the new vehicle operation plan.

10. 9. The information processing apparatus according to claim 8, wherein the processing means sets a solution obtained by solving the problem as a set partitioning problem as the new vehicle operation plan.

11. An information processing method executed by an information processing device that assigns cars when a train schedule is disrupted, comprising: an acquisition step of acquiring information regarding operation including a vehicle operation plan based on an execution instruction for the vehicle allocation; A division step of dividing the acquired rolling stock operation plan in accordance with a predetermined condition; A processing step of generating a new rolling stock schedule based on the divided rolling stock schedule and allocating rolling stock to the rolling stock schedule; and outputting information relating to the new vehicle operation plan to which vehicles have been assigned.

12. A computer of an information processing device that assigns cars when a train schedule is disrupted, an acquisition step of acquiring information regarding operation including a vehicle operation plan based on an execution instruction of the vehicle allocation; A division step of dividing the acquired rolling stock operation plan in accordance with a predetermined condition; A processing step of generating a new rolling stock schedule based on the divided rolling stock schedule and allocating vehicles to the rolling stock schedule; and an output step of outputting information about the new vehicle operation plan to which vehicles have been assigned.

Images