Crew and vehicle rescheduling based on a network flow model and its application to a railway train operation

Tatsuhiro Sato, Shuichiro Sakikawa, Toyohisa Morita, Nobutaka Ueki, Tomohiro Murata

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

For the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP), we propose a 0-1 integer programming formulation based on a network flow model and a solution method that uses a heuristic flow modification and a local search technique. The proposed formulation is able to represent the "differences between the new and original schedules", which is a significant criterion for the CRP/VRP, though taking these differences into account is difficult for other related formulations based on the set partitioning/covering models. Implementation of a prototype system for vehicle rescheduling showed that the model is also effective for designing interactive operations between users and the computer system. The results of numerical experiments with real-world vehicle rescheduling data showed that the proposed method generated feasible solutions within a practical amount of time, and on the basis of a two-phase solution approach, the proposed method improved the evaluation values of the solution. This work could lead to practical computer systems which would effectively support train recovery operations under strict time limitations.

Original languageEnglish
JournalIAENG International Journal of Applied Mathematics
Volume39
Issue number3
Publication statusPublished - 2009 Aug

Fingerprint

Rescheduling
Network Flow
Railway
Computer systems
Formulation
Integer programming
Model
0-1 Integer Programming
Set Partitioning
Recovery
Local Search
Schedule
Covering
Numerical Experiment
Heuristics
Prototype
Experiments
Evaluation

Keywords

  • Crew/vehicle rescheduling
  • Heuristics
  • Local search
  • Network flow model
  • Railway
  • Train operation

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Crew and vehicle rescheduling based on a network flow model and its application to a railway train operation. / Sato, Tatsuhiro; Sakikawa, Shuichiro; Morita, Toyohisa; Ueki, Nobutaka; Murata, Tomohiro.

In: IAENG International Journal of Applied Mathematics, Vol. 39, No. 3, 08.2009.

Research output: Contribution to journalArticle

@article{ee226e56dcdf4ceb91e3a0dd81335198,
title = "Crew and vehicle rescheduling based on a network flow model and its application to a railway train operation",
abstract = "For the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP), we propose a 0-1 integer programming formulation based on a network flow model and a solution method that uses a heuristic flow modification and a local search technique. The proposed formulation is able to represent the {"}differences between the new and original schedules{"}, which is a significant criterion for the CRP/VRP, though taking these differences into account is difficult for other related formulations based on the set partitioning/covering models. Implementation of a prototype system for vehicle rescheduling showed that the model is also effective for designing interactive operations between users and the computer system. The results of numerical experiments with real-world vehicle rescheduling data showed that the proposed method generated feasible solutions within a practical amount of time, and on the basis of a two-phase solution approach, the proposed method improved the evaluation values of the solution. This work could lead to practical computer systems which would effectively support train recovery operations under strict time limitations.",
keywords = "Crew/vehicle rescheduling, Heuristics, Local search, Network flow model, Railway, Train operation",
author = "Tatsuhiro Sato and Shuichiro Sakikawa and Toyohisa Morita and Nobutaka Ueki and Tomohiro Murata",
year = "2009",
month = "8",
language = "English",
volume = "39",
journal = "IAENG International Journal of Applied Mathematics",
issn = "1992-9978",
publisher = "International Association of Engineers",
number = "3",

}

TY - JOUR

T1 - Crew and vehicle rescheduling based on a network flow model and its application to a railway train operation

AU - Sato, Tatsuhiro

AU - Sakikawa, Shuichiro

AU - Morita, Toyohisa

AU - Ueki, Nobutaka

AU - Murata, Tomohiro

PY - 2009/8

Y1 - 2009/8

N2 - For the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP), we propose a 0-1 integer programming formulation based on a network flow model and a solution method that uses a heuristic flow modification and a local search technique. The proposed formulation is able to represent the "differences between the new and original schedules", which is a significant criterion for the CRP/VRP, though taking these differences into account is difficult for other related formulations based on the set partitioning/covering models. Implementation of a prototype system for vehicle rescheduling showed that the model is also effective for designing interactive operations between users and the computer system. The results of numerical experiments with real-world vehicle rescheduling data showed that the proposed method generated feasible solutions within a practical amount of time, and on the basis of a two-phase solution approach, the proposed method improved the evaluation values of the solution. This work could lead to practical computer systems which would effectively support train recovery operations under strict time limitations.

AB - For the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP), we propose a 0-1 integer programming formulation based on a network flow model and a solution method that uses a heuristic flow modification and a local search technique. The proposed formulation is able to represent the "differences between the new and original schedules", which is a significant criterion for the CRP/VRP, though taking these differences into account is difficult for other related formulations based on the set partitioning/covering models. Implementation of a prototype system for vehicle rescheduling showed that the model is also effective for designing interactive operations between users and the computer system. The results of numerical experiments with real-world vehicle rescheduling data showed that the proposed method generated feasible solutions within a practical amount of time, and on the basis of a two-phase solution approach, the proposed method improved the evaluation values of the solution. This work could lead to practical computer systems which would effectively support train recovery operations under strict time limitations.

KW - Crew/vehicle rescheduling

KW - Heuristics

KW - Local search

KW - Network flow model

KW - Railway

KW - Train operation

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

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

M3 - Article

AN - SCOPUS:77949508569

VL - 39

JO - IAENG International Journal of Applied Mathematics

JF - IAENG International Journal of Applied Mathematics

SN - 1992-9978

IS - 3

ER -