Idioma:

Exact formulations and algorithm for the train timetabling problem with dynamic demand

Barrena, Eva ; Canca, David ; Coelho, Leandro C. ; Laporte, Gilbert

Computers & operations research, 2014-04, Vol.44, p.66-74 [Periódico revisado por pares]

Kidlington: Elsevier Ltd

Texto completo disponível

Citações Citado por

Enviar para

Título:
Exact formulations and algorithm for the train timetabling problem with dynamic demand
Autor: Barrena, Eva ; Canca, David ; Coelho, Leandro C. ; Laporte, Gilbert
Assuntos: Algorithms ; Applied sciences ; Branch-and-cut ; Comparative analysis ; Computation ; Demand ; Dynamic demand ; Exact algorithm ; Exact sciences and technology ; Ground, air and sea transportation, marine construction ; Mathematical analysis ; Mathematical models ; Mathematical programming ; Nonlinear dynamics ; Operational research and scientific management ; Operational research. Management science ; Queuing theory. Traffic theory ; Railroad transportation ; Railway transportation and traffic ; Regular timetable ; Scheduling, sequencing ; Studies ; Timetables ; Train timetabling ; Trains
É parte de: Computers & operations research, 2014-04, Vol.44, p.66-74
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
Descrição: In this paper we study the design and optimization of train timetabling adapted to a dynamic demand environment. This problem arises in rapid train services which are common in most important cities. We present three formulations for the problem, with the aim of minimizing passenger average waiting time. The most intuitive model would consider binary variables representing train departure times but it yields to non-linear objective function. Instead, we introduce flow variables, which allow a linear representation of the objective function. We provide incremental improvements on these formulations, which allows us to evaluate and compare the benefits and disadvantages of each modification. We present a branch-and-cut algorithm applicable to all formulations. Through extensive computational experiments on several instances derived from real data provided by the Madrid Metropolitan Railway, we show the advantages of designing a timetable adapted to the demand pattern, as opposed to a regular timetable. We also perform an extensive computational comparison of all linear formulations in terms of size, solution quality and running time.
Editor: Kidlington: Elsevier Ltd
Idioma: Inglês

Links

View record in Pascal Francis

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Exact formulations and algorithm for the train timetabling problem with dynamic demand

Barrena, Eva ; Canca, David ; Coelho, Leandro C. ; Laporte, Gilbert

Kidlington: Elsevier Ltd

Buscando em bases de dados remotas. Favor aguardar.