The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks

DOI10.1287/trsc.21.3.188zbMath0626.90089OpenAlexW2008593696MaRDI QIDQ3030602

Jared L. Cohon, John R. Current, Charles S. Re Velle

Publication date: 1987

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.21.3.188

zbMATH Keywords

locationtransportation network designtotal path lengthbicriterion path problemmedian shortest path problemtotal travel time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (29)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Locating median cycles in networks ⋮ Rapid transit network design for optimal cost and origin-destination demand capture ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ The transit route arc-node service maximization problem ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ An interactive approach to identify the best compromise solution for two objective shortest path problems ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ A minimum length covering subgraph of a network ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Locating concentrators in centralized computer networks ⋮ On symmetric subtour problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A branch-and-cut algorithm for the median-path problem ⋮ The determination of the path with minimum-cost norm value ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ The vehicle routing-allocation problem: A unifying framework ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ A review of extensive facility location in networks ⋮ Some personal views on the current state and the future of locational analysis ⋮ A multi-modal approach to the location of a rapid transit line ⋮ Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling ⋮ An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem ⋮ Locating stops along bus or railway lines -- a bicriteria problem

This page was built for publication: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks