• DocumentCode
    1941561
  • Title

    Estimation of missing values in traffic density maps

  • Author

    Petrlik, Jiri ; Korcek, Pavol ; Fucik, Otto ; Beszedes, Marian ; Sekanina, Lukas

  • Author_Institution
    IT4Innovations Centre of Excellence, Brno Univ. of Technol., Brno, Czech Republic
  • fYear
    2012
  • fDate
    16-19 Sept. 2012
  • Firstpage
    632
  • Lastpage
    637
  • Abstract
    The traffic density map (TDM) represents the density of road network traffic as the number of vehicles per a specific time interval. TDMs are used by traffic experts as a base documentation for planning a new infrastructure (long-term) or by drivers for showing a current traffic status (short-term). We propose two methods for estimation of missing density values in TDMs. In the first method, the problem is formulated relatively strictly in terms of quadratic programming (QP) and a QP solver is utilized to find a solution. The second, more general method is based on a multiobjective genetic algorithm which allows us to find a reasonable compromise among several objectives that a traffic expert may formulate. These two methods can work automatically or they can be used by a traffic expert for an iterative density estimation. Results of experimental evaluation based on real and randomly generated data are presented.
  • Keywords
    Java; genetic algorithms; iterative methods; quadratic programming; road traffic; traffic engineering computing; QP solver; TDM; complete Java based software system; iterative density estimation; multiobjective genetic algorithm; quadratic programming; road network traffic; traffic density maps; traffic expert; traffic status; Estimation; Genetic algorithms; Linear programming; Quadratic programming; Sociology; Time division multiplexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Transportation Systems (ITSC), 2012 15th International IEEE Conference on
  • Conference_Location
    Anchorage, AK
  • ISSN
    2153-0009
  • Print_ISBN
    978-1-4673-3064-0
  • Electronic_ISBN
    2153-0009
  • Type

    conf

  • DOI
    10.1109/ITSC.2012.6338757
  • Filename
    6338757