In this paper, distributed optimization approaches are developed for the planning of maintenance operations of large-scale railway infrastructure formulated as a Mixed-Integer Linear Programming (MILP) problem. The proposed planning problem is solved using three different distributed optimization schemes: Parallel Augmented Lagrangian Relaxation (PALR), Alternating Direction Method of Multipliers (ADMM), and Distributed Robust Safe But Knowledgeable (DRSBK). The original distributed algorithms are modified to handle the non-convex nature of the optimization problem and to improve the solution quality. The results of large-scale test instances show that DRSBK can outperform the other distributed approaches, by providing the closest-to-optimum solution while requiring the lowest computation time.
Distributed Optimization for Railway Track Maintenance Operations Planning
2018-11-01
241969 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch