Dynamic, fair, and efficient routing for cooperative autonomous vehicle fleets

Abstract

This paper addresses challenges in agricultural cooperative autonomous fleet routing through the proposition, modeling, and resolution of the Dynamic Vehicle Routing Problem with Fair Profits and Time Windows (DVRP-FPTW). The aim is to dynamically optimize routes for a vehicle fleet serving tasks within assigned time windows, emphasizing fair and efficient solutions. Our DVRP-FPTW accommodates unforeseen events like task modifications or vehicle breakdowns, ensuring adherence to task demand, vehicle capacities, and autonomies. The proposed model incorporates mandatory and optional tasks, including optional ones in operational vehicle routes if not compromising the vehicles’ profits. Including asynchronous and distributed column generation heuristics, the proposed Multi-Agent-based architecture DIMASA for the DVRP-FPTW dynamically adapts to unforeseen events. Systematic Egalitarian social welfare optimization is used to iteratively maximize the profit of the least profitable vehicle, prioritizing fairness across the fleet in light of unforeseen events. This improves upon existing dynamic and multi-period VRP models that rely on prior knowledge of demand changes. Our approach allows vehicle agents to maintain privacy while sharing minimal local data with a fleet coordinator agent. We propose publicly available benchmark instances for both static and dynamic VRP-FPTW. Simulation results demonstrate the effectiveness of our DVRP-FPTW model and our multi-agent system solution approach in coordinating large, dynamically evolving cooperative autonomous fleets fairly and efficiently in close to real-time