FUNDAMENTAL SCHEME FOR TRAIN SCHEDULING (APPLICATION OF RANGE-CONSTRICTION SEARCH)
Traditionally, the compilation of long-term timetables for high density rail service with multiple classes of trains of the same track is a job for expert people, not computers. We propose an algorithm that uses the range-constriction search technique to schedule the timing and pass-through relations of trains smoothly and efficiently. The program determines how the timing of certain trains constrains the timing of others, finds possible time regions and pass-through relations, and then evaluates the efficiency of train movement for each pass-through relation. (Author)
-
Corporate Authors:
Massachusetts Institute of Technology
Artificial Intelligence Laboratory
Cambridge, MA United States 02139 -
Authors:
- FUKUMORI, K
- Publication Date: 1980-9
Media Info
- Pagination: 25 p.
Subject/Index Terms
- TRT Terms: Algorithms; Artificial intelligence; Fault tree analysis; High density; Information processing; Mathematical models; Operations; Planning; Railroad facility operations; Railroad transportation; Scheduling; Time dependence
- Uncontrolled Terms: Line capacity; Parameters
- Old TRIS Terms: Operations planning; Train meets
- Subject Areas: Administration and Management; Freight Transportation; Planning and Forecasting; Railroads;
Filing Info
- Accession Number: 00336794
- Record Type: Publication
- Source Agency: National Technical Information Service
- Report/Paper Numbers: AI-M-596
- Contract Numbers: N00014-75-C-0643
- Files: TRIS
- Created Date: Jun 12 1981 12:00AM