THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
From MaRDI portal
Publication:3632030
DOI10.1142/S0217595909002080zbMath1177.90253MaRDI QIDQ3632030
Dorothea Wagner, Annegret Liebers, Anita Schöbel, Horst W. Hamacher
Publication date: 23 June 2009
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
Urban rapid transit network design: accelerated Benders decomposition ⋮ Stop location design in public transportation networks: covering and accessibility objectives ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ Set covering with almost consecutive ones property ⋮ 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 ⋮ Train stop scheduling in a high-speed rail network by utilizing a two-stage approach ⋮ Operational impacts of using restricted passenger flow assignment in high-speed train stop scheduling problem ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property ⋮ A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Decomposition of integer matrices and multileaf collimator sequencing ⋮ Locating stops along bus or railway lines -- a bicriteria problem
Cites Work
- Unnamed Item
- Locating stops along bus or railway lines -- a bicriteria problem
- A coverage model for improving public transit system accessibility and expanding access
- Set covering with almost consecutive ones property
- Finite Dominating Sets for Network Location Problems
- A Heuristic Method for the Set Covering Problem
- The NP-completeness column: An ongoing guide
- Locating stations on rapid transit lines
