Abstract Population growth and the massive production of automotive vehicles have lead to the increase of traffic congestion problems. Traffic congestion today is not limited to large metropolitan areas, but is observed even in medium-sized cities and highways. Traffic engineering can contribute to lessen these problems. One possibility, explored in this paper, is to assign tolls to streets and roads, with the objective of inducing drivers to take alternative routes, and thus better distribute traffic across the road network. This assignment problem is often referred to as the tollbooth problem and it is NP-hard. In this paper, we propose mathematical formulations for two versions of the tollbooth problem that use piecewise-linear functions to approximate congestion cost. We also apply a biased random-key genetic algorithm on a set of real-world instances, analyzing solutions when computing shortest paths according to two different weight functions. Experimental results show that the proposed piecewise-linear functions approximate the original convex function quite well and that the biased random-key genetic algorithm produces high-quality solutions.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On the minimization of traffic congestion in road networks with tolls


    Contributors:

    Published in:

    Publication date :

    2015-02-15


    Size :

    21 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    THESEUS - Traffic safety, traffic influencing, road tolls

    Leditzky,G. / Theurl,J. / Theurl,N. et al. | Automotive engineering | 1991


    Congestion tolls -- Engineer's viewpoint

    Clair, G.P.St. | Engineering Index Backfile | 1964



    Choosing Congestion Pricing Policy:Cordon Tolls Versus Link-Based Tolls

    National Research Council (U.S.) | British Library Conference Proceedings | 2005