Multi-Depot Rail Departure and Garaging Line Coordination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for compiling urban rail transit operation lines fail to efficiently coordinate multiple depots, leading to complex outbound and inbound scheduling challenges, particularly in managing rolling stock and depot capacities, and require manual calculations that are time-consuming and inefficient.
Innovation Solution
A method for compiling urban rail transit outbound and inbound operation lines that synchronously generates paths and times, considering multiple depots, by screening feasible paths, identifying districts, and matching them with depot constraints to resolve conflicts and optimize train operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If manual calculations are used to compile outbound and inbound operation lines, then flexibility and adaptability are maintained, but compiling efficiency is significantly reduced and working time increases
Solution Approach 1:
The patent replaces manual calculation methods with an automated computer-based compilation system. The system automatically generates outbound and inbound operation lines by processing mainline operation data, eliminating the need for manual calculations and significantly reducing compiling time while maintaining scheduling accuracy
Solution Approach 2:
The compilation system performs self-service by automatically generating operation lines based on input data without requiring manual intervention for each scheduling decision. The system autonomously processes constraints, resolves conflicts, and produces final schedules, reducing both time loss and manual effort
2Adaptability or versatility
If multiple depots with limited parking capacities are coordinated, then train scheduling becomes more complex, but the ability to meet diverse service demands improves
Solution Approach 1:
The patent segments the scheduling problem by treating each depot independently with its own constraints and capabilities. The system processes each depot's parking capacity, outbound/inbound intervals, and service requirements separately, then integrates the solutions. This segmentation reduces overall complexity while enabling diverse service routing across multiple depots
Solution Approach 2:
The scheduling system dynamically adjusts operation lines based on real-time constraints from multiple depots. It continuously adapts to varying parking capacities, service demands, and temporal constraints, generating flexible schedules that meet diverse service requirements without becoming overwhelmed by complexity
3Ease of manufacture
If outbound and inbound operation lines are compiled separately, then the compilation process is simpler, but coordination between adjacent time periods and depots becomes insufficient
Solution Approach 1:
The patent merges the compilation of outbound and inbound operation lines into a unified process. The system simultaneously generates both types of operation lines while maintaining their respective constraints and ensuring proper coordination between adjacent time periods and depots. This integration improves reliability without significantly increasing complexity
4Adaptability or versatility
If the number of on-line trains is increased to meet passenger demand, then service coverage improves, but depot parking capacity constraints become more difficult to satisfy
Solution Approach 1:
The patent introduces a temporal dimension to parking capacity management by considering outbound and inbound intervals at different time periods. The system schedules trains not just by location but by time, allowing multiple trains to be parked at different times rather than requiring all trains to be parked simultaneously. This temporal dimension resolves capacity constraints while maintaining service coverage
Data Source
Figure 1
Figure 2A~2B
Figure 3
AI summary
Disclosed is a method for compilation of urban rail transit outbound and inbound operation lines with coordination of multiple depots, including the steps: S 1, screening out, based on the mainline path, a feasible outbound and inbound path set corresponding to switch tracks in each depot that can be connected to the mainline path; S2, identifying, based on a connection mode of an outbound and inbound path and the mainline path, outbound and inbound districts to be compiled in a feasible outbound and inbound path and assigning a time scale to the outbound and inbound districts as a feasible outbound and inbound operation line set; S3, matching a feasible outbound and inbound operation line of a corresponding time period, service route and direction for each originating event and terminating event of the mainline to be connected to the outbound and inbound operation line; and S4, according to a constraint on depot parking capacities, generating arrival and departure events of a corresponding feasible outbound and inbound operation line, and checking and resolving any time conflicts between the arrival and departure events of the feasible outbound and inbound operation line and those in mainline operation line; and determining the ultimately matched train outbound and inbound depots, outbound and inbound paths and arrival and departure events in the outbound and inbound operation line based on outbound and inbound interval constraint of the depot.