Show simple item record

dc.contributor.authorFukumori, Kojien_US
dc.date.accessioned2004-10-01T20:32:06Z
dc.date.available2004-10-01T20:32:06Z
dc.date.issued1980-09-01en_US
dc.identifier.otherAIM-596en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5710
dc.description.abstractTraditionally, 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.extent24 p.en_US
dc.format.extent1484856 bytes
dc.format.extent1159616 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-596en_US
dc.subjecttime schedulingen_US
dc.subjectrailroaden_US
dc.subjecttrain time-tablesen_US
dc.subjectsearchen_US
dc.subjectspropagation of constraintsen_US
dc.titleFundamental Scheme for Train Schedulingen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record