Travel Recommendation System with Precomputed Flight Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for generating travel recommendations for itineraries with multiple bounds are inefficient, as they often limit the number of recommendations and require multiple polls of airline inventory systems, failing to provide a comprehensive set of combinable options for outbound and inbound flights.
Innovation Solution
A system that includes a processor and memory to generate and display recommendations for both bounds of a trip, where the second bound's recommendations are either instantly retrieved from memory if the selected first bound is within a subset or recalculated based on user input, optimizing the display of combinable flight options and reducing redundant data retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If all combinations of outbound and inbound flights are computed to provide comprehensive recommendations, then the number of travel recommendations increases, but the system complexity and processing time increase significantly
Solution Approach 1:
The patent segments the flight recommendation generation into two independent phases: outbound flight recommendations and inbound flight recommendations. The outbound recommendations are generated without considering specific inbound flights, and vice versa. This segmentation allows the system to provide comprehensive recommendations without computing all possible combinations, thereby reducing system complexity while maintaining versatility.
2Loss of information
If the airline inventory system is polled multiple times to retrieve flight information, then comprehensive flight data is obtained, but the data retrieval time and system load increase
Solution Approach 1:
The patent performs preliminary action by generating and storing outbound flight recommendations in advance, before the user selects specific flights. These pre-generated recommendations are stored and can be quickly retrieved when needed, eliminating the need for multiple real-time polls of the airline inventory system and significantly reducing data retrieval time while maintaining data completeness.
3Reliability
If the system computes all possible flight combinations in advance, then accurate combinable recommendations are provided, but the processing time and computational resources increase
Solution Approach 1:
The system performs preliminary generation of outbound flight recommendations without waiting for inbound flight selections. By preparing recommendations in advance and storing them, the system maintains reliability by ensuring accurate combinable options are available while dramatically reducing processing time compared to computing all combinations in real-time.
Solution Approach 2:
The system enables self-service by allowing outbound and inbound flight recommendations to be generated independently without requiring coordination or combination computations. Each recommendation set serves itself without needing to know about the other bound, eliminating redundant processing while maintaining recommendation accuracy.
Data Source
AI summary
Methods, systems, and computer program products for generating recommendations. In response to receiving a request, the system generates a plurality of suggested recommendations for both a first bound and a second bound of a trip. The system stores the suggested recommendations corresponding to the first bound and the second bound in a memory, where the suggested recommendations corresponding to the second bound coincide to a subset of the suggested recommendations corresponding to the first bound published for display. The system publishes the suggested recommendations corresponding to the first bound for display to a user. In response to receiving an input that indicates a selected recommendation for the first bound, the system determines whether the selected recommendation is one of the subset of the suggested recommendations corresponding to the first bound.