Railway rolling-stock-assignment-scheduling algorithm for minimizing inspection cost

Tomoe Tomiyama, Tatsuhiro Sato, Kenichirou Okada, Takashi Wakamiya, Tomohiro Murata

Research output: Contribution to journalArticle

Abstract

Train maintenance regulation requires regular inspections of the rolling stock of railway companies. A planner who makes a schedule of rolling-stock operation should consider both assignments of rolling stock to train services and schedules of periodical maintenance. In Japan, the schedule is manually created for the middle-term, which is for half a month or full month. To reduce spent time to make the schedule, we developed an algorithm for rolling-stock-assignment schedule. To efficiently consider inspection cycles, the proposed algorithm creates assignment patterns of rolling stock which satisfy inspection cycles in advance. And then, the algorithm creates templates of schedule using the patterns, and assigns inspections to the templates. We verified the feasibility and scalability of the proposed algorithm using actual train operation data. The results indicate that the algorithm successfully generates a schedule which satisfies required regular inspection cycles within feasible calculation time.

Original languageEnglish
Pages (from-to)228-237
Number of pages10
JournalIAENG International Journal of Applied Mathematics
Volume48
Issue number2
Publication statusPublished - 2018 May 28

Fingerprint

Railway
Scheduling algorithms
Scheduling Algorithm
Inspection
Schedule
Assignment
Costs
Cycle
Template
Maintenance
Scalability
Japan
Assign
Industry
Term

Keywords

  • Dijkstra method
  • Inspection cycle
  • Rolling stock assignment
  • Scheduling algorithm

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Railway rolling-stock-assignment-scheduling algorithm for minimizing inspection cost. / Tomiyama, Tomoe; Sato, Tatsuhiro; Okada, Kenichirou; Wakamiya, Takashi; Murata, Tomohiro.

In: IAENG International Journal of Applied Mathematics, Vol. 48, No. 2, 28.05.2018, p. 228-237.

Research output: Contribution to journalArticle

Tomiyama, Tomoe ; Sato, Tatsuhiro ; Okada, Kenichirou ; Wakamiya, Takashi ; Murata, Tomohiro. / Railway rolling-stock-assignment-scheduling algorithm for minimizing inspection cost. In: IAENG International Journal of Applied Mathematics. 2018 ; Vol. 48, No. 2. pp. 228-237.
@article{2817689b45fb41f193615b9541993852,
title = "Railway rolling-stock-assignment-scheduling algorithm for minimizing inspection cost",
abstract = "Train maintenance regulation requires regular inspections of the rolling stock of railway companies. A planner who makes a schedule of rolling-stock operation should consider both assignments of rolling stock to train services and schedules of periodical maintenance. In Japan, the schedule is manually created for the middle-term, which is for half a month or full month. To reduce spent time to make the schedule, we developed an algorithm for rolling-stock-assignment schedule. To efficiently consider inspection cycles, the proposed algorithm creates assignment patterns of rolling stock which satisfy inspection cycles in advance. And then, the algorithm creates templates of schedule using the patterns, and assigns inspections to the templates. We verified the feasibility and scalability of the proposed algorithm using actual train operation data. The results indicate that the algorithm successfully generates a schedule which satisfies required regular inspection cycles within feasible calculation time.",
keywords = "Dijkstra method, Inspection cycle, Rolling stock assignment, Scheduling algorithm",
author = "Tomoe Tomiyama and Tatsuhiro Sato and Kenichirou Okada and Takashi Wakamiya and Tomohiro Murata",
year = "2018",
month = "5",
day = "28",
language = "English",
volume = "48",
pages = "228--237",
journal = "IAENG International Journal of Applied Mathematics",
issn = "1992-9978",
publisher = "International Association of Engineers",
number = "2",

}

TY - JOUR

T1 - Railway rolling-stock-assignment-scheduling algorithm for minimizing inspection cost

AU - Tomiyama, Tomoe

AU - Sato, Tatsuhiro

AU - Okada, Kenichirou

AU - Wakamiya, Takashi

AU - Murata, Tomohiro

PY - 2018/5/28

Y1 - 2018/5/28

N2 - Train maintenance regulation requires regular inspections of the rolling stock of railway companies. A planner who makes a schedule of rolling-stock operation should consider both assignments of rolling stock to train services and schedules of periodical maintenance. In Japan, the schedule is manually created for the middle-term, which is for half a month or full month. To reduce spent time to make the schedule, we developed an algorithm for rolling-stock-assignment schedule. To efficiently consider inspection cycles, the proposed algorithm creates assignment patterns of rolling stock which satisfy inspection cycles in advance. And then, the algorithm creates templates of schedule using the patterns, and assigns inspections to the templates. We verified the feasibility and scalability of the proposed algorithm using actual train operation data. The results indicate that the algorithm successfully generates a schedule which satisfies required regular inspection cycles within feasible calculation time.

AB - Train maintenance regulation requires regular inspections of the rolling stock of railway companies. A planner who makes a schedule of rolling-stock operation should consider both assignments of rolling stock to train services and schedules of periodical maintenance. In Japan, the schedule is manually created for the middle-term, which is for half a month or full month. To reduce spent time to make the schedule, we developed an algorithm for rolling-stock-assignment schedule. To efficiently consider inspection cycles, the proposed algorithm creates assignment patterns of rolling stock which satisfy inspection cycles in advance. And then, the algorithm creates templates of schedule using the patterns, and assigns inspections to the templates. We verified the feasibility and scalability of the proposed algorithm using actual train operation data. The results indicate that the algorithm successfully generates a schedule which satisfies required regular inspection cycles within feasible calculation time.

KW - Dijkstra method

KW - Inspection cycle

KW - Rolling stock assignment

KW - Scheduling algorithm

UR - http://www.scopus.com/inward/record.url?scp=85047626479&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047626479&partnerID=8YFLogxK

M3 - Article

VL - 48

SP - 228

EP - 237

JO - IAENG International Journal of Applied Mathematics

JF - IAENG International Journal of Applied Mathematics

SN - 1992-9978

IS - 2

ER -