Home > Research > Publications & Outputs > Algorithms for Itinerary Planning in Multimodal...

Research

Associated organisational units

Electronic data

  • Algorithms for Itinerary Planning in Multimodal Transportation Networks

    Rights statement: "©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."

    Submitted manuscript, 314 KB, PDF document

Links

Text available via DOI:

View graph of relations

Algorithms for Itinerary Planning in Multimodal Transportation Networks

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
Close
More...
<mark>Journal publication date</mark>03/2008
<mark>Journal</mark>IEEE Transactions on Intelligent Transportation Systems
Issue number1
Volume9
Number of pages10
Pages (from-to)175-184
Publication StatusPublished
<mark>Original language</mark>English

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.

Bibliographic note

"©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."