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

Management Science

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

Published

Standard

Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. / Androutsopoulos, Konstantinos N.; Zografos, Konstantinos G.
In: European Journal of Operational Research, Vol. 192, No. 1, 01.01.2009, p. 18-28.

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

Harvard

Androutsopoulos, KN & Zografos, KG 2009, 'Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network', European Journal of Operational Research, vol. 192, no. 1, pp. 18-28. https://doi.org/10.1016/j.ejor.2007.09.004

APA

Androutsopoulos, K. N., & Zografos, K. 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), 18-28. https://doi.org/10.1016/j.ejor.2007.09.004

Vancouver

Androutsopoulos KN, Zografos KG. Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. European Journal of Operational Research. 2009 Jan 1;192(1):18-28. doi: 10.1016/j.ejor.2007.09.004

Author

Androutsopoulos, Konstantinos N. ; Zografos, Konstantinos G. / Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. In: European Journal of Operational Research. 2009 ; Vol. 192, No. 1. pp. 18-28.

Bibtex

@article{bbd2f69c733141dd936a8f341efccad9,

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

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

keywords = "(B) Routing, Multi-objective programming, Dynamic programming",

author = "Androutsopoulos, {Konstantinos N.} and Zografos, {Konstantinos G.}",

year = "2009",

month = jan,

day = "1",

doi = "10.1016/j.ejor.2007.09.004",

language = "English",

volume = "192",

pages = "18--28",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier Science B.V.",

number = "1",

}

RIS

TY - JOUR

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

AU - Androutsopoulos, Konstantinos N.

AU - Zografos, Konstantinos G.

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

AB - 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.

KW - (B) Routing

KW - Multi-objective programming

KW - Dynamic programming

U2 - 10.1016/j.ejor.2007.09.004

DO - 10.1016/j.ejor.2007.09.004

M3 - Journal article

VL - 192

SP - 18

EP - 28

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -

Research

Associated organisational unit

Links

Text available via DOI:

Keywords