4.7 Article

Robust scheduling of EMU first-level maintenance in a stub-end depot under stochastic uncertainties

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2023.106398

关键词

Robust scheduling; First-level maintenance; Flexible maintenance routes; Stochastic uncertainties; Adaptive iterative local search

向作者/读者索取更多资源

This study proposes a robust scheduling model for first-level maintenance of electric multiple units in railway systems. An adaptive iterative local search algorithm is developed to solve this model. The proposed model considers flexible maintenance routes, train shunting conflicts, and track occupation conflicts, and includes uncertain parameters in objective functions and constraints. The algorithm incorporates problem-specific neighborhood structures, a variable neighborhood descent method, and an adaptive perturbation mechanism to achieve a trade-off between robustness and efficiency.
Frequently occurring and unavoidable perturbations in railway systems cause a reduction in performance and even the infeasibility of the original schedule. In addition, existing related studies assume that the maintenance routes are fixed in a deterministic situation. Therefore, it is necessary to focus on robust scheduling of electric multiple units first-level maintenance with flexible maintenance routes to defend against stochastic uncertainties. Firstly, a mixed-integer linear programming model with uncertain parameters in objective functions and constraints is built for the first time. Multiple constraints are formulated to consider flexible maintenance routes, train shunting conflicts, and track occupation conflicts in a stub-end depot. A robust optimization approach is adopted to obtain a deterministic robust counterpart model with uncertainties in processing/arrival/departure times. In this model, uncertainty and reliability levels are introduced to describe and quantify the disturbance degree of processing/arrival/departure times and the allowable violation degree of resource constraints respectively. Moreover, an adaptive iterative local search is proposed by embedding heuristic rules for the initialization. The proposed algorithm includes problem-specific neighborhood structures to improve the evolutionary ability, a variable neighborhood descent method to guide and drive the search toward promising areas of the search space, and an adaptive perturbation mechanism to enable the algorithm to jump out of local optimum. Numerical results from China's railway system validate the proposed model and quantitatively demonstrate the merit of the proposed algorithm. Further analysis shows that our approach can achieve an appropriate trade-off between robustness and efficiency for various uncertainty and reliability levels.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据