24.08.2013 Views

VISSIM 5.30-05 User Manual

VISSIM 5.30-05 User Manual

VISSIM 5.30-05 User Manual

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

12.2 Principle<br />

Principle<br />

The Dynamic Assignment procedure in <strong>VISSIM</strong> is based on the idea of<br />

iterated simulation. That means a modeled network is simulated not only<br />

once but repetitively and the drivers choose their routes through the network<br />

based on the travel cost they have experienced during the preceding<br />

simulations. To model that kind of “learning process”, several tasks are to be<br />

addressed:<br />

► Routes from origins to destinations must be found. <strong>VISSIM</strong> assumes that<br />

not everybody uses the best route but that less attractive routes are used<br />

as well, although by a minor part of the drivers. That means not only the<br />

best routes must be known for each origin-destination relation but a set<br />

of routes. Ideally we would have the set of the k best routes but there are<br />

no efficient methods to compute this set of routes directly - at least not in<br />

a way that makes sense for traffic assignment. The solution adopted in<br />

<strong>VISSIM</strong> is to compute best paths in each repetition of the simulation and<br />

thus to find more than one route because traffic conditions change during<br />

the iteration. During the iterated simulations <strong>VISSIM</strong> builds a growing<br />

archive of routes from which the drivers choose. See section 12.6 for a<br />

detailed description of how routes are computed.<br />

► The routes must have some kind of assessment on which the drivers<br />

base their choice. In <strong>VISSIM</strong> for all routes the so called generalized costs<br />

are computed, i.e. a combination of distance, travel time and “other”<br />

costs (e.g. tolls). Distance and costs are defined directly in the network<br />

model but travel time is a result of the simulation. Therefore <strong>VISSIM</strong><br />

measures travel times on all edges in the network during one simulation<br />

so that the route choice decision model in the next simulation can use<br />

these values.<br />

► The choice of one route out of a set of possible routes is a special case<br />

of the more general problem called “discrete choice modeling”. Given a<br />

set of routes and their generalized costs, the percentages of the drivers<br />

that choose each route is computed. By far the most frequently used<br />

mathematical function to model that kind of choice among alternatives is<br />

the Logit model. <strong>VISSIM</strong> uses a variant of the Logit model to handle<br />

route choice. See section 12.6.2 for a detailed description.<br />

The <strong>VISSIM</strong> road network model is very detailed in order to allow an exact<br />

reproduction of the traffic flow in a high resolution in time and space. All of<br />

the three tasks above do not require such a detailed model of the network,<br />

e.g. the choice which route to take from one side of the city to the other does<br />

not consider how the intersections actually look like or on which lane the<br />

vehicles travel.<br />

Assignment related problems always refer to a more abstract idea of the<br />

road network where the intersections are the nodes and the roads between<br />

the intersections are the edges of an abstract graph. The assignment<br />

procedures can operate much more efficiently on this type of graph and this<br />

level of abstraction is more appropriate even for the human understanding of<br />

the problem.<br />

<strong>User</strong> <strong>Manual</strong> © PTV AG 2011 593

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!