Shunting scheduling method in a railway depot for dealing with changes in operational conditions

Tatsuhiro Sato, Yoshiki Kakumoto, Tomohiro Murata

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A shunting schedule in a railroad depot consists of instructions to allocate or move train-units in the field. In this paper, we propose a scheduling method which can reconstruct solution in response to various changes in operational conditions. Under classification of train-units to be re-scheduled into two sets; one is a group of having invalid schedule (ISU) and another is a group of having valid schedule (VSU), the method is escalating the re-scheduling target by adding ISUs to a set of VSU and repeatedly solving a partial problem of the target until all the unit is processed. Based on the mathematical model which formalizes the problem as a kind of Flexible Job Shop Scheduling Problems (FJSSP), the partial solution can be derived by an algorithm which uses Constraint Programming (CP) with domain-oriented heuristics. Being evaluated on some test cases, it is showed that the proposed method can find a reasonable solution in a practical time while suppressing the differences from the original schedule.

Original languageEnglish
Pages (from-to)274-283
Number of pages10
JournalIEEJ Transactions on Electronics, Information and Systems
Volume127
Issue number2
DOIs
Publication statusPublished - 2007

Fingerprint

Scheduling
Railroads
Mathematical models
Job shop scheduling

Keywords

  • Constraint programming
  • Decision support system
  • Railway depot shunting problems
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Shunting scheduling method in a railway depot for dealing with changes in operational conditions. / Sato, Tatsuhiro; Kakumoto, Yoshiki; Murata, Tomohiro.

In: IEEJ Transactions on Electronics, Information and Systems, Vol. 127, No. 2, 2007, p. 274-283.

Research output: Contribution to journalArticle

@article{54acd52b998e4d959d7e854d5bd6de58,
title = "Shunting scheduling method in a railway depot for dealing with changes in operational conditions",
abstract = "A shunting schedule in a railroad depot consists of instructions to allocate or move train-units in the field. In this paper, we propose a scheduling method which can reconstruct solution in response to various changes in operational conditions. Under classification of train-units to be re-scheduled into two sets; one is a group of having invalid schedule (ISU) and another is a group of having valid schedule (VSU), the method is escalating the re-scheduling target by adding ISUs to a set of VSU and repeatedly solving a partial problem of the target until all the unit is processed. Based on the mathematical model which formalizes the problem as a kind of Flexible Job Shop Scheduling Problems (FJSSP), the partial solution can be derived by an algorithm which uses Constraint Programming (CP) with domain-oriented heuristics. Being evaluated on some test cases, it is showed that the proposed method can find a reasonable solution in a practical time while suppressing the differences from the original schedule.",
keywords = "Constraint programming, Decision support system, Railway depot shunting problems, Scheduling",
author = "Tatsuhiro Sato and Yoshiki Kakumoto and Tomohiro Murata",
year = "2007",
doi = "10.1541/ieejeiss.127.274",
language = "English",
volume = "127",
pages = "274--283",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "2",

}

TY - JOUR

T1 - Shunting scheduling method in a railway depot for dealing with changes in operational conditions

AU - Sato, Tatsuhiro

AU - Kakumoto, Yoshiki

AU - Murata, Tomohiro

PY - 2007

Y1 - 2007

N2 - A shunting schedule in a railroad depot consists of instructions to allocate or move train-units in the field. In this paper, we propose a scheduling method which can reconstruct solution in response to various changes in operational conditions. Under classification of train-units to be re-scheduled into two sets; one is a group of having invalid schedule (ISU) and another is a group of having valid schedule (VSU), the method is escalating the re-scheduling target by adding ISUs to a set of VSU and repeatedly solving a partial problem of the target until all the unit is processed. Based on the mathematical model which formalizes the problem as a kind of Flexible Job Shop Scheduling Problems (FJSSP), the partial solution can be derived by an algorithm which uses Constraint Programming (CP) with domain-oriented heuristics. Being evaluated on some test cases, it is showed that the proposed method can find a reasonable solution in a practical time while suppressing the differences from the original schedule.

AB - A shunting schedule in a railroad depot consists of instructions to allocate or move train-units in the field. In this paper, we propose a scheduling method which can reconstruct solution in response to various changes in operational conditions. Under classification of train-units to be re-scheduled into two sets; one is a group of having invalid schedule (ISU) and another is a group of having valid schedule (VSU), the method is escalating the re-scheduling target by adding ISUs to a set of VSU and repeatedly solving a partial problem of the target until all the unit is processed. Based on the mathematical model which formalizes the problem as a kind of Flexible Job Shop Scheduling Problems (FJSSP), the partial solution can be derived by an algorithm which uses Constraint Programming (CP) with domain-oriented heuristics. Being evaluated on some test cases, it is showed that the proposed method can find a reasonable solution in a practical time while suppressing the differences from the original schedule.

KW - Constraint programming

KW - Decision support system

KW - Railway depot shunting problems

KW - Scheduling

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

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

U2 - 10.1541/ieejeiss.127.274

DO - 10.1541/ieejeiss.127.274

M3 - Article

VL - 127

SP - 274

EP - 283

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 2

ER -