Abstract This paper presents an optimal guidance algorithm that takes into account the driver compliance to route advice and flows higher than capacities of links. The optimization problem consists in minimizing the travel time of guided vehicles using a model that describes the traffic by a set of flows on a graph. The travel time of a link is obtained by computing the delay of vehicles due to queues. It leads to Wardrop's travel time when the initial queue is empty and the flow is smaller than the capacity of the link. The optimization problem is solved using the Simplex Algorithm recursively on two examples. Results show that for most of the demands, the guidance benefit increases with the ratio of equipped vehicles.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Dynamic route guidance with queue- and flow-dependent travel time


    Beteiligte:
    Weymann, J. (Autor:in) / Farges, J.-L. (Autor:in) / Henry, J.-J. (Autor:in)


    Erscheinungsdatum :

    04.03.1994


    Format / Umfang :

    19 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    TRAVEL ROUTE GUIDANCE DEVICE

    MIYAZATO YOSHIAKI / IWASE YUJI / TABATA MITSUHIRO et al. | Europäisches Patentamt | 2023

    Freier Zugriff

    TRAVEL ROUTE GUIDANCE DEVICE

    MIYAZATO YOSHIAKI / IWASE YUJI / TABATA MITSUHIRO et al. | Europäisches Patentamt | 2021

    Freier Zugriff

    TRAVEL ROUTE GUIDANCE DEVICE

    MIYASATO YOSHIAKI / IWASE YUJI / TABATA MICHIHIRO et al. | Europäisches Patentamt | 2021

    Freier Zugriff

    TRAVEL ROUTE GUIDANCE DEVICE

    SAIKI SEIJI | Europäisches Patentamt | 2019

    Freier Zugriff

    TRAVEL ROUTE GUIDANCE DEVICE

    MIYASATO YOSHIAKI / IWASE YUJI / TABATA MICHIHIRO et al. | Europäisches Patentamt | 2021

    Freier Zugriff