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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

12 Dynamic Assignment<br />

12.6 Route Search and Route Choice<br />

12.6.1 Routes and their Cost<br />

A route is a sequence of edges that describes a path through the network.<br />

Routes in <strong>VISSIM</strong>’s Dynamic Assignment start and end at parking lots. Since<br />

normally more than one route exists between an origin and a destination<br />

parking lot in the network <strong>VISSIM</strong> has to model the driver’s decision which<br />

route to take. For the beginning let us assume that the set of available routes<br />

is known for a certain origin-destination pair.<br />

As stated in the introduction the route choice is a special case of the discrete<br />

choice problem. For a given set of discrete alternatives the probabilities for<br />

the alternatives to be chosen must be determined. For traffic assignment we<br />

need to define a utility function to assess each route in the set and a decision<br />

function based on this assessment.<br />

As discussed in the previous section we know for all edges their general<br />

costs which are computed from expected travel times, travel distances and<br />

financial costs. The general cost for a route is then simply defined as the<br />

sum of the general costs of all its edges:<br />

C<br />

R<br />

=<br />

∑<br />

a∈R<br />

C<br />

a<br />

where<br />

C = general cost<br />

R = a route<br />

a = an edge belonging to R<br />

12.6.2 Route Choice<br />

In Dynamic Assignment the drivers have to choose a route when they start<br />

their trip at the origin parking lot. In this section let us assume that the<br />

destination parking lot is known and a set of possible routes is already<br />

known. The problem of how to find routes and choosing the destination<br />

parking lot is covered in separate sections.<br />

One basic assumption in <strong>VISSIM</strong>’s route choice model is that not all drivers<br />

use the best route but all routes available can be used. Of course more traffic<br />

should be assigned to “better” routes than to “worse” routes. To assess how<br />

“good” a route is, we use the general cost of the route as explained in the<br />

section above. The general cost is obviously the inverse of what is called a<br />

utility value in discrete choice modeling. So we use as an utility function the<br />

reciprocal of the general cost:<br />

624 <strong>VISSIM</strong> <strong>5.30</strong>-<strong>05</strong> © PTV AG 2011

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

Saved successfully!

Ooh no, something went wrong!