Fundamental Scheme for Train Scheduling
Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on 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 rel...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/5710 |
| _version_ | 1811093115193262080 |
|---|---|
| author | Fukumori, Koji |
| author_facet | Fukumori, Koji |
| author_sort | Fukumori, Koji |
| collection | MIT |
| description | Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on 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. |
| first_indexed | 2024-09-23T15:39:56Z |
| id | mit-1721.1/5710 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:39:56Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/57102019-04-11T04:54:13Z Fundamental Scheme for Train Scheduling Fukumori, Koji time scheduling railroad train time-tables search spropagation of constraints Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on 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. 2004-10-01T20:32:06Z 2004-10-01T20:32:06Z 1980-09-01 AIM-596 http://hdl.handle.net/1721.1/5710 en_US AIM-596 24 p. 1484856 bytes 1159616 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | time scheduling railroad train time-tables search spropagation of constraints Fukumori, Koji Fundamental Scheme for Train Scheduling |
| title | Fundamental Scheme for Train Scheduling |
| title_full | Fundamental Scheme for Train Scheduling |
| title_fullStr | Fundamental Scheme for Train Scheduling |
| title_full_unstemmed | Fundamental Scheme for Train Scheduling |
| title_short | Fundamental Scheme for Train Scheduling |
| title_sort | fundamental scheme for train scheduling |
| topic | time scheduling railroad train time-tables search spropagation of constraints |
| url | http://hdl.handle.net/1721.1/5710 |
| work_keys_str_mv | AT fukumorikoji fundamentalschemefortrainscheduling |