# US 2025/0094883 A1 · Database operations and analysis for virtual interline of travel routes with feedback loop

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

- Number: US 2025/0094883 A1
- Document ID: US20250094883A1
- Status: Published application
- Kind: A1
- Application number: 18/370,398
- Filed: 2023-09-20
- Published: 2025-03-20
- Earliest claimed: 2023-09-18
- Assignees: Hopper S.r.l.
- Applicants: Hopper, Inc.
- Inventors: David G. D’Alessandro; Stephen Charles Pearson
- Web page: https://patentgrep.com/patent/US20250094883A1

## CPC

- G06Q 10/02: Reservations, e.g. for tickets, services or events
- G06Q 50/14: Travel agencies
- 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

A system and a method for generating and displaying candidate virtual interline routes for travel between an origin location and a destination location. The system identifies a set of candidate virtual interline routes based on the origin location and the destination location, each including multiple segments offered by different carriers that lack an interline agreement. Each route is associated with a weight determined based on historical data including user input. The routes are ranked based on the weights, and a subset is selected. The system retrieves from external data providers up-to-date data associated with the subset of candidate virtual interline routes, and displays the up-to-date data on a client device of a user.

## Claims

### Claim 1

A method implemented at a travel service system, the method comprising:
receiving, from a client device of a user by the travel service system, a request to book travel between an origin location and a destination location;
identifying a set of candidate virtual interline routes based on the origin location, the destination location, and a graph built based on historical user travel data, each candidate virtual interline route comprising a plurality of segments offered by different carriers among a plurality of carriers that lack an interline agreement, wherein the graph is a data structure including nodes and edges, each node corresponding to a travel hub locations and each edge linking nodes corresponding to travel segments based on historical user travel data;
retrieving a weight associated with each of the set of candidate virtual interline routes, wherein each weight associated with a candidate virtual interline route is determined based in part on prior user input associated with the candidate virtual interline route;
ranking the set of candidate virtual interline routes based on the weights;
selecting a subset of the set of candidate virtual interline routes based on the ranking;
requesting, by the travel service system, from one or more external data providers, data associated with segments of the subset of candidate virtual interline routes currently offered by the plurality of carriers; and
generating for display on the client device, by the travel service system, up-to-date data associated with the subset of candidate virtual interline routes.

### Claim 2 (depends on 1)

The method of claim 1, wherein the graph includes more than one hundred nodes and more than one hundred edges, and
wherein the up-to-date data associated with the subset of candidate virtual interline routes are displayed in an order based on the ranking.

### Claim 3 (depends on 1)

The method of claim 1, the method further comprising:
receiving a user selection of one of the displayed candidate virtual interline routes; and
updating a weight of at least one virtual interline route in the set of virtual interline routes based in part on the user selection.

### Claim 4 (depends on 3)

The method of claim 3, the method further comprising:
receiving, from a second client device, by the travel service system, a second request for booking travel between the origin location and the destination location;
reranking the set of candidate virtual interline routes based in part on the updated weight;
selecting a second subset of candidate virtual interline routes from the set of candidate virtual interline routes based on the reranked set of candidate virtual interline routes; and
generating for display on the second client device the up-to-date data associated with the second subset of candidate virtual interline routes.

### Claim 5 (depends on 1)

The method of claim 1, wherein the weight is further based on comparison between historical data associated with the candidate virtual interline route and historical data associated with a real route between the origin location and the destination location offered by one or more carriers with an interline agreement.

### Claim 6 (depends on 1)

The method of claim 1, the method further comprising:
requesting, by the travel service system, from the one or more external data providers up-to-date data associated with a set of real routes between the origin location and the destination location offered by a single carrier or carriers with an interline agreement;
determining a difference between a value of an attribute associated with at least one candidate virtual interline route in the subset of candidate virtual interline routes and a value of the attribute associated with at least one real route in the set of real routes; and
updating a weight of the at least one virtual interline route based in part on the difference between the values of the attribute associated with the at least one candidate virtual interline route and the at least one real route.

### Claim 7 (depends on 1)

The method of claim 1, wherein identifying the set of candidate virtual interline routes comprises:
accessing a route graph comprising nodes representing travel hub locations and edges connecting nodes representing segments of routes; and
applying a constraint function to the route graph to identify the set of candidate virtual interline routes.

### Claim 8 (depends on 7)

The method of claim 7, wherein each of the set of candidate virtual interline routes includes a set of attributes, and ranking of the set of candidate virtual interline routes comprises:
for each of the set of candidate virtual interline routes,
summarizing values of the set of attributes of the candidate virtual interline route into a score; and
applying the weight associated with the candidate virtual interline route to generate a weighted score; and
ranking the set of candidate virtual interline routes based on the weighted scores.

### Claim 9 (depends on 7)

The method of claim 7, wherein for each of the set of candidate virtual interline routes, a set of attributes are associated with each of a plurality of segments of the candidate virtual interline route, and the set of attributes for the candidate virtual interline routes are computed based on the set of attributes of the plurality of segments.

### Claim 10

A computer system comprising:
One or more processors; and
a non-transitory computer-readable storage medium having instructions encoded thereon that, when executed by the one or more processors, cause the one or more processors to:
receive, from a client device of a user, a request to book travel between an origin location and a destination location;
identify a set of candidate virtual interline routes based on the origin location, the destination location, and a graph built based on historical user travel data, each candidate virtual interline route comprising a first segment offered by a first carrier of a plurality of carriers and a second segment offered by a second carrier of the plurality of carriers that does not have an interline agreement with the first carrier, wherein the graph is a data structure including nodes and edges, each node corresponding to a travel hub locations and each edge linking nodes corresponding to travel segments based on historical user travel data;
retrieve a weight associated with each of the set of candidate virtual interline routes, wherein each weight associated with a candidate virtual interline route is determined based prior user input associated with the candidate virtual interline route;
rank the set of candidate virtual interline routes based in part on the weights;
select a subset of candidate virtual interline routes based on the ranking;
request, from one or more external data providers, up-to-date data associated with the subset of candidate virtual interline routes that are currently offered by a combination of one or more carriers among the plurality of carriers; and
generate for display on the client device up-to-date data associated with the subset of candidate virtual interline routes.

### Claim 11 (depends on 10)

The computer system of claim 10, wherein the graph includes more than one hundred nodes and more than one hundred edges, and
wherein the up-to-date data associated with the subset of candidate virtual interline routes are displayed in an order based on the ranking.

### Claim 12 (depends on 10)

The computer system of claim 10, wherein the instructions further cause the processor to:
receive a user selection of one of the displayed candidate virtual interline routes; and
update a weight of at least one virtual interline route in the set of virtual interline routes based in part on the user selection.

### Claim 13 (depends on 12)

The computer system of claim 12, the instructions further cause the processor to:
receive, from a second client device, a second request for booking travel between the origin location and the destination location;
rerank the set of candidate virtual interline routes based in part on the updated weight;
select a second subset of candidate virtual interline routes from the set of candidate virtual interline routes based on the reranked set of candidate virtual interline routes; and
generate for display on the second client device the up-to-date data associated with the second subset of candidate virtual interline routes.

### Claim 14 (depends on 10)

The computer system of claim 10, wherein the instructions further cause the processor to:
request from the one or more external data providers up-to-date data associated with a set of real routes between the origin location and the destination location offered by a single carrier or carriers with an interline agreement;
determine a difference between a value of an attribute associated with at least one candidate virtual interline route in the subset of candidate virtual interline routes and a value of the attribute associated with at least one real route in the set of real routes; and
update a weight of the at least one virtual interline route based in part on the difference between the values of the attribute associated with the at least one candidate virtual interline route and the at least one real route.

### Claim 15 (depends on 10)

The computer system of claim 10, wherein comparison between historical data associated with the candidate virtual interline route and historical data associated with a real route between the origin location and the destination location offered by a single carrier or carriers with an interline agreement.

### Claim 16 (depends on 10)

The computer system of claim 10, wherein the instructions further cause the processor to:
access a route graph comprising nodes representing travel hub locations and edges connecting nodes representing segments of routes; and
apply a constraint function to the route graph to identify the set of candidate virtual interline routes.

### Claim 17 (depends on 16)

The computer system of claim 16, wherein each of the set of candidate virtual interline routes includes a set of attributes, and ranking of the set of candidate virtual interline routes comprises:
for each of the set of candidate virtual interline route,
summarizing values of the set of attributes of the candidate virtual interline route into a score; and
applying the weight associated with the candidate virtual interline route to generate a weighted score; and
ranking the set of candidate virtual interline routes based on the weighted scores.

### Claim 18 (depends on 17)

The computer system of claim 17, wherein the weight of each candidate virtual interline route is associated with an attribute of each segment in the candidate virtual interline route.

### Claim 19

A computer program product, comprising a non-transitory computer-readable storage medium having instructions encoded thereon that, when executed by one or more processors, cause one or more processors to:
receive, from a client device of a user, a request to book travel between an origin location and a destination location;
identify a set of candidate virtual interline routes based on the origin location, the destination location, and a graph built based on historical user travel data, each candidate virtual interline route comprising a first segment offered by a first carrier of a plurality of carriers and a second segment offered by a second carrier of the plurality of carriers that does not have an interline agreement with the first carrier, wherein the graph is a data structure including nodes and edges, each node corresponding to a travel hub locations and each edge linking nodes corresponding to travel segments based on historical user travel data;
retrieve a weight associated with each of the set of candidate virtual interline routes, wherein each weight associated with a candidate virtual interline route is determined based prior user input associated with the candidate virtual interline route;
rank the set of candidate virtual interline routes based in part on the weights;
select a subset of candidate virtual interline routes based on the ranking;
request, from one or more external data providers, up-to-date data associated with the subset of candidate virtual interline routes that are currently offered by a combination of one or more carriers among the plurality of carriers; and
generate for display on the client device up-to-date data associated with the subset of candidate virtual interline routes.

### Claim 20 (depends on 19)

The computer program product of claim 19, wherein identifying the set of candidate virtual interline routes comprises:
accessing a route graph comprising nodes representing travel hub locations and edges connecting nodes representing segments of routes; and
applying a constraint function to the route graph to identify the set of candidate virtual interline routes.
