# US 2025/0145191 A1 · System and Method for Optimizing Utilization of Parking Lot Resources 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/0145191 A1
- Document ID: US20250145191A1
- Status: Published application
- Kind: A1
- Application number: 18/911,387
- 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/US20250145191A1

## CPC

- B61L 27/16: Trackside optimisation of vehicle or train operation
- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06Q 10/063: Operations research, analysis or management
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- B61L 27/12: Preparing schedules
- G06Q 2240/00: Transportation facility access, e.g. fares, tolls or parking
- 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 utilization of parking lots of a hub based on a dual-stream resource optimization (DSRO). In embodiments, an optimized operating schedule over a planning horizon may be obtained, including predictions of units arriving at the hub through a consolidation stream and/or a deconsolidation stream during each time increment of the planning horizon. In embodiments, a unit is received at the hub during a first time increment of the planning horizon of the optimized operating schedule, a dwell time of the unit over the planning horizon ids determined, the unit is classified based on the dwell time of the unit over the planning horizon, and the unit is assigned to a parking lot associated with the hub based on the classification of the unit and a prediction of units to be processed during remaining time increments of the planning horizon after the first time increment.

## Claims

### Claim 1

A method of optimizing utilization of parking lots associated with a hub, comprising:
obtaining an optimized operating schedule including a consolidated time-space network and a deconsolidated time-space network over a planning horizon, wherein the optimized operating schedule includes a prediction of units to be processed at the hub during each time increment of the planning horizon;
receiving a unit at the hub during a first time increment of the planning horizon of the optimized operating schedule;
determining a dwell time of the unit over the planning horizon;
classifying the unit based on the dwell time of the unit over the planning horizon; and
assigning the unit to a parking lot associated with the hub based on the classification of the unit and a prediction of units to be processed during remaining time increments of the planning horizon after the first time increment.

### Claim 2 (depends on 1)

The method of claim 1, wherein the prediction of units to be processed at the hub during each time increment of the planning horizon includes a prediction of units to flow through a consolidation stream associated with the consolidated time-space network during each time increment of the planning horizon.

### Claim 3 (depends on 2)

The method of claim 2, wherein the unit received at the hub is to flow through the consolidation stream; and wherein determining the dwell time of the unit over the planning horizon includes determining the dwell time of the unit over the planning horizon based on a unit-to-train assignment system configured to assign the unit to a train based on a known train schedule.

### Claim 4 (depends on 1)

The method of claim 1, wherein the prediction of units to be processed at the hub during each time increment of the planning horizon includes a prediction of units to flow through a deconsolidation stream associated with the deconsolidated time-space network during each time increment of the planning horizon.

### Claim 5 (depends on 4)

The method of claim 4, wherein the unit received at the hub is to flow through the deconsolidation stream; and wherein determining the dwell time of the unit over the planning horizon includes predicting the dwell time of the unit over the planning horizon using a dwell time prediction model.

### Claim 6 (depends on 1)

The method of claim 1, wherein classifying the unit based on the dwell time of the unit over the planning horizon includes classifying the unit into one of:
a short dwell time unit when the dwell time of the unit over the planning horizon is determined to be less than a first threshold;
a medium dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the first threshold and less than a second threshold;
a long dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the second threshold and less than a third threshold;
a prediction of extremely long dwell time units to be processed at the hub during the time increment; and
an extremely long dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the third threshold and less than a fourth threshold.

### Claim 7 (depends on 6)

The method of claim 6, wherein the prediction of units to be processed at the hub during a time increment of the planning horizon includes one or more of:
a prediction of short dwell time units to be processed at the hub during the time increment;
a prediction of medium dwell time units to be processed at the hub during the time increment; and
a prediction of long dwell time units to be processed at the hub during the time increment.

### Claim 8 (depends on 1)

The method of claim 1, wherein assigning the unit to a parking lot associated with the hub is further based on a number of available spaces in the parking lot.

### Claim 9 (depends on 1)

The method of claim 1, wherein parking lot associated with the hub include one or more of:
trackside parking lots including parking lots within a first distance of a ramping or deramping track;
hub parking lots including parking lots within a second distance of the ramping or deramping track, the second distance greater than the first distance;
off-site parking lots including parking lots outside of the hub; and
stacked parking lots including parking lots with units stacked over each other.

### Claim 10 (depends on 1)

The method of claim 1, wherein assigning the unit to a parking lot associated with the hub includes:
assigning the unit to a highest priority parking lot available based on parking lot spaces currently available at the highest priority parking lot and parking lot spaces available based on a number of higher-priority units predicted to be processed during the remaining time increments of the planning horizon after the first time increment.

### Claim 11

A system configured to optimize utilization of resources in a train yard, 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:
obtaining an optimized operating schedule including a consolidated time-space network and a deconsolidated time-space network over a planning horizon, wherein the optimized operating schedule includes a prediction of units to be processed at the hub during each time increment of the planning horizon;
receiving a unit at the hub during a first time increment of the planning horizon of the optimized operating schedule;
determining a dwell time of the unit over the planning horizon;
classifying the unit based on the dwell time of the unit over the planning horizon; and
assigning the unit to a parking lot associated with the hub based on the classification of the unit and a prediction of units to be processed during remaining time increments of the planning horizon after the first time increment.

### Claim 12 (depends on 11)

The system of claim 11, wherein the prediction of units to be processed at the hub during each time increment of the planning horizon includes a prediction of units to flow through a consolidation stream associated with the consolidated time-space network during each time increment of the planning horizon.

### Claim 13 (depends on 12)

The system of claim 12, wherein the unit received at the hub is to flow through the consolidation stream; and wherein determining the dwell time of the unit over the planning horizon includes determining the dwell time of the unit over the planning horizon based on a unit-to-train assignment system configured to assign the unit to a train based on a known train schedule.

### Claim 14 (depends on 11)

The system of claim 11, wherein the prediction of units to be processed at the hub during each time increment of the planning horizon includes a prediction of units to flow through a deconsolidation stream associated with the deconsolidated time-space network during each time increment of the planning horizon.

### Claim 15 (depends on 14)

The system of claim 14, wherein the unit received at the hub is to flow through the deconsolidation stream; and wherein determining the dwell time of the unit over the planning horizon includes predicting the dwell time of the unit over the planning horizon using a dwell time prediction model.

### Claim 16 (depends on 11)

The system of claim 11, wherein classifying the unit based on the dwell time of the unit over the planning horizon includes classifying the unit into one of:
a short dwell time unit when the dwell time of the unit over the planning horizon is determined to be less than a first threshold;
a medium dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the first threshold and less than a second threshold;
a long dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the second threshold and less than a third threshold; and
an extremely long dwell time unit when the dwell time of the unit over the planning horizon is determined to be equal to or more than the third threshold and less than a fourth threshold.

### Claim 17 (depends on 16)

The system of claim 16, wherein the prediction of units to be processed at the hub during a time increment of the planning horizon includes one or more of:
a prediction of short dwell time units to be processed at the hub during the time increment;
a prediction of medium dwell time units to be processed at the hub during the time increment;
a prediction of long dwell time units to be processed at the hub during the time increment; and
a prediction of extremely long dwell time units to be processed at the hub during the time increment.

### Claim 18 (depends on 11)

The system of claim 11, wherein parking lot associated with the hub include one or more of:
trackside parking lots including parking lots within a first distance of a ramping or deramping track;
hub parking lots including parking lots within a second distance of the ramping or deramping track, the second distance greater than the first distance;
off-site parking lots including parking lots outside of the hub; and
stacked parking lots including parking lots with units stacked over each other.

### Claim 19 (depends on 11)

The system of claim 11, wherein assigning the unit to a parking lot associated with the hub includes:
assigning the unit to a highest priority parking lot available based on parking lot spaces currently available at the highest priority parking lot and parking lot spaces available based on a number of higher-priority units predicted to be processed during the remaining time increments of the planning horizon after the first time increment.

### Claim 20

A computer-based tool for optimizing utilization of resources in a train yard, 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:
obtaining an optimized operating schedule including a consolidated time-space network and a deconsolidated time-space network over a planning horizon, wherein the optimized operating schedule includes a prediction of units to be processed at the hub during each time increment of the planning horizon;
receiving a unit at the hub during a first time increment of the planning horizon of the optimized operating schedule;
determining a dwell time of the unit over the planning horizon;
classifying the unit based on the dwell time of the unit over the planning horizon; and
assigning the unit to a parking lot associated with the hub based on the classification of the unit and a prediction of units to be processed during remaining time increments of the planning horizon after the first time increment.
