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

Tatsuhiro Sato*, Tomoe Tomiyama, Toyohisa Morita, Tomohiro Murata

*この研究の対応する著者

研究成果: Article査読

2 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)260-268
ページ数9
ジャーナルIEEJ Transactions on Electronics, Information and Systems
132
2
DOI
出版ステータスPublished - 2012

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「A lagrangian relaxation method for crew and vehicle rescheduling of railway passenger transportation and its application」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル