CA2510432A1 - Dynamic optimizing traffic planning method and system - Google Patents

Dynamic optimizing traffic planning method and system Download PDF

Info

Publication number
CA2510432A1
CA2510432A1 CA002510432A CA2510432A CA2510432A1 CA 2510432 A1 CA2510432 A1 CA 2510432A1 CA 002510432 A CA002510432 A CA 002510432A CA 2510432 A CA2510432 A CA 2510432A CA 2510432 A1 CA2510432 A1 CA 2510432A1
Authority
CA
Canada
Prior art keywords
traffic
plan
traffic movement
planning
plans
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CA002510432A
Other languages
French (fr)
Other versions
CA2510432C (en
Inventor
Viorel Morariu
C. Franklin Boyle
Uwe Deutermann
Gregory P. Barry
Andrey A. Korytko
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hitachi Rail STS USA Inc
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of CA2510432A1 publication Critical patent/CA2510432A1/en
Application granted granted Critical
Publication of CA2510432C publication Critical patent/CA2510432C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • G06Q50/40—
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/10—Operations, e.g. scheduling or time tables
    • B61L27/12—Preparing schedules
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L27/00—Central railway traffic control systems; Trackside control; Communication systems specially adapted therefor
    • B61L27/10—Operations, e.g. scheduling or time tables
    • B61L27/16—Trackside optimisation of vehicle or vehicle train operation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B61—RAILWAYS
    • B61L—GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC
    • B61L2205/00—Communication or navigation systems for railway traffic
    • B61L2205/04—Satellite based navigation systems, e.g. GPS

Abstract

A method generates optimized traffic movement plans. A plan monitor (58) determines a first planning boundary for traffic based upon traffic conditions of a region. A plan generator (56) employs the first planning boundary and repetitively generates first traffic movement plans for the traffic. The plan generator (56) selects one of the fist traffic movement plans as a first optimized traffic movement plan, and outputs the same for controlling traffic movement. The plan monitor (58) determines current traffic conditions of the region for a planning window, and updates the first planning boundary to provide a second planning boundary for the traffic based upon the current traffic conditions. The plan generator (56) employs the second planning boundary and repetitively generates second traffic movement plans for the traffic, selects one of the fist and second traffic movement plans as a second optimized traffic movement plan, and outputs the same for controlling traffic movement.

Claims (94)

1. A method of generating optimized traffic movement plans for a region having a plurality of traffic and a plurality of traffic conditions, said method comprising:
determining a first planning boundary for said traffic based upon the traffic conditions of said region;
employing said first planning boundary and repetitively generating a first plurality of traffic movement plans for the traffic of said region;
selecting one of said first plurality of traffic movement plans as a first optimized traffic movement plan for execution;
outputting said first optimized traffic movement plan for controlling traffic movement in said region;
determining current traffic conditions of said region;
updating said first planning boundary to provide a second planning boundary for said traffic based upon said current traffic conditions;
employing said second planning boundary and repetitively generating a second plurality of traffic movement plans for the traffic of said region;
selecting one of said first and second plurality of traffic movement plans as a second optimized traffic movement plan for execution; and outputting said second optimized traffic movement plan for controlling traffic movement in said region:
2. The method of Claim 1 further comprising:
selecting said first optimized traffic movement plan as said second optimized traffic movement plan for execution.
3. The method of Claim 1 further comprising:
selecting one of said first plurality of traffic movement plans as said second optimized traffic movement plan for execution.
4. The method of Claim 1 further comprising:
selecting one of said second plurality of traffic movement plans as said second optimized traffic movement plan for execution.
5. The method of Claim 1 further comprising:
employing a first plurality of traffic conditions for said first optimized traffic movement plan; and comparing said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan, and continuing to plan with the second planning boundary based substantially upon said first plurality of traffic movement plans to repetitively generate said second plurality of traffic movement plans for the traffic of said region.
6. The method of Claim 1 further comprising:
employing a first plurality of traffic conditions for said first optimized traffic movement plan; and comparing said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan, and responsively re-planning with the second planning boundary to repetitively generate as said second plurality of traffic movement plans for the traffic of said region: (a) a third plurality of traffic movement plans based substantially upon some of said first plurality traffic movement plans for the traffic of said region, and (b) a fourth plurality of traffic movement plans independent of said first plurality traffic movement plans for the traffic of said region.
7. The method of Claim 5 further comprising:
associating an objective function value with each of said first and second plurality of traffic movement plans; and employing as said continuing to plan with the second planning boundary:
destroying at least one of said first plurality of traffic movement plans based upon said objective function values, modifying at least one of said first plurality of traffic movement plans, in order to improve the objective function value thereof, employing a plurality of said first plurality of traffic movement plans to generate one of said second plurality of traffic movement plans, modifying at least one of said first plurality of traffic movement plans responsive to at least one perturbation associated with said current traffic conditions, and generating at least one of said second plurality of traffic movement plans independent of said first plurality of traffic movement plans.
8. The method of Claim 1 further comprising:
determining objective function values for said first and second plurality of traffic movement plans; and selecting said one of said first and second plurality of traffic movement plans as said second optimized traffic movement plan based upon said objective function values.
9. The method of Claim 8 further comprising:
employing a plurality of goals for each of said objective function values.
10. The method of Claim 8 further comprising:
ranking said first and second plurality of traffic movement plans based upon the objective function values; and selecting said second optimized traffic movement plan for execution based upon said ranking.
11. The method of Claim 1 further comprising:
continuing said employing said first planning boundary and repetitively generating a first plurality of traffic movement plans for the traffic of said region for a predetermined time before said selecting one of said first plurality of traffic movement plans as a first optimized traffic movement plan for execution.
12. The method of Claim 1 further comprising:
associating a first planning horizon with said first planning boundary and a later second planning horizon with said second planning boundary;
inputting schedule changes;
adjusting at least one of said first plurality of traffic movement plans to said second planning horizon and said schedule changes; and generating at least one of said second plurality of traffic movement plans employing said adjusted at least one of said first plurality of traffic movement plans.
13. The method of Claim 12 further comprising:
continuing said adjusting and said generating at least one of said second plurality of traffic movement plans for a predetermined time before said updating said first planning boundary.
14. The method of Claim 12 further comprising:
providing a corresponding objective function value and a corresponding age for each of said first and second plurality of traffic movement plans; and downgrading the corresponding objective function value as a function of the corresponding age for each of said first plurality of traffic movement plans.
15. The method of Claim 1 further comprising:
deleting at least one of said first plurality of traffic movement plans.
16. The method of Claim 6 further comprising:
determining objective function values for said first and second plurality of traffic movement plans; and selecting said one of said first and second plurality of traffic movement plans as said second optimized traffic movement plan based upon said objective function values.
17. The method of Claim 6 further comprising:
associating a first planning horizon with said first planning boundary and a later second planning horizon with said second planning boundary;
inputting schedule changes;
adjusting at least one of said first plurality of traffic movement plans to said second planning horizon and said schedule changes; and generating at least one of said second plurality of traffic movement plans employing said adjusted at least one of said first plurality of traffic movement plans.
18. The method of Claim 17 further comprising:
continuing said adjusting and said generating at least one of said second plurality of traffic movement plans for a predetermined time before updating said second planning boundary.
19. The method of Claim 1 further comprising:
employing a plurality of currently executing reservations with said first optimized traffic movement plan with said first planning boundary;
employing a plurality of presently committed reservations with said first optimized traffic movement plan with said first planning boundary;
and employing a plurality of reservations that are expected to be committed during a subsequent planning cycle for said second plurality of traffic movement plans with said first planning boundary.
20. The method of Claim 1 further comprising:
including at least some of said first plurality of traffic movement plans and said second plurality of traffic movement plans in a pool of traffic movement plans.
21. The method of Claim 20 further comprising:
employing a plurality of generations of traffic movement plans in said pool including a first generation of said first plurality of traffic movement plans and a second generation of said second plurality of traffic movement plans.
22. The method of Claim 20 further comprising:
employing about 50 of said first and second plurality of traffic movement plans in said pool.
23. The method of Claim 21 further comprising:
redetermining current traffic conditions of said region;
updating said second planning boundary to provide a third planning boundary for said traffic based upon said redetermined current traffic conditions;
employing said third planning boundary and repetitively generating a third plurality of traffic movement plans in a third generation of said traffic movement plans;

providing a corresponding objective function value and a corresponding age for each of the traffic movement plans of said first, second and third generations;
downgrading the corresponding objective function value as a function of the corresponding age for each of said first and second plurality of traffic movement plans;
determining a best plan based upon the downgraded corresponding objective function value for each of said first and second plurality of traffic movement plans and the corresponding objective function value for each of the traffic movement plans of said third generation; and comparing the corresponding objective function value of said second optimized movement plan to the objective function value of said best plan, in order to determine whether to replace said second optimized traffic movement plan with said best plan.
24. The method of Claim 23 further comprising:
employing a planning cycle for each of said generations; and maintaining said objective function values for a predetermined count of said planning cycles before employing said downgrading.
25. The method of Claim 24 further comprising:
employing a planning window associated with said first and second plurality of traffic movement plans; and discarding said movement plans after said planning window has passed.
26. The method of Claim 24 further comprising:
employing one of said objective function values having a positive value and another one of said objective function values having a negative value; and downgrading both of said positive and negative values.
27. The method of Claim 24 further comprising:
employing one of said objective function values having a positive value or another one of said objective function values having a negative value; and downgrading one of said positive and negative values.
28. The method of Claim 20 further comprising:
employing a corresponding objective function value for each of the traffic movement plans in said pool;
ordering the traffic movement plans in said pool based upon the corresponding objective function values; and selecting one of said traffic movement plans in said pool as said second optimized traffic movement plan for execution based upon said ordering.
29. The method of Claim 28 further comprising:
determining the corresponding objective function value for a corresponding one of said traffic movement plans before adding said corresponding one of said traffic movement plans to said pool.
30. The method of Claim 29 further comprising:
ordering said corresponding one of said traffic movement plans when adding said corresponding one of said traffic movement plans to said pool.
31. The method of Claim 28 further comprising:
employing a corresponding age for each of the traffic movement plans in said pool;
downgrading the corresponding objective function value of the corresponding one of said traffic movement plans in said pool as a function of the corresponding age; and re-ordering said corresponding one of said traffic movement plans in said pool responsive to said downgrading.
32. The method of Claim 20 further comprising:
deleting some of said first plurality of traffic movement plans and some of said second plurality of traffic movement plans from said pool, in order to maintain a predetermined count of traffic movement plans in said pool.
33. The method of Claim 6 further comprising:
employing a plurality of types of said traffic conditions of said region; and employing checking for changes in at least one of said types of said traffic conditions as said comparing said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan.
34. The method of Claim 33 further comprising:
employing at least one of changes in a railroad network and train ordering changes as said changes in at least one of said types of said traffic conditions.
35. The method of Claim 6 further comprising:
comparing said current traffic conditions against said first plurality of traffic conditions for said first optimized traffic movement plan and determining a re-planning score; and employing said re-planning when said re-planning score exceeds a predetermined value.
36. The method of Claim 35 further comprising:
accounting for train schedule changes and responsively determining said re-planning score including said train schedule changes; and employing said re-planning when said re-planning score including said train schedule changes exceeds a predetermined value.
37. The method of Claim 36 further comprising:
determining a relative number of changed trains from a count of train schedules changed divided by a count of trains in a planning horizon;
determining a relative number of new trains from a count of trains added divided by a sum of said count of trains in a planning horizon and said count of trains added; and employing said relative number of changed trains and said relative number of new trains to determine said re-planning score.
38. The method of Claim 37 further comprising:
determining a relative total duration of changed train schedules;
multiplying said relative number of changed trains by said relative total duration of changed train schedules;
determining a relative total duration of new train schedules;
multiplying said relative number of new trains by said relative total duration of new train schedules, in order to provide a product; and employing said product to determine said re-planning score.
39. The method of Claim 6 further comprising:
comparing said current traffic conditions against said first plurality of traffic conditions for said first optimized traffic movement plan and determining a re-planning score;
employing a plurality of types of said traffic conditions of said region; and employing said re-planning when said re-planning score exceeds a predetermined value or in response to changes in at least one of said types of said traffic conditions.
40. The method of Claim 39 further comprising:
determining a count as a function of said re-planning score; and generating said count of said fourth plurality of traffic movement plans.
41. The method of Claim 40 further comprising:
employing as said count a first count;
determining a second count of said first plurality of traffic movement plans;
determining a percentage from said function of said re-planning score; and determining said first count as said percentage times said second count.
42. The method of Claim 39 further comprising:
determining a count as a function of said re-planning score; and re-generating said count of said third plurality of traffic movement plans.
43. The method of Claim 42 further comprising:
employing as said count a first count;
determining a second count of said first plurality of traffic movement plans;
determining a percentage from said function of said re-planning score; and determining said first count as said percentage times said second count.
44. The method of Claim 39 further comprising:
determining a first count and a second count as functions of said re-planning score;
re-generating said first count of said third plurality of traffic movement plans; and generating said second count of said fourth plurality of traffic movement plans.
45. The method of Claim 39 further comprising:
employing a first function of said re-planning score for said first count;
employing a second function of said re-planning score for said second count; and employing a sum of said first and second functions being equal to one.
46. The method of Claim 39 further comprising:
employing a first function of said re-planning score for said first count;
employing a second function of said re-planning score for said second count; and employing a sum of said first and second functions being less than 0.5 when no schedule changes are present.
47. The method of Claim 1 further comprising:
providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions;
determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
48. The method of Claim 47 further comprising:
determining that said second objective function value is less than said first objective function value by a predetermined amount and responsively replacing said first optimized traffic movement plan with said best plan.
49. The method of Claim 47 further comprising:
providing a corresponding objective function value and a corresponding age for each of said first and second plurality of traffic movement plans;
downgrading the corresponding objective function value as a function of the corresponding age for each of said first plurality of traffic movement plans;
determining said best plan based upon the downgraded corresponding objective function value for each of said first plurality of traffic movement plans and the corresponding objective function value for each of said second plurality of traffic movement plans; and comparing said first objective function value to the objective function value of said best plan, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
50. The method of Claim 6 further comprising:
comparing said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan and determining a re-planning score;
determining that said re-planning score has exceeded a predetermined value and responsively employing said current traffic conditions to generate said second plurality of traffic movement plans;
providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions;
determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
51. The method of Claim 6 further comprising:
employing a plurality of types of said traffic conditions of said region;
determining changes in at least one of said types of said traffic conditions of said region in said current traffic conditions and responsively employing said current traffic conditions to generate said second plurality of traffic movement plans;
providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions;
determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
52. The method of Claim 1 further comprising:
generating said first plurality of traffic movement plans for a plurality of trains in a railroad network in said region; and dynamically optimizing movements of said trains across said railroad network under changes of the traffic conditions in said railroad network.
53. The method of Claim 52 further comprising:
employing a plurality of track sections in said railroad network;
employing a plurality of reservations, with each of said reservations representing a planned usage of one of said track sections by one of said trains from an entry date/time to an exit date/time; and combining said reservations to generate one of said first and second plurality of traffic movement plans.
54. The method of Claim 53 further comprising:
employing said first planning boundary as a collection of said reservations;
determining a current position and a speed for each of said trains in said railroad network; and determining said reservations from said first optimized traffic movement plan and from the current positions and speeds of said trains in said railroad network.
55. The method of Claim 54 further comprising:
employing as some of said reservations a plurality of current reservations;
employing with one of said trains a first car and a last car;
employing said first car on one of said track sections;
determining a delay incurred before arriving at said one of said track sections by said first car and a delay extension incurred at said one of said track sections by said first car; and employing said delay incurred and said delay extension incurred for each of said current reservations.
56. The method of Claim 54 further comprising:
employing with said one of said trains a plurality of cars including a first car and a last car;
employing as said entry date/time a date/time of entry of the first car onto one of said track sections; and employing as said exit date/time a date/time of exit of the last car from the last said one of said track sections.
57. The method of Claim 54 further comprising:
determining a plurality of track blocks, track speed restrictions and train position gaps in said railroad network;
calculating a re-planning score based on said track blocks, said track speed restrictions and said train position gaps in said railroad network;
determining that said re-planning score has exceeded a predetermined value and responsively employing said current traffic conditions of railroad network to generate said second plurality of traffic movement plans;
providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions of said railroad network;
determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions of said railroad network; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
58. The method of Claim 54 further comprising:
employing a plurality of train schedules for said trains;
determining at least one train schedule change for said train schedules;
responsive to said at least one train schedule change, employing said current traffic conditions of said railroad network to generate said second plurality of traffic movement plans;

providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions of said railroad network;
determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions of said railroad network; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
59. The method of Claim 52 further comprising:
converting said first optimized traffic movement plan into a plurality of commands;
employing as said commands a plurality of route clears and control commands for said railroad network; and outputting said route clears and said control commands for controlling real time traffic movement of said trains in said railroad network.
60. The method of Claim 59 further comprising:
employing a computer-aided dispatching system to execute said route clears and said control commands.
61. The method of Claim 60 further comprising:
receiving data from said computer-aided dispatching system regarding said trains in said railroad network; and employing said data to generate said first plurality of traffic movement plans for said trains in said railroad network.
62. The method of Claim 52 further comprising:
periodically generating said second plurality of traffic movement plans for the trains of said railroad network;
providing a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions of said railroad network;

determining a best plan from one of said first and second plurality of traffic movement plans;
providing a second objective function value for said best plan based upon said current traffic conditions of said railroad network; and comparing said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
63. The method of Claim 62 further comprising:
employing at least one objective selected from the group comprising on-time performance, best time and minimizing overall delay to determine said first and second objective function values.
64. The method of Claim 50 further comprising:
employing a plurality of types of said traffic conditions; and employing a weighting factor for each of said types in said re-planning score.
65. The method of Claim 64 further comprising:
employing as said types a first type for a plurality of track blocks, a second type for a plurality of track speed restrictions, and a third type for a plurality of train position gaps; and employing a plurality of sums associated with said first, second and third types.
66. The method of Claim 65 further comprising:
employing a zero speed associated with said track speed restrictions; and equating the sum associated with said first type with the sum associated with said second type.
67. The method of Claim 1 further comprising:
displaying a representation of said first optimized traffic movement plan.
68. The method of Claim 67 further comprising:
displaying a train graph including a time-distance representation of said first optimized traffic movement plan, in order to display a plurality of planned movements of trains in a railroad network.
69. The method of Claim 50 further comprising:
employing a railroad network in said region;
including a plurality of track blocks, track speed restrictions and train position gaps in said railroad network; and determining said re-planning score as a function of said track blocks, track speed restrictions and train position gaps in said railroad network.
70. The method of Claim 51 further comprising:
determining changes in train schedules and responsively generating said second plurality of traffic movement plans.
71. A dynamic optimizing traffic planning apparatus for a region having a plurality of traffic and a plurality of traffic conditions of said traffic, said apparatus comprising:
means for inputting information representing said traffic conditions; and means for executing a plurality of routines, said routines comprising:
a plan monitor determining a first planning boundary for said traffic based upon the traffic conditions of said region, determining current traffic conditions of said region, and updating said first planning boundary to provide a second planning boundary for said traffic based upon said current traffic conditions, a plan generator successively employing said first planning boundary and said second planning boundary and repetitively generating a first plurality of traffic movement plans and a second plurality of traffic movement plans, respectively, for the traffic of said region, selecting one of said first plurality of traffic movement plans as a first optimized traffic movement plan for execution, selecting one of said first and second plurality of traffic movement plans as a second optimized traffic movement plan for execution; and successively outputting said first and second optimized traffic movement plans, and a plan executive successively converting said first and said second optimized traffic movement plans into a plurality of commands for controlling traffic movement in said region.
72. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said plan generator employs a first plurality of traffic conditions for said first optimized traffic movement plan; wherein said plan monitor compares said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan; and wherein said plan generator continues to plan with the second planning boundary for a predetermined time based substantially upon said first plurality of traffic movement plans to repetitively generate said second plurality of traffic movement plans for the traffic of said region.
73. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said plan generator employs a first plurality of traffic conditions for said first optimized traffic movement plan; wherein said plan monitor compares said current traffic conditions against the first plurality of traffic conditions for said first optimized traffic movement plan and responsively sends a signal to said plan generator;
and wherein said plan generator, responsive to said signal, re-plans with the second planning boundary to repetitively generate as said second plurality of traffic movement plans for the traffic of said region: (a) a third plurality of traffic movement plans based substantially upon some of said first plurality traffic movement plans for the traffic of said region, and (b) a fourth plurality of traffic movement plans independent of said first plurality traffic movement plans for the traffic of said region.
74. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said plan executive successively converts said first and said second optimized traffic movement plans into corresponding proposed near-term movement plans for manually controlling traffic movement in said region.
75. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said plan executive successively converts said first and said second optimized traffic movement plans into a plurality of automatic control commands for automatically controlling traffic movement in said region.
76. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said region includes a commuter rail system; and wherein said traffic conditions are commuter rail traffic conditions.
77. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said region includes a railroad network; and wherein said traffic conditions are railroad traffic conditions.
78. The dynamic optimizing traffic planning apparatus of Claim 77 wherein said plan monitor determines said first planning boundary and a corresponding planning horizon; and wherein said plan generator inputs a plurality of train schedules, train properties and track descriptions for said railroad network, and outputs as said first optimized traffic movement plan a plurality of meet/pass plans for a plurality of trains over a predetermined time interval, which extends from said first planning boundary to said corresponding planning horizon.
79. The dynamic optimizing traffic planning apparatus of Claim 77 wherein said railroad network includes a plurality of trains; wherein said traffic conditions include train delays, changes in said railroad network and schedule changes for said trains; and wherein said plan monitor determines if re-planning by said plan generator is necessary from at least one of said train delays, said changes in said railroad network and said schedule changes for said trains.
80. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said first optimized traffic movement plan includes a plurality of first traffic conditions; wherein said means for inputting updates said information representing said traffic conditions with said current traffic conditions; wherein said plan monitor compares said current traffic conditions against the plurality of first traffic conditions of said first optimized traffic movement plan and determines a re-planning score, and determines that said re-planning score has exceeded a predetermined value; and wherein said plan generator responsively determines a first count and a second count as a function of said re-planning score, re-generates said first count of said first plurality of traffic movement plans, and generates said second count of said second plurality of traffic movement plans.
81. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said means for inputting updates said information representing said traffic conditions with said current traffic conditions; and wherein said plan generator provides a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions, generates said second plurality of traffic movement plans for the traffic of said region, determines a best plan from one of said first and second plurality of traffic movement plans, provides a second objective function value for said best plan based upon said current traffic conditions, and compares said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
82. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said first optimized traffic movement plan includes a plurality of first traffic conditions; wherein said means for inputting updates said information representing said traffic conditions with said current traffic conditions; wherein said plan monitor compares said current traffic conditions against the plurality of first traffic conditions of said first optimized traffic movement plan and determines a re-planning score, and determines that said re-planning score has exceeded a predetermined value; and wherein said plan generator responsively employs said current traffic conditions to generate said second plurality of traffic movement plans, provides a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions, determines a best plan from one of said first and second plurality of traffic movement plans, provides a second objective function value for said best plan based upon said current traffic conditions, and compares said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
83. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said means for inputting updates said information representing said traffic conditions with said current traffic conditions; wherein said plan monitor employs a plurality of types of said traffic conditions of said region, and determines changes in at least one of said types of said traffic conditions of said region in said current traffic conditions; and wherein said plan generator responsively employs said current traffic conditions to generate said second plurality of traffic movement plans, provides a first objective function value for said first optimized traffic movement plan based upon said current traffic conditions, determines a best plan from one of said first and second plurality of traffic movement plans, provides a second objective function value for said best plan based upon said current traffic conditions, and compares said first objective function value to said second objective function value, in order to determine whether to replace said first optimized traffic movement plan with said best plan.
84. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said means for executing includes a single processor for said plan monitor, said plan generator and said plan executive.
85. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said means for executing includes a first processor for said plan monitor and said plan generator, and a second processor for said plan executive.
86. The dynamic optimizing traffic planning apparatus of Claim 71 wherein said means for executing includes a first processor for said plan monitor, a second processor for said plan generator, and a third processor for said plan executive.
87. A traffic management system for a region having a plurality of traffic and a plurality of traffic conditions of said traffic, said apparatus comprising:
means for inputting information representing said traffic conditions;
means for executing a plurality of routines, said routines comprising:
a plan monitor determining a first planning boundary for said traffic based upon the traffic conditions of said region, determining current traffic conditions of said region, and updating said first planning boundary to provide a second planning boundary for said traffic based upon said current traffic conditions, a plan generator successively employing said first planning boundary and said second planning boundary and repetitively generating a first plurality of traffic movement plans and a second plurality of traffic movement plans, respectively, for the traffic of said region, selecting one of said first plurality of traffic movement plans as a first optimized traffic movement plan for execution, selecting one of said first and second plurality of traffic movement plans as a second optimized traffic movement plan for execution; and successively outputting said first and second optimized traffic movement plans, and a plan executive successively converting said first and said second optimized traffic movement plans into a plurality of commands for controlling traffic movement in said region; and means for executing said commands to control traffic movement in said region.
88. The traffic management system of Claim 87 wherein said means for executing said commands is a computer-aided dispatching system for controlling movements of trains in said region.
89. The traffic management system of Claim 88 wherein said computer-aided dispatching system includes a database having information about railroad infrastructure and control for said region.
90. The traffic management system of Claim 87 wherein said means for executing said commands is a traffic control system that issues commands for controlling said traffic.
91. The traffic management system of Claim 90 wherein said traffic control system is selected from the group comprising an operations control center, a network management center, a network control center and a traffic control center.
92. The traffic management system of Claim 87 wherein said region includes a railroad network having a plurality of trains; wherein said information representing said traffic conditions includes dynamic data from said railroad network; wherein said plan generator inputs a plurality of train schedules, train properties and track descriptions for said railroad network and generates as said first and second plurality of traffic movement plans a plurality of optimized meet/pass plans for said trains in said railroad network; wherein said means for executing said commands employs said dynamic data from said railroad network; and wherein said meet/pass plans do not violate any constraints on said train schedules, said train properties and said track descriptions for said railroad network based upon said dynamic data from said railroad network.
93. The traffic management system of Claim 87 wherein said region includes a railroad network having a plurality of trains; and wherein said means for executing displays a train graph including a time-distance representation of said first optimized traffic movement plan, in order to display a plurality of planned movements of said trains in said railroad network.
94. The traffic management system of Claim 87 wherein said first planning boundary comprises a plurality of reservations for said first optimized traffic movement plan, a plurality of presently committed reservations for said first optimized traffic movement plan, and a plurality of reservations that are expected to be committed during a subsequent planning cycle for said second plurality of traffic movement plans.
CA2510432A 2002-12-20 2003-12-19 Dynamic optimizing traffic planning method and system Expired - Lifetime CA2510432C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US43511402P 2002-12-20 2002-12-20
US60/435,114 2002-12-20
PCT/US2003/041207 WO2004059446A2 (en) 2002-12-20 2003-12-19 Dynamic optimizing traffic planning method and system

Publications (2)

Publication Number Publication Date
CA2510432A1 true CA2510432A1 (en) 2004-07-15
CA2510432C CA2510432C (en) 2011-02-22

Family

ID=32682160

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2510432A Expired - Lifetime CA2510432C (en) 2002-12-20 2003-12-19 Dynamic optimizing traffic planning method and system

Country Status (11)

Country Link
US (1) US7386391B2 (en)
EP (1) EP1573578B1 (en)
JP (1) JP2006511394A (en)
KR (1) KR20050085832A (en)
CN (1) CN1729465A (en)
AT (1) ATE461090T1 (en)
AU (1) AU2003300354B2 (en)
CA (1) CA2510432C (en)
DE (1) DE60331772D1 (en)
RU (1) RU2314561C2 (en)
WO (1) WO2004059446A2 (en)

Families Citing this family (126)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040172175A1 (en) * 2003-02-27 2004-09-02 Julich Paul M. System and method for dispatching by exception
US9233696B2 (en) 2006-03-20 2016-01-12 General Electric Company Trip optimizer method, system and computer software code for operating a railroad train to minimize wheel and track wear
US10308265B2 (en) 2006-03-20 2019-06-04 Ge Global Sourcing Llc Vehicle control system and method
US10569792B2 (en) 2006-03-20 2020-02-25 General Electric Company Vehicle control system and method
US11208129B2 (en) 2002-06-04 2021-12-28 Transportation Ip Holdings, Llc Vehicle control system and method
US9733625B2 (en) 2006-03-20 2017-08-15 General Electric Company Trip optimization system and method for a train
US11358615B2 (en) 2002-06-04 2022-06-14 Ge Global Sourcing Llc System and method for determining vehicle orientation in a vehicle consist
US8924049B2 (en) 2003-01-06 2014-12-30 General Electric Company System and method for controlling movement of vehicles
US7937193B2 (en) * 2003-02-27 2011-05-03 General Electric Company Method and apparatus for coordinating railway line of road and yard planners
US20060212188A1 (en) * 2003-02-27 2006-09-21 Joel Kickbusch Method and apparatus for automatic selection of alternative routing through congested areas using congestion prediction metrics
US20060212186A1 (en) * 2003-02-27 2006-09-21 Philp Joseph W Method and apparatus for scheduling maintenance of way
US20060212185A1 (en) * 2003-02-27 2006-09-21 Philp Joseph W Method and apparatus for automatic selection of train activity locations
US7797087B2 (en) * 2003-02-27 2010-09-14 General Electric Company Method and apparatus for selectively disabling train location reports
US20060212187A1 (en) * 2003-02-27 2006-09-21 Wills Mitchell S Scheduler and method for managing unpredictable local trains
US7725249B2 (en) * 2003-02-27 2010-05-25 General Electric Company Method and apparatus for congestion management
US8292172B2 (en) * 2003-07-29 2012-10-23 General Electric Company Enhanced recordation device for rail car inspections
US7395140B2 (en) * 2004-02-27 2008-07-01 Union Switch & Signal, Inc. Geographic information system and method for monitoring dynamic train positions
US7908047B2 (en) 2004-06-29 2011-03-15 General Electric Company Method and apparatus for run-time incorporation of domain data configuration changes
US7849031B2 (en) 2004-12-22 2010-12-07 Hntb Holdings Ltd. Optimizing traffic predictions and enhancing notifications
US7847807B2 (en) * 2004-12-22 2010-12-07 Hntb Holdings Ltd Geometry creation tool
US7511634B2 (en) * 2004-12-22 2009-03-31 Htnb Corporation Retrieving and presenting dynamic traffic information
US7711699B2 (en) * 2004-12-22 2010-05-04 Hntb Holdings Ltd. Method and system for presenting traffic-related information
WO2006099387A2 (en) 2005-03-14 2006-09-21 General Electric Company A system and method for railyard planning
AU2006235003B2 (en) * 2005-04-07 2010-06-17 New York Air Brake Llc Multimedia train simulator
ATE428159T1 (en) * 2005-07-18 2009-04-15 Siemens Ag METHOD FOR EQUALIZING TRAFFIC FLOWS AS WELL AS AVOIDING AND DISSOLVING CONGESTIONS
US20070115916A1 (en) * 2005-11-07 2007-05-24 Samsung Electronics Co., Ltd. Method and system for optimizing a network based on a performance knowledge base
US20070106434A1 (en) * 2005-11-07 2007-05-10 Galbraith Robert E Ii User interface for railroad dispatch monitoring of a geographic region and display system employing a common data format for displaying information from different and diverse railroad CAD systems
US8473127B2 (en) * 2006-03-20 2013-06-25 General Electric Company System, method and computer software code for optimizing train operations considering rail car parameters
US9376971B2 (en) * 2006-03-20 2016-06-28 General Electric Company Energy management system and method for vehicle systems
US9527518B2 (en) 2006-03-20 2016-12-27 General Electric Company System, method and computer software code for controlling a powered system and operational information used in a mission by the powered system
US9156477B2 (en) 2006-03-20 2015-10-13 General Electric Company Control system and method for remotely isolating powered units in a vehicle system
US9266542B2 (en) 2006-03-20 2016-02-23 General Electric Company System and method for optimized fuel efficiency and emission output of a diesel powered system
US8768543B2 (en) * 2006-03-20 2014-07-01 General Electric Company Method, system and computer software code for trip optimization with train/track database augmentation
US8290645B2 (en) 2006-03-20 2012-10-16 General Electric Company Method and computer software code for determining a mission plan for a powered system when a desired mission parameter appears unobtainable
US9201409B2 (en) 2006-03-20 2015-12-01 General Electric Company Fuel management system and method
US20070260497A1 (en) * 2006-05-02 2007-11-08 Wolfgang Daum Method of planning train movement using a front end cost function
US7734383B2 (en) * 2006-05-02 2010-06-08 General Electric Company Method and apparatus for planning the movement of trains using dynamic analysis
US8498762B2 (en) * 2006-05-02 2013-07-30 General Electric Company Method of planning the movement of trains using route protection
US7797088B2 (en) 2006-05-02 2010-09-14 General Electric Company Method and apparatus for planning linked train movements
CN101356089B (en) * 2006-05-19 2015-06-24 通用电气公司 System, method and computer software code for optimizing train operations considering rail car parameters
US7680750B2 (en) 2006-06-29 2010-03-16 General Electric Company Method of planning train movement using a three step optimization engine
JP4736979B2 (en) * 2006-06-30 2011-07-27 日産自動車株式会社 In-vehicle device, traffic information acquisition method, traffic information providing system, and traffic information providing method
US8082071B2 (en) * 2006-09-11 2011-12-20 General Electric Company System and method of multi-generation positive train control system
US8433461B2 (en) 2006-11-02 2013-04-30 General Electric Company Method of planning the movement of trains using pre-allocation of resources
DE102007047474A1 (en) * 2007-09-27 2009-04-02 Siemens Ag Timetable generation process for traffic systems with consideration of time limits
US9073562B2 (en) 2007-10-12 2015-07-07 General Electric Company System and method for a simulation based movement planner
WO2009117364A2 (en) * 2008-03-21 2009-09-24 General Electric Company Method for controlling a powered system based on mission plan
US8676410B2 (en) * 2008-06-02 2014-03-18 General Electric Company System and method for pacing a plurality of powered systems traveling along a route
US20100235210A1 (en) * 2009-03-11 2010-09-16 United Parcel Service Of America, Inc. Scheduled delivery service systems, apparatuses, methods, and computer programs embodied on computer-readable media
US9834237B2 (en) 2012-11-21 2017-12-05 General Electric Company Route examining system and method
US8640629B2 (en) * 2009-05-01 2014-02-04 Norfolk Southern Corporation Battery-powered all-electric and/or hybrid locomotive and related locomotive and train configurations
CN101920711A (en) * 2009-06-17 2010-12-22 上海宝信软件股份有限公司 Method for controlling device through schedule in rail traffic monitoring system
US8428798B2 (en) 2010-01-08 2013-04-23 Wabtec Holding Corp. Short headway communications based train control system
FR2958248B1 (en) * 2010-04-01 2012-06-15 Alstom Transport Sa METHOD FOR MANAGING THE MOVEMENT OF VEHICLES ON A RAILWAY NETWORK AND ASSOCIATED SYSTEM
KR20130126632A (en) * 2010-12-09 2013-11-20 지멘스 에스에이에스 Method for communicating information between an on-board control unit and a public transport network
US8774991B1 (en) * 2010-12-10 2014-07-08 Cybertran International Inc. System and method of controlling vehicles to follow a defined trajectory in a complex track network
US9008933B2 (en) * 2011-05-09 2015-04-14 General Electric Company Off-board scheduling system and method for adjusting a movement plan of a transportation network
EP2720927A4 (en) * 2011-06-14 2015-11-11 Thales Canada Inc Control of automatic guided vehicles without wayside interlocking
US20130116865A1 (en) * 2011-11-03 2013-05-09 Jared COOPER System and method for changing when a vehicle enters a vehicle yard
US20130116916A1 (en) * 2011-11-04 2013-05-09 Joel Kickbusch Transportation network scheduling system and method
US8655518B2 (en) 2011-12-06 2014-02-18 General Electric Company Transportation network scheduling system and method
US9235991B2 (en) * 2011-12-06 2016-01-12 General Electric Company Transportation network scheduling system and method
US20130144467A1 (en) * 2011-12-06 2013-06-06 Joel Kickbusch Transportation network scheduling system and method
EP2834868B1 (en) 2012-04-02 2023-12-27 Hydrogenics Corporation Fuel cell start up method
US9027102B2 (en) 2012-05-11 2015-05-05 Sprint Communications Company L.P. Web server bypass of backend process on near field communications and secure element chips
US20130311153A1 (en) * 2012-05-15 2013-11-21 Caterpillar Inc. Virtual environment and method for sorting among potential route plans for operating autonomous machine at work site
US9282898B2 (en) 2012-06-25 2016-03-15 Sprint Communications Company L.P. End-to-end trusted communications infrastructure
EP2873586A4 (en) * 2012-07-13 2016-07-27 Hitachi Ltd Method for selecting alternate operating route for train, and system therefor
US9183412B2 (en) 2012-08-10 2015-11-10 Sprint Communications Company L.P. Systems and methods for provisioning and using multiple trusted security zones on an electronic device
US9015068B1 (en) * 2012-08-25 2015-04-21 Sprint Communications Company L.P. Framework for real-time brokering of digital content delivery
TWI548553B (en) * 2012-11-15 2016-09-11 Nippon Sharyo Ltd The route determination system for railway vehicles
US9669851B2 (en) 2012-11-21 2017-06-06 General Electric Company Route examination system and method
US9003039B2 (en) 2012-11-29 2015-04-07 Thales Canada Inc. Method and apparatus of resource allocation or resource release
JP5811996B2 (en) * 2012-12-12 2015-11-11 トヨタ自動車株式会社 Transportation plan creation support device, transportation plan creation support method
AU2013270604A1 (en) * 2012-12-14 2014-07-03 Technological Resources Pty. Limited A rail network management system
US9578664B1 (en) 2013-02-07 2017-02-21 Sprint Communications Company L.P. Trusted signaling in 3GPP interfaces in a network function virtualization wireless communication system
US9171345B2 (en) * 2013-02-15 2015-10-27 Norfolk Southern Corporation System and method for terminal capacity management
US9613208B1 (en) 2013-03-13 2017-04-04 Sprint Communications Company L.P. Trusted security zone enhanced with trusted hardware drivers
US9374363B1 (en) 2013-03-15 2016-06-21 Sprint Communications Company L.P. Restricting access of a portable communication device to confidential data or applications via a remote network based on event triggers generated by the portable communication device
US9324016B1 (en) 2013-04-04 2016-04-26 Sprint Communications Company L.P. Digest of biographical information for an electronic device with static and dynamic portions
US9454723B1 (en) 2013-04-04 2016-09-27 Sprint Communications Company L.P. Radio frequency identity (RFID) chip electrically and communicatively coupled to motherboard of mobile communication device
US9838869B1 (en) 2013-04-10 2017-12-05 Sprint Communications Company L.P. Delivering digital content to a mobile device via a digital rights clearing house
US9443088B1 (en) 2013-04-15 2016-09-13 Sprint Communications Company L.P. Protection for multimedia files pre-downloaded to a mobile device
BR112015024222A2 (en) * 2013-04-22 2017-07-18 Landmark Graphics Corp method for adjusting existing well plans, program transport device, program support device, and method for adjusting existing well plans
US9560519B1 (en) 2013-06-06 2017-01-31 Sprint Communications Company L.P. Mobile communication device profound identity brokering framework
RU2546577C2 (en) * 2013-06-19 2015-04-10 Федеральное государственное бюджетное образовательное учреждение высшего профессионального образования "Самарский государственный университет путей сообщения" (СамГУПС) Computer-aided system for traffic schedule control analysis
US9129522B2 (en) * 2013-07-01 2015-09-08 Iteris, Inc. Traffic speed estimation using temporal and spatial smoothing of GPS speed data
US9293040B2 (en) * 2013-07-01 2016-03-22 Iteris, Inc. Data quality assessment and real-time evaluation of GPS probe data
US10546307B2 (en) 2013-09-25 2020-01-28 International Business Machines Corporation Method, apparatuses, and computer program products for automatically detecting levels of user dissatisfaction with transportation routes
RU2566171C2 (en) * 2014-01-16 2015-10-20 Федеральное государственное унитарное предприятие "Центральный научно-исследовательский институт машиностроения" (ФГУП ЦНИИмаш) Method for conflict resolution in spacecraft flight control
WO2015166727A1 (en) * 2014-04-28 2015-11-05 株式会社日立製作所 Driving assistance system
EP2974939B1 (en) * 2014-07-17 2023-06-07 Hitachi, Ltd. Train management system
JP2016030542A (en) * 2014-07-30 2016-03-07 株式会社日立製作所 Train operation management system
US10572847B2 (en) * 2014-10-10 2020-02-25 Conduent Business Services, Llc Dynamic space-time diagram for visualization of transportation schedule adherence
US11312018B2 (en) 2014-11-14 2022-04-26 Transportation Ip Holdings, Llc Control system with task manager
US9779232B1 (en) 2015-01-14 2017-10-03 Sprint Communications Company L.P. Trusted code generation and verification to prevent fraud from maleficent external devices that capture data
US9838868B1 (en) 2015-01-26 2017-12-05 Sprint Communications Company L.P. Mated universal serial bus (USB) wireless dongles configured with destination addresses
US10507853B2 (en) * 2015-01-27 2019-12-17 Mitsubishi Electric Corporation Train-information management device and train-information management method
US9473945B1 (en) 2015-04-07 2016-10-18 Sprint Communications Company L.P. Infrastructure for secure short message transmission
US9819679B1 (en) 2015-09-14 2017-11-14 Sprint Communications Company L.P. Hardware assisted provenance proof of named data networking associated to device data, addresses, services, and servers
US10282719B1 (en) 2015-11-12 2019-05-07 Sprint Communications Company L.P. Secure and trusted device-based billing and charging process using privilege for network proxy authentication and audit
US9817992B1 (en) 2015-11-20 2017-11-14 Sprint Communications Company Lp. System and method for secure USIM wireless network access
JP6596750B2 (en) * 2015-11-25 2019-10-30 三菱重工エンジニアリング株式会社 Vehicle control system, travel management device, resource management device, vehicle control method, program
EP3243726B1 (en) * 2016-05-09 2020-07-15 ALSTOM Transport Technologies Traffic management method and traffic management system
US11562300B2 (en) 2016-06-10 2023-01-24 Conduent Business Services, Llc System and method for optimal automated booking of on-demand transportation in multi-modal journeys
DE102016214057A1 (en) * 2016-07-29 2018-02-01 Siemens Aktiengesellschaft Method and device for revising at least one planned timetable of a traffic engineering system
US10279823B2 (en) * 2016-08-08 2019-05-07 General Electric Company System for controlling or monitoring a vehicle system along a route
US20180047124A1 (en) * 2016-08-12 2018-02-15 Hatch Ltd. System and method for optimizing a rail system
CN106781461A (en) * 2016-12-02 2017-05-31 交通运输部公路科学研究所 A kind of freeway net operation situation deduces thermal starting technology online
RU2669873C2 (en) * 2017-03-07 2018-10-16 ООО "Ассоциация инженеров и учёных по водоснабжению и водоотведению" Method for optimal control of water disposal system
US10769946B1 (en) * 2017-04-24 2020-09-08 Ronald M Harstad Incentive-compatible, asymmetric-information, real-time traffic-routing differential-advice
US10499249B1 (en) 2017-07-11 2019-12-03 Sprint Communications Company L.P. Data link layer trust signaling in communication network
RU2667745C1 (en) * 2017-08-07 2018-09-24 Государственное Унитарное Предприятие "Водоканал Санкт-Петербурга" Method of optimization of the wastewater streams
US10699588B2 (en) * 2017-12-18 2020-06-30 Honeywell International Inc. Aircraft taxi routing
US10816990B2 (en) * 2017-12-21 2020-10-27 Baidu Usa Llc Non-blocking boundary for autonomous vehicle planning
RU2685897C1 (en) * 2018-01-18 2019-04-23 Государственное Унитарное Предприятие "Водоканал Санкт-Петербурга" Method of optimizing discharges of wastewater of combined water disposal systems
US20200342418A1 (en) * 2019-04-29 2020-10-29 Lyft, Inc. Vehicle service center dispatch system
CN110803203B (en) * 2019-11-06 2021-11-26 中国铁道科学研究院集团有限公司通信信号研究所 Method and system for predicting evolution of high-speed railway running track
JP7227118B2 (en) * 2019-11-08 2023-02-21 株式会社日立製作所 RESOURCE OPERATION PLANNING SUPPORT DEVICE, RESOURCE OPERATION PLANNING SUPPORT METHOD, AND PROGRAM
US20230014504A1 (en) * 2019-12-02 2023-01-19 Wsp Global Inc. Railway management system with data repository
CN110991740B (en) * 2019-12-03 2023-12-15 海南电网有限责任公司 Power grid planning method and system based on operation simulation and intelligent agent technology
CN112215475A (en) * 2020-09-24 2021-01-12 交控科技股份有限公司 Driving organization scheme design system of rail transit
US11714829B2 (en) * 2020-12-14 2023-08-01 Sap Se Parallel calculation of access plans delimitation using table partitions
CN113591327B (en) * 2021-08-17 2023-12-19 广东汇通信息科技股份有限公司 Local traffic planning multi-scale evaluation method based on VISSIM
CN116110228B (en) * 2023-04-06 2023-07-07 齐鲁云商数字科技股份有限公司 Urban traffic rapid guiding system based on block chain
CN117558132B (en) * 2024-01-11 2024-03-15 北京华创智芯科技有限公司 Traffic management platform data processing method and system based on big data

Family Cites Families (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3706969A (en) * 1971-03-17 1972-12-19 Forney Eng Co Airport ground aircraft automatic taxi route selecting and traffic control system
US4041283A (en) * 1975-07-25 1977-08-09 Halliburton Company Railway train control simulator and method
US4122523A (en) * 1976-12-17 1978-10-24 General Signal Corporation Route conflict analysis system for control of railroads
US4361202A (en) * 1979-06-15 1982-11-30 Michael Minovitch Automated road transportation system
US4883245A (en) * 1987-07-16 1989-11-28 Erickson Jr Thomas F Transporation system and method of operation
US5574648A (en) * 1990-10-09 1996-11-12 Pilley; Harold R. Airport control/management system using GNSS-based methods and equipment for the control of surface and airborne traffic
US5177684A (en) * 1990-12-18 1993-01-05 The Trustees Of The University Of Pennsylvania Method for analyzing and generating optimal transportation schedules for vehicles such as trains and controlling the movement of vehicles in response thereto
US5257194A (en) * 1991-04-30 1993-10-26 Mitsubishi Corporation Highway traffic signal local controller
US5374932A (en) * 1993-08-02 1994-12-20 Massachusetts Institute Of Technology Airport surface surveillance system
US5519618A (en) * 1993-08-02 1996-05-21 Massachusetts Institute Of Technology Airport surface safety logic
US5559707A (en) * 1994-06-24 1996-09-24 Delorme Publishing Company Computer aided routing system
US5802492A (en) * 1994-06-24 1998-09-01 Delorme Publishing Company, Inc. Computer aided routing and positioning system
US6321158B1 (en) * 1994-06-24 2001-11-20 Delorme Publishing Company Integrated routing/mapping information
US7539624B2 (en) * 1994-09-01 2009-05-26 Harris Corporation Automatic train control system and method
US5623413A (en) * 1994-09-01 1997-04-22 Harris Corporation Scheduling system and method
US6459964B1 (en) * 1994-09-01 2002-10-01 G.E. Harris Railway Electronics, L.L.C. Train schedule repairer
US5828979A (en) * 1994-09-01 1998-10-27 Harris Corporation Automatic train control system and method
WO1997009217A2 (en) * 1995-09-07 1997-03-13 Siemens Aktiengesellschaft Control process for track-bound vehicles
US6218961B1 (en) * 1996-10-23 2001-04-17 G.E. Harris Railway Electronics, L.L.C. Method and system for proximity detection and location determination
AU734038B2 (en) * 1997-02-07 2001-05-31 Ge-Harris Railways Electronics, L.L.C. A system and method for automatic train operation
US6331068B1 (en) * 1999-02-18 2001-12-18 Lacks Industries, Inc. Flexible lamp mounting
US6356383B1 (en) * 1999-04-02 2002-03-12 Corvis Corporation Optical transmission systems including optical amplifiers apparatuses and methods
US6587738B1 (en) 1999-12-30 2003-07-01 Ge-Harris Railway Electronics, L.L.C. Optimal locomotive assignment for a railroad network
US6304801B1 (en) * 1999-12-30 2001-10-16 Ge-Harris Railway Electronics, L.L.C. Train corridor scheduling process including a balanced feasible schedule cost function
US6546371B1 (en) * 1999-12-30 2003-04-08 Ge-Harris Railway Electronics, L.L.C. Train corridor scheduling process including various cost functions associated with railway operations
WO2001050666A2 (en) * 1999-12-31 2001-07-12 Crone Michael S Cost reactive resource scheduler and method
US6356838B1 (en) 2000-07-25 2002-03-12 Sunil Paul System and method for determining an efficient transportation route
US6456371B1 (en) * 2000-09-25 2002-09-24 The Boeing Company Attitude determination with earth horizon-crossing indicators and relative-attitude propagation

Also Published As

Publication number Publication date
WO2004059446A3 (en) 2004-12-09
JP2006511394A (en) 2006-04-06
WO2004059446A2 (en) 2004-07-15
US20060074544A1 (en) 2006-04-06
EP1573578A2 (en) 2005-09-14
CN1729465A (en) 2006-02-01
AU2003300354B2 (en) 2009-03-26
US7386391B2 (en) 2008-06-10
RU2314561C2 (en) 2008-01-10
ATE461090T1 (en) 2010-04-15
KR20050085832A (en) 2005-08-29
RU2005123061A (en) 2006-02-27
EP1573578A4 (en) 2007-05-30
EP1573578B1 (en) 2010-03-17
DE60331772D1 (en) 2010-04-29
CA2510432C (en) 2011-02-22
AU2003300354A1 (en) 2004-07-22

Similar Documents

Publication Publication Date Title
CA2510432A1 (en) Dynamic optimizing traffic planning method and system
Nash et al. Railroad simulation using OpenTrack
Dong et al. Integrated optimization of train stop planning and timetabling for commuter railways with an extended adaptive large neighborhood search metaheuristic approach
US8082071B2 (en) System and method of multi-generation positive train control system
Corman et al. Closing the loop in real-time railway control: Framework design and impacts on operations
US7680750B2 (en) Method of planning train movement using a three step optimization engine
CN110843870B (en) Method for maintaining fixed capacity of high-speed railway network graph under abnormal event
Luan et al. Non-discriminatory train dispatching in a rail transport market with multiple competing and collaborative train operating companies
CN114132363B (en) Train running chart compiling method based on passenger flow space-time state refined analysis
JP2002037076A (en) Method and device for simulating train operation
RU2207279C1 (en) Method of simulation of train traffic flow in railway section
RU2297353C1 (en) Method of simulation of train flow along railway section
US11104363B2 (en) Train operation planning support system
CN116142264A (en) Urban rail transit operation planning method and system
JPH08156793A (en) Train operation predictive device, operation and arrangement programming device, train operation programming device and train operation support system
RU2737817C1 (en) System for hybrid control of marshalling yards operation with decision support function on procedure for trains classification
Hallowell Optimal dispatching under uncertainty: with application to railroad scheduling
CN114298378A (en) Night train driving planning method, equipment and storage medium
Bueno-Cadena et al. An analytical model for controlling disruptions on a metro line
PT2200884E (en) Method for creating timetables for transportation systems taking into account time limits
JPH05319269A (en) Transport system evaluation simulator
Zhao Hybrid model for proactive dispatching of railway operation under the consideration of random disturbances in dynamic circumstances
Lee et al. Analysis of skip-and-stop planning using smart card data
Schöbel et al. Microscopic Simulation of Railway Operation for Developing Integrated Timetables
Vandebona et al. TRAMS: Transit route animation and modelling by simulation

Legal Events

Date Code Title Description
EEER Examination request
MKEX Expiry

Effective date: 20231219