AN ALGORITHM FOR STATION SHUNTING SCHEDULING PROBLEMS COMBINING PROBABILISTIC LOCAL SEARCH AND PERT
In this paper, the authors present an algorithm for station switching scheduling problems by combining probabilistic local search and PERT a network analysis tool. The algorithm is shown to be effective in experiments using train schedule data.
-
Supplemental Notes:
- Publication Date: 1999 Springer Verlag, Berlin
-
Corporate Authors:
University of Auckland
Department of Computer Science
Auckland, New ZealandTetsudo Sogo Gijutsu Kenkyujo (Japan)
, -
Authors:
- Tomii, N
- Li, Jian Zhou
- Fukumura, N
- Conference:
- Publication Date: 1999
Language
- English
Media Info
- Pagination: p. 788-797
Subject/Index Terms
- TRT Terms: Computer algorithms; Railroad transportation; Scheduling
- Subject Areas: Railroads;
Filing Info
- Accession Number: 00788594
- Record Type: Publication
- Source Agency: UC Berkeley Transportation Library
- Files: PATH
- Created Date: Mar 23 2000 12:00AM