An algorithm to evaluate public transportation stops for minimizing passenger walking distance

DOI10.1016/0307-904X(83)90158-0zbMath0503.90039MaRDI QIDQ1173527

Joseph N. Prashker, Jelman I. Stern, Avishai (Avi) Ceder

Publication date: 1983

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

logisticslocation of public transit stopsminimizing passenger walking distanceoptimum algorithmpublic transportation system designurban transportation network

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Uses Software

• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The m-Center Problem
• The Optimum Location of Multi-centres on a Graph
• On the Set-Covering Problem
• A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: An algorithm to evaluate public transportation stops for minimizing passenger walking distance