Two-phase heuristic for SNCF rolling stock problem (Q1730598)
From MaRDI portal
!
WARNING
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 7032630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-phase heuristic for SNCF rolling stock problem |
scientific article; zbMATH DE number 7032630 |
Statements
Two-phase heuristic for SNCF rolling stock problem (English)
0 references
6 March 2019
0 references
greedy heuristic
0 references
integer programming
0 references
local search
0 references
rolling stock
0 references
scheduling
0 references
0.826545774936676
0 references
0.818047285079956
0 references
0.7572429776191711
0 references
0.7553280591964722
0 references
0.7457448840141296
0 references
