Home > Research > Publications & Outputs > Solving the multi-criteria time-dependent routi...

Associated organisational unit

View graph of relations

Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>1/01/2009
<mark>Journal</mark>European Journal of Operational Research
Issue number1
Number of pages11
Pages (from-to)18-28
Publication StatusPublished
<mark>Original language</mark>English


Multi-criteria routing and scheduling in a multimodal fixed scheduled network with time-dependent travel times involves the determination of the non-dominated itineraries (i.e., paths enhanced with scheduled departures) under the following constraints: (i) visiting a given set of intermediate stops in a specified sequence, and (ii) strict time windows on the origin, the destination and the intermediate stops. The objective of this paper is to present the formulation and algorithmic solution for the multi-criteria itinerary planning problem that takes into account the aforementioned features. The algorithmic approach proposed is based on the decomposition of the problem to a sequence of elementary itinerary sub-problems, solved by a dynamic programming algorithm. The computational performance of the algorithms on a set of large scale test problems indicates non-prohibitive time requirements and encourages its integration into travel planning decision support systems.