Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling

Tatsuhiro Sato, Tomoe Tomiyama, Toyohisa Morita, Tomohiro Murata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 covers 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. Results of real-world vehicle rescheduling data from a Japanese railway line indicate that the proposed method generates a feasible solution within a practical amount of time, which is confirmed to be fairly close to the optimum according to the gap and a comparison with the heuristic solution method.

Original languageEnglish
Title of host publicationProceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010
Pages403-408
Number of pages6
Volume1
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Conference on Advanced Computer Control, ICACC 2010 -
Duration: 2010 Mar 272010 Mar 29

Other

Other2010 IEEE International Conference on Advanced Computer Control, ICACC 2010
Period10/3/2710/3/29

Fingerprint

Integer programming

Keywords

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

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Sato, T., Tomiyama, T., Morita, T., & Murata, T. (2010). Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling. In Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010 (Vol. 1, pp. 403-408). [5486971] https://doi.org/10.1109/ICACC.2010.5486971

Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling. / Sato, Tatsuhiro; Tomiyama, Tomoe; Morita, Toyohisa; Murata, Tomohiro.

Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010. Vol. 1 2010. p. 403-408 5486971.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sato, T, Tomiyama, T, Morita, T & Murata, T 2010, Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling. in Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010. vol. 1, 5486971, pp. 403-408, 2010 IEEE International Conference on Advanced Computer Control, ICACC 2010, 10/3/27. https://doi.org/10.1109/ICACC.2010.5486971
Sato T, Tomiyama T, Morita T, Murata T. Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling. In Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010. Vol. 1. 2010. p. 403-408. 5486971 https://doi.org/10.1109/ICACC.2010.5486971
Sato, Tatsuhiro ; Tomiyama, Tomoe ; Morita, Toyohisa ; Murata, Tomohiro. / Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling. Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010. Vol. 1 2010. pp. 403-408
@inproceedings{97618efbd0034184a9b055cf59d32266,
title = "Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling",
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 covers 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. Results of real-world vehicle rescheduling data from a Japanese railway line indicate that the proposed method generates a feasible solution within a practical amount of time, which is confirmed to be fairly close to the optimum according to the gap and a comparison with the heuristic solution method.",
keywords = "Crew/vehicle rescheduling, Integer programming, Lagrangian relaxation method, Network flow model, Railway train operation",
author = "Tatsuhiro Sato and Tomoe Tomiyama and Toyohisa Morita and Tomohiro Murata",
year = "2010",
doi = "10.1109/ICACC.2010.5486971",
language = "English",
isbn = "9781424458462",
volume = "1",
pages = "403--408",
booktitle = "Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010",

}

TY - GEN

T1 - Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling

AU - Sato, Tatsuhiro

AU - Tomiyama, Tomoe

AU - Morita, Toyohisa

AU - Murata, Tomohiro

PY - 2010

Y1 - 2010

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 covers 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. Results of real-world vehicle rescheduling data from a Japanese railway line indicate that the proposed method generates a feasible solution within a practical amount of time, which is confirmed to be fairly close to the optimum according to the gap and a comparison with the heuristic solution method.

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 covers 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. Results of real-world vehicle rescheduling data from a Japanese railway line indicate that the proposed method generates a feasible solution within a practical amount of time, which is confirmed to be fairly close to the optimum according to the gap and a comparison with the heuristic solution method.

KW - Crew/vehicle rescheduling

KW - Integer programming

KW - Lagrangian relaxation method

KW - Network flow model

KW - Railway train operation

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

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

U2 - 10.1109/ICACC.2010.5486971

DO - 10.1109/ICACC.2010.5486971

M3 - Conference contribution

AN - SCOPUS:77957949829

SN - 9781424458462

VL - 1

SP - 403

EP - 408

BT - Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010

ER -