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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Guo, Hongliang (Autor:in) / Cao, Zhiguang (Autor:in) / Zhang, Jie (Autor:in) / Niyato, Dusit (Autor:in) / Fastenrath, Ulrich (Autor:in)


    Erscheinungsdatum :

    01.10.2014


    Format / Umfang :

    492870 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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 Archiv | 1976


    Minimizing Electric Cars to Maximize Performance

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


    Road-testing cars

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