# US 2026/0065174 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/0065174 A1
- Document ID: US20260065174A1
- Status: Published application
- Kind: A1
- Application number: 19/307,727
- Filed: 2025-08-22
- 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/US20260065174A1

## CPC

- G06Q 10/047: Optimisation of routes or paths, e.g. travelling salesman problem
- G01C 21/343: {Calculating itineraries (travelling salesman problem G06Q10/04; optimisation of routes G06Q10/047)}
- G01C 21/3476: {using point of interest [POI] information, e.g. a route passing visible POIs}
- G01C 21/3626: {Details of the output of route guidance instructions (traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968)}
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G01C 21/3446: {Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags or using precalculated routes}
- 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
- 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)

## Abstract

Computer-implemented methods for optimising routes in a transport network for a geographical region are disclosed. Methods may include obtaining an analysis of the geographical region; generating probabilistic predictions; and checking whether at least a subset of the generated probabilistic predictions have previously been solved by a trained machine learning model. When at least a first subset of the generated probabilistic predictions have 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. When 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.

## Claims

### Claim 1

A computer-implemented method for optimising routes in a transport network for a geographical region, the method comprising:
by a processor configured to execute,
obtaining transport data relating to the geographical region, the transport data indicating current transport needs of transport users within the geographical region;
obtaining tourist data relating to the geographical region, the tourist data indicating tourist hotspots within the geographical region;
generating a 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 of the set of nodes indicating a location in the geographical region, each edge of the set of edges 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 graph into a plurality of subgraphs;
assessing each subgraph of the plurality of subgraphs in parallel to determine the relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs among the plurality of subgraphs to produce an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region.

### Claim 2 (depends on 1)

The method of claim 1, wherein the determining comprises:
checking whether there is a trained machine learning model associated with the geographical region;
when there is a trained machine learning model associated with the geographical region:
checking whether the graph has been previously assessed by the trained machine learning model to determine a relationship between the tourist hotspots and the current transport needs;
when the graph has been previously assessed, retrieving the assessed graph and providing the assessed graph as an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region;
when the graph has not been previously assessed:
dividing the graph into a plurality of subgraphs;
for each subgraph of the plurality of subgraphs, 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;
when the subgraph has been previously assessed, retrieving an assessed subgraph;
when the subgraph has not been previously assessed,
assessing the subgraph to determine a relationship between the tourist hotspots and the current transport needs, and
combining assessed subgraphs among the plurality of subgraphs to produce an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region;
when there is not a trained machine learning model for the geographical region:
dividing the graph into a plurality of subgraphs;
assessing each subgraph of the plurality of subgraphs in parallel to determine a relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs among the plurality of subgraphs to produce an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region.

### Claim 3 (depends on 1)

The method of claim 1, wherein the assessing comprises using a graph convolutional network (GCN), to weight the set of nodes of the subgraph based on nearby nodes and/or connected nodes.

### Claim 4 (depends on 3)

The method of claim 3, wherein the assessing comprises using anisotropic aggregation.

### Claim 5 (depends on 1)

The method of claim 1, wherein the processor is further configured to execute outputting the updated graph to a user.

### Claim 6 (depends on 1)

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

### Claim 7 (depends on 1)

The method of claim 1, wherein the processor is further configured to execute determining a plurality of suggested routes for the transport network based on the updated graph, and outputting the suggested routes to a user.

### Claim 8 (depends on 7)

The method of claim 7, wherein, the determining a plurality of suggested routes for the transport network comprises:
estimating respective probabilities of each of a plurality of possible trips within the geographical region, based on the updated graph; and
determining the suggested routes based on the respective probabilities.

### Claim 9 (depends on 7)

The method of claim 7, wherein the determining a plurality of suggested routes for the transport network comprises:
generating probabilistic predictions for each node and each edge of the updated graph, wherein the probabilistic predictions indicate an importance of each location and each route within the transport network;
checking if subsets of the generated probabilistic predictions have previously been solved by a trained machine learning model;
if at least a first subset among the subsets of the generated probabilistic predictions has previously been solved, retrieving the trained machine learning model previously used to solve the at least 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;
if at least a second subset among the subsets of the generated probabilistic predictions has not previously been solved, training a new machine learning model to solve the at least second subset of generated probabilistic predictions to determine a second plurality of suggested routes for the transport network.

### Claim 10 (depends on 9)

The method of claim 9, wherein the processor is further configured to execute outputting the first and/or second pluralities of suggested routes to a user.

### Claim 11 (depends on 9)

The method of claim 9, wherein the processor is further configured to execute 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 outputting the optimal transport network solution to a user.

### Claim 12 (depends on 1)

The method of claim 1, wherein the transport network comprises at least one transport network among transport networks including a Bus Rapid Transit (BR) system, a rail transport system, a bus transport system, and/or a waterborne transport system.

### Claim 13

A non-transitory computer readable medium storing a program which, when run on a computer, causes the computer to carry out a method for optimising routes in a transport network for a geographical region, the method comprising:
obtaining transport data relating to the geographical region, the transport data indicating current transport needs of transport users within the geographical region;
obtaining tourist data relating to the geographical region, the tourist data indicating tourist hotspots within the geographical region;
generating a 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 of the set of nodes indicating a location in the geographical region, each edge of the set of edges 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 graph into a plurality of subgraphs;
assessing each subgraph of the plurality of subgraphs in parallel to determine the relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs among the plurality of subgraphs to produce an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region.

### Claim 14

An information processing apparatus comprising a processor configured to communicate with a memory, wherein the processor is configured to perform a method for optimising routes in a transport network for a geographical region, the method comprising:
obtaining transport data relating to the geographical region, the transport data indicating current transport needs of transport users within the geographical region;
obtaining tourist data relating to the geographical region, the tourist data indicating tourist hotspots within the geographical region;
generating a 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 of the set of nodes indicating a location in the geographical region, each edge of the set of edges 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 graph into a plurality of subgraphs;
assessing each subgraph of the plurality of subgraphs in parallel to determine the relationship between the tourist hotspots and the current transport needs; and
combining the assessed subgraphs among the plurality of subgraphs to produce an updated graph representing the relationship between the tourist hotspots and the current transport needs for the geographical region.
