Traffic assignment is an important stage in traffic modeling. Most of the existing approaches are based on finding an approximate solution to the user equilibrium or to the system optimum, which can be computationally expensive. In this paper we use a genetic algorithm to compute an approximate solution (routes for the trips) that seeks to minimize the average travel time. To illustrate this approach, a non-trivial network is used, departing from binary route choice scenarios. Our result shows that the proposed approach is able to find low travel times, without the need of recomputing shortest paths iteratively.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An evolutionary approach to traffic assignment


    Contributors:


    Publication date :

    2014-12-01


    Size :

    764284 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Multi-objective Evolutionary Traffic Assignment

    Chira, Camelia / Bazzan, Ana L. C. / Rossetti, Rosaldo J. F. | IEEE | 2015


    Iterative approach to traffic assignment

    Tillman, F.A. / Pai, D.K. / Funk, M.L. et al. | Engineering Index Backfile | 1968


    Dynamic Traffic Assignment: Genetic Algorithms Approach

    Sadek, A. W. / Smith, B. L. / Demetsky, M. J. et al. | British Library Conference Proceedings | 1997


    An iterative approach to traffic assignment

    Tillman, F.A. / Pai, D.K. / Funk, M.L. et al. | Elsevier | 1967


    Dynamic Traffic Assignment: Genetic Algorithms Approach

    Sadek, Adel W. | Online Contents | 1997