THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
From MaRDI portal
Publication:3632030
DOI10.1142/S0217595909002080zbMATH Open1177.90253MaRDI QIDQ3632030FDOQ3632030
Authors: Anita Schöbel, Horst W. Hamacher, Annegret Liebers, Dorothea Wagner 
Publication date: 23 June 2009
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Recommendations
- Locating stops along bus or railway lines -- a bicriteria problem
- The stop location problem with realistic traveling time
- Stop location design in public transportation networks: covering and accessibility objectives
- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- Covering population areas by railway stops
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Locating stops along bus or railway lines -- a bicriteria problem
- The NP-completeness column: An ongoing guide
- Locating stations on rapid transit lines
- A Heuristic Method for the Set Covering Problem
- A coverage model for improving public transit system accessibility and expanding access
- Finite Dominating Sets for Network Location Problems
- Set covering with almost consecutive ones property
Cited In (19)
- A two-stage urban bus stop location model
- Decomposition of integer matrices and multileaf collimator sequencing
- Covering population areas by railway stops
- Locating stops along bus or railway lines -- a bicriteria problem
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
- Set covering with almost consecutive ones property
- The stop location problem with realistic traveling time
- Station location -- complexity and approximation
- Continuous space maximal coverage: insights, advances and challenges
- Urban rapid transit network design: accelerated Benders decomposition
- Operational impacts of using restricted passenger flow assignment in high-speed train stop scheduling problem
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- To stop or not to stop: a time-constrained trip covering location problem on a tree network
- Stop location design in public transportation networks: covering and accessibility objectives
- Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network
- Algorithms – ESA 2004
- Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
- Train stop scheduling in a high-speed rail network by utilizing a two-stage approach
- Public facility location using dispersion, population, and equity criteria
This page was built for publication: THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3632030)
