Shortest paths on road networks can be efficiently calculated using Dijkstra’s algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc. For paths on this type of network, further constraints, e.g., preferences in using certain modes of transportation, may arise. The regular language constrained shortest path problem deals with t...

The objective of this paper is to review object-oriented (OO) approaches to data modeling and data handling and their usefulness in transportation planning and modeling in general and Intelligent Transportation Systems in particular. The paper begins with a discussion of the current GIS data model for representing a transportation network and the most common database management systems used in ...

The objective of this paper is to review object-oriented (OO) approaches to data modeling and data handling and their usefulness in transportation planning and modeling in general and Intelligent Transportation Systems in particular. The paper begins with a discussion of the current GIS data model for representing a transportation network and the most common database management systems used in ...

We consider shortest paths on a multi-modal transportation network where restrictions or preferences on the use of certain modes of transportation may arise. The regular language constraint shortest path problem deals with this kind of problem. It models constraints by using regular languages. The problem can be solved efficiently by using a generalization of Dijkstra’s algorithm (DRegLC). Rece...

Abstract. Continuous progress in navigation, sensor-based, and GPS technologies have made smart devices essential to our daily lives many location-based applications. However, the trajectory datasets generated by these applications require management of large data volumes while preserving their main properties semantics. One most popular methods for compressing offline is Douglas–Peucker (DP) a...

We present a new algorithm to find optimal routes in a multi-modal public transportation network. This work is an extension of recent work on finding multi-criteria optimal paths in multi-modal public transportation networks [8] using the ideas of TRANSIT algorithm [4]. As a preprocessing step, we identify hub stations, a relatively small subset of all stations and then precompute optimal paths...