Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Zhao, Peng | Han, Baoming; * | Li, Dewei | Li, Yawei
Affiliations: School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
Correspondence: [*] Corresponding author. Baoming Han, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China. E-mail: Hannnn1332@163.com.
Abstract: As a key operation for the daily maintenance of electric multiple units (EMU), the first-level maintenance operation directly affects the utilization efficiency of the EMU. The fixed operation sequence of EMU trains, the limitation of the track capacity and inconsistent arrival time of EMU trains give rise to such problems as extended waiting time, idle tracks and waste of maintenance capacity. To solve these problems and optimize the assignment of EMU-to-track, we propose a flexible job-shop sequence scheduling (Flexible-JSS) mode for the first-level maintenance of EMU trains, and a flexible sequence and tracks sharing (FSTS) model for the first-level maintenance at electric multiple units depot (EMUD) has also been proposed in this paper. The FSTS model is designed to shorten the latest completion time after taking into account the constraints such as the train length, track capacity, the operation sequence of all EMU trains, the operation process of a single EMU train, and the train-set scheduling plan. A modified genetic algorithm is used to solve the model. The feasibility and effectiveness of the model and algorithm are verified by a real case, and the comparison with the other two fixed job-shop sequence scheduling (Fixed-JSS) modes proves that the Flexible-JSS mode can improve the efficiency and ability of the first-level maintenance at EMUD impressively.
Keywords: First-level maintenance operation, flexible job-shop sequence scheduling mode, flexible sequence and tracks sharing (FSTS) model, modified genetic algorithm, the latest completion time
DOI: 10.3233/JIFS-210823
Journal: Journal of Intelligent & Fuzzy Systems, vol. 41, no. 1, pp. 2145-2160, 2021
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl