dc.contributor.author | Fukumori, Koji | en_US |
dc.date.accessioned | 2004-10-01T20:32:06Z | |
dc.date.available | 2004-10-01T20:32:06Z | |
dc.date.issued | 1980-09-01 | en_US |
dc.identifier.other | AIM-596 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5710 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 24 p. | en_US |
dc.format.extent | 1484856 bytes | |
dc.format.extent | 1159616 bytes | |
dc.format.mimetype | application/postscript | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.relation.ispartofseries | AIM-596 | en_US |
dc.subject | time scheduling | en_US |
dc.subject | railroad | en_US |
dc.subject | train time-tables | en_US |
dc.subject | search | en_US |
dc.subject | spropagation of constraints | en_US |
dc.title | Fundamental Scheme for Train Scheduling | en_US |