![]() ; ; Viti, Francesco ![]() in Networks and Spatial Economics (2016) Increasing numbers of hard environmental constraints are being imposed in urban traffic networks by authorities in an attempt to mitigate pollution caused by traffic. However, it is not trivial for ... [more ▼] Increasing numbers of hard environmental constraints are being imposed in urban traffic networks by authorities in an attempt to mitigate pollution caused by traffic. However, it is not trivial for authorities to assess the cost of imposing such hard environmental constraints. This leads to difficulties when setting the constraining values as well as implementing effective control measures. For that reason, quantifying the cost of imposing hard environmental constraints for a certain network becomes crucial. This paper first indicates that for a given network, such cost is not only related to the attribution of environmental constraints but also related to the considered control measures. Next, we present an assessment criterion that quantifies the loss of optimality under the control measures considered by introducing the environmental constraints. The criterion can be acquired by solving a bi-level programming problem with/without environmental constraints. A simple case study shows its practicability as well as the differences between this framework and other frameworks integrating the environmental aspects. This proposed framework is widely applicable when assessing the interaction of traffic and its environmental aspects [less ▲] Detailed reference viewed: 245 (4 UL)![]() Cantelmo, Guido ![]() ![]() in Periodica Polytechnica Transportation Engineering (2015) Detailed reference viewed: 88 (9 UL)![]() ; Viti, Francesco ![]() Scientific Conference (2015, July) Detailed reference viewed: 82 (1 UL)![]() Cantelmo, Guido ![]() ![]() in Proceedings of the MT-ITS Conference (2015, June) Detailed reference viewed: 86 (1 UL)![]() ; ; Viti, Francesco ![]() in Proceedings of the MT-ITS Conference (2015, June) Detailed reference viewed: 114 (1 UL)![]() ; ; Viti, Francesco ![]() in Proceedings of the MT-ITS Conference (2015, June) Detailed reference viewed: 64 (0 UL)![]() ![]() ; ; Viti, Francesco ![]() Scientific Conference (2014, June) Detailed reference viewed: 80 (1 UL)![]() Cantelmo, Guido ![]() ![]() in Transportation Research Record: Journal of the Transportation Research Board (2014), 2466 In this work deterministic and stochastic optimization methods are tested for solving the Dynamic Demand Estimation problem. All the adopted methods demonstrate the difficulty in reproducing the correct ... [more ▼] In this work deterministic and stochastic optimization methods are tested for solving the Dynamic Demand Estimation problem. All the adopted methods demonstrate the difficulty in reproducing the correct traffic regime, especially if the seed matrix is not sufficiently close to the real one. Therefore, in this paper a new and intuitive procedure to specify an opportune starting seed matrix is proposed: it is a two-step procedure based on the concept of dividing the problem into small-size problems, focusing on specific OD pairs in different steps. Specifically, the first step focuses on the optimization of a subset of OD variables (the ones who generate the higher flows or the ones who generate the bottlenecks on the network). In the second step the optimization works on all the OD pairs, using as starting matrix the matrix derived from the first step. In this way is possible to use a more performance optimization method for every step, improving the performance of the method and the quality of the result with respect to the classical “one-step” approach. The procedure has been tested on the real network of Antwerp, Belgium, demonstrating its efficacy in combination with different optimization methods. [less ▲] Detailed reference viewed: 237 (25 UL)![]() ; Viti, Francesco ![]() in Journal of Intelligent Transportation Systems (2014), 18(1), 51-66 Despite the ever increasing computing power, dynamic Origin-Destination (OD) estimation in congested networks remains troublesome. In previous research, we have shown that an unbiased estimation requires ... [more ▼] Despite the ever increasing computing power, dynamic Origin-Destination (OD) estimation in congested networks remains troublesome. In previous research, we have shown that an unbiased estimation requires the calculation of the sensitivity of the link flows to all Origin Destination flows, in order to incorporate the effects of congestion spillback. This is however computationally infeasible for large-scale networks. To overcome this issue, we propose a hierarchical approach for off-line application that decomposes the dynamic OD estimation procedure in space. The main idea is to perform a more accurate dynamic OD estimation only on subareas where there is congestion spillback. The output of this estimation is then used as input for the OD estimation on the whole network. This hierarchical approach solves many practical and theoretical limitations of traditional OD estimation methods. The main advantage is that different OD estimation method can be used for different parts of the network as necessary. This allows applying more advanced and accurate, but more time consuming methods only where necessary. The hierarchical approach is tested on a study network and on a real network. In both cases the proposed methodology performs better than traditional OD estimation approaches, indicating its merit. [less ▲] Detailed reference viewed: 179 (5 UL)![]() Viti, Francesco ![]() in Journal of Intelligent Transportation Systems (2014), 18(1), 1-4 Detailed reference viewed: 143 (7 UL)![]() Viti, Francesco ![]() in Transportation Research Record: Journal of the Transportation Research Board (2014), 2395 Detailed reference viewed: 173 (8 UL)![]() ; ; Viti, Francesco ![]() in Transportation Research. Part C : Emerging Technologies (2014), 41 Currently, the applicability of macroscopic Dynamic Network Loading (DNL) models for large-scale problems such as network-wide traffic management, reliability and vulnerability studies, network design ... [more ▼] Currently, the applicability of macroscopic Dynamic Network Loading (DNL) models for large-scale problems such as network-wide traffic management, reliability and vulnerability studies, network design, traffic flow optimization and dynamic origin–destination (OD) estimation is computationally problematic. The main reason is that these applications require a large number of DNL runs to be performed. Marginal DNL simulation, introduced in this paper, exploits the fact that the successive simulations often exhibit a large overlap. Through marginal simulation, repeated DNL simulations can be performed much faster by approximating each simulation as a variation to a base scenario. Thus, repetition of identical calculations is largely avoided. The marginal DNL algorithm that is presented, the Marginal Computation (MaC) algorithm, is based on first order kinematic wave theory. Hence, it realistically captures congestion dynamics. MaC can simulate both demand and supply variations, making it useful for a wide range of DNL applications. Case studies on different types of networks are presented to illustrate its performance. [less ▲] Detailed reference viewed: 138 (3 UL)![]() Cantelmo, Guido ![]() ![]() Scientific Conference (2014) Detailed reference viewed: 85 (17 UL)![]() ; Viti, Francesco ![]() Scientific Conference (2013) Detailed reference viewed: 101 (3 UL)![]() ; Viti, Francesco ![]() in Proceedings of IEEE-ITS Conference (2013) Traffic signal control influences route choice in traffic networks, and may even determine whether a traffic system settles in equilibrium or destabilizes into oscillatory patterns. Ideally, a stable ... [more ▼] Traffic signal control influences route choice in traffic networks, and may even determine whether a traffic system settles in equilibrium or destabilizes into oscillatory patterns. Ideally, a stable equilibrium flow pattern should result from the interaction between control and route choice on a long-term horizon. This paper proposes an iterative learning approach for designing signal controls able to attract the system to equilibrium in an acceptable convergence speed. The traffic assignment model and combined traffic assignment and control problem are first introduced. An iterative learning control (ILC) based signal control is formulated and a basic model inversion method is analyzed. To deal with the nonlinearity of traffic system, a Newton based ILC algorithm is applied. Test in an example network verifies the effectiveness of the ILC method in achieving stable equilibrium in the traffic system. [less ▲] Detailed reference viewed: 148 (0 UL)![]() ; Viti, Francesco ![]() in Transportmetrica (2013), 9(6), 494-513 In this study we analyse the impact of congestion in dynamic origin–destination (OD) estimation. This problem is typically expressed using a bi-level formulation. When solving this problem the ... [more ▼] In this study we analyse the impact of congestion in dynamic origin–destination (OD) estimation. This problem is typically expressed using a bi-level formulation. When solving this problem the relationship between OD flows and link flows is linearised. In this article the effect of using two types of linear relationship on the estimation process is analysed. It is shown that one type of linearisation implicitly assumes separability of the link flows, which can lead to biased results when dealing with congested networks. Advantages and disadvantages of adopting non-separable relationships are discussed. Another important source of error attributable to congestion dynamics is the presence of local minima in the objective function. It is illustrated that these local minima are the result of an incorrect interpretation of the information from the detectors. The theoretical findings are cast into a new methodology, which is successfully tested in a proof of concept. [less ▲] Detailed reference viewed: 76 (1 UL)![]() Viti, Francesco ![]() Poster (2013) Detailed reference viewed: 90 (0 UL) |
||