Two‐Level Hierarchical Transportation Networks: A New Set of Problems and Practical Applications*
定义并解决了两级分层交通网络中的新问题：给定一组点，找到一条主路径，使得各点到主路径的垂线长度加权和与两个最远垂足间距离之和最小，并给出了主路径为直线时的算法与计算结果。
ABSTRACT This paper defines and solves a set of new problems for two‐level hierarchical transportation networks. Given a set of points, the objective is to find the path of a primary link such that a weighted sum of the lengths of the perpendiculars from each point to the primary link and the distance between the feet of the two extreme perpendiculars is minimized. The perpendiculars are the connecting or secondary links and the primary link could be a straight line or a curve. The paper provides an algorithm and computational results for the case in which the primary link is a straight line. Implementation approaches are also discussed.