# US 2025/0145196 A1 · System and method for optimizing ramp operations of a hub based on a dual-stream resource optimization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0145196 A1
- Document ID: US20250145196A1
- Status: Published application
- Kind: A1
- Application number: 18/911,570
- Filed: 2024-10-10
- Published: 2025-05-08
- Earliest claimed: 2023-11-03
- Assignees: BNSF Railway Company
- Applicants: BNSF Railway Company
- Inventors: Dasaradh R. Mallampati; Vishal Badyal; Paul Kuhn; April Y. Kuo
- Web page: https://patentgrep.com/patent/US20250145196A1

## CPC

- B61L 27/12: Preparing schedules
- B61L 27/16: Trackside optimisation of vehicle or train operation
- G06Q 10/063: Operations research, analysis or management
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- B61L 2201/00: Control methods
- B61L: GUIDING RAILWAY TRAFFIC; ENSURING THE SAFETY OF RAILWAY TRAFFIC (brakes or auxiliary equipment B61H, B61K; point or crossing construction E01B)
- 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

## Abstract

Systems and techniques for optimizing ramp operations of a hub based on a dual-stream resource optimization (DSRO). In embodiments, inbound and outbound trains scheduled to arrive at or depart from a hub over a planning horizon are identified. A set of candidate track-train assignment sequences involving the inbound and outbound trains and production tracks of the hub facility is generated. Infeasible candidate track-train assignment sequences are eliminated from the set. A cost associated with each remaining candidate track-train assignment sequence over the planning horizon is determined based on one or more effort matrices. An optimized track-train assignment sequence is selected from the set of candidate track-train assignment sequences based on the determined cost. A control signal is automatically sent to a controller to cause execution of the optimized track-train assignment sequence.

## Claims

### Claim 1

A method for optimizing ramp operations in a hub facility, the method comprising:
identifying inbound and outbound trains scheduled to arrive at or depart from a hub over a planning horizon of an optimized operating schedule based on a dual-stream optimization model including a consolidated time-space network and a deconsolidated time-space network of the optimized operating schedule;
generating a set of candidate track-train assignment sequences involving the inbound and outbound trains and production tracks of the hub facility, wherein each candidate track-train assignment sequence in the set of candidate track-train assignment sequences defines a sequence of track-train assignments for a respective production track of the production tracks over the planning horizon, wherein a track-train assignments includes an assignment of one of the inbound and outbound trains to a particular production track for processing;
eliminating infeasible candidate track-train assignment sequences from the set of candidate track-train assignment sequences;
determining a cost, based on one or more effort matrices, associated with each remaining candidate track-train assignment sequence in the set of candidate track-train assignment sequences over the planning horizon;
selecting an optimized track-train assignment sequence from the set of candidate track-train assignment sequences based on the determined cost; and
automatically sending, during execution of the optimized operating schedule, a control signal to a controller to cause execution of the optimized track-train assignment sequence.

### Claim 2 (depends on 1)

The method of claim 1, wherein an infeasible candidate track-train assignment sequence is a sequence that includes a track-train assignment for a first train followed by a track-train assignment for a second train to the same production track in which a time for processing the first train overlaps the processing time for the second train.

### Claim 3 (depends on 1)

The method of claim 1, wherein an infeasible candidate track-train assignment sequence is a sequence that includes one or more track-train assignments for one or more respective trains to be processed during one or more time increments of the planning horizon that are implausible to perform with resources predicted to be available during the one or more time increments.

### Claim 4 (depends on 1)

The method of claim 1, wherein identifying inbound and outbound trains scheduled to arrive at or depart from the hub over the planning horizon of the optimized operating schedule includes analyzing an active train schedule for the hub to determine the arrival and departure times of the inbound and outbound trains within the planning horizon.

### Claim 5 (depends on 1)

The method of claim 1, wherein identifying inbound and outbound trains scheduled to arrive at or depart from the hub over the planning horizon of the optimized operating schedule includes predicting the inbound and outbound trains scheduled to arrive at or depart from the hub based on historical data.

### Claim 6 (depends on 1)

The method of claim 1, wherein generating the set of candidate track-train assignment sequences is based on one or more of a predicted volume of units, resources predicted to be available at the hub, and constraints of the consolidated time-space network and the deconsolidated time-space network.

### Claim 7 (depends on 1)

The method of claim 1, wherein eliminating infeasible candidate track-train assignment sequences from the set of candidate track-train assignment sequences includes evaluating a compatibility of train types and processing requirements for sequential assignments on the same production track.

### Claim 8 (depends on 1)

The method of claim 1, wherein determining the cost associated with each remaining candidate track-train assignment sequence in the set of candidate track-train assignment sequences over the planning horizon includes quantifying an effort necessitated to position a latter train in a train pair of a candidate track-train assignment sequence, on the heels of departure of a former train in the train pair, while considering the constraints of the dual-stream optimization model.

### Claim 9 (depends on 1)

The method of claim 1, wherein selecting the optimized track-train assignment sequence from the set of candidate track-train assignment sequences based on the determined cost includes using a mathematical optimization model to minimize the total cost across all candidate track-train assignment sequences, taking into account operational constraints and objectives of the hub.

### Claim 10

A system configured for optimizing ramp operations in a hub facility, comprising:
at least one processor; and
a memory operably coupled to the at least one processor and storing processor-readable code that, when executed by the at least one processor, is configured to perform operations including:
identifying inbound and outbound trains scheduled to arrive at or depart from a hub over a planning horizon of an optimized operating schedule based on a dual-stream optimization model including a consolidated time-space network and a deconsolidated time-space network of the optimized operating schedule;
generating a set of candidate track-train assignment sequences involving the inbound and outbound trains and production tracks of the hub facility, wherein each candidate track-train assignment sequence in the set of candidate track-train assignment sequences defines a sequence of track-train assignments for a respective production track of the production tracks over the planning horizon, wherein a track-train assignments includes an assignment of one of the inbound and outbound trains to a particular production track for processing;
eliminating infeasible candidate track-train assignment sequences from the set of candidate track-train assignment sequences;
determining a cost, based on one or more effort matrices, associated with each remaining candidate track-train assignment sequence in the set of candidate track-train assignment sequences over the planning horizon;
selecting an optimized track-train assignment sequence from the set of candidate track-train assignment sequences based on the determined cost; and
automatically sending, during execution of the optimized operating schedule, a control signal to a controller to cause execution of the optimized track-train assignment sequence.

### Claim 11 (depends on 10)

The system of claim 10, wherein an infeasible candidate track-train assignment sequence is a sequence that includes a track-train assignment for a first train followed by a track-train assignment for a second train to the same production track in which a time for processing the first train overlaps the processing time for the second train.

### Claim 12 (depends on 10)

The system of claim 10, wherein an infeasible candidate track-train assignment sequence is a sequence that includes one or more track-train assignments for one or more respective trains to be processed during one or more time increments of the planning horizon that are implausible to perform with resources predicted to be available during the one or more time increments.

### Claim 13 (depends on 10)

The system of claim 10, wherein identifying inbound and outbound trains scheduled to arrive at or depart from the hub over the planning horizon of the optimized operating schedule includes analyzing an active train schedule for the hub to determine the arrival and departure times of the inbound and outbound trains within the planning horizon.

### Claim 14 (depends on 10)

The system of claim 10, wherein identifying inbound and outbound trains scheduled to arrive at or depart from the hub over the planning horizon of the optimized operating schedule includes predicting the inbound and outbound trains scheduled to arrive at or depart from the hub based on historical data.

### Claim 15 (depends on 10)

The system of claim 10, wherein generating the set of candidate track-train assignment sequences is based on one or more of a predicted volume of units, resources predicted to be available at the hub, and constraints of the consolidated time-space network and the deconsolidated time-space network.

### Claim 16 (depends on 10)

The system of claim 10, wherein eliminating infeasible candidate track-train assignment sequences from the set of candidate track-train assignment sequences includes evaluating a compatibility of train types and processing requirements for sequential assignments on the same production track.

### Claim 17 (depends on 10)

The system of claim 10, wherein determining the cost associated with each remaining candidate track-train assignment sequence in the set of candidate track-train assignment sequences over the planning horizon includes quantifying an effort necessitated to position a latter train in a train pair of a candidate track-train assignment sequence, on the heels of departure of a former train in the train pair, while considering the constraints of the dual-stream optimization model.

### Claim 18 (depends on 10)

The system of claim 10, wherein selecting the optimized track-train assignment sequence from the set of candidate track-train assignment sequences based on the determined cost includes using a mathematical optimization model to minimize the total cost across all candidate track-train assignment sequences, taking into account operational constraints and objectives of the hub.

### Claim 19

A computer-based tool for optimizing ramp operations in a hub facility, the computer-based tool including non-transitory computer readable media having stored thereon computer code which, when executed by a processor, causes a computing device to perform operations comprising:
identifying inbound and outbound trains scheduled to arrive at or depart from a hub over a planning horizon of an optimized operating schedule based on a dual-stream optimization model including a consolidated time-space network and a deconsolidated time-space network of the optimized operating schedule;
generating a set of candidate track-train assignment sequences involving the inbound and outbound trains and production tracks of the hub facility, wherein each candidate track-train assignment sequence in the set of candidate track-train assignment sequences defines a sequence of track-train assignments for a respective production track of the production tracks over the planning horizon, wherein a track-train assignments includes an assignment of one of the inbound and outbound trains to a particular production track for processing;
eliminating infeasible candidate track-train assignment sequences from the set of candidate track-train assignment sequences;
determining a cost, based on one or more effort matrices, associated with each remaining candidate track-train assignment sequence in the set of candidate track-train assignment sequences over the planning horizon;
selecting an optimized track-train assignment sequence from the set of candidate track-train assignment sequences based on the determined cost; and
automatically sending, during execution of the optimized operating schedule, a control signal to a controller to cause execution of the optimized track-train assignment sequence.

### Claim 20 (depends on 19)

The computer-based tool of claim 19, wherein an infeasible candidate track-train assignment sequence is a sequence that includes a track-train assignment for a first train followed by a track-train assignment for a second train to the same production track in which a time for processing the first train overlaps the processing time for the second train.
