Fundamental Scheme for Train Scheduling

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5710

Full metadata record

DC Field	Value	Language
dc.creator	Fukumori, Koji	-
dc.date	2004-10-01T20:32:06Z	-
dc.date	2004-10-01T20:32:06Z	-
dc.date	1980-09-01	-
dc.date.accessioned	2013-10-09T02:40:57Z	-
dc.date.available	2013-10-09T02:40:57Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-596	-
dc.identifier	http://hdl.handle.net/1721.1/5710	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.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.	-
dc.format	24 p.	-
dc.format	1484856 bytes	-
dc.format	1159616 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-596	-
dc.subject	time scheduling	-
dc.subject	railroad	-
dc.subject	train time-tables	-
dc.subject	search	-
dc.subject	spropagation of constraints	-
dc.title	Fundamental Scheme for Train Scheduling	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI