Suchergebnisse

ABSTRACTDue 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.

Most prior decision models for nature reserve-site selection have considered just two options for candidate sites: protected or not protected. In many reserve planning contexts this is an artificial and unrealistic limitation, as multiple categories of protection may be possible and desirable, especially if certain conservation elements such as rare species require special protection or management. In this paper we consider the implications of different levels of protection for species conservation and for the selection of reserve sites. New integer programming models are formulated for this problem of optimal site selection, and are presented in the context of a five-step procedure for identifying tradeoffs in the number of sites selected for each of multiple categories of protection. Results of a case study using data from Oregon are presented and compared to results from a previous study by Csuti et al.