Multi-Section Seat Reservation with Movement Burden Scoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing seat reservation systems fail to provide a convenient solution when a user cannot obtain the same seat throughout a multi-section use route, leading to unnecessary movement burdens between seats.
Innovation Solution
A seat reservation system that searches for a combination of seats satisfying desired conditions and calculates a movement burden score to present the combination with the least movement burden to the user.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a combination of multiple seats is presented to the user when the same seat is not available throughout the use route, then the user can obtain a seat satisfying their desired condition, but the user experiences movement burden between seats
Solution Approach 1:
The system changes the evaluation parameter from simple seat availability to a composite score including movement burden. By calculating movement burden scores based on section boundaries and seat positions, the system transforms the seat selection problem into an optimized parameter selection problem, presenting combinations with the smallest movement burden scores first.
Solution Approach 2:
The movement burden score acts as an intermediary metric that mediates between seat availability and user convenience. Instead of directly presenting any available seat combination, the system uses this intermediate scoring mechanism to filter and rank combinations, thereby reducing the actual movement burden experienced by users.
2Loss of information
If all possible seat combinations are presented to the user, then the user has complete information to choose, but the system complexity and processing time increase
Solution Approach 1:
Instead of presenting all possible seat combinations (excessive action), the system calculates movement burden scores for all combinations but only presents a limited number of combinations with the smallest scores (partial action). This approach maintains sufficient information quality while significantly reducing system complexity and processing requirements.
Solution Approach 2:
The system changes the output parameter from presenting all combinations to presenting only top-ranked combinations based on movement burden scores. This parameter transformation allows the system to maintain computational completeness internally while providing a simplified, manageable output to the user interface.
3Ease of operation
If the system calculates movement burden scores for all seat combinations, then the most convenient seat combination can be identified, but the calculation time and processing power increase
Solution Approach 1:
The system performs complete movement burden calculations for all combinations internally but only processes and presents the top results. This partial output approach allows comprehensive analysis to be performed while limiting the time-consuming presentation phase to only the most relevant combinations, thereby reducing overall processing time.
Solution Approach 2:
The system performs preliminary sorting and filtering of seat combinations based on movement burden scores before presenting them to the user. By pre-calculating and ranking combinations in advance, the system reduces the time required for real-time decision-making and minimizes the computational burden during the user interaction phase.
Data Source
AI summary
A processor of a seat reservation system searches for a same seat satisfying a desired seat condition throughout a use route, based on seat arrangement information, seat reservation information, use route information, and seat condition information stored in a memory device. When the same seat does not exist, the processor searches for a combination of a plurality of seats satisfying the desired seat condition. When a plurality of combinations exist as a plurality of combination candidates, the processor executes a score calculation process of calculating, for each of the plurality of combination candidates, a movement burden score indicating a magnitude of burden of movement of the user between the plurality of seats, based on the seat arrangement information and the seat reservation information. The processor presents to the user via a user device, a combination candidate having a smallest movement burden score among the plurality of combination candidates.