Linked Train Movement Planning System
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current systems for scheduling train movements over rail networks cannot effectively accommodate linked train movements, where the departure or characteristics of one train depend on another, requiring manual intervention or offline static planning, and fail to dynamically adjust train characteristics at linkage points.
Innovation Solution
A system and method that identifies and optimizes linked train movements within the planning algorithm, dynamically adjusting train characteristics and re-planning affected trains in response to changes, using computer-executable code to manage dependencies and update train values based on linked activities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual intervention or offline static planning is used to accommodate linked train movements, then train dependencies can be managed, but scheduling efficiency and real-time responsiveness deteriorate
Solution Approach 1:
The patent replaces manual dispatcher intervention with an automated computer-based planning system that uses algorithms to identify and coordinate linked train movements. The system automatically detects train linkages, evaluates alternative schedules, and implements optimized plans without manual intervention, thereby maintaining reliability while dramatically improving scheduling efficiency and real-time responsiveness.
Solution Approach 2:
The patent implements dynamic schedule evaluation by continuously monitoring train movements and automatically re-planning when linkages are detected. The system adapts to changing conditions in real-time, evaluating alternative schedules and implementing optimizations dynamically rather than relying on static offline planning, thus resolving the contradiction between reliable linkage coordination and scheduling efficiency.
2Adaptability or versatility
If traditional planning algorithms are used, then computational simplicity is maintained, but the ability to identify and optimize linked train movements deteriorates
Solution Approach 1:
The patent incorporates linkage identification and evaluation logic directly into the schedule planning algorithm itself, rather than adding separate post-processing steps. The system proactively identifies potential linkages during the planning phase and evaluates their impact on overall schedule quality, enabling adaptive optimization without excessive computational complexity or separate complex subsystems.
3Adaptability or versatility
If train characteristics are statically defined, then data management simplicity is maintained, but the ability to dynamically adjust train characteristics at linkage points deteriorates
Solution Approach 1:
The patent implements dynamic train characteristic management by automatically modifying train attributes when linkages are identified. The system adjusts train characteristics such as weight, length, and composition based on linked activities like car set-outs and pick-ups, enabling adaptive response to operational conditions while maintaining manageable data complexity through automated rule-based updates.
Data Source
AI summary
A scheduling system and method for identifying and planning for the linked movement of two or more trains.