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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Weymann, J. (author) / Farges, J.-L. (author) / Henry, J.-J. (author)


    Publication date :

    1994-03-04


    Size :

    19 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    TRAVEL ROUTE GUIDANCE DEVICE

    MIYAZATO YOSHIAKI / IWASE YUJI / TABATA MITSUHIRO et al. | European Patent Office | 2023

    Free access

    TRAVEL ROUTE GUIDANCE DEVICE

    MIYAZATO YOSHIAKI / IWASE YUJI / TABATA MITSUHIRO et al. | European Patent Office | 2021

    Free access

    TRAVEL ROUTE GUIDANCE DEVICE

    SAIKI SEIJI | European Patent Office | 2019

    Free access

    TRAVEL ROUTE GUIDANCE DEVICE

    MIYASATO YOSHIAKI / IWASE YUJI / TABATA MICHIHIRO et al. | European Patent Office | 2021

    Free access

    TRAVEL ROUTE GUIDANCE DEVICE

    SAIKI SEIJI | European Patent Office | 2022

    Free access