Dynamic Vehicle Allocation Graph for Route Deviation Minimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Transport agencies face challenges in managing dynamic changes in transport requests, leading to cost overheads due to underutilization of vehicles hired by organizations for employee pickup and drop services, as last-minute schedule changes and employee absences result in vehicles traveling additional distances.
Innovation Solution
A method and system that determine additional distances for vehicles to accommodate requestors on predefined routes, using a graph mapping between requestors and vehicles to optimize vehicle allocation, recommending vehicles based on minimal additional distance traveled, thereby reducing cost overheads.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If vehicles are hired based on predetermined work schedules, then employee pickup and drop services can be provided, but last-minute schedule changes and employee absences result in vehicle underutilization and cost overhead
Solution Approach 1:
The system dynamically reassigns requestors to vehicles based on real-time route compatibility and additional distance calculations. When schedule changes or cancellations occur, the system automatically identifies suitable vehicles for reassignment, transforming a static vehicle allocation system into a dynamic one that adapts to changing conditions and minimizes underutilization.
Solution Approach 2:
The system implements a feedback mechanism where cancellation information is received and processed, triggering automatic reassignment of affected requestors to alternative vehicles. This closed-loop feedback system ensures that vehicle allocation continuously optimizes itself based on current operational status, reducing both underutilization and service disruption.
2Adaptability or versatility
If vehicles traverse additional distance to accommodate last-minute changes, then service flexibility is improved, but cost overhead increases
Solution Approach 1:
The system changes the parameter of route selection by calculating additional distance for each potential vehicle reassignment. It optimizes the balance between adaptability (accommodating schedule changes) and energy loss (additional distance) by selecting reassignments that minimize total additional distance while still fulfilling service requirements.
3Adaptability or versatility
If manual handling of dynamic transport changes is performed, then service customization is possible, but operational complexity and cost overhead increase
Solution Approach 1:
The system enables self-service by automatically handling the complex task of reassigning requestors to vehicles when changes occur. The system independently receives cancellation information, calculates optimal reassignments based on route compatibility, and implements the reallocation without requiring manual intervention, thereby reducing operational complexity while maintaining service customization.
Solution Approach 2:
The patent replaces the mechanical system of manual vehicle reassignment with an automated computational system. Instead of operators manually calculating and implementing reassignments, the system uses graph-based algorithms and additional distance calculations to automatically determine optimal vehicle allocations, substituting human operational complexity with automated computational processes.
Data Source
AI summary
The disclosed embodiments illustrate methods and systems for recommending one or more vehicles, commuting on a predefined route, for one or more requestors. The method includes determining a first additional distance traversable by each vehicle apart from the predefined route to accommodate each requestor. Further, a graph comprising a first set of nodes representing the one or more requestors, and a second set of nodes representing the one or more vehicles, is generated. Thereafter, a mapping between the first set of nodes and the second set of nodes is determined based on the first additional distance. The mapping corresponds to an allocation of a requestor to a vehicle such that an additional distance traversable by the vehicle is less than an additional distance traversable by remaining vehicles apart from the predefined route. Thereafter, the one or more vehicles are recommended for the one or more requestors based on the mapping.