WIT Press


Depot Shunting Scheduling Using Combined Genetic Algorithm And PERT

Price

Free (open access)

Paper DOI

10.2495/CR000421

Volume

50

Pages

10

Published

2000

Size

865 kb

Author(s)

N. Tomii & Li J. Zhou

Abstract

Depot shunting scheduling using combined genetic algorithm and PERT N. Tomii & Li J. Zhou Railway Technical Research Institute JAPAN Abstract Shunting scheduling problems at railway depot can be regarded as a sort of resource constrained project scheduling problem (RCPSP). Unlike the normal RCPSPs, however, shunting scheduling problems require that the number of activities which form a project has to be dynamically changed in the problem solving process and some of the activities have to be performed at a prescribed timing, for example. We propose an efficient algorithm for depot shunting scheduling problems combining genetic algorithm (GA) and PERT. GA and PERT are combined so that the candidates for answers in GA are evaluated by PERT. This enables us to reduce the search space of GA to a great extent. We have confirmed the effectiveness of our algorithm through several experiments using practical train schedule data. 1 Introduction Decision support systems such as train

Keywords