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.

Closed edges are shown in red color rather than yellow.<br />

Assignment Control<br />

Restricting the Number of Routes<br />

The number of routes found during the iterations in principle is not restricted.<br />

Therefore, as long as no special action is done, all routes that have been<br />

found are stored in the route archive and are used for traffic distribution. As a<br />

result, to some rather expensive routes some vehicles will still be assigned<br />

even if in later iterations much better routes are found. To avoid this effect,<br />

the number of routes that is used for each OD pair can be restricted. There<br />

are two ways of restricting the number of routes:<br />

► Defining an upper limit for the number of routes<br />

► Defining a maximum of cost difference between the best and the worst<br />

route<br />

Defining an upper limit may not be appropriate in networks where for some<br />

OD pairs many alternative routes exist (and shall be used) and for other<br />

relations only few routes exist. Then the maximum of cost difference<br />

between the cheapest and the most expensive route may be defined. This<br />

method is intended to discard unwanted expensive routes that once have<br />

been the cheapest because some or all edges had no real cost evaluations<br />

yet (i.e. they were initialized with cost value 0.1). The low initialization values<br />

encourage the route choice model to assign traffic to routes where no<br />

vehicles have been traveled yet. Those routes which are found to be much<br />

more expensive (compared to existing routes) after some vehicles have<br />

traveled on them for the first time can be discarded from the route archive<br />

using this method.<br />

The following action is performed every time the data from a path file is<br />

loaded (generally speaking at every start of a new iteration):<br />

For each OD pair separately, out of the set of all available routes <strong>VISSIM</strong><br />

finds the cheapest and the most expensive route. Then every route is<br />

discarded for which the excess cost (compared with the cheapest route)<br />

divided by the cost of the cheapest route is higher than the defined threshold<br />

factor for all evaluation intervals.<br />

in the Path Search window<br />

► the threshold factor and<br />

► the upper limit<br />

can be defined, if the particular option is active. It is reached by pressing the<br />

button EXTENDED for option Search new paths in the Dynamic Assignment<br />

window.<br />

Furthermore, the following options are provided:<br />

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

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

Saved successfully!

Ooh no, something went wrong!