Skip to main content

Algorithms of Multi-Modal Route Planning Based on the Concept of Switch Point Algorithmen zur multi-modalen Routenplanung auf Grundlage des Schaltpunktes

Buy Article:

$39.00 plus tax (Refund Policy)


The paper addresses the task of generically finding the shortest path in multi modal networks with the multi-modal route planning problem in transportation field as a special case. The multi modal networks can be modelled by a data structure based on the core concept of Switch Point which abstracts the places where it is allowed for changing from one mode to another. Two routing algorithms Multi-Modal Bellman-Ford (MMBF) and Multi-Modal Dijkstra (MMD) were elicited which are respectively rooted in the classical label-correcting and label-setting methods. Both MMBF and MMD are capable of finding in multi modal networks the shortest paths in spite of different computing complexity. The feasibility of the approach was verified in our prototype system. The results of our experiments conducted on real transportation networks showed the differences between the proposed algorithms in terms of computing performance.

Der Beitrag befasst sich mit der Aufgabe zum Auffinden der kürzesten Route in einem multi mo dalen Netzwerk, wobei die multi modale Routen planung aus dem Bereich der Verkehrstechnik als eine spezielle Anwendung betrachtet wird. Die Modellierung eines multi-modalen Netzwerks basiert auf dem Kernkonzept Schaltpunkt. Bei einem Schaltpunkt handelt es sich um eine Stelle, wo eine Modalität auf eine andere umgeschaltet werden darf. Zwei Routenalgorithmen Multi Modal Bell man-Ford (MMBF) und Multi-Modal Dijkstra (MMD) wurden dargestellt. Als Grundlage dazu dienen zwei klassische Methoden – ,,Label-Korrektur" und ,,Label-Einstellung". Beide MMBF und MMD sind in der Lage, die kürzeste Route in einem beliebigen multi modalen Netzwerk aufzufinden. Die Machbarkeit des Ansatzes zur multimodalen Routenplanung wurde in einem Prototypensystem bestätigt. Ergebnisse aus unseren Untersuchungen der realen Verkehrsnetzwerke zeigen jedoch, dass sich die beiden Algorithmen hinsichtlich des Rechenaufwands voneinander unterscheiden.


Document Type: Research Article


Publication date: November 1, 2009

More about this publication?
  • Photogrammetrie - Fernerkundung - Geoinformation (PFG) is an international scholarly journal covering the progress and application of photogrammetric methods, remote sensing technology and the intricately connected field of geoinformation processing.

    Papers published in PFG highlight new developments and applications of these technologies in practice. The journal hence addresses both researchers and student of these disciplines at academic institutions and universities and the downstream users in both the private sector and public administration.

    PFG places special editorial emphasis on the communication of new methodologies in data acquisition, new approaches to optimized processing and interpretation of all types of data which were acquired by photogrammetric methods, remote sensing, image processing and the computer-aided interpretation of such data in general.

    PFG is the official journal of the German Society of Photogrammetry and Remote Sensing.
  • Editorial Board
  • Information for Authors
  • Subscribe to this Title
  • Ingenta Connect is not responsible for the content or availability of external websites

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more