Locating stops along bus or railway lines -- a bicriteria problem

DOI10.1007/s10479-005-2046-0zbMath1114.90013MaRDI QIDQ816419

Anita Schöbel

Publication date: 9 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2046-0

zbMATH Keywords

dynamic programming; set covering; location; public transportation; bicriterial

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B20: Traffic problems in operations research

Related Items

Stop location design in public transportation networks: covering and accessibility objectives, Site selection in the US retailing industry, The multicriteria \(p\)-facility median location problem on networks, AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS, THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS

Uses Software

• Isolde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing trip coverage in the location of a single rapid transit alignment
• A linear-time algorithm for concave one-dimensional dynamic programming
• Improved complexity bounds for location problems on the real line
• A multi-modal approach to the location of a rapid transit line
• Multicriteria optimization
• Set covering with almost consecutive ones property
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• On a routing problem
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• A Heuristic Method for the Set Covering Problem
• The Location of Emergency Service Facilities
• Locating stations on rapid transit lines