Travel planning system that re-prices travel options to produce answers involving multiple sales channels/PNRs/tickets per answer

• US 20080140466A1
• 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,805
• Publication Number:
  US 20080140466A1
• 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:

sending a travel planning query to a travel planning system, the travel query including a specification of whether or not to expand a search space to include multiple passenger name records, or tickets or sales channels; and

processing the travel query to produce solutions with a specification of possible partitions of the solutions;

selecting a subset of the solutions produced; and

re-pricing the subset of solutions, as multiple tickets, by partitioning the solutions by a partition and re-pricing the partitioned solutions.

2. The method of claim 1 further comprising:

determining if at least one property of the solution is better than that property of the solution prior to re-pricing by the combination of the multiple tickets,

returning the re-priced solutions in addition or in place of the whole-journey pricing.

3. The method of claim 2 wherein the at least one property of the solution is total price of the solution.

4. The method of claim 1 wherein the partition is by trip segment or carrier or passenger.

5. The method of claim 1 wherein the partition is into at least one of passenger name records (PNRs), tickets or sales channels for the solutions.

6. The method of claim 1 wherein the type of partition of complete solutions is to sell multiple passengers individually.

7. The method of claim 1 wherein the type of partition of complete solutions is to sell each priceable unit separately.

8. The method of claim 1 wherein the type of partition of complete solutions is to sell each airline separately.

9. The method of claim 1 wherein the type of partition of complete solutions is to sell each slice or trip-segment separately.

10. The method of claim 1 wherein processing the query comprises:

generating a plurality of possible itineraries comprised of flight sequences, for the entire journey; and

pricing each itinerary to produce a set of solutions.

11. The method of claim 1 wherein re-pricing comprises:

for each of the solutions in the subset of solutions,

constructing a set of partitions P of flights and passengers corresponding the solution s;

for each partition p in the set of partitions P, and for each set of flights and passengers q in p,

adding pricing of q to the subset of solutions, and

adding the solutions in the subset of solutions to set of solutions.

12. The method of claim 11 wherein partitioning is by a selected partition.

13. The method of claim 11 wherein the selected method by slice, by airline or by priceable unit.

14. The method of claim 11 further comprising:

returning the set of solutions according to the partition selected.

15. A computer program product, residing on a computer readable medium for producing a travel solution comprised of multiple travel units, the computer program product comprising instructions for causing a computer to:

send a travel planning query to a travel planning system, the travel query including a specification of whether or not to expand a search space to include multiple passenger name records, or tickets or sales channels; and

process the travel query to produce solutions with a specification of possible partitions of the solutions;

select a subset of the solutions produced; and

re-price the subset of solutions, as multiple tickets, by partitioning the solutions by a partition and re-pricing the partitioned solutions.

16. The computer program product of claim 15 further comprising instructions to:

determine if at least one property of the solution is better than that property of the solution prior to re-pricing by the combination of the multiple tickets,

return the re-priced solutions in addition or in place of the whole-journey pricing.

17. The computer program product of claim 16 wherein the at least one property of the solution is total price of the solution.

18. The computer program product of claim 15 wherein the partition is by trip segment or carrier or passenger.

19. The computer program product of claim 15 wherein the partition is into at least one of passenger name records (PNRs), tickets, or sales channels for the solutions.

20. The computer program product of claim 15 wherein the type of partition of complete solutions is to sell multiple passengers individually.

21. The computer program product of claim 15 wherein the type of partition of complete solutions is to sell each priceable unit separately.

22. The computer program product of claim 15 wherein the type of partition of complete solutions is to sell each airline separately.

23. The computer program product of claim 15 wherein the type of partition of complete solutions is to sell each slice or trip-segment separately.

24. The computer program product of claim 15 wherein instruction to process the query further comprises instructions to:

generate a plurality of possible itineraries comprised of flight sequences, for the entire journey; and

price each itinerary to produce a set of solutions.

25. The computer program product of claim 15 wherein instruction to process the query further comprises instructions to:

for each of the solutions in the subset of solutions,

construct a set of partitions P of flights and passengers corresponding the solution s;

for each partition p in the set of partitions P, and for each set of flights and passengers q in p,

add pricing of q to the subset of solutions, and

add the solutions in the subset of solutions to set of solutions.

26. The computer program product of claim 15 wherein instruction to process the query further comprises instructions to:

return the set of solutions according to the partition selected.