Travel planning system that shares work across itineraries and produces answers involving multiple sales channels/PNRs/tickets per answer

• US 20080140465A1
• Filed: 12/07/2006
• Published: 06/12/2008
• Est. Priority Date: 12/07/2006
• Status: Abandoned Application

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google LLC (Alphabet Inc.)
• Inventors: de Marcken, Carl G.
• Application Number:
  US11/635,401
• Publication Number:
  US 20080140465A1
• Time in Patent Office: Days
• US Class Current: 705/6
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202

Abstract

Techniques for producing a travel solution comprised of multiple travel units are disclosed. The techniques include sending a travel planning query having a partition specification to a travel planning system. The travel planning system processes the travel query to produce solutions based on partitions. Possible partitions can include passenger name records (PNRs), tickets or sales channels for the returned solutions. Processing can involve relaxing constraints, rules, or regulations on solutions and re-pricing solutions, as multiple tickets, by partitioning the solutions by a partition. Tickets can be produced for different portions of the multiple travel units from the travel solution using different selling methods or points of sale channels.

Claims

1. A method for producing a travel solution comprised of multiple travel units, the method comprising:

receiving a set of itineraries;

determining plural split possibilities for pricing of the itineraries;

producing fare components as combinations of individual units of representation and fares, according to whether a fare'"'"'s rules pass a preliminary check on individual units of representation; and

determining plural individual units of representation for each split possibilities.

2. The method of claim 1 wherein determining plural individual units further comprises:

computing plural individual units of representation multiple times using different journey split assumptions; and

storing the journey split assumptions required for the individual units of representation to be valid with the corresponding individual units of representation.

3. The method of claim 2 wherein the individual units of representation are at least from faring atoms, fare components and priceable units.

4. The method of claim 1 further comprising:

constructing priceable units from the fare components.

5. The method of claim 4 further comprising:

linking the priceable units into complete sets of pricing solutions by linking itineraries to corresponding pricing units from different slices to provide the pricing solution.

6. The method of claim 5 wherein linking enforces consistency of journey split assumptions required for the individual units of representation to be valid.

7. The method of claim 5 wherein linking further comprises:

constructing a unique data structure for each slice of a journey, for every set of multi-slice priceable-unit-labels;

constructing a second set of data structures, the second set comprising a set of “

open”

multi-slice priceable-unit-labels and a set of backward-links that correspond to a pair of a “

first set” and

a “

second set.”

8. The method of claim 6 wherein linking further comprises:

assigning to each first set and each second set a set of labels so as to enforce split consistency;

determining an intersection of the second set of data structures for the priceable unit labels, and determining if the intersection is non-empty;

if non-empty,

producing a first set labeled with labels based on the intersection;

determining if the first set already exists, and if not,

adding back the pointer and union L into second set.

9. The method of claim 1 wherein the method produces a pricing-graph that enforces multiple-ticket consistency and represents multiple PNR'"'"'s.

10. The method of claim 1 wherein the method produces a pricing-graph that enforces multiple-ticket consistency and represents multiple PNR'"'"'s and a single PNR.

11. The method of claim 1 wherein producing fare components, comprises:

decomposing the itineraries into individual units of representation of units of travel; and

testing retrieved fares by applying corresponding fare rules for the fare to the individual units of representation.

12. The method of claim 1 further comprising:

splitting the journey according to the lowest-priced solution.

13. The method of claim 1 wherein splitting comprises:

splitting by placing passengers on different passenger name records, or dividing the journey by slice, or dividing the journey by priceable unit.

14. A computer program product for producing a travel solution comprised of multiple travel units, the computer program product comprising instructions for causing a computer to:

receive a set of itineraries;

determine plural split possibilities for pricing of the itineraries;

produce fare components as combinations of individual units of representation and fares, according to whether a fare'"'"'s rules pass a preliminary check on individual units of representation; and

determine plural individual units of representation, for each split possibility.

15. The computer program product of claim 14 wherein instructions to determine plural individual units further comprise instructions to:

compute plural individual units of representation multiple times using different journey split assumptions; and

store the journey split assumptions required for the individual units of representation to be valid with the corresponding individual units of representation.

16. The computer program product of claim 14 wherein the individual units of representation are at least from faring atoms, fare components, and priceable units.

17. The computer program product of claim 14 further comprising instructions to:

construct priceable units from the fare components.

18. The computer program product of claim 14 further comprising instructions to:

link the priceable units into complete sets of pricing solutions by linking itineraries to corresponding pricing units from different slices to provide the pricing solution.

19. The computer program product of claim 14 wherein instructions to link enforce consistency of journey split assumptions required for the individual units of representation to be valid.

20. The computer program product of claim 14 wherein instructions to link further comprise instructions to:

construct a unique data structure for each slice of a journey, for every set of multi-slice priceable-unit-labels;

construct a second set of data structures, the second set comprising a set of “

open”

multi-slice priceable-unit-labels and a set of backward-links that correspond to a pair of a “

first set” and

a “

second set.”

21. The computer program product of claim 14 wherein instructions to link further comprise instructions to:

assigning to each first set and each second set a set of labels so as to enforce split consistency;

determining an intersection of the second set of data structures for the priceable unit labels, and determining if the intersection is non-empty;

if non-empty,

producing a first set labeled with labels based on the intersection;

determining if the first set already exists, and if not,

adding back the pointer and union L into second set.

22. The computer program product of claim 14 further comprising instructions to:

produce a pricing-graph that enforces multiple-ticket consistency and represents multiple PNR'"'"'s.

23. The computer program product of claim 14 further comprising instructions to:

produce a pricing-graph that enforces multiple-ticket consistency and represents multiple PNR'"'"'s and a single PNR.

24. The computer program product of claim 14 wherein instructions to produce fare components comprises instructions to:

decompose the itineraries into individual units of representation of units of travel; and

test retrieved fares by applying corresponding fare rules for the fare to the individual units of representation.

25. The computer program product of claim 14 further comprising instructions to:

split the journey according to the lowest-priced solution.

26. The computer program product of claim 14 wherein instructions to split further comprise instructions to:

split by placing passengers on different passenger name records, or dividing the journey by slice, or dividing the journey by priceable unit.