ORNInA: A Decentralized, Auction-based Multi-agent Coordination in ODT Systems

On-Demand Transport (ODT) systems have attracted increasing attention in recent years. Traditional centralized dispatching can achieve optimal solutions, but NP-Hard complexity makes it unsuitable for online and dynamic problems. Centralized and decentralized heuristics can achieve fast, feasible solution at run-time with no guarantee on the quality. Starting from a feasible not optimal solution, we present in this paper a new solution model (ORNInA) consisting of two parallel coordination processes. The first one is a decentralized insertion-heuristic based algorithm to build vehicle schedules in order to solve a particular case of the dynamic Dial-A-Ride-Problem (DARP) as an ODT system, in which vehicles communicate via Vehicle-to-vehicle communication (V2V) and make decentralized decisions. The second coordination scheme is a continuous optimization process namely Pull-demand protocol, based on combinatorial auctions, in order to improve the quality of the global solution achieved by decentralized decision at run-time by exchanging resources between vehicles (k-opt). In its simplest implementation, k is set to 1 so that vehicles can exchange only one resource at a time. We evaluate and analyze the promising results of our contributed techniques on synthetic data for taxis operating in Saint-Etienne city, against a classical decentralized greedy approach and a centralized one that uses a classical mixed-integer linear program (MILP) solver.

[1]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..

[2]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[3]  Flavien Balbo,et al.  Generic model for resource allocation in transportation. Application to urban parking management , 2016 .

[4]  Stephan Winter,et al.  Simulating Demand-responsive Transportation: A Review of Agent-based Approaches , 2015 .

[5]  P. Lacomme,et al.  A dial-a-ride problem using private vehicles and alternative nodes , 2019, Journal on Vehicle Routing Algorithms.

[6]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[7]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[8]  Josep Maria Salanova Grau,et al.  Agent Based Modelling for Simulating Taxi Services , 2015, ANT/SEIT.

[9]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[10]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[11]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[12]  Keld Helsgaun,et al.  General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..

[13]  Nikolaos Geroliminis,et al.  The electric autonomous dial-a-ride problem , 2019, Transportation Research Part B: Methodological.

[14]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[15]  Antonio LaTorre,et al.  A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios , 2015 .

[16]  Timo Gschwind,et al.  Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem , 2019, Transp. Sci..

[17]  Mashrur Chowdhury,et al.  Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication in a heterogeneous wireless network – Performance evaluation , 2016 .

[18]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[19]  Henrik Andersson,et al.  The integrated dial-a-ride problem with timetabled fixed route service , 2017, Public Transp..

[20]  Yoav Shoham,et al.  An overview of combinatorial auctions , 2007, SECO.

[21]  Evangelos Mitsakis,et al.  Agent based modeling for simulation of taxi services , 2013 .

[22]  Henrik Andersson,et al.  The Integrated Dial-a-Ride Problem , 2009, Public Transp..

[23]  Walter Ukovich,et al.  A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem , 2006, Eur. J. Oper. Res..

[24]  Giovanni Righini,et al.  Modelling and optimizing dynamical dial-a-ride problems , 2001 .