On-Demand Service Request Server with Dynamic Radius Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing on-demand service platforms face challenges in managing demand during peak hours without dampening user experience, as conventional solutions like reducing delivery radius and implementing delivery fee surges can drive away users and reduce service provider visibility.
Innovation Solution
A server system that processes requests for on-demand services by determining a distance based on confirmed allocation rates, ranking service providers by predicted delivery experience value, and filtering providers to optimize visibility and demand management, ensuring high-quality service providers are showcased to users.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the delivery radius is reduced to dampen demand during peak hours, then the demand fulfilment rate is improved, but the visibility of service providers to users is reduced and user experience deteriorates
Solution Approach 1:
The patent implements dynamic adjustment of delivery radius based on real-time supply-demand conditions. During peak hours, the system dynamically reduces the delivery radius to manage demand, while during off-peak hours, it expands the radius to show more service providers. This dynamic approach allows the system to adapt to changing conditions without permanently limiting user access to service providers.
Solution Approach 2:
The system changes the delivery radius parameter based on confirmed allocation rates and demand levels. When demand exceeds supply during peak hours, the radius parameter is reduced to control visibility. When supply exceeds demand, the radius is expanded. This parameter adjustment resolves the contradiction by making the limitation temporary and condition-dependent rather than fixed.
2Productivity
If delivery fee surge is implemented to curb excessive demand, then the demand management is improved, but user experience deteriorates as users are driven away
Solution Approach 1:
The patent introduces an intermediary mechanism - the dynamic delivery radius - that mediates between demand management needs and user experience. Instead of directly increasing fees which users perceive negatively, the system uses radius adjustment as an intermediary control that limits visibility of distant providers without explicitly charging surge fees, thereby managing demand while preserving user experience.
Solution Approach 2:
The system uses parameter changes in delivery radius as an alternative to fee surge. By adjusting the radius parameter based on demand conditions, the system achieves demand management through visibility control rather than price control, avoiding the negative user experience associated with fee surges while still achieving the goal of curbing excessive demand.
3Productivity
If batching multiple orders is used to fulfil demand during peak hours, then the demand fulfilment rate is improved, but the delivery time increases
Solution Approach 1:
The patent applies partial action by selectively batching orders rather than batching all orders uniformly. The system evaluates individual order characteristics and batches only compatible orders that can be delivered together without significant time penalty. This partial batching approach maintains demand fulfilment rate while minimizing the time loss that would result from forcing all orders into batches.
Solution Approach 2:
The system segments orders into different batches based on delivery location, time window, and service provider availability. Rather than creating a single large batch, the system divides orders into multiple smaller batches that can be fulfilled efficiently. This segmentation reduces the average delivery time while still achieving high demand fulfilment rates by processing orders in optimized groups.
Data Source
AI summary
Aspects concern a server configured to receive a request for a search, determine a distance from a location of a computing device to produce a first list of service providers within the distance, rank the first list of service providers based on a plurality of predetermined first factor values including a predicted delivery experience value of each service provider in the first list of service providers, produce a second list of service providers from the first list of service providers based on the rank of each service provider in the first list of service providers, determine whether to filter out a part of the second list of service providers based on a size of the second list of service providers, and filter out the part of the second list of service providers based on the predicted delivery experience value of each service provider in the second list of service providers.


