| 摘要 |
<P>PROBLEM TO BE SOLVED: To obtain a device for obtaining a proper crew schedule plan. <P>SOLUTION: In a first crew schedule plan, a crew schedule network is generated based on a train timetable or the like (step S1), and basic costs are set in each arc of the crew schedule network based on a predetermined evaluation reference (step S3). Also, the minimum cost complete matching of nodes included in the crew schedule network is calculated (step S5), and the sieving of courses is operated based on the irreducible costs of each arc calculated in the process (step S7). Then, set partitioning solutions are retrieved from among the courses remaining after the sieving (step S9), and the retrieved set partitioning solutions are defined as a crew schedule plan. <P>COPYRIGHT: (C)2007,JPO&INPIT |
