A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application

Tatsuhiro Sato, Tomoe Tomiyama, Toyohisa Morita, Tomohiro Murata

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We propose a method for solving the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP) based on the Lagrangian relaxation method. The CRP/VRP is formulated as an integer programming problem on the basis of a network flow modeling approach from which a Lagrangian relaxation problem is constructed by relaxing the constraint that links multiple resources. Using two procedures that generate the upper and lower bounds of the primal problem, both of which utilize an efficient shortest path algorithm for the directed acyclic graph (DAG), the proposed method gradually improves the gap between the upper and lower bounds while updating Lagrangian multipliers. Experimental results of real-world vehicle rescheduling data from Japanese railway lines indicated that the proposed method generated feasible solutions that were confirmed to be fairly close to the optimal solutions according to the gap between the upper and lower bounds, and also clarified the quality of the other method's solution by using the gap, which could lead to streamlining and sophisticating real-world rescheduling related activities.

Original languageEnglish
Pages (from-to)260-268
Number of pages9
JournalIEEJ Transactions on Electronics, Information and Systems
Volume132
Issue number2
DOIs
Publication statusPublished - 2012

Fingerprint

Integer programming

Keywords

  • Crew/vehicle rescheduling
  • Integer programming
  • Lagrangian relaxation method
  • Network flow model
  • Railway train operation
  • Shortest path algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application. / Sato, Tatsuhiro; Tomiyama, Tomoe; Morita, Toyohisa; Murata, Tomohiro.

In: IEEJ Transactions on Electronics, Information and Systems, Vol. 132, No. 2, 2012, p. 260-268.

Research output: Contribution to journalArticle

@article{e045034cfd3a4847bbd56c0a3af0d1ff,
title = "A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application",
abstract = "We propose a method for solving the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP) based on the Lagrangian relaxation method. The CRP/VRP is formulated as an integer programming problem on the basis of a network flow modeling approach from which a Lagrangian relaxation problem is constructed by relaxing the constraint that links multiple resources. Using two procedures that generate the upper and lower bounds of the primal problem, both of which utilize an efficient shortest path algorithm for the directed acyclic graph (DAG), the proposed method gradually improves the gap between the upper and lower bounds while updating Lagrangian multipliers. Experimental results of real-world vehicle rescheduling data from Japanese railway lines indicated that the proposed method generated feasible solutions that were confirmed to be fairly close to the optimal solutions according to the gap between the upper and lower bounds, and also clarified the quality of the other method's solution by using the gap, which could lead to streamlining and sophisticating real-world rescheduling related activities.",
keywords = "Crew/vehicle rescheduling, Integer programming, Lagrangian relaxation method, Network flow model, Railway train operation, Shortest path algorithm",
author = "Tatsuhiro Sato and Tomoe Tomiyama and Toyohisa Morita and Tomohiro Murata",
year = "2012",
doi = "10.1541/ieejeiss.132.260",
language = "English",
volume = "132",
pages = "260--268",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "2",

}

TY - JOUR

T1 - A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application

AU - Sato, Tatsuhiro

AU - Tomiyama, Tomoe

AU - Morita, Toyohisa

AU - Murata, Tomohiro

PY - 2012

Y1 - 2012

N2 - We propose a method for solving the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP) based on the Lagrangian relaxation method. The CRP/VRP is formulated as an integer programming problem on the basis of a network flow modeling approach from which a Lagrangian relaxation problem is constructed by relaxing the constraint that links multiple resources. Using two procedures that generate the upper and lower bounds of the primal problem, both of which utilize an efficient shortest path algorithm for the directed acyclic graph (DAG), the proposed method gradually improves the gap between the upper and lower bounds while updating Lagrangian multipliers. Experimental results of real-world vehicle rescheduling data from Japanese railway lines indicated that the proposed method generated feasible solutions that were confirmed to be fairly close to the optimal solutions according to the gap between the upper and lower bounds, and also clarified the quality of the other method's solution by using the gap, which could lead to streamlining and sophisticating real-world rescheduling related activities.

AB - We propose a method for solving the crew rescheduling problem (CRP) and the vehicle rescheduling problem (VRP) based on the Lagrangian relaxation method. The CRP/VRP is formulated as an integer programming problem on the basis of a network flow modeling approach from which a Lagrangian relaxation problem is constructed by relaxing the constraint that links multiple resources. Using two procedures that generate the upper and lower bounds of the primal problem, both of which utilize an efficient shortest path algorithm for the directed acyclic graph (DAG), the proposed method gradually improves the gap between the upper and lower bounds while updating Lagrangian multipliers. Experimental results of real-world vehicle rescheduling data from Japanese railway lines indicated that the proposed method generated feasible solutions that were confirmed to be fairly close to the optimal solutions according to the gap between the upper and lower bounds, and also clarified the quality of the other method's solution by using the gap, which could lead to streamlining and sophisticating real-world rescheduling related activities.

KW - Crew/vehicle rescheduling

KW - Integer programming

KW - Lagrangian relaxation method

KW - Network flow model

KW - Railway train operation

KW - Shortest path algorithm

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

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

U2 - 10.1541/ieejeiss.132.260

DO - 10.1541/ieejeiss.132.260

M3 - Article

AN - SCOPUS:84863027874

VL - 132

SP - 260

EP - 268

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 2

ER -