Railway Traffic Graph Validation for Timetable Consistency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing traffic control systems for guided vehicles on railway networks are unable to efficiently and automatically manage changes to timetables, leading to potential inconsistencies and errors that can disrupt the smooth operation of guided vehicles.
Innovation Solution
A method and system that utilize a directed graph algorithm to automatically detect and correct inconsistencies in timetables by reversing directed edges in a cycle, ensuring consistent scheduling and routing of guided vehicles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a timetable is manually changed to accommodate delays or issues, then the timetable can be adapted to current conditions, but errors or mistakes in manual changes can have serious consequences on traffic consistency and safety
Solution Approach 1:
The system performs self-validation by automatically detecting inconsistencies in the timetable itself without requiring external manual verification. The algorithm analyzes the timetable structure to identify conflicts, enabling the system to self-correct errors before they impact traffic operations.
Solution Approach 2:
The system provides immediate feedback about timetable inconsistencies to operators through clear error messages and visual indicators. This feedback mechanism allows operators to understand and correct issues quickly, preventing erroneous timetables from being implemented and maintaining traffic consistency.
2Reliability
If traditional traffic control systems recalculate timetables by applying delays to guided vehicles, then consistency is maintained, but the system cannot efficiently or automatically manage timetable changes
Solution Approach 1:
The patent replaces manual mechanical processes of timetable verification with an automated computer-based algorithm. The system uses electronic data processing to automatically detect inconsistencies, eliminating the need for manual checking and significantly improving timetable management efficiency while maintaining consistency.
Solution Approach 2:
The algorithm acts as an intermediary between timetable creation and implementation. It automatically analyzes the timetable structure, detects potential conflicts, and prevents erroneous timetables from being applied, serving as a protective layer that maintains consistency without requiring manual intervention.
3Reliability
If the system uses a directed graph algorithm to automatically detect inconsistencies, then timetable errors can be prevented before implementation, but the system complexity increases
Solution Approach 1:
The patent segments the timetable verification process into distinct algorithmic steps: constructing the directed graph from timetable data, analyzing graph properties to detect inconsistencies, and generating error reports. This segmentation makes the complex verification process manageable and implementable through structured computer algorithms.
Data Source
Figure 1~3
Figure 4
Figure 5A~5B
AI summary
The present invention concerns a traffic control system (110) and a method (200) for managing traffic of guided vehicles (103) over a railway network, said method comprising: - acquiring (201) a timetable for said guided vehicles (103); - acquiring (202) a map of said railway network; - using said map of the railway network for automatically dividing/splitting (203) the railway network into a set of successive track sections delimited by boundary positions (A-M); - for each boundary position (A-M), automatically determining (204) a list of the guided vehicles (103) crossing said boundary position (A-M); - automatically creating (206), from the map, the timetable, the boundary positions (A-M) and their associated list, a directed graph comprising nodes (401) and directed edges (402), wherein each node (401) represents an itinerary followed by one of said guided vehicles (103), and wherein each directed edge (402) is configured for connecting two of said nodes (401); - using (207) the directed graph as input to an algorithm configured for automatically detecting whether said directed graph comprises one or several cycles; and - if no cycle is detected (208) by the algorithm, then managing the traffic of said guided vehicles (103) according to said timetable.