Simulation/Rerouter

=Rerouter= Rerouter changes the route of a vehicle as soon as the vehicle moves onto a specified edge.

A rerouter is set into the simulated network by adding the following declaration line to an "additional file": " edges="[;]*" file="" [probability=""]/>. Rerouter may be placed on several edges, at least one edge is necessary. Furthermore, it is possible to define the probability for rerouting a vehicle by giving a number between 0 (none) and 1 (all) already within the definition. The declaration values are:

In addition to this declaration a definition file (stored in ) must be given which describes the behaviour of the rerouter over time. Each description of what a rerouter shall do is embedded in an interval definition which describes within which time period the rerouter shall work. This is set up as following: " end=""> ... action description ...

... further intervals ...

A rerouter may work in several different ways. Within a time period you may close an edge, or assign new destinations or pregiven routes to vehicles. The next subchapters will describe these possibilities and how to describe them within the rerouter's definition file in detail.

Closing a Street
A "closing_reroute" forces the rerouter to close the edge . Vehicles which normally would pass this edge will get a new route as soon as they reach one of the edges given in the edges-attribute of the rerouter's declaration. a closing_reroute definition may look like this: " end=""> "/>

... further intervals ...

The attributes used within such definitions are:

Assigning a new Destination
A "dest_prob_reroute" forces the rerouter to assign a new route to vehicles that pass one of the edges defined in the edges-attribute of the rerouter's declaration. A new route destination is used, defined by the name of a new destination in the according element: " end=""> " probability=""/> <destProbReroute id="<EDGE_ID2>" probability="<PROBABILITY2>"/>

... further intervals ...

The route is computed automatically using the Dijkstra-algorithm and starting at the edge the vehicle is located at and ending at the new destination. The new route will be the fastest route in the empty network.

The attributes used within a dest_prob_reroute are:

Assigning a new Route
A "route_prob_reroute" forces the rerouter to assign a new route to vehicles which pass one of the edges defined in the edges-attribute of the rerouter's declaration. In this case, the id of a complete route must be supplied instead of a new destination: <interval begin="<BEGIN_TIME>" end="<END_TIME>"> <routeProbReroute id="<ROUTE_ID1>" probability="<PROBABILITY1>"/> <routeProbReroute id="<ROUTE_ID2>" probability="<PROBABILITY2>"/>

... further intervals ...

The attributes used within such definitions are: