11,540 research outputs found
Volatile Decision Dynamics: Experiments, Stochastic Description, Intermittency Control, and Traffic Optimization
The coordinated and efficient distribution of limited resources by individual
decisions is a fundamental, unsolved problem. When individuals compete for road
capacities, time, space, money, goods, etc., they normally make decisions based
on aggregate rather than complete information, such as TV news or stock market
indices. In related experiments, we have observed a volatile decision dynamics
and far-from-optimal payoff distributions. We have also identified ways of
information presentation that can considerably improve the overall performance
of the system. In order to determine optimal strategies of decision guidance by
means of user-specific recommendations, a stochastic behavioural description is
developed. These strategies manage to increase the adaptibility to changing
conditions and to reduce the deviation from the time-dependent user
equilibrium, thereby enhancing the average and individual payoffs. Hence, our
guidance strategies can increase the performance of all users by reducing
overreaction and stabilizing the decision dynamics. These results are highly
significant for predicting decision behaviour, for reaching optimal behavioural
distributions by decision support systems, and for information service
providers. One of the promising fields of application is traffic optimization.Comment: For related work see http://www.helbing.or
A Review of Traffic Signal Control.
The aim of this paper is to provide a starting point for the future research within the SERC sponsored project "Gating and Traffic Control: The Application of State Space Control Theory". It will provide an introduction to State Space Control Theory, State Space applications in transportation in general, an in-depth review of congestion control (specifically traffic signal control in congested situations), a review of theoretical works, a review of existing systems and will conclude with recommendations for the research to be undertaken within this project
Microsimulation models incorporating both demand and supply dynamics
There has been rapid growth in interest in real-time transport strategies over the last decade, ranging from automated highway systems and responsive traffic signal control to incident management and driver information systems. The complexity of these strategies, in terms of the spatial and temporal interactions within the transport system, has led to a parallel growth in the application of traffic microsimulation models for the evaluation and design of such measures, as a remedy to the limitations faced by conventional static, macroscopic approaches. However, while this naturally addresses the immediate impacts of the measure, a difficulty that remains is the question of how the secondary impacts, specifically the effect on route and departure time choice of subsequent trips, may be handled in a consistent manner within a microsimulation framework.
The paper describes a modelling approach to road network traffic, in which the emphasis is on the integrated microsimulation of individual trip-makers’ decisions and individual vehicle movements across the network. To achieve this it represents directly individual drivers’ choices and experiences as they evolve from day-to-day, combined with a detailed within-day traffic simulation model of the space–time trajectories of individual vehicles according to car-following and lane-changing rules and intersection regulations. It therefore models both day-to-day and within-day variability in both demand and supply conditions, and so, we believe, is particularly suited for the realistic modelling of real-time strategies such as those listed above. The full model specification is given, along with details of its algorithmic implementation. A number of representative numerical applications are presented, including: sensitivity studies of the impact of day-to-day variability; an application to the evaluation of alternative signal control policies; and the evaluation of the introduction of bus-only lanes in a sub-network of Leeds. Our experience demonstrates that this modelling framework is computationally feasible as a method for providing a fully internally consistent, microscopic, dynamic assignment, incorporating both within- and between-day demand and supply dynamic
Recommended from our members
Adaptive Route Choice in Stochastic Time-Dependent Networks: Routing Algorithms and Choice Modeling
Transportation networks are inherently uncertain due to random disruptions; meanwhile, real-time information potentially helps travelers adapt to realized traffic conditions and make better route choices under such disruptions. Modeling adaptive route choice behavior is essential in evaluating Advanced Traveler Information Systems (ATIS) and related policies to better provide travelers with real-time information. This dissertation contributes to the state of the art by estimating the first latent-class routing policy choice model using revealed preference (RP) data and providing efficient computer algorithms for routing policy choice set generation. A routing policy is defined as a decision rule applied at each link that maps possible realized traffic conditions to decisions on the link to take next. It represents a traveler\u27s ability to look ahead in order to incorporate real-time information not yet available at the time of decision.
A case study is conducted in Stockholm, Sweden and data for the stochastic time-dependent network are generated from hired taxi Global Positioning System (GPS) traces through the methods of map-matching and non-parametric link travel time estimation. A latent-class Policy Size Logit model is specified with two additional layers of latency in the measurement equation. The two latent classes of travelers are policy users who follow routing policies and path users who follow fixed paths. For the measurement equation of the policy user class, the choice of a routing policy is latent and only its realized path on a given day can be observed. Furthermore, when GPS traces have relatively long gaps between consecutive readings, the realized path cannot be uniquely identified.
Routing policy choice set generation is based on the generalization of path choice set generation methods, and utilizes efficient implementation of an optimal routing policy (ORP) algorithm based on the two-queue data structure for label correcting. Systematic evaluation of the algorithm in random networks as well as in two large scale real-life networks is conducted. The generated choice sets are evaluated based on coverage and adaptiveness. Coverage is the percentage of observed trips included in the generated choice sets based on a certain threshold of overlapping between observed and generated routes, and adaptiveness represents the capability of a routing policy to be realized as different paths over different days. It is shown that using a combination of methods yields satisfactory coverage of 91.2%. Outlier analyses are then carried out for unmatching trips in choice set generation. The coverage achieves 95% for 100% threshold after correcting GPS errors and breaking up trips with intermediate stops, and further achieves 100% for 90% threshold.
The latent-class routing policy choice model is estimated against observed GPS traces based on the three different sample sizes resulting from coverage improvement, and the estimates appear consistent across different sample sizes. Estimation results show the policy user class probability increases with trip length, and the latent-class routing policy choice model fits the data better than a single-class path choice model or routing policy choice model. This suggests that travelers are heterogeneous in terms of their ability and willingness to plan ahead and utilize real-time information. Therefore, a fixed path model as commonly used in the literature may lose explanatory power due to its simplified assumptions on network stochasticity and travelers\u27 utilization of real-time information
Decentralized Routing on Spatial Networks with Stochastic Edge Weights
We investigate algorithms to find short paths in spatial networks with
stochastic edge weights. Our formulation of the problem of finding short paths
differs from traditional formulations because we specifically do not make two
of the usual simplifying assumptions: (1) we allow edge weights to be
stochastic rather than deterministic; and (2) we do not assume that global
knowledge of a network is available. We develop a decentralized routing
algorithm that provides en route guidance for travelers on a spatial network
with stochastic edge weights without the need to rely on global knowledge about
the network. To guide a traveler, our algorithm uses an estimation function
that evaluates cumulative arrival probability distributions based on distances
between pairs of nodes. The estimation function carries a notion of proximity
between nodes and thereby enables routing without global knowledge. In testing
our decentralized algorithm, we define a criterion that allows one to
discriminate among arrival probability distributions, and we test our algorithm
and this criterion using both synthetic and real networks.Comment: 10 pages, 9 figures (some with multiple parts
Recommended from our members
Real-Time Information and Correlations for Optimal Routing in Stochastic Networks
Congestion is a world-wide problem in transportation. One major reason is random interruptions. The traffic network is inherently stochastic, and strong dependencies exist among traffic quantities, e.g., travel time, traffic speed, link volume. Information in stochastic networks can help with adaptive routing in terms of minimizing expected travel time or disutility. Routing in such networks is different from that in deterministic networks or when stochastic dependencies are not taken into account. This dissertation addresses the optimal routing problems, including the optimal a priori path problem and the optimal adaptive routing problem with different information scenarios, in stochastic and time-dependent networks with explicit consideration of the correlations between link travel time random variables. There are a number of studies in the literature addressing the optimal routing problems, but most of them ignore the correlations between link travel times. The consideration of the correlations makes the problem studied in this dissertation difficult, both conceptually and computationally. The optimal path finding problem in such networks is different from that in stochastic and time-dependent networks with no consideration of the correlations. This dissertation firstly provides an empirical study of the correlations between random link travel times and also verifies the importance of the consideration of the spatial and temporal correlations in estimating trip travel time and its reliability. It then shows that Bellman\u27s principle of optimality or non-dominance is not valid due to the time-dependency and the correlations. A new property termed purity is introduced and an exact label-correcting algorithm is designed to solve the problem. With the fast advance of telecommunication technologies, real-time traffic information will soon become an integral part of travelers\u27 route choice decision making. The study of optimal adaptive routing problems is thus timely and of great value. This dissertation studies the problems with a wide variety of information scenarios, including delayed global information, real-time local information, pre-trip global information, no online information, and trajectory information. It is shown that, for the first four partial information scenarios, Bellman\u27s principle of optimality does not hold. A heuristic algorithm is developed and employed based on a set of necessary conditions for optimality. The same algorithm is showed to be exact for the perfect online information scenario. For optimal adaptive routing problem with trajectory information, this dissertation proves that, if the routing policy is defined in a similar way to other four information scenarios, i.e., the trajectory information is included in the state variable, Bellman\u27s principle of optimality is valid. However, this definition results in a prohibitively large number of the states and the computation can hardly be carried out. The dissertation provides a recursive definition for the trajectory-adaptive routing policy, for which the information is not included in the state variable. In this way, the number of states is small, but Bellman\u27s principle of optimality or non-dominance is invalid for a similar reason as in the optimal path problem. Again purity is introduced to the trajectory-adaptive routing policy and an exact algorithm is designed based on the concept of decreasing order of time
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
- …