Ride Sharing Request Matching via Batch Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing ride sharing systems are inefficient in matching trip requests due to sequential processing and reliance on individual customer decisions, leading to suboptimal sharing solutions.
Innovation Solution
A centralized system processes trip requests in batches, using a trip matching manager module to calculate travel times and apply maximum matching algorithms to optimize shared trip combinations, with a centralized server deciding on sharability and vehicle dispatch.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If trip requests are processed sequentially with individual customer decisions, then the system is simple to operate, but the matching efficiency and sharing optimization deteriorate
Solution Approach 1:
The patent introduces a centralized server as an intermediary that receives trip requests from multiple patrons, performs batch processing of shareability analysis, and returns optimized matching results. This mediator coordinates the matching process centrally rather than relying on sequential individual decisions, thereby improving matching efficiency while managing system complexity through centralized control.
Solution Approach 2:
The system performs preliminary batch processing of trip requests to pre-determine shareability combinations before final matching. By analyzing multiple requests together in advance and identifying potential shared trips beforehand, the system optimizes matching efficiency proactively rather than reactively, resolving the contradiction between efficiency and complexity.
2Manufacturing precision
If a centralized server processes trip requests in batches, then the optimal matching of shared trips is improved, but the processing time and system complexity increase
Solution Approach 1:
The system implements periodic batch processing where trip requests are collected and processed in scheduled intervals rather than continuously or sequentially. This periodic approach allows the centralized server to accumulate sufficient data for accurate shareability analysis while controlling processing time through structured batches, thereby improving matching precision without excessive time loss.
Solution Approach 2:
The patent segments the trip request processing into distinct phases: request collection, batch processing for shareability analysis, and result return. This segmentation allows the system to manage complex batch processing in controlled segments, improving matching precision while reducing overall processing time through structured division of the workflow.
3Ease of operation
If individual patrons make sharing decisions, then the system is easy to operate, but the system-wide optimal combination is not achieved
Solution Approach 1:
The system maintains ease of operation by allowing patrons to simply submit their trip requests without manual intervention. The centralized server automatically performs the complex shareability analysis and matching optimization in the background, then returns results to patrons. This self-service approach preserves user-friendly operation while achieving system-wide optimization that individual decisions cannot provide.
Data Source
AI summary
System for optimal matching of ride sharing requests. A trip request manager receives trip requests from patrons and a shareability network is established. The system checks to see whether certain parameters related to ride-sharing delays are less than or equal to other parameters to decide whether trips are shareable.