Method for determining the number of available transport seats in a computerized reservation system

• US 8,117,051 B2
• Filed: 06/13/2003
• Issued: 02/14/2012
• Est. Priority Date: 07/22/2002
• Status: Active Grant

• Current Assignee: Amadeus (Amadeus Global Travel Distribution S.A.)
• Original Assignee: Amadeu SAS
• Inventors: Sauvage, Jean-Michel, Arnaud, Denis, Viale, Valerie
• Primary Examiner(s): Hayes, John
• Assistant Examiner(s): JOSEPH, TONYA S
• Application Number:
  US10/521,965
• Publication Number:
  US 20050278201A1
• Time in Patent Office: 3,168 Days
• Field of Search: 705 5- 6
• US Class Current: 705/5
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation

Abstract

A process for determining the number of available transport seats in a computerized reservation system, which includes elements for storing data on services that provide transportation between two locations and their current reservation status, broken down by class of service, a process in which, at a predefined level of expected revenue, a number of seats available locally for a given class of service of a transport service is determined. The following process are carried out:

• • selection of at least one other class of service of a transport service;
  • determination of the number of seats available locally for the class of service of the transport service, at the predefined level of expected revenue;
  • determination of an overall number of seats available for the class of service of the transport service at the predefined level of expected revenue as a function of the different numbers of seats available locally.

Claims

1. A method for determining a number of transport seats available in a computerized reservation system that comprises means for storing data on services that provide transportation between two locations and their current reservation status, broken down by class of service, the method comprising:

receiving an availability request at a computer system for at least one seat on a given transport service (F_i) between the two locations;

in response to receiving the availability request, determining at the computer system, at a predefined level of expected revenue (Y), a number of seats locally available av_Fik(Y) for the given class of service (k) on the given transport service (F_i) between said two locations;

selecting at least one other class of service (k′

) of another transport service (F_j) between said two locations;

determining at the computer system the number of locally available seats av_Fik′

(Y) for the class of service (k′

) of the another transport service (F_j) at the predefined level of expected revenue (Y);

determining, for the given class of service (k) on the given transport service (F_i), an overall number of available seats XFAV_Fik(Y) at the predefined level of expected revenue (Y) as a function of the numbers of locally available seats (av_FikY) av_Fjk′

(Y)) determined for the given transport service (F_i) and the at least another transport service (F_j) between said two locations,

where the given transport service (F_i) between said two locations is a journey consisting only of a single leg;

using the overall number of available seats XFAV_FIk(Y) as an availability capacity when considering the availability request for the given class of service (k) on the given transport service (F_i) between said two locations, and

replying favorably to the availability request upon the overall number of available seats XFAV_Fik(Y) being sufficient to serve the requested at least one seat, where the method executed by the computer system further comprises assigning to each class of service a boundary transfer value (SP^max);

using the boundary transfer value (SP^max) as the maximum number of reservation requests for the class of service transferrable to seats on other classes of service;

for each class of service, a number of transferable reservation requests (SP(Y)) is determined that is equal to;

either zero, if the number of seats available locally for said class of service (k) is positive, or the inverse of the number of seats available locally for said class of service (k) if said number is negative and its inverse is less than the boundary transfer value (SP^max);

or the boundary transfer value (SP^max) if the number of seats available locally is negative and its inverse is greater than or equal to said boundary transfer value (SP^max);

for each class of service an acceptable number of reservation requests (SA(Y)) is determined that is equal to;

either zero, if the number of seats available locally for said class of service av(Y) is less than or equal to zero;

or the number of seats available locally for said class of service av_k(Y) if this number is positive; and

where

a total acceptance capacity TSA_Fik(Y) for the class of service (k) is determined by selecting the minimum (Min) value from the boundary transfer value (SP_Fik^max) of the given class of service (k) and a summation (Σ

) of the numbers of acceptable reservation requests (SA_Fik′

(Y)) for the classes of service (k′

) of transport services (Fj) to which the given class of service (k) is transferrable, in accordance with;

2. The method according to claim 1, wherein:

the overall number of available seats XFAV_Fik(Y) is determined by adding up the numbers of seats available locally (av_Fik(Y), av_Fik′

(Y)) determined for the given transport service (F_i) and the at least another transport service (F_j) between said two locations.

3. The method according to claim 1, wherein:

to each class of service a boundary acceptance value (SA^max) is assigned that corresponds to the maximum number of seats in said class of service useable to transfer reservation requests on other classes of service;

an upper limit that is equal to the boundary acceptance value (SA^max) is assigned to the number of acceptable reservation requests.

4. The method according to claim 1, wherein:

a single other class of service (k′

) that belongs to another transport service (F_j) is selected;

the total acceptance capacity (TSA_k) from the other class of service (k′

) for the given class of service (k) is determined by selecting the minimum value from the boundary transfer value (SPF_jk^max) of the given class of service (k) and the number of acceptable reservation requests (SA_Fjk′

(Y)) on said other class of service (k′

), the total transfer capacity (TSP_k) on said other class of service (k′

) is determined on the given class of service (k) by selecting the minimum value from the number of transferable reservation requests for the other class of service (k′

) (SP_Fjk′

(Y)) and the number of acceptable reservation requests on the given class of service (k) (SA_Fjk(Y)), the overall number of available seats XFAV_Fik(Y) is calculated by;

adding the number of seats available locally av_Fik(Y) and the total acceptance capacity TSA_Fik(Y), and subtracting therefrom the total transfer capacity TSP_Fik(Y).

5. The method according to claim 3, wherein:

a transport service chain (Fi) is formed that has successive departure times and where each departure time has a selected class of service (k, k′

), an index i is assigned to each transport service, whereby the value of said index increases with the time of departure, for each class of service (k) of a given transport service (Fi), the classes of service (k′

) of the transport service are selected that have a lower index to which the reservation requests on the class of service of the given transport service (Fi) are transferrable.

6. The method according to claim 1, wherein:

the total transfer capacity TSP_Fik from all of the other classes of service to a class of service (k) is determined from the update of the number of acceptable reservation requests to said class of service (k).

7. The method according to claim 6, wherein:

the overall number of available seats XFAV_Fik (Y) is calculated by;

adding the number of seats available locally av_Fik(Y) and the total acceptance capacity TSA_Fik(Y), and subtracting therefrom the total transfer capacity TSP_Fik(Y).

8. The method according to claim 1, wherein:

the steps in the process are carried out each time there is an availability request from a customer.

9. The method according to claim 5, wherein:

the total transfer capacity TSP_Fik from all of the other classes of service to a class of service (k) is determined from the update of the number of acceptable reservation requests to said class of service (k).

10. A method for determining a number of transport seats available in a computerized reservation system that comprises means for storing data on flights between locations, the method comprising:

receiving an availability request at a computer system for at least one seat on a first flight (F_i) between two locations;

in response to receiving the availability request, determining at the computer system, at a predefined level of expected revenue (Y), a number of seats locally available av_Fik(Y) for a given class of service (k) on a flight leg of the first flight (F₁) between the two locations;

selecting at least one other class of service (k′

) of a second flight (F_i) between the two locations;

determining at the computer system a number of locally available seats av_Fkj′

(Y) for the class of service (k′

) on a flight leg of the second flight (F_j) between the two locations, at the predefined level of expected revenue (Y);

determining at the computer system, for the given class of service (k) on the flight leg of the first flight (F_i), an overall number of available seats at the predefined level of expected revenue (Y) as a sum of the numbers of locally available seats (av_Fik(Y), av_Fik′

(Y)) that were determined for the flight leg of the first flight between the two locations and for the flight leg of the second flight between the two locations;

using the determined overall number of available seats as an availability capacity when considering an availability request for the given class of service (k) on the flight leg of the first flight (F_i) between the two locations; and

replying favorably to the availability request upon the overall number of available seats being sufficient to serve the availability request, where the method executed by the computer system further comprises assigning to each class of service a boundary transfer value (SP^max);

using the boundary transfer value (SP^max) as the maximum number of reservation requests for the class of service transferrable to seats on other classes of service;

for each class of service, a number of transferable reservation requests (SP(Y)) is determined that is equal to;

either zero, if the number of seats available locally for said class of service (k) is positive, or the inverse of the number of seats available locally for said class of service (k) if said number is negative and its inverse is less than the boundary transfer value (SP^max);

or the boundary transfer value (SP^max) if the number of seats available locally is negative and its inverse is greater than or equal to said boundary transfer value (SP^max);

for each class of service, an acceptable number of reservation requests (SA(Y)) is determined that is equal to;

either zero, if the number of seats available locally for said class of service av(Y) is less than or equal to zero;

or the number of seats available locally for said class of service av_k(Y) if this number is positive; and

where

a total acceptance capacity TSA_Fik(Y) for the class of service (k) is determined by selecting the minimum (Min) value from the boundary transfer value (SP_Fik^max)of the given class of service (k) and a summation (Σ

) of the numbers of acceptable reservation requests (SA_Fik′

(Y)) for the classes of service (k′

) of transport services (Fj) to which the given class of service (k) is transferrable, in accordance with