# US 2025/0156437 A1 · Computer architecture for dispatch platform

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

- Number: US 2025/0156437 A1
- Document ID: US20250156437A1
- Status: Published application
- Kind: A1
- Application number: 18/941,593
- Filed: 2024-11-08
- Published: 2025-05-15
- Earliest claimed: 2023-11-10
- Assignees: Sabava LLC
- Applicants: Sabava LLC
- Inventors: Vahid Disfani
- Web page: https://patentgrep.com/patent/US20250156437A1

## CPC

- G06Q 10/08355: {Routing methods}
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G06F 16/254: {Extract, transform and load [ETL] procedures, e.g. ETL data flows in data warehouses}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- 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/0838: {Historical data}
- G06N 3/045: Combinations of networks
- G06N 3/08: Learning methods
- 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
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A server transforms, by an input formatting engine, load data from a plurality of load data sources into a standardized load format. The server transforms, by the input formatting engine, truck data from a plurality of truck data sources into a standardized truck format. The server obtains, by a multilayered graph neural network, the load data in the standardized load format and the truck data in the standardized truck format. The server generates, by the multilayered graph neural network, load-truck matches matching at least one load to at least one truck based on the load data, the truck data, and a set of global constraints stored in a constraint data repository. The server transforms, by a match formatting engine, the load-truck matches into a match format for storage in a match data repository. The server transmits the load-truck matches in the match format to the match data repository.

## Claims

### Claim 1

A method comprising:
transforming, by an input formatting engine of a server, load data from a plurality of load data sources into a standardized load format;
transforming, by the input formatting engine, truck data from a plurality of truck data sources into a standardized truck format;
obtaining, by a multilayered graph neural network of the server, the load data in the standardized load format and the truck data in the standardized truck format;
generating, by the multilayered graph neural network, load-truck matches matching at least one load to at least one truck based on the load data, the truck data, and a set of global constraints stored in a constraint data repository;
transforming, by a match formatting engine, the load-truck matches into a match format for storage in a match data repository; and
transmitting, by the server, the load-truck matches in the match format to the match data repository.

### Claim 2 (depends on 1)

The method of claim 1, wherein generating the load-truck matches comprises:
generating a graph data structure representing the load data and the truck data, the graph data structure comprising nodes corresponding to individual loads and trucks, and edges representing potential matches between loads and trucks;
evaluating each edge based on learned dependencies among features in the load data, the truck data, and the global constraints; and
iteratively adjusting edge weights to optimize at least one numeric value by selecting a first subset of the edges and rejecting a second subset of the edges, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a dashboard layout that includes multiple interactive panels displaying key performance indicators related to at least one of the load-truck matches, wherein the key performance indicators comprise at least one of: a profit, a revenue per mile, a fuel cost, a mileage travelled, or a deadhead percentage.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a visual map interface that graphically represents a route associated with at least one load-truck match, the visual map interface including at least one of: an origin location, a destination location, a route path, or an estimated travel time, the visual map interface comprising a visually indicated line to indicate a status of at least one route segment.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a filter and search toolbar, the filter and search toolbar enabling a user of the client device to sort and filter load-truck matches based on criteria, the criteria comprising at least one of a distance, driver availability, compliance status, or load type.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a load-truck matching matrix indicating the load-truck matches in cell of the matrix;
receiving, from the client device, an indication of a selection of a cell of the matrix;
causing display, at the client device and in response to the indication of the selection, of additional data related to a load-truck match of the cell.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a dashboard comprising at least one graph indicating at least one of a truck utilization rate, a mileage rate, a profit rate, a revenue rate, or a match rate of loads to trucks.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a truck view interface indicating loads assigned to at least one truck; and
transmitting, to a computing device associated with the at least one truck, an indication the loads assigned to the at least one truck and a proposed route for the at least one truck.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a modification interface for a user of the client device to manually assign a first load to a first truck or to manually remove an assignment of a second load to a second truck.

### Claim 10 (depends on 1)

The method of claim 1, wherein the features comprise at least one of a load location, a truck location, a load departure time range, a load delivery time range, a truck location constraint, a revenue potential, or a compliance constraint of the global constraints.

### Claim 11 (depends on 1)

The method of claim 1, wherein the at least one numeric value comprises or is determined based on at least one of a revenue value, a cost value, a profit value, a carbon emission value, or a mileage value.

### Claim 12 (depends on 1)

The method of claim 1, wherein the load data comprises a first set of mandatory loads and a second set of optional loads, wherein the load-truck matches include the first set of mandatory loads and a subset of the second set of optional loads.

### Claim 13 (depends on 1)

The method of claim 1, wherein the multilayered graph neural network comprises at least one input layer, one or more hidden layers, and an output layer, wherein:
the input layer receives node features representing attributes of loads from the load data and attributes of trucks from the truck data;
the hidden layers perform graph convolutional operations that aggregate information from neighboring nodes and edges to capture relationships between loads and trucks; and
the output layer generates a matching score for each load-truck pairing based on the aggregated node and edge features, the load-truck matches being generated based on the matching score.

### Claim 14 (depends on 1)

The method of claim 1, wherein the multilayered graph neural network is configured to iteratively adjust the edge weights by:
using a message-passing sub-engine to transmit information between connected nodes, allowing each node to update its state based on a state of a neighboring node or an attribute of an edge connecting to the node, and
using a gradient-based optimization sub-engine to adjust weights of the edges based on optimizing the at least one numeric value.

### Claim 15

A non-transitory computer-readable medium storing instructions operable to cause one or more processors to perform operations comprising:
transforming, by an input formatting engine of a server, load data from a plurality of load data sources into a standardized load format;
transforming, by the input formatting engine, truck data from a plurality of truck data sources into a standardized truck format;
obtaining, by a multilayered graph neural network of the server, the load data in the standardized load format and the truck data in the standardized truck format;
generating, by the multilayered graph neural network, load-truck matches matching at least one load to at least one truck based on the load data, the truck data, and a set of global constraints stored in a constraint data repository;
transforming, by a match formatting engine, the load-truck matches into a match format for storage in a match data repository; and
transmitting, by the server, the load-truck matches in the match format to the match data repository.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein generating the load-truck matches comprises:
generating a graph data structure representing the load data and the truck data, the graph data structure comprising nodes corresponding to individual loads and trucks, and edges representing potential matches between loads and trucks;
evaluating each edge based on learned dependencies among features in the load data, the truck data, and the global constraints; and
iteratively adjusting edge weights to optimize at least one numeric value by selecting a first subset of the edges and rejecting a second subset of the edges, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, the operations further comprising:
causing display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a dashboard layout that includes multiple interactive panels displaying key performance indicators related to at least one of the load-truck matches, wherein the key performance indicators comprise at least one of: a profit, a revenue per mile, a fuel cost, a mileage travelled, or a deadhead percentage.

### Claim 18

A system, comprising:
a memory subsystem storing instructions; and
processing circuitry configured to execute the instructions to:
transform, by an input formatting engine of a server, load data from a plurality of load data sources into a standardized load format;
transform, by the input formatting engine, truck data from a plurality of truck data sources into a standardized truck format;
obtain, by a multilayered graph neural network of the server, the load data in the standardized load format and the truck data in the standardized truck format;
generate, by the multilayered graph neural network, load-truck matches matching at least one load to at least one truck based on the load data, the truck data, and a set of global constraints stored in a constraint data repository;
transform, by a match formatting engine, the load-truck matches into a match format for storage in a match data repository; and
transmit, by the server, the load-truck matches in the match format to the match data repository.

### Claim 19 (depends on 18)

The system of claim 18, the processing circuitry further configured to execute the instructions to:
cause display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a dashboard layout that includes multiple interactive panels displaying key performance indicators related to at least one of the load-truck matches, wherein the key performance indicators comprise at least one of: a profit, a revenue per mile, a fuel cost, a mileage travelled, or a deadhead percentage.

### Claim 20 (depends on 18)

The system of claim 18, the processing circuitry further configured to execute the instructions to:
cause display, at a client device communicating with the server, of a graphical user interface representing the load-truck matches, wherein the graphical user interface comprises a visual map interface that graphically represents a route associated with at least one load-truck match, the visual map interface including at least one of: an origin location, a destination location, a route path, or an estimated travel time, the visual map interface comprising a visually indicated line to indicate a status of at least one route segment.
