A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (Q1652116)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6901317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations |
scientific article; zbMATH DE number 6901317 |
Statements
A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (English)
0 references
11 July 2018
0 references
real-time railway traffic management
0 references
train scheduling and routing
0 references
alternative graph
0 references
disjunctive programming
0 references
branch-and-bound
0 references
variable neighbourhood search
0 references
tabu search
0 references
0 references
0.9157659
0 references
0.91396964
0 references
0.8713118
0 references
0.8706413
0 references
0.8690336
0 references
0.86717325
0 references
0.8669639
0 references
0.86507666
0 references
