8,996 research outputs found
Parallel implementation of the TRANSIMS micro-simulation
This paper describes the parallel implementation of the TRANSIMS traffic
micro-simulation. The parallelization method is domain decomposition, which
means that each CPU of the parallel computer is responsible for a different
geographical area of the simulated region. We describe how information between
domains is exchanged, and how the transportation network graph is partitioned.
An adaptive scheme is used to optimize load balancing. We then demonstrate how
computing speeds of our parallel micro-simulations can be systematically
predicted once the scenario and the computer architecture are known. This makes
it possible, for example, to decide if a certain study is feasible with a
certain computing budget, and how to invest that budget. The main ingredients
of the prediction are knowledge about the parallel implementation of the
micro-simulation, knowledge about the characteristics of the partitioning of
the transportation network graph, and knowledge about the interaction of these
quantities with the computer system. In particular, we investigate the
differences between switched and non-switched topologies, and the effects of 10
Mbit, 100 Mbit, and Gbit Ethernet. keywords: Traffic simulation, parallel
computing, transportation planning, TRANSIM
Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
We address the problem of simulating pair-interaction Hamiltonians in n node
quantum networks where the subsystems have arbitrary, possibly different,
dimensions. We show that any pair-interaction can be used to simulate any other
by applying sequences of appropriate local control sequences. Efficient schemes
for decoupling and time reversal can be constructed from orthogonal arrays.
Conditions on time optimal simulation are formulated in terms of spectral
majorization of matrices characterizing the coupling parameters. Moreover, we
consider a specific system of n harmonic oscillators with bilinear interaction.
In this case, decoupling can efficiently be achieved using the combinatorial
concept of difference schemes. For this type of interactions we present optimal
schemes for inversion.Comment: 19 pages, LaTeX2
Individual Adaption in a Path-Based Simulation of the Freeway Network of Northrhine-Westfalia
Traffic simulations are made more realistic by giving individual drivers
intentions, i.e. an idea of where they want to go. One possible implementation
of this idea is to give each driver an exact pre-computed path, that is, a
sequence of roads this driver wants to follow. This paper shows, in a realistic
road network, how repeated simulations can be used so that drivers can explore
different paths, and how macroscopic quantities such as locations of jams or
network throughput change as a result of this
The dynamics of iterated transportation simulations
Iterating between a router and a traffic micro-simulation is an increasibly
accepted method for doing traffic assignment. This paper, after pointing out
that the analytical theory of simulation-based assignment to-date is
insufficient for some practical cases, presents results of simulation studies
from a real world study. Specifically, we look into the issues of uniqueness,
variability, and robustness and validation. Regarding uniqueness, despite some
cautionary notes from a theoretical point of view, we find no indication of
``meta-stable'' states for the iterations. Variability however is considerable.
By variability we mean the variation of the simulation of a given plan set by
just changing the random seed. We show then results from three different
micro-simulations under the same iteration scenario in order to test for the
robustness of the results under different implementations. We find the results
encouraging, also when comparing to reality and with a traditional assignment
result.
Keywords: dynamic traffic assignment (DTA); traffic micro-simulation;
TRANSIMS; large-scale simulations; urban planningComment: 24 pages, 7 figure
Optimal Control of Transient Flow in Natural Gas Networks
We outline a new control system model for the distributed dynamics of
compressible gas flow through large-scale pipeline networks with time-varying
injections, withdrawals, and control actions of compressors and regulators. The
gas dynamics PDE equations over the pipelines, together with boundary
conditions at junctions, are reduced using lumped elements to a sparse
nonlinear ODE system expressed in vector-matrix form using graph theoretic
notation. This system, which we call the reduced network flow (RNF) model, is a
consistent discretization of the PDE equations for gas flow. The RNF forms the
dynamic constraints for optimal control problems for pipeline systems with
known time-varying withdrawals and injections and gas pressure limits
throughout the network. The objectives include economic transient compression
(ETC) and minimum load shedding (MLS), which involve minimizing compression
costs or, if that is infeasible, minimizing the unfulfilled deliveries,
respectively. These continuous functional optimization problems are
approximated using the Legendre-Gauss-Lobatto (LGL) pseudospectral collocation
scheme to yield a family of nonlinear programs, whose solutions approach the
optima with finer discretization. Simulation and optimization of time-varying
scenarios on an example natural gas transmission network demonstrate the gains
in security and efficiency over methods that assume steady-state behavior
Experiences with a simplified microsimulation for the Dallas/Fort Worth area
We describe a simple framework for micro simulation of city traffic. A medium
sized excerpt of Dallas was used to examine different levels of simulation
fidelity of a cellular automaton method for the traffic flow simulation and a
simple intersection model. We point out problems arising with the granular
structure of the underlying rules of motion.Comment: accepted by Int.J.Mod.Phys.C, 20 pages, 14 figure
- …