Abstract In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along given routes, or of railway stations along the tracks in a railway network. The goal is to achieve a maximal covering of given demand points with a minimal number of stops. This bicriteria problem is in general NP-hard. We present a finite dominating set yielding an IP-formulation as a bicriteria set covering problem. Using this formulation we discuss cases in which the bicriteria stop location problem can be solved in polynomial time. Extensions for tackling real-world instances are mentioned.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Locating Stops Along Bus or Railway Lines—A Bicriteria Problem


    Contributors:

    Published in:

    Publication date :

    2005-04-01


    Size :

    17 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Railway stops

    Beeler, John A. | Engineering Index Backfile | 1917


    The Bicriteria Delay Management Problem

    Schöbel, Anita | Springer Verlag | 2006


    Bicriteria Stop Location

    Schöbel, Anita | Springer Verlag | 2006



    Covering Population Areas by Railway Stops

    Schöbel, Anita / Schröder, Michael | Springer Verlag | 2003