Dynamic Route Determination via Vendor Auction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional route planning systems fail to consider non-optimal routes that may have value to other parties and do not account for dynamic market value associated with presenting a route to a traveler, limiting their effectiveness in recommending routes that include specific locations.
Innovation Solution
A computer-implemented method that determines a route by initiating an auction among vendors to include specific locations along the route, where the winning vendor's location is incorporated into the recommended route, based on user profile data and route calculation rules.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional route planning systems focus on optimal route determination based on minimizing travel time or distance, then routing efficiency is improved, but the ability to consider non-optimal routes with value to other parties deteriorates
Solution Approach 1:
The system dynamically adjusts route selection by incorporating real-time auction results. Routes are not statically optimized but dynamically determined based on vendor bids, allowing the system to adapt between optimal routing and routes that include specific locations of interest to vendors.
Solution Approach 2:
The system changes the optimization parameter from purely time/distance minimization to include vendor-specific location preferences. By accepting bids that modify route parameters, the system can shift between different optimization criteria based on market demand.
2Device complexity
If conventional route planning systems use fixed optimization criteria, then system simplicity is improved, but the ability to account for dynamic market value deteriorates
Solution Approach 1:
The auction mechanism serves as an intermediary between the route planning system and market dynamics. Vendors submit bids that translate market value into route selection criteria, allowing the system to incorporate dynamic market information without complex direct integration.
Solution Approach 2:
The system maintains a universal route determination framework that can serve multiple functions: traditional optimal routing, vendor-promoted routing, and hybrid approaches. The same core system adapts to different market conditions through the auction interface.
3Loss of time
If route planning systems prioritize optimal routes, then travel time is reduced, but the opportunity to present routes with commercial value deteriorates
Solution Approach 1:
The auction mechanism provides feedback loops between vendors and the routing system. Vendors receive information about route selections and can adjust their bids accordingly, while the system learns about commercial values associated with different locations and routes.
Solution Approach 2:
Vendors submit bids in advance before route determination, allowing the system to pre-calculate routes that incorporate commercial considerations. This preliminary action enables commercial value integration without adding delays to the actual route determination process.
Data Source
AI summary
An approach for determining a route is provided. A rule is retrieved, which indicates a number of recommended routes passing through a constrained area is not permitted to exceed a threshold. After a receipt of N requests from N respective users for N routes, N recommended routes passing through the constrained area are determined and presented to the N users. After determining the N recommended routes and based on a receipt of a request from an (N+1)-th user for an (N+1)-th route, the (N+1)-th route, which passes through the constrained area, is determined. Based on the retrieved rule and the (N+1)-th route passing through the constrained area, N+1 is determined to not exceed the second number. Responsive to determining N+1 does not exceed the threshold, the (N+1)-th route is designated as an (N+1)-th recommended route.