Periodic Metro Scheduling

Bampas, E; Kaouri, G; Lampis, M; Pagourtzis, A

dc.contributor.author	Bampas, E	en
dc.contributor.author	Kaouri, G	en
dc.contributor.author	Lampis, M	en
dc.contributor.author	Pagourtzis, A	en
dc.date.accessioned	2014-03-01T02:50:16Z
dc.date.available	2014-03-01T02:50:16Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35011
dc.relation.uri	http://drops.dagstuhl.de/opus/volltexte/2006/684	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/atmos/atmos2006.html#BampasKLP06	en
dc.subject	Approximate Algorithm	en
dc.subject	Exact Algorithm	en
dc.subject	Ring Network	en
dc.subject	Tree Network	en
dc.title	Periodic Metro Scheduling	en
heal.type	conferenceItem	en
heal.publicationDate	2006	en
heal.abstract	We introduce the Periodic Metro Scheduling (PMS) problem, which aims in generating a periodic timetable for a given set of routes and a given time period, in such a way that the minimum time dis- tance between any two successive trains that pass from the same point of the network is maximized. This can be particularly useful in cases where	en
heal.journalName	Algorithmic Approaches for Transportation Modeling, Optimization, and Systems	en