Automatic Generation of Maintenance Worker Schedules at Railway Rolling Stock Depots by Tabu Search

This paper proposes a hierarchical optimization framework for automatic generation of maintenance worker schedules at rolling stock depots. Maintenance worker schedules at rolling stock depots are daily schedules assigned to maintenance worker teams such as cleaning rolling stock and performing inspection during turnaround operations of superior trains. To evaluate the effectiveness of the proposed method, the schedules generated by the proposed method are compared with actual schedules, those generated by a mathematical programming method, and local search. The results indicate that the proposed method can generate maintenance worker schedules satisfying non-relaxable constraints and high priority relaxable constraints within a practical computation time of three minutes with levelized and reduced worker loads.

Authors

Institutions

Publication Details

Journal
IEEJ Transactions on Industry Applications
Published
2025-02-28
DOI
https://doi.org/10.1541/ieejias.145.159
Primary Topic
Scheduling and Timetabling Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Automatic Generation of Maintenance Worker Schedules at Railway Rolling Stock Depots by Tabu Search

Satoshi Kato, Yoshikazu Fukuyama, Taichi Nakahigashi, Tatsuya Kokubo
IEEJ Transactions on Industry Applications
Scheduling and Timetabling Solutions
article

Automatic Generation of Maintenance Worker Schedules at Railway Rolling Stock Depots by Tabu Search

Satoshi Kato, Yoshikazu Fukuyama, Taichi Nakahigashi, Tatsuya Kokubo
article en

Abstract

This paper proposes a hierarchical optimization framework for automatic generation of maintenance worker schedules at rolling stock depots. Maintenance worker schedules at rolling stock depots are daily schedules assigned to maintenance worker teams such as cleaning rolling stock and performing inspection during turnaround operations of superior trains. To evaluate the effectiveness of the proposed method, the schedules generated by the proposed method are compared with actual schedules, those generated by a mathematical programming method, and local search. The results indicate that the proposed method can generate maintenance worker schedules satisfying non-relaxable constraints and high priority relaxable constraints within a practical computation time of three minutes with levelized and reduced worker loads.

IEEJ Transactions on Industry ApplicationsVol. 145(3)
Railway Technical Research Institute (JP), Meiji University (JP)
Openalex Percentile: Top 96%
Scheduling and Timetabling Solutions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.