1,188 research outputs found

    Stochastic user equilibrium assignment with traffic-responsive signal control

    Get PDF
    This paper considers the Stochastic User Equilibrium (SUE) assignment problem for a signal-controlled network in which intersection control is flow-responsive. The problem is addressed within a Combined Traffic Assignment and Control (CTAC) modeling framework, in which the calculation of user equilibrium link flows is integrated with the calculation of consistent signal settings [1]. It is assumed that network equilibrium is dispersed due to user misperceptions of travel times, and that the intersection control system is designed to allow the persistent adjustment of signal settings in response to traffic flow variations. Thus, the model simulates real- world situations in which network users have limited information and signal control is traffic-actuated. The SUE- based CTAC model is solved algorithmically by means of the so- called Iterative Optimization and Assignment (IOA) procedure, a widely used heuristic which relies on the alternate execution of a control step (signal setting calculation for fixed link flows) and an assignment step (network equilibration under fixed signal settings). The main objective of the study is to define a methodological framework for the evaluation of the performance of various traffic-responsive signal control strategies in interaction with different levels of user information, as represented by the spread parameter of the perceived travel time distribution assumed in the SUE assignment submodel. The results are of practical relevance in a policy context, as they provide a basis for assessing the potential integration of Advanced Traveler Information Systems (ATIS) and signal control systems. Several computational experiments are carried out on a small, contrived network and using realistic intersection delay functions, in order to test the behavior of the model under a wide range of conditions; in particular, convergence pattern and network performance measures at equilibrium are analyzed under alternative information/control scenarios and for various demand levels. The issue of uniqueness of the model solution is addressed as well. Reference: [1] Meneguzzer C. (1997). Review of models combining traffic assignment and signal control. ASCE Journal of Transportation Engineering, vol. 123, no. 2, pp. 148-155.

    Analysis and operational challenges of dynamic ride sharing demand responsive transportation models

    Get PDF
    There is a wide body of evidence that suggests sustainable mobility is not only a technological question, but that automotive technology will be a part of the solution in becoming a necessary albeit insufficient condition. Sufficiency is emerging as a paradigm shift from car ownership to vehicle usage, which is a consequence of socio-economic changes. Information and Communication Technologies (ICT) now make it possible for a user to access a mobility service to go anywhere at any time. Among the many emerging mobility services, Multiple Passenger Ridesharing and its variants look the most promising. However, challenges arise in implementing these systems while accounting specifically for time dependencies and time windows that reflect users’ needs, specifically in terms of real-time fleet dispatching and dynamic route calculation. On the other hand, we must consider the feasibility and impact analysis of the many factors influencing the behavior of the system – as, for example, service demand, the size of the service fleet, the capacity of the shared vehicles and whether the time window requirements are soft or tight. This paper analyzes - a Decision Support System that computes solutions with ad hoc heuristics applied to variants of Pick Up and Delivery Problems with Time Windows, as well as to Feasibility and Profitability criteria rooted in Dynamic Insertion Heuristics. To evaluate the applications, a Simulation Framework is proposed. It is based on a microscopic simulation model that emulates real-time traffic conditions and a real traffic information system. It also interacts with the Decision Support System by feeding it with the required data for making decisions in the simulation that emulate the behavior of the shared fleet. The proposed simulation framework has been implemented in a model of Barcelona’s Central Business District. The obtained results prove the potential feasibility of the mobility concept.Postprint (published version

    Towards Developing a Travel Time Forecasting Model for Location-Based Services: a Review

    Get PDF
    Travel time forecasting models have been studied intensively as a subject of Intelligent Transportation Systems (ITS), particularly in the topics of advanced traffic management systems (ATMS), advanced traveler information systems (ATIS), and commercial vehicle operations (CVO). While the concept of travel time forecasting is relatively simple, it involves a notably complicated task of implementing even a simple model. Thus, existing forecasting models are diverse in their original formulations, including mathematical optimizations, computer simulations, statistics, and artificial intelligence. A comprehensive literature review, therefore, would assist in formulating a more reliable travel time forecasting model. On the other hand, geographic information systems (GIS) technologies primarily provide the capability of spatial and network database management, as well as technology management. Thus, GIS could support travel time forecasting in various ways by providing useful functions to both the managers in transportation management and information centers (TMICs) and the external users. Thus, in developing a travel time forecasting model, GIS could play important roles in the management of real-time and historical traffic data, the integration of multiple subsystems, and the assistance of information management. The purpose of this paper is to review various models and technologies that have been used for developing a travel time forecasting model with geographic information systems (GIS) technologies. Reviewed forecasting models in this paper include historical profile approaches, time series models, nonparametric regression models, traffic simulations, dynamic traffic assignment models, and neural networks. The potential roles and functions of GIS in travel time forecasting are also discussed.

    On the Feasibility of Social Network-based Pollution Sensing in ITSs

    Full text link
    Intense vehicular traffic is recognized as a global societal problem, with a multifaceted influence on the quality of life of a person. Intelligent Transportation Systems (ITS) can play an important role in combating such problem, decreasing pollution levels and, consequently, their negative effects. One of the goals of ITSs, in fact, is that of controlling traffic flows, measuring traffic states, providing vehicles with routes that globally pursue low pollution conditions. How such systems measure and enforce given traffic states has been at the center of multiple research efforts in the past few years. Although many different solutions have been proposed, very limited effort has been devoted to exploring the potential of social network analysis in such context. Social networks, in general, provide direct feedback from people and, as such, potentially very valuable information. A post that tells, for example, how a person feels about pollution at a given time in a given location, could be put to good use by an environment aware ITS aiming at minimizing contaminant emissions in residential areas. This work verifies the feasibility of using pollution related social network feeds into ITS operations. In particular, it concentrates on understanding how reliable such information is, producing an analysis that confronts over 1,500,000 posts and pollution data obtained from on-the- field sensors over a one-year span.Comment: 10 pages, 15 figures, Transaction Forma

    Distributed Learning over Unreliable Networks

    Full text link
    Most of today's distributed machine learning systems assume {\em reliable networks}: whenever two machines exchange information (e.g., gradients or models), the network should guarantee the delivery of the message. At the same time, recent work exhibits the impressive tolerance of machine learning algorithms to errors or noise arising from relaxed communication or synchronization. In this paper, we connect these two trends, and consider the following question: {\em Can we design machine learning systems that are tolerant to network unreliability during training?} With this motivation, we focus on a theoretical problem of independent interest---given a standard distributed parameter server architecture, if every communication between the worker and the server has a non-zero probability pp of being dropped, does there exist an algorithm that still converges, and at what speed? The technical contribution of this paper is a novel theoretical analysis proving that distributed learning over unreliable network can achieve comparable convergence rate to centralized or distributed learning over reliable networks. Further, we prove that the influence of the packet drop rate diminishes with the growth of the number of \textcolor{black}{parameter servers}. We map this theoretical result onto a real-world scenario, training deep neural networks over an unreliable network layer, and conduct network simulation to validate the system improvement by allowing the networks to be unreliable

    Green Cellular Networks: A Survey, Some Research Issues and Challenges

    Full text link
    Energy efficiency in cellular networks is a growing concern for cellular operators to not only maintain profitability, but also to reduce the overall environment effects. This emerging trend of achieving energy efficiency in cellular networks is motivating the standardization authorities and network operators to continuously explore future technologies in order to bring improvements in the entire network infrastructure. In this article, we present a brief survey of methods to improve the power efficiency of cellular networks, explore some research issues and challenges and suggest some techniques to enable an energy efficient or "green" cellular network. Since base stations consume a maximum portion of the total energy used in a cellular system, we will first provide a comprehensive survey on techniques to obtain energy savings in base stations. Next, we discuss how heterogeneous network deployment based on micro, pico and femto-cells can be used to achieve this goal. Since cognitive radio and cooperative relaying are undisputed future technologies in this regard, we propose a research vision to make these technologies more energy efficient. Lastly, we explore some broader perspectives in realizing a "green" cellular network technologyComment: 16 pages, 5 figures, 2 table

    Dynamic Message Sign and Diversion Traffic Optimization

    Get PDF
    This dissertation proposes a Dynamic Message Signs (DMS) diversion control system based on principles of existing Advanced Traveler Information Systems and Advanced Traffic Management Systems (ATMS). The objective of the proposed system is to alleviate total corridor traffic delay by choosing optimized diversion rate and alternative road signal-timing plan. The DMS displays adaptive messages at predefined time interval for guiding certain number of drivers to alternative roads. Messages to be displayed on the DMS are chosen by an on-line optimization model that minimizes corridor traffic delay. The expected diversion rate is assumed following a distribution. An optimization model that considers three traffic delay components: mainline travel delay, alternative road signal control delay, and the travel time difference between the mainline and alternative roads is constructed. Signal timing parameters of alternative road intersections and DMS message level are the decision variables; speeds, flow rates, and other corridor traffic data from detectors serve as inputs of the model. Traffic simulation software, CORSIM, served as a developmental environment and test bed for evaluating the proposed system. MATLAB optimization toolboxes have been applied to solve the proposed model. A CORSIM Run-Time-Extension (RTE) has been developed to exchange data between CORSIM and the adopted MATLAB optimization algorithms (Genetic Algorithm, Pattern Search in direct search toolbox, and Sequential Quadratic Programming). Among the three candidate algorithms, the Sequential Quadratic Programming showed the fastest execution speed and yielded the smallest total delays for numerical examples. TRANSYT-7F, the most credible traffic signal optimization software has been used as a benchmark to verify the proposed model. The total corridor delays obtained from CORSIM with the SQP solutions show average reductions of 8.97%, 14.09%, and 13.09% for heavy, moderate and light traffic congestion levels respectively when compared with TRANSYT-7F optimization results. The maximum model execution time at each MATLAB call is fewer than two minutes, which implies that the system is capable of real world implementation with a DMS message and signal update interval of two minutes

    Algorithms for advance bandwidth reservation in media production networks

    Get PDF
    Media production generally requires many geographically distributed actors (e.g., production houses, broadcasters, advertisers) to exchange huge amounts of raw video and audio data. Traditional distribution techniques, such as dedicated point-to-point optical links, are highly inefficient in terms of installation time and cost. To improve efficiency, shared media production networks that connect all involved actors over a large geographical area, are currently being deployed. The traffic in such networks is often predictable, as the timing and bandwidth requirements of data transfers are generally known hours or even days in advance. As such, the use of advance bandwidth reservation (AR) can greatly increase resource utilization and cost efficiency. In this paper, we propose an Integer Linear Programming formulation of the bandwidth scheduling problem, which takes into account the specific characteristics of media production networks, is presented. Two novel optimization algorithms based on this model are thoroughly evaluated and compared by means of in-depth simulation results

    Doctor of Philosophy

    Get PDF
    dissertationTraffic congestion occurs because the available capacity cannot serve the desired demand on a portion of the roadway at a particular time. Major sources of congestion include recurring bottlenecks, incidents, work zones, inclement weather, poor signal timing, and day-to-day fluctuations in normal traffic demand. This dissertation addresses a series of critical and challenging issues in evaluating the benefits of Advanced Traveler Information Strategies under different uncertainty modeling approaches are integrated in this dissertation, namely: mathematical programming, dynamic simulation and analytical approximation. The proposed models aim to 1) represent static-state network user equilibrium conditions, knowledge quality and accessibility of traveler information systems under both stochastic capacity and stochastic demand distributions; 2) characterize day-to-day learning behavior with different information groups under stochastic capacity and 3) quantify travel time variability from stochastic capacity distribution functions on critical bottlenecks. First, a nonlinear optimization-based conceptual framework is proposed for incorporating stochastic capacity, stochastic demand, travel time performance functions and varying degrees of traveler knowledge in an advanced traveler information provision environment. This method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions across different days. Using a gap function framework, two mathematical programming models are further formulated to describe the route choice behavior of the perfect information and expected travel time user classes under stochastic day-dependent travel time. This dissertation also presents adaptive day-to-day traveler learning and route choice behavioral models under the travel time variability. To account for different levels of information availability and cognitive limitations of individual travelers, a set of "bounded rationality" rules are adapted to describe route choice rules for a traffic system with inherent process noise and different information provision strategies. In addition, this dissertation investigates a fundamental problem of quantifying travel time variability from its root sources: stochastic capacity and demand variations that follow commonly used log-normal distributions. The proposed models provide theoretically rigorous and practically usefully tools to understand the causes of travel time unreliability and evaluate the system-wide benefit of reducing demand and capacity variability
    • …
    corecore