Method for determining the number of available transport seats in a computerized reservation system
First Claim
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 (Fi) 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 avFik(Y) for the given class of service (k) on the given transport service (Fi) between said two locations;
selecting at least one other class of service (k′
) of another transport service (Fj) between said two locations;
determining at the computer system the number of locally available seats avFik′
(Y) for the class of service (k′
) of the another transport service (Fj) at the predefined level of expected revenue (Y);
determining, for the given class of service (k) on the given transport service (Fi), an overall number of available seats XFAVFik(Y) at the predefined level of expected revenue (Y) as a function of the numbers of locally available seats (avFikY) avFjk′
(Y)) determined for the given transport service (Fi) and the at least another transport service (Fj) between said two locations,where the given transport service (Fi) between said two locations is a journey consisting only of a single leg;
using the overall number of available seats XFAVFIk(Y) as an availability capacity when considering the availability request for the given class of service (k) on the given transport service (Fi) between said two locations, andreplying favorably to the availability request upon the overall number of available seats XFAVFik(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 (SPmax);
using the boundary transfer value (SPmax) 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 (SPmax);
or the boundary transfer value (SPmax) if the number of seats available locally is negative and its inverse is greater than or equal to said boundary transfer value (SPmax);
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 avk(Y) if this number is positive; and
wherea total acceptance capacity TSAFik(Y) for the class of service (k) is determined by selecting the minimum (Min) value from the boundary transfer value (SPFikmax) of the given class of service (k) and a summation (Σ
) of the numbers of acceptable reservation requests (SAFik′
(Y)) for the classes of service (k′
) of transport services (Fj) to which the given class of service (k) is transferrable, in accordance with;
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
10 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 (Fi) 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 avFik(Y) for the given class of service (k) on the given transport service (Fi) between said two locations; selecting at least one other class of service (k′
) of another transport service (Fj) between said two locations;determining at the computer system the number of locally available seats avFik′
(Y) for the class of service (k′
) of the another transport service (Fj) at the predefined level of expected revenue (Y);determining, for the given class of service (k) on the given transport service (Fi), an overall number of available seats XFAVFik(Y) at the predefined level of expected revenue (Y) as a function of the numbers of locally available seats (avFikY) avFjk′
(Y)) determined for the given transport service (Fi) and the at least another transport service (Fj) between said two locations,where the given transport service (Fi) between said two locations is a journey consisting only of a single leg; using the overall number of available seats XFAVFIk(Y) as an availability capacity when considering the availability request for the given class of service (k) on the given transport service (Fi) between said two locations, and replying favorably to the availability request upon the overall number of available seats XFAVFik(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 (SPmax); using the boundary transfer value (SPmax) 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 (SPmax); or the boundary transfer value (SPmax) if the number of seats available locally is negative and its inverse is greater than or equal to said boundary transfer value (SPmax); 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 avk(Y) if this number is positive; and
wherea total acceptance capacity TSAFik(Y) for the class of service (k) is determined by selecting the minimum (Min) value from the boundary transfer value (SPFikmax) of the given class of service (k) and a summation (Σ
) of the numbers of acceptable reservation requests (SAFik′
(Y)) for the classes of service (k′
) of transport services (Fj) to which the given class of service (k) is transferrable, in accordance with; - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
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 (Fi) 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 avFik(Y) for a given class of service (k) on a flight leg of the first flight (F1) between the two locations; selecting at least one other class of service (k′
) of a second flight (Fi) between the two locations;determining at the computer system a number of locally available seats avFkj′
(Y) for the class of service (k′
) on a flight leg of the second flight (Fj) 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 (Fi), an overall number of available seats at the predefined level of expected revenue (Y) as a sum of the numbers of locally available seats (avFik(Y), avFik′
(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 (Fi) 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 (SPmax); using the boundary transfer value (SPmax) 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 (SPmax); or the boundary transfer value (SPmax) if the number of seats available locally is negative and its inverse is greater than or equal to said boundary transfer value (SPmax); 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 avk(Y) if this number is positive; and
wherea total acceptance capacity TSAFik(Y) for the class of service (k) is determined by selecting the minimum (Min) value from the boundary transfer value (SPFikmax)of the given class of service (k) and a summation (Σ
) of the numbers of acceptable reservation requests (SAFik′
(Y)) for the classes of service (k′
) of transport services (Fj) to which the given class of service (k) is transferrable, in accordance with
-
Specification