Lancaster EPrints

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

Androutsopoulos, Konstantinos N. and Zografos, Konstantinos G. (2009) Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. European Journal of Operational Research, 192 (1). pp. 18-28. ISSN 0377-2217

Full text not available from this repository.

Abstract

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.

Item Type: Article
Journal or Publication Title: European Journal of Operational Research
Uncontrolled Keywords: (B) Routing ; Multi-objective programming ; Dynamic programming
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 64638
Deposited By: ep_importer_pure
Deposited On: 20 May 2013 11:03
Refereed?: Yes
Published?: Published
Last Modified: 24 Nov 2017 05:17
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/64638

Actions (login required)

View Item