Rolling Stock Scheduling via Operation Connection Graph
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional rolling stock scheduling methods are inefficient and time-consuming, often relying on manual processes and struggle to create schedules that satisfy complex constraints, especially when dealing with irregular schedules and strict operation limitations, leading to increased maintenance costs and potential operational disorders.
Innovation Solution
A rolling stock scheduling apparatus that utilizes an operation connection graph to automatically assign operations to cars, employing a greedy assignment unit and a backtrack search unit to ensure all cars exist at target sites, thereby creating a schedule that satisfies connection and target day constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If manual scheduling methods are used, then flexibility in handling complex constraints is improved, but time consumption and productivity deteriorate
Solution Approach 1:
The patent replaces manual mechanical scheduling processes with an automated computer-based system that uses graph theory algorithms and constraint satisfaction methods to generate rolling stock schedules, thereby eliminating the time-consuming nature of manual work while maintaining the ability to handle complex constraints through systematic computational approaches
Solution Approach 2:
The patent transforms the scheduling problem from a manual iterative process into an automated computational process by changing parameters such as representing operations as nodes and connectability as arcs in a graph structure, enabling the system to efficiently process complex constraints through algorithmic evaluation rather than human judgment
2Ease of manufacture
If conventional scheduling methods are used, then simplicity of implementation is improved, but ability to satisfy complex constraints deteriorates
Solution Approach 1:
The patent segments the complex scheduling problem into manageable components by representing operations as discrete nodes and connectability relationships as arcs in a graph structure, allowing each constraint type (connection constraints, target day constraints, operation limiting constraints) to be systematically evaluated and satisfied through structured algorithmic processing
Solution Approach 2:
The patent introduces an operation connection graph as an intermediary data structure that mediates between the scheduling requirements and the constraint satisfaction process, enabling the system to systematically evaluate and reconcile multiple competing constraints through graph traversal and path finding algorithms
3Productivity
If automated scheduling is implemented, then productivity is improved, but device complexity deteriorates
Solution Approach 1:
The patent creates a universal scheduling system that handles multiple types of constraints (connection constraints, target day constraints, operation limiting constraints) and various rolling stock scenarios through a single integrated graph-based framework, reducing the need for multiple specialized systems while maintaining high productivity through automated constraint satisfaction
Data Source
AI summary
A rolling-stock-scheduling apparatus includes a creation unit creating a graph from an initial day to a target day, the graph including nodes representing initial-day sites, target-day sites, and first operations, the first operations being defined by a departure time, a departure site, an arrival time, and an arrival site, the graph including arcs each of which indicates nodes' connectability, a setting unit setting paths that connect second operations on each day from the initial day to the target day, an exchange unit exchanging, if there is a first car which does not exist at the target-day site on the target day, each arc so that all the cars exist at target-day sites on the target day, and an output unit outputting, if second paths on which all the cars exist at the target-day sites are found, third operations corresponding to each of the second paths as a car-operation.