Standortplanung von Bahnhöfen

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:070c8d4a272083f58491a584e6bf69a7

MECKE, Steffen, 2003. Standortplanung von Bahnhöfen

@mastersthesis{Mecke2003Stand-753, title={Standortplanung von Bahnhöfen}, year={2003}, author={Mecke, Steffen} }

deposit-license Mecke, Steffen On Station Location We consider the problem "Station Location along Lines". Given a railway network consisting of existing stations and lines, we want to introduce new stops along the lines such that their cover is maximized. A settlement is said to be covered if it is within a given radius of a stop.<br /><br />Therefor, we transform the problem into an equivalent set covering problem and subsequently solve this problem using an exakt, combinatorial algorithm. Although the set covering problem is known to be notoriously hard in general, we observe that even large, real world instances of our problem can be quickly solved by our approach. Efficient reduction of the problem size using some simple rules plays a vital role here. application/pdf Mecke, Steffen deu 2011-03-22T17:45:45Z 2011-03-22T17:45:45Z Standortplanung von Bahnhöfen 2003

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

diplomarbeit.pdf 141

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto