Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling

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

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

研究成果: Conference contribution

4 被引用数 (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 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.

本文言語English
ホスト出版物のタイトルProceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010
ページ403-408
ページ数6
DOI
出版ステータスPublished - 2010 10 21
イベント2010 IEEE International Conference on Advanced Computer Control, ICACC 2010 -
継続期間: 2010 3 272010 3 29

出版物シリーズ

名前Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010
1

Other

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

ASJC Scopus subject areas

  • 制御およびシステム工学
  • 電子工学および電気工学

フィンガープリント

「Lagrangian relaxation method for network flow modeled crew and vehicle rescheduling」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル