Scheduling tamping operations on railway tracks using mixed integer linear programming

Uloženo v:
Podrobná bibliografie
Název: Scheduling tamping operations on railway tracks using mixed integer linear programming
Autoři: Gustavsson, Emil, 1987
Zdroj: Utveckling av matematiska modeller och metoder för optimalt tillståndsbaserat underhåll, speciellt inom energiproduktion och energiintensiv industri EURO Journal on Transportation and Logistics. 4(1):97-112
Témata: Maintenance scheduling, Rail tamping, Railway maintenance, Mixed integer linear optimization, Preventive maintenance
Popis: A mixed integer linear programming model for the problem of scheduling tamping operations on ballasted tracks is presented and analyzed. The model improves a previously proposed one by introducing disaggregated constraints yielding in a model with stronger lower bound from the continuous relaxation of the binary variables. A more general cost structure is proposed; a structure having the possibility of including setup costs for the tamping operations. The problem considered is shown to be NP-hard. A numerical study is performed to evaluate the performance of the model compared to two simple policies for constructing maintenance schedules. The computational results show that the maintenance costs can be reduced by up to 10% as compared with the best policy investigated.
Popis souboru: electronic
Přístupová URL adresa: https://research.chalmers.se/publication/520067
https://research.chalmers.se/publication/205244
http://dx.doi.org/10.1007/s13676-014-0067-z
Databáze: SwePub
Popis
Abstrakt:A mixed integer linear programming model for the problem of scheduling tamping operations on ballasted tracks is presented and analyzed. The model improves a previously proposed one by introducing disaggregated constraints yielding in a model with stronger lower bound from the continuous relaxation of the binary variables. A more general cost structure is proposed; a structure having the possibility of including setup costs for the tamping operations. The problem considered is shown to be NP-hard. A numerical study is performed to evaluate the performance of the model compared to two simple policies for constructing maintenance schedules. The computational results show that the maintenance costs can be reduced by up to 10% as compared with the best policy investigated.
ISSN:21924376
21924384
DOI:10.1007/s13676-014-0067-z