The Maximum Trip Covering Location Problem with an Alternative Mode of Transportation

Mark Körner, Juan A. Mesa, Federico Perea, Anita Schöbel, Daniel Scholz

Publication date
January 2008

In this paper the problem of locating stations on a given line is studied. Mobility patterns are given by an origin-destination matrix. We assume that a potential passenger will use the railway line if his total time is lower than or equal to that of the alternative mode. The objective is to locate points on the line that maximize the number of passengers that will use the line. We provide algorithms for the the two-stations case for Euclidean and Manhattan distance and suggest interval techniques for the general case.

Work Package

BibTeX Entry
@techreport{ARRIVAL-TR-0148, author = {Mark K\"ōrner, Juan A. Mesa, Federico Perea, Anita Sch\"ōbel, Daniel Scholz}, title = {The Maximum Trip Covering Location Problem when there is an Alternative Mode of Transportation}, year = {2008}, month = {January}, institution = {ARRIVAL project}, key = {ARRIVAL-TR-0148} }

Publication details

Filename: ARRIVAL-TR-0148.pdf

Click here to set the permissions for this page.
Click here to upload an updated version of this file.
To the technical report library.

« 0147 · 0149 »