Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

Traffic information systems have become a major issue in many countries as a modern technology for alleviating traffic congestion in urban areas. Pre-trip or en-route real-time travel information regarding traffic conditions can enhance drivers’ knowledge of the situation in road networks and may assist in drivers’ decisions such as the choice of departure time, route, and destination. In facts...

Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...

Many static analyzers exploit sparseness techniques to reduce the amount of information being propagated and stored during analysis. Although several variations are described in the literature, no existing technique is suitable for analyzing JavaScript code. In this paper, we point out the need for a sparse analysis framework that supports pointers and reachability. We present such a framework,...

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for...

We present a novel decentralized and infrastructure-less algorithm to alleviate traffic congestions on road networks and to fill the void left by current algorithms which are either static, centralized, or require infrastructure. The algorithm follows an online approach that seeks stochastic user equilibrium and assigns traffic as it evolves in real time, without prior knowledge of the traffic ...

Title of Document: TRAFFIC ANALYSIS ON CUMULATIVE LAND DEVELOPMENT AND TRANSPORTATION RELATED POLICY SCENARIOS Zheng Zhu, Master of Science, 2014 Directed By: Professor Lei Zhang, Department of Civil and Environmental Engineering Numerous methods have been developed to evaluate the impact of land developments and transportation policies on transportation infrastructures. But traditional approac...

— This study concerns the air route network design problem and more precisely the route and level flight assignment problem, which has already become a key issue owing to the growth of air traffic. A number of related problems appear in the operations research literature, notably vehicle routing, scheduling and other transportation problems. The problem studied in this paper concerns the genera...

This paper addresses a theoretical issue related to combined dynamic traffic assignment and signal control under conditions of congestion through a brief review of previous research and the discussion on interaction between dynamic traffic assignment and signal control. The dynamic characteristics of the interaction are approached using a differential game modeling approach here to formulate th...

In dynamic carrier allocation (DCA) strategies, carriers are assigned priorities. Based upon how priorities are assigned to carriers, DCA strategies are classified into three classes: static-priority, dynamic-priority, and hybrid-priority strategies. In this paper, we lay out a theoretical foundation for DCA strategies: we first develop the concept of optimal reuse pattern and then propose a mo...