Traffic has become a universal metropolitan problem. This paper aims at easing the traffic jam situation through routing multiple cars cooperatively. We propose a novel distributed multi-vehicle routing algorithm with an objective of minimizing the road network breakdown probability. The algorithm is distributed, and hence highly scalable, making it applicable for large scale metropolitan road networks. Our algorithm always guarantees a much faster convergence rate than traditional distributed optimization techniques such as dual decomposition. Additionally, the algorithm always guarantees a feasible solution during the optimization process. This feature allows for real time decision making when applied to scenarios with time limits. We show the effectiveness of the algorithm by applying it to an arbitrarily large road network in simulation environment.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Routing multiple cars in large scale networks: Minimizing road network breakdown probability


    Contributors:


    Publication date :

    2014-10-01


    Size :

    492870 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimal Distribution of Traffic in Manhattan Road Networks for Minimizing Routing-Time

    Sarma, Sayan Sen / Sinha, Koushik / Sub-r-pa, Chayanon et al. | IEEE | 2021


    Minimizing electric cars to maximize performance

    Shipps, P.R. | Tema Archive | 1976


    Minimizing Electric Cars to Maximize Performance

    Shipps,P.R. / Shipps Engineering Service,El Cajon,US | Automotive engineering | 1976


    Road-testing cars

    Curtis,C.A. / Motor,Surrey House,Sutton,GB | Automotive engineering | 1979


    Bi-objective eco-routing in large urban road networks

    De Nunzio, Giovanni / Thibault, Laurent / Sciarretta, Antonio | IEEE | 2017