# US 2026/0065175 A1 · Optimising transport routes

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

- Number: US 2026/0065175 A1
- Document ID: US20260065175A1
- Status: Published application
- Kind: A1
- Application number: 19/309,047
- Filed: 2025-08-25
- Published: 2026-03-05
- Earliest claimed: 2024-08-30
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Manuel PEÑA MUÑOZ
- Web page: https://patentgrep.com/patent/US20260065175A1

## CPC

- G01C 21/3446: {Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes}
- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G01C 21/3423: {Multimodal routing}
- G01C 21/3476: {using point of interest [POI] information, e.g. a route passing visible POIs}
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06Q 50/14: Travel agencies
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G06Q 50/47: Passenger ride requests, e.g. ride-hailing
- G01C: MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY (measuring liquid level G01F; radio navigation, determining distance or velocity by use of propagation effects, e.g. Doppler effects, propagation time, of radio waves, analogous arrangements using other waves G01S)
- 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
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Computer-implemented methods optimising routes in a transport network for a geographical region are disclosed. Methods comprise obtaining an analysis of the geographical region; generating probabilistic predictions, checking whether at least a subset of the generated probabilistic predictions have previously been solved by a trained machine learning model; based on at least a first subset of the generated probabilistic predictions having previously been solved, retrieving the trained machine learning model previously used to solve the at least a first subset of the generated probabilistic predictions and executing the trained machine learning model to determine a first plurality of suggested routes for the transport network; based on at least a second subset of the generated probabilistic predictions not having previously been solved, training a new machine learning model to solve the at least a second subset of generated probabilistic predictions to determine a second plurality of suggested routes for the transport network.

## Claims

### Claim 1

A computer-implemented method for optimising routes in a transport network for a geographical region, the computer-implemented method comprising:
obtaining an analysis of the geographical region, the analysis including a graph indicating a relationship between current transport needs of transport users and tourist hotspots in the geographical region, and the graph including a set of nodes and a set of edges, each node indicating a location in the geographical region, each edge indicating a route between two locations;
generating probabilistic predictions, for each node and each edge of the graph, which indicate an importance of each location and each route within the transport network;
checking whether at least a subset of the generated probabilistic predictions have previously been solved by a trained machine learning model;
based on at least a first subset of the generated probabilistic predictions having previously been solved, retrieving the trained machine learning model previously used to solve the at least the first subset of the generated probabilistic predictions and executing the trained machine learning model to determine a first plurality of suggested routes for the transport network;
based on at least a second subset of the generated probabilistic predictions have not previously been solved, training a new machine learning model to solve the at least a second subset of generated probabilistic predictions to determine a second plurality of suggested routes for the transport network.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising, outputting the first and/or second pluralities of suggested routes to a user.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, further comprising processing the first and/or the second pluralities of suggested routes with information relating to the geographical region and the transport network to produce an optimal transport network solution, and optionally, outputting the optimal transport network solution to a user.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, wherein obtaining the analysis of the geographical region comprises:
obtaining transport data relating to the geographical region, the transport data indicating the current transport needs of transport users within the geographical region;
obtaining tourist data relating to the geographical region, the tourist data indicating the tourist hotspots within the geographical region;
generating a preliminary graph based on the transport data and the tourist data, wherein the graph comprises a set of nodes and a set of edges, each node indicating a location in the geographical region, each edge indicating a route between two locations, wherein the graph indicates the current transport needs of transport users and the tourist hotspots within the geographical region;
determining a relationship between the tourist hotspots and the current transport needs, wherein the determining comprises:
dividing the preliminary graph into a plurality of subgraphs;
assessing each subgraph in parallel to determine the relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs to produce the graph indicating the relationship between current transport needs of transport users and tourist hotspots in the geographical region.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the determining comprises:
checking whether there is a trained machine learning model associated with the geographical region;
based on there being a trained machine learning model associated with the geographical region:
checking whether the preliminary graph has been previously assessed by the trained machine learning model to determine a relationship between the tourist hotspots and the current transport needs;
based on the preliminary graph having been previously assessed, retrieving a corresponding assessed graph and providing this as the graph;
based on the preliminary graph not having been previously assessed:
dividing the preliminary graph into a plurality of subgraphs;
for each subgraph, in parallel:
checking whether the subgraph has been previously assessed by the trained machine learning model to determine a relationship between the tourist hotspots and the current transport needs;
based on the subgraph having been previously assessed, retrieving a corresponding assessed subgraph;
based on the subgraph not having been previously assessed, assessing the subgraph to determine a relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs to produce the graph;
based on there being no a trained machine learning model for the geographical region:
dividing the preliminary graph into a plurality of subgraphs;
assessing each subgraph in parallel to determine a relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs to produce the graph.

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, wherein the assessing comprises using a graph convolutional network, GCN, to weight the nodes of the subgraph based on nearby nodes and/or connected nodes.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, wherein the assessing comprises using anisotropic aggregation.

### Claim 8 (depends on 4)

The computer-implemented method of claim 4, further comprising outputting the graph to a user.

### Claim 9 (depends on 4)

The computer-implemented method of claim 4, wherein the transport data is filtered to remove transport data relating to trips occurring less frequently than a pre-determined threshold.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the transport network comprises a Bus Rapid Transit, BRT, system, a rail transport system, a bus transport system, and/or a waterborne transport system.

### Claim 11 (depends on 1)

A computer program executable on a computer to cause the computer to perform the computer-implemented method of claim 1.

### Claim 12 (depends on 1)

An information processing apparatus comprising a memory and a processor connected to the memory, wherein the processor is configured to perform the computer-implemented method of claim 1.
