Flexible train rostering

Eidenbenz, S; Pagourtzis, A; Widmayer, P

dc.contributor.author	Eidenbenz, S	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Widmayer, P	en
dc.date.accessioned	2014-03-01T01:19:00Z
dc.date.available	2014-03-01T01:19:00Z
dc.date.issued	2003	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15309
dc.subject	Approximate Algorithm	en
dc.subject	Cost Effectiveness	en
dc.subject	Mass Transport	en
dc.subject	Polynomial Time Algorithm	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Flexible train rostering	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-24587-2_63	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-24587-2_63	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	Determining cost-effective vehicle scheduling is an important optimization issue in mass transportation networks. An interesting question in this context is whether allowing certain flexibility in the departure times of scheduled routes may reduce the number of vehicles needed. We formulate this question as the FLEXIBLE TRAIN ROSTERING1 problem. We consider two cases that are of practical interest: - Unlimited flexibility: only the durations of routes are given and we are free to determine the most appropriate departure time for each route. - Limited flexibility: initial departure times are given, together with a delay threshold ε; we are asked to determine the most appropriate delay ≤ ε for each route. We also consider variants where we are allowed to use empty rides, (i.e., routes without passengers). We present a variety of results for these problems: polynomial-time algorithms that optimally solve some of them, script N℘P- and script A℘script X-hardness proofs for others, as well as approximation algorithms for most of the hard problems. © Springer-Verlag Berlin Heidelberg 2003.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-24587-2_63	en
dc.identifier.isi	ISI:000188242500063	en
dc.identifier.volume	2906	en
dc.identifier.spage	615	en
dc.identifier.epage	624	en