References of "Rinaldi, Marco 50022015"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA global optimization heuristic for the decomposed static anticipatory network traffic control problem anticipatory network traffic control problem
Rinaldi, Marco UL; Tampére, Chris; Viti, Francesco UL

in Transportation Research Procedia (2017)

Developing traffic control strategies taking explicitly into account the route choice behavior of users has been widely recognized irregularities in the solution space shape, such as non-convexity and non ... [more ▼]

Developing traffic control strategies taking explicitly into account the route choice behavior of users has been widely recognized irregularities in the solution space shape, such as non-convexity and non-smoothness. In this work, we propose an extended as a very challenging problem. Furthermore, the inclusion of user behavior in optimization based control schemes introduces strong decomposition scheme for the anticipatory traffic control problem, based upon our previous contributions, which aims at i) reducing irregularities in the solution space shape, such as non-convexity and non-smoothness. In this work, we propose an extended the computational complexity of the problem by approaching it in a controller-by-controller fashion, and ii) internalizing specific decomposition scheme for the anticipatory traffic control problem, based upon our previous contributions, which aims at i) reducing constraints in the objective function, guiding the optimization process away from non-significant minima, such as flat regions. the computational complexity of the problem by approaching it in a controller-by-controller fashion, and ii) internalizing specific Through two small scale test networks and different, randomly chosen initial points, we compare how the proposed extension constraints in the objective function, guiding the optimization process away from non-significant minima, such as flat regions. influences optimization results with respect to our previously developed decomposed approach, as well as centralized schemes. Through two small scale test networks and different, randomly chosen initial points, we compare how the proposed extension influences optimization results with respect to our previously developed decomposed approach, as well as centralized schemes. [less ▲]

Detailed reference viewed: 31 (2 UL)
Full Text
Peer Reviewed
See detailA local dynamic route and green time swapping control algorithm maximizing total network capacity
Viti, Francesco UL; Rinaldi, Marco UL

in Proceedings of the 25th Mediterranean Conference on Control and Automation, MED 2017 (2017)

This paper deals with the traffic signal control problem. More specifically it investigates the impact at a network level of simple dynamic local traffic control policies. A dynamic route swapping rule is ... [more ▼]

This paper deals with the traffic signal control problem. More specifically it investigates the impact at a network level of simple dynamic local traffic control policies. A dynamic route swapping rule is adopted to model the behavioral response of the travellers to signal changes, while a dynamic signal control swapping rule based on an equi-pressure policy is used to implicitly consider the flow response within the control updating process. Results on a simple network show that the flow responsive control policy outperforms pre-timed control, as well as a more conventional local control policy based on signal equi-saturation. Numerical results show also that the swapping rule based on equi-pressure is less susceptible to local optima, to systematically improve total network throughput, and to increase its effectiveness with when demand increases. © 2017 IEEE. [less ▲]

Detailed reference viewed: 77 (1 UL)
Full Text
Peer Reviewed
See detailOn characterizing the relationship between route choice behavior and optimal traffic control solution space
Rinaldi, Marco UL; Tampère, C. M. J.; Viti, Francesco UL

in Transportation Research Procedia (2017), 23

Explicitly including the dynamics of users' route choice behaviour in optimal traffic control applications has been of interest for researchers in the last five decades. This has been recognized as a very ... [more ▼]

Explicitly including the dynamics of users' route choice behaviour in optimal traffic control applications has been of interest for researchers in the last five decades. This has been recognized as a very challenging problem, due to the added layer of complexity and the considerable non-convexity of the resulting problem, even when dealing with simple static assignment and analytical link cost functions. In this work we establish a direct behavioural connection between the different shapes and structures emerging in the solution space of such problems and the underlying route choice behaviour. We specifically investigate how changes in the active equilibrium route set exert direct influence on the solution space's structure and behaviour. Based on this result, we then formulate and validate a constrained version of the original problem, yielding desirable properties in terms of solution space regularity. © 2017 The Authors. [less ▲]

Detailed reference viewed: 81 (2 UL)
Full Text
Peer Reviewed
See detailExact and approximate route set generation for resilient partial observability in sensor location problems
Rinaldi, Marco UL; Viti, Francesco UL

in Transportation Research. Part B : Methodological (2017), 105

Sensor positioning is a fundamental problem in transportation networks, as the location of sensors strongly determines how traffic flows are observable and hence manageable. This paper aims to develop a ... [more ▼]

Sensor positioning is a fundamental problem in transportation networks, as the location of sensors strongly determines how traffic flows are observable and hence manageable. This paper aims to develop a methodology to determine sensor locations on a network such that an optimal trade-off solution is found between the amount of sensors installed and the resilience of the sensor set. In particular, we propose exact and heuristic solutions for identifying the optimal route sets such that no other route would include any additional information for finding optimal full and partial observability solutions. This is an important contribution to sensor location problems, as route-based link flow inference problems have non-unique solutions, strongly depending on the used link-route information. The properties of the new methodology are analyzed and illustrated through different case studies, and the advantages of the algorithms are quantified both for full and for partial observability solutions. Due to the route sets found by our approach, we are able to find full observability solutions characterized by a small number of sensors, while yet being efficient also in terms of partial observability. We perform validation tests on both small and real-life sized network instances. © 2017 Elsevier Ltd [less ▲]

Detailed reference viewed: 100 (3 UL)
Full Text
Peer Reviewed
See detailOn characterizing the relationship between route choice behaviuor and optimal traffic control solution space
Rinaldi, Marco UL; Tampère, C. M. J.; Viti, Francesco UL

in Transportation Research. Part B : Methodological (2017)

Explicitly including the dynamics of users' route choice behaviour in optimal traffic control applications has been of interest for researchers in the last five decades. This has been recognized as a very ... [more ▼]

Explicitly including the dynamics of users' route choice behaviour in optimal traffic control applications has been of interest for researchers in the last five decades. This has been recognized as a very challenging problem, due to the added layer of complexity and the considerable non-convexity of the resulting problem, even when dealing with simple static assignment and analytical link cost functions. In this work we establish a direct behavioural connection between the different shapes and structures emerging in the solution space of such problems and the underlying route choice behaviour. We specifically investigate how changes in the active equilibrium route set exert direct influence on the solution space's structure and behaviour. Based on this result, we then formulate and validate a constrained version of the original problem, yielding desirable properties in terms of solution space regularity. © 2017. [less ▲]

Detailed reference viewed: 87 (3 UL)
Full Text
Peer Reviewed
See detailExperimental analysis of eGLOSA and eGLODTA transit control strategies
Giorgione, Giulio UL; Viti, Francesco UL; Rinaldi, Marco UL et al

in Proceedings of the 5th IEEE International Conference on Models and Technologies for Intelligent Transportation Systems, MT-ITS 2017 (2017)

Battery powered electric buses have higher energy efficiency, lower emissions and noise when compared to buses with internal combustion engines. However, due to battery charging requirements, their large ... [more ▼]

Battery powered electric buses have higher energy efficiency, lower emissions and noise when compared to buses with internal combustion engines. However, due to battery charging requirements, their large-scale integration into public transport operations is more complex. This study proposes a novel concept supporting said integration via new control strategies, dubbed e-GLOSA and e-GLODTA. These strategies extend the existing Green Light Optimal Speed and Dwell Time Systems (GLOSA/GLODTA) to account for the specific needs of electric buses. That is, they include the goals of minimizing the energy consumption between charging stations, and maximizing available charging time. At the same time, interference with schedule requirements is minimized. The formulated heuristics are tested on a Bus Rapid Transit (BRT) corridor case study, where different scenarios—such as placement of charging stations and bus regularity—are studied to assess under which conditions each action (maintain speed, accelerate or dwell for a longer time at a stop) is beneficial. Results show that eGLOSA contributes to schedule adherence while eGLODTA allows satisfying charging time constraints. [less ▲]

Detailed reference viewed: 118 (26 UL)
Full Text
Peer Reviewed
See detailA network-wide assessment of local signal control policies’ performance in practical implementations
Cantelmo, Guido UL; Viti, Francesco UL; Rinaldi, Marco UL

in Intelligent Transportation Systems (ITSC), 2016 IEEE 19th International Conference on (2016, November)

Detailed reference viewed: 95 (9 UL)
Peer Reviewed
See detailA PAS-state constrained optimization formulation for the anticipatory network traffic control problem
Rinaldi, Marco UL; Tampère, Chris

Scientific Conference (2016, September)

Detailed reference viewed: 101 (2 UL)
Full Text
Peer Reviewed
See detailNetwork observability information maximization through ad-hoc route enumeration approaches
Rinaldi, Marco UL; Corman, Francesco; Viti, Francesco UL

Scientific Conference (2016, June)

Detailed reference viewed: 54 (2 UL)
Full Text
Peer Reviewed
See detailImproving the accuracy of OD estimation from traffic counts employing a partial observabillity maximizing methodology
Rinaldi, Marco UL; Fakhraeiroudsari, Farzad; Viti, Francesco UL et al

Scientific Conference (2016, January)

Detailed reference viewed: 57 (1 UL)
Full Text
Peer Reviewed
See detailA sensitivity-based approach for adaptive decomposition of anticipatory network traffic control
Rinaldi, Marco UL; Himpe, W.; Tampère, C. M. J.

in Transportation Research. Part C : Emerging Technologies (2016), 66

Anticipatory optimal network control is defined as the problem of determining the set of control actions that minimizes a network-wide objective function. This not only takes into account local ... [more ▼]

Anticipatory optimal network control is defined as the problem of determining the set of control actions that minimizes a network-wide objective function. This not only takes into account local consequences on the propagation of flows, but also the global network-wide routing behavior of the users. Such an objective function is, in general, defined in a centralized setting, as knowledge regarding the whole network is needed to correctly compute it. Reaching a level of centralization sufficient to attain network-wide control objectives is however rarely realistic in practice. Multiple authorities are influencing different portions the network, separated either hierarchically or geographically. The distributed nature of networks and traffic directly influences the complexity of the anticipatory control problem. This is our motivation for this work, in which we introduce a decomposition mechanism for the global anticipatory network traffic control problem, based on dynamic clustering of traffic controllers. Rather than solving the full centralized problem, or blindly performing a full controller-wise decomposition, this technique allows recognizing when and which controllers should be grouped in clusters, and when, instead, these can be optimized separately. The practical relevance with respect to our motivation is that our approach allows identification of those network traffic conditions in which multiple actors need to actively coordinate their actions, or when unilateral action suffices for still approximating global optimality. This clustering procedure is based on well-known algebraic and statistical tools that exploit the network's sensitivity to control and its structure to deduce coupling behavior. We devise several case studies in order to assess our newly introduced procedure's performances, in comparison with fully decomposed and fully centralized anticipatory optimal network control, and show that our approach is able to outperform both centralized and decomposed procedures. © 2016 Elsevier Ltd. [less ▲]

Detailed reference viewed: 73 (2 UL)
Full Text
Peer Reviewed
See detailSystematic assessment of local & global signal control policies: A methodological perspective
Cantelmo, Guido UL; Viti, Francesco UL; Rinaldi, Marco UL et al

in Proceedings of 2015 International Conference on Models and Technologies for Intelligent Transportation Systems, MT-ITS 2015 (2015)

Traffic control performance on networks depends on the flow response to the policy adopted, which in turn contributes to determine the optimal signal settings. This paper focuses on the relationship ... [more ▼]

Traffic control performance on networks depends on the flow response to the policy adopted, which in turn contributes to determine the optimal signal settings. This paper focuses on the relationship between local and network wide traffic control policies within the combined traffic control and assignment problem. Through a full exploration of the solution space, an in depth cross comparison is performed between the well-known local policies P0 and Equisaturation, versus the global policies Maximum Throughput and Minimum Delay, to verify how the two local policies approximate the optimal settings for signalized intersections. Realistic traffic dynamics, such as congestion, multiple controllers and spillback are considered, to empirically determine the conditions under which the local policies are able to approximate global performances. After presenting the different local and global control policies, experiments are performed on simple toy networks. The complexity of the underlying network and, therefore, of the problems' boundary conditions is then increased, allowing us to showcase how the different metrics perform in different situations. Finally, conclusions on the results are drawn. © 2015 BME. [less ▲]

Detailed reference viewed: 23 (1 UL)
Full Text
Peer Reviewed
See detailAn Integrated Perspective on Traffic Management and Logistic Optimization
Amaral, R. R.; Aghezzaf, E.-H.; Rinaldi, Marco UL et al

in Proceedings of the 18th IEEE International Conference on Intelligent Transportation Systems, ITSC 2015 (2015)

Traffic Management and Logistic Optimization have been extensively studied as two separate classes of problems, for which numerous methodologies, mathematical models and algorithmic solutions were made ... [more ▼]

Traffic Management and Logistic Optimization have been extensively studied as two separate classes of problems, for which numerous methodologies, mathematical models and algorithmic solutions were made available in literature. However, little attention has been devoted to the interactions between the variables involved in these problems and the consequences of the decision making processes carried independently by Traffic Managers and Logistic Players. We believe this to be of considerable importance, since partial or incomplete knowledge on one another's decisions might yield sub-optimality for either or both of them. In this work, we propose an integrated view on both classes of problems, providing mathematical formulations to support the assessment of the impact which the two players may have on each other. © 2015 IEEE. [less ▲]

Detailed reference viewed: 59 (0 UL)
Full Text
Peer Reviewed
See detailAn extended coordinate descent method for distributed anticipatory network traffic control
Rinaldi, Marco UL; Tampère, C. M. J.

in Transportation Research. Part B : Methodological (2015), 80

Anticipatory optimal network control can be defined as the practice of determining the set of control actions that minimizes a network-wide objective function, so that the consequences of this action are ... [more ▼]

Anticipatory optimal network control can be defined as the practice of determining the set of control actions that minimizes a network-wide objective function, so that the consequences of this action are taken in consideration not only locally, on the propagation of flows, but globally, taking into account the user's routing behavior. Such an objective function is, in general, defined and optimized in a centralized setting, as knowledge regarding the whole network is needed in order to correctly compute it. This is a strong theoretical framework but, in practice, reaching a level of centralization sufficient to achieve said optimality is very challenging. Furthermore, even if centralization was possible, it would exhibit several shortcomings, with concerns such as computational speed (centralized optimization of a huge control set with a highly nonlinear objective function), reliability and communication overhead arising.The main aim of this work is to develop a decomposed heuristic descent algorithm that, demanding the different control entities to share the same information set, attains network-wide optimality through separate control actions. © 2015 Elsevier Ltd. [less ▲]

Detailed reference viewed: 67 (2 UL)
Full Text
Peer Reviewed
See detailCentralized and decomposed anticipatory Model Predictive Control for network-wide Ramp Metering
Rinaldi, Marco UL; Tampere, C. M. J.; Himpe, W. et al

in Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems: Intelligent Transportation Systems for All Modes, ITSC 2013 (2013)

The problem of determining Ramp Metering control rates, taking into account routing response, is addressed in this paper. We develop Model Predictive Control based Anticipatory control schemes, featuring ... [more ▼]

The problem of determining Ramp Metering control rates, taking into account routing response, is addressed in this paper. We develop Model Predictive Control based Anticipatory control schemes, featuring both centralized and decomposed optimization problems, with focus on real-life deployability. We then evaluate the aforementioned schemes' performances in comparison to simpler, non-anticipatory control techniques, by means of software simulation based on purpose-built experimental scenarios. © 2013 IEEE. [less ▲]

Detailed reference viewed: 80 (0 UL)
Full Text
Peer Reviewed
See detailDistributed identification of the Cell Transmission traffic model: A case study
Rinaldi, Marco UL; Capisani, L.; Ferrara, A. et al

in Procedings of the 2012 American Control Conference, ACC 2012 (2012)

The problem of the distributed identification of a macroscopic first-order traffic model, viz. the Cell Transmission Model (CTM), is considered in the paper. The parameters to be identified characterize ... [more ▼]

The problem of the distributed identification of a macroscopic first-order traffic model, viz. the Cell Transmission Model (CTM), is considered in the paper. The parameters to be identified characterize the dynamics of the density in different sections of the freeway (cells). We explore different distributed identification schemes. The purposes of the approach are mainly to obtain good prediction models through the minimization of the one-step ahead prediction error of the densities of the cells, and to reduce the computational time and the effort required to perform the identification. The methodology is validated relying on real-life data measured on a portion of the A12 freeway in The Netherlands. An evaluation of the performance of the identified model used as a set of virtual sensors in different scenarios is presented. © 2012 AACC American Automatic Control Council). [less ▲]

Detailed reference viewed: 58 (0 UL)