Car Routing
Inter-modal journey planning does not only include trip planning with the public transport. The inter-modal router of mdv calculates the best connection between origin and destination with several modes of transport. The calculated trips can be both, mono-modal with individual traffic (i.e. by car) and/or public transport and inter-modal scenarios (Park & Ride, Kiss & Ride,?)
By car the shortest, fastest or cheapest route can be searched. Trips with stopovers are possible.
The following example describes the car routing functionality included in the journey planner of Turin. Besides important information like travel time and distance, a detailed description of the requested car route is displayed.
|
 Car route with detailed route description |
The major challenge of a journey planner is the route computation time. It is important to use efficient algorithms and procedures for the route calculation. Mdv has developed an algorithm, which reduces nodes and links to a minimum, without any loss of quality in the route result.
Also dynamic traffic data, like archived speed profiles, can be integrated in the car journey planning process. Speed profiles describe the averaged driven speed for a specified street section in free definable intervals (i.e. every hour) for different day types, i.e. an usual working day (Monday to Friday for school time).
|
 Speed profiles for working days (Mo - Fr during school time) |
With the integration of speed profiles the car journey planner can take into account the average traffic situation for the main street network, depending on the time of day. Route search and travel times can be different depending on the time of day (see also Fig 3 and 4).
|
 Car routing at 08:30 at a working day (Mo ? Fr for school time) |
|
 Car routing at 18:30 at a working day (Mo ? Fr during school time) |
Using dynamic data more realistic travel times can be calculated in comparison to the calculation based on statistic data provided by digital maps.
