Engine scheduling by column generation (Q2740904)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Engine scheduling by column generation |
scientific article; zbMATH DE number 1642060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Engine scheduling by column generation |
scientific article; zbMATH DE number 1642060 |
Statements
9 September 2001
0 references
railway scheduling
0 references
set partitioning problem
0 references
linear programming
0 references
column generation
0 references
Engine scheduling by column generation (English)
0 references
A solution procedure is developed for the Engine Scheduling Problem (ESP) which appears in connection with rail freight transport systems. Different mixed integer linear programming formulations for the ESP are discussed. The most promising approach, based on a set partitioning formulation, is implemented. To solve the set partitioning problem a price-and-branch approach is used. Lower bounds are derived by solving the continuous relaxation of the set partitioning problem with column generation techniques. Computational results for problem instances based on real world data are reported. It is possible to solve instances with 35 transportation requests to be served by six engines.
0 references
0.7997970581054688
0 references
0.7871260643005371
0 references
0.7849395871162415
0 references
0.7815887928009033
0 references
