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 trafic 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.

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 trafic 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.