Tunable Multi-Vehicle Routing System for Scalable Fleet Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing systems struggle to efficiently manage complex scenarios involving multiple vehicles and customers, as the number of possible solutions grows astronomically with added vehicles and customers, making it difficult to scale and accommodate varying constraints effectively.
Innovation Solution
A processor-based system that receives tunable routing parameters, builds client-specific models, and refines planning algorithms to meet specific constraints, allowing for adaptive route planning and scheduling that accommodates different client requirements, thereby reducing the complexity of managing multiple vehicles and customers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the number of vehicles and customers is increased to improve service coverage, then the system's adaptability and service capability are improved, but the computational complexity and number of possible routing solutions grow astronomically
Solution Approach 1:
The patent segments the routing problem into discrete, parameterizable constraints that can be independently evaluated. By breaking down the complex routing optimization into separate tunable parameters (such as maximum travel time, minimum stops, preferred routes), the system can handle larger fleets and customer bases without experiencing exponential complexity growth, as each segment can be optimized independently rather than solving the entire problem at once.
Solution Approach 2:
The patent applies parameter changes by introducing tunable routing parameters that allow the system to adapt to different service scenarios without redesigning the entire routing algorithm. These parameters (e.g., service radius, time windows, vehicle capacity) enable the system to scale to larger numbers of vehicles and customers while maintaining computational tractability through parameter adjustment rather than algorithmic redesign.
2Adaptability or versatility
If custom routing solutions are developed for different clients to meet specific constraints, then the adaptability to client requirements is improved, but the device complexity and programming effort increase
Solution Approach 1:
The patent implements universality by creating a single routing system that can serve multiple clients with different requirements through a common set of tunable parameters. Instead of developing separate custom solutions for each client, the system provides a universal platform where clients can configure their specific needs by adjusting parameters such as service areas, time constraints, and vehicle assignments, thereby reducing programming complexity while maintaining high adaptability.
Solution Approach 2:
The patent applies dynamics by making the routing parameters adjustable and configurable rather than fixed. The system allows clients to dynamically modify routing parameters based on their specific requirements, enabling the same core system to adapt to different client scenarios without requiring custom programming for each case.
3Productivity
If traditional routing systems are used for fleet management, then the device complexity is reduced, but the ability to handle large volumes of requests and varying constraints is insufficient
Solution Approach 1:
The patent applies preliminary action by pre-defining a set of routing parameters and constraints that can be quickly configured for different service scenarios. Instead of building complex routing logic from scratch for each new request or client, the system has preliminary parameter sets ready that can be activated and adjusted as needed, enabling rapid scaling to handle large volumes of requests while keeping system complexity manageable through reuse of pre-configured parameter templates.
Data Source
AI summary
A system includes a processor configured to receive requirement values, from a vehicle-providing entity, for a plurality of predefined tunable routing parameters. The processor is also configured to select and assign entity-associated, routing parameter consideration-levels, based on the values correlated to a predefined schema of consideration-levels for each parameter. The processor is further configured to receive a plurality of pick-up requests and determine, using the entity-associated routing parameter consideration-levels, a routing-plan for a plurality of vehicles to service the requests such that the received values are met.