10,100 research outputs found

    Convexity and Robustness of Dynamic Traffic Assignment and Freeway Network Control

    Get PDF
    We study the use of the System Optimum (SO) Dynamic Traffic Assignment (DTA) problem to design optimal traffic flow controls for freeway networks as modeled by the Cell Transmission Model, using variable speed limit, ramp metering, and routing. We consider two optimal control problems: the DTA problem, where turning ratios are part of the control inputs, and the Freeway Network Control (FNC), where turning ratios are instead assigned exogenous parameters. It is known that relaxation of the supply and demand constraints in the cell-based formulations of the DTA problem results in a linear program. However, solutions to the relaxed problem can be infeasible with respect to traffic dynamics. Previous work has shown that such solutions can be made feasible by proper choice of ramp metering and variable speed limit control for specific traffic networks. We extend this procedure to arbitrary networks and provide insight into the structure and robustness of the proposed optimal controllers. For a network consisting only of ordinary, merge, and diverge junctions, where the cells have linear demand functions and affine supply functions with identical slopes, and the cost is the total traffic volume, we show, using the maximum principle, that variable speed limits are not needed in order to achieve optimality in the FNC problem, and ramp metering is sufficient. We also prove bounds on perturbation of the controlled system trajectory in terms of perturbations in initial traffic volume and exogenous inflows. These bounds, which leverage monotonicity properties of the controlled trajectory, are shown to be in close agreement with numerical simulation results

    Shortest path or anchor-based route choice: a large-scale empirical analysis of minicab routing in London

    Get PDF
    Understanding and modelling route choice behaviour is central to predicting the formation and propagation of urban road congestion. Yet within conventional literature disagreements persist around the nature of route choice behaviour, and how it should be modelled. In this paper, both the shortest path and anchor-based perspectives on route choice behaviour are explored through an empirical analysis of nearly 700,000 minicab routes across London, United Kingdom. In the first set of analyses, the degree of similarity between observed routes and possible shortest paths is established. Shortest paths demonstrate poor performance in predicting both observed route choice and characteristics. The second stage of analysis explores the influence of specific urban features, named anchors, in route choice. These analyses show that certain features attract more route choices than would be expected were individuals choosing route based on cost minimisation alone. Instead, the results indicate that major urban features form the basis of route choice planning – being selected disproportionately more often, and causing asymmetry in route choice volumes by direction of travel. At a finer scale, decisions made at minor road features are furthermore demonstrated to influence routing patterns. The results indicate a need to revisit the basis of how routes are modelled, shifting from the shortest path perspective to a mechanism structured around urban features. In concluding, the main trends are synthesised within an initial framework for route choice modelling, and presents potential extensions of this research

    Asynchronous Nano-Electronics: Preliminary Investigation

    Get PDF
    This paper is a preliminary investigation in implementing asynchronous QDI logic in molecular nano-electronics, taking into account the restricted geometry, the lack of control on transistor strengths, the high timing variations. We show that the main building blocks of QDI logic can be successfully implemented; we illustrate the approach with the layout of an adder stage. The proposed techniques to improve the reliability of QDI apply to nano-CMOS as well

    Resilience of Traffic Networks with Partially Controlled Routing

    Full text link
    This paper investigates the use of Infrastructure-To-Vehicle (I2V) communication to generate routing suggestions for drivers in transportation systems, with the goal of optimizing a measure of overall network congestion. We define link-wise levels of trust to tolerate the non-cooperative behavior of part of the driver population, and we propose a real-time optimization mechanism that adapts to the instantaneous network conditions and to sudden changes in the levels of trust. Our framework allows us to quantify the improvement in travel time in relation to the degree at which drivers follow the routing suggestions. We then study the resilience of the system, measured as the smallest change in routing choices that results in roads reaching their maximum capacity. Interestingly, our findings suggest that fluctuations in the extent to which drivers follow the provided routing suggestions can cause failures of certain links. These results imply that the benefits of using Infrastructure-To-Vehicle communication come at the cost of new fragilities, that should be appropriately addressed in order to guarantee the reliable operation of the infrastructure.Comment: Accepted for presentation at the IEEE 2019 American Control Conferenc

    Priority Management for Urban Arterials. Transferability of Techniques: Hypothetical Arterials.

    Get PDF
    A series of hypothetical corridors have been simulated, representing a range of junction spacings, capacity distribution, availability of parallel routes, bus flows and routing patterns. These have been used to test a range of traffic management measures designed to increase capacity, improve public transport operations and calm traffic. All measures have been assessed in terms of their impact on travel costs and conclusions have been drawn in terms of the appropriateness of different measures in differing contexts
    corecore