Travel planning system that produces answers involving mulitple sales channels/PNRs/tickets per answer

• US 20080140464A1
• 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,400
• Publication Number:
  US 20080140464A1
• 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 return solutions with a specification of possible partitions of the solutions into at least one of passenger name records (PNRs), tickets or sales channels for the returned solutions.

2. The method of claim 1 wherein the query specifies the types of partitions that are allowed.

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

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

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

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

7. The method of claim 1 wherein processing comprises:

processing the query by;

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

thereafter,

pricing each itinerary to produce a set of solutions.

8. The method of claim 7 wherein generating a plurality of possible itineraries comprises:

enumerating sets of sub-itineraries for each slice;

producing a cross product of the enumerated sets of sub-itineraries to provide resulting possible itineraries; and

pruning the resulting possible itineraries to a manageable number of whole-trip itineraries, based upon criteria.

9. The method of claim 8 wherein pricing comprises:

pricing each sub-itinerary, for each slice, as a single ticket.

10. The method of claim 8 wherein pricing comprises:

pricing multiple-ticket options by combining per-trip-segment tickets.

11. The method of claim 8 wherein pricing comprises:

determining a set of cheapest multiple-ticket solutions by constructing the set from the cheapest tickets for each trip segment;

adding the cheapest multi-ticket solutions to the set of solutions.

12. 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 to cause 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 return solutions with a specification of possible partitions of the solutions into at least one of passenger name records (PNRs), tickets or sales channels for the returned solutions.

13. The computer program product of claim 12 wherein the computer program operates on the query, and with the query specifying the types of partitions that are allowed.

14. The computer program product of claim 13 wherein the computer program operates on the query that specifies the types of partitions, with one of the partition of complete solutions is to sell multiple passengers individually.

15. The computer program product of claim 13 wherein the computer program operates on the query that specifies the types of partitions, with one of the partition of complete solutions is to sell each priceable unit separately.

16. The computer program product of claim 13 wherein the computer program operates on the query that specifies the types of partitions, with one of the partition of complete solutions is to sell each airline separately.

17. The computer program product of claim 13 wherein the computer program operates on the query that specifies the types of partitions, with one of the partition of complete solutions is to sell each slice or trip-segment separately.

18. The computer program product of claim 12 wherein instructions to process further comprises instructions to processing the query by instructions to:

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

thereafter,

price each itinerary to produce a set of solutions.

19. The computer program product of claim 18 wherein instructions to generate a plurality of possible itineraries comprises instructions to:

enumerate sets of sub-itineraries for each slice;

produce a cross product of the enumerated sets of sub-itineraries to provide resulting possible itineraries; and

prune the resulting possible itineraries to a manageable number of whole-trip itineraries, based upon criteria.

20. The computer program product of claim 19 wherein instructions to price comprises instructions to:

price each sub-itinerary, for each slice, as a single ticket.

21. The computer program product of claim 19 wherein instructions to price comprises instructions to:

price multiple-ticket options by instructions to combine per-trip-segment tickets.

22. The computer program product of claim 19 wherein instructions to price comprises instructions to:

determine a set of cheapest multiple-ticket solutions by constructing the set from the cheapest tickets for each trip segment;

add the cheapest multi-ticket solutions to the set of solutions.