Algorithms for Itinerary Planning in Multimodal Transportation Networks

Zografos, Konstantinos G. and Androutsopoulos, Konstantinos N. (2008) Algorithms for Itinerary Planning in Multimodal Transportation Networks. IEEE Transactions on Intelligent Transportation Systems, 9 (1). pp. 175-184. ISSN 1524-9050

[img]
Preview
PDF (Algorithms for Itinerary Planning in Multimodal Transportation Networks)
10.pdf - Submitted Version

Download (321kB)

Abstract

The itinerary planning problem in an urban public transport system constitutes a common routing and scheduling decision faced by travelers. The objective of this paper is to present a new formulation and an algorithm for solving the itinerary planning problem, i.e., determination of the itinerary that lexicographically optimizes a set of criteria (i.e., total travel time, number of transfers, and total walking and waiting time) while departing from the origin and arriving at the destination within specified time windows. Based on the proposed formulation, the itinerary planning problem is expressed as a shortest path problem in a multimodal time-schedule network with time windows and time-dependent travel times. A dynamic programming-based algorithm has been developed for the solution of the emerging problem. The special case of the problem involving a mandatory visit at an intermediate stop within a given time window is formulated as two nested itinerary planning problems which are solved by the aforementioned algorithm. The proposed algorithm has been integrated in a Web-based journey planning system, whereas its performance has been assessed by solving real-life itinerary planning problems defined on the Athens urban public transport network, providing fast and accurate solutions.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Transactions on Intelligent Transportation Systems
Additional Information:
"©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." "This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1706
Subjects:
ID Code:
64646
Deposited By:
Deposited On:
20 May 2013 10:12
Refereed?:
Yes
Published?:
Published
Last Modified:
21 Oct 2020 02:35