An Algorithm for Shunting Scheduling Problems combining Probabilistic Local Search and PERT
-
- Tomii Norio
- Railway Technical Research Institute
-
- Zhou Li Jian
- Railway Technical Research Institute
-
- Fukumura Naoto
- Railway Technical Research Institute
Bibliographic Information
- Other Title
-
- 確率的局所探索とPERTを組み合わせた駅構内入換計画作成アルゴリズム
- カクリツテキ キョクショ タンサク ト PERT オ クミアワセタ エキ コウナイ イレカエ ケイカク サクセイ アルゴリズム
Search this article
Abstract
Shunting scheduling problems in railway stations can be regarded as a sort of resource constrained project scheduling problems (RCPSPs). But unlike normal RCPSPs, shunting scheduling problems have such requirements that the number of works which consist of a project has to be dynamically changed in the process of solving the problem, some of the works have to be performed at prescribed timing, etc., We propose an efficient algorithm for shunting scheduling problems combining probabilistic local search and PERT. Local search and PERT is combined so that the candidates for answers in the local search process are evaluated by PERT. This enables to reduce the search space of the local search to a great extent and to make the algorithm work quite fast. We have confirmed effectiveness of our algorithm through several experiments using practical train schedule data.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 119 (3), 289-295, 1999
The Institute of Electrical Engineers of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390001204611446912
-
- NII Article ID
- 130006845952
- 10002816343
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
- http://id.crossref.org/issn/03854221
-
- NDL BIB ID
- 4663563
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed