A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations

This paper focuses on the development of metaheuristic algorithms for the real-time traffic management problem of scheduling and routing trains in complex and busy railway networks. This key optimization problem can be formulated as a mixed integer linear program. However, since the problem is stron...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 78; s. 480 - 499
Hlavní autoři:	Samà, Marcella, D׳Ariano, Andrea, Corman, Francesco, Pacciarelli, Dario
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.02.2017 Pergamon Press Inc
Témata:	Algorithms Alternative graph Branch-and-bound Disjunctive programming Neighborhoods Optimization Railway networks Real time Real-time railway traffic management Studies Tabu search Train scheduling and routing Trains Variable neighbourhood search Branch-and-bound Tabu search Disjunctive programming Alternative graph Variable neighbourhood search Real-time railway traffic management Train scheduling and routing
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!