The Minimum‐Covering/Shortest‐Path Problem*
提出最小覆盖/最短路径问题，这是一个双目标路径优化模型，旨在最小化路径对周边人口的不利影响和路径长度，将覆盖概念从设施选址扩展到网络设计。
ABSTRACT Due to the inherent multiobjective nature of many network design and routing problems, there has been a tremendous increase in multiobjective network modeling in recent years. In this article we introduce one such model, the minimum‐covering/shortest‐path (MinCSP) problem, and formulate several variations of the problem. The MinCSP problem is a two‐objective path problem: minimization of the total population negatively impacted by the path and minimization of the total path length. A population is considered to be negatively impacted by the path if the path comes within some predetermined distance of the population. Consequently, the MinCSP problem extends the concept of coverage from facility location modeling to network design. Additionally, several existing solution methods for the problem are briefly discussed and potential applications presented.