Stop location design in public transportation networks: covering and accessibility objectives

DOI10.1007/s11750-008-0061-4zbMath1179.90208OpenAlexW2014149569MaRDI QIDQ845574

Horst W. Hamacher, Dwi Retnani Poetranto Groß, Anita Schöbel, Simone Horn

Publication date: 29 January 2010

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-008-0061-4

zbMATH Keywords

accessibilitycoveringlocationpublic transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (3)

Continuous space maximal coverage: insights, advances and challenges ⋮ To stop or not to stop: a time-constrained trip covering location problem on a tree network ⋮ A two-phase heuristic algorithm for the label printing problem

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Locating stops along bus or railway lines -- a bicriteria problem
• Set covering with almost consecutive ones property
• On the Complexity of Some Common Geometric Location Problems
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Algorithms – ESA 2004
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• The Location of Emergency Service Facilities
• Locating stations on rapid transit lines

This page was built for publication: Stop location design in public transportation networks: covering and accessibility objectives