The Maximum Utilization Subtree Problem

James George, Charles ReVelle and John Current

Annals of Operations Research, 2002, vol. 110, issue 1, 133-151

Abstract: A number of network design problems can be built on the following premise: Given a tree network, T, containing node set, V, identify a single subtree, t, containing nodes, v, so that the subtree is located optimally with respect to the remaining, unconnected nodes {V−v}. Distances between unconnected nodes and nodes in the subtree t can be defined on travel paths that are restricted to lie in the larger tree T (the travel-restricted case), or can be defined on paths in an auxiliary complete graph G (the travel-unrestricted case). This paper presents the Maximum Utilization Subtree Problem (MUSP), a bicriterion problem that trades off the cost of a subtree, t, against the utilization of the subtree by the sum of the populations at nodes connected to the subtree, plus the distance-attenuated population that must travel to the subtree from unconnected nodes. The restricted and unrestricted cases are formulated as a two objective integer programs where the objectives are to maximize utilization of the subtree and minimize the cost of the subtree. The programs are tested using linear programming and branch and bound to resolve fractions. The types of problems presented in this paper have been characterized in the existing literature as “structure location” or “extensive facility location” problems. This paper adds two significant contributions to the general body of location literature. First, it draws explicit attention to the travel-restricted and travel-unrestricted cases, which may also be called “limited-access” and “general-access” cases, respectively. Second, the distance-attenuated demands represent a new objective function concept that does not appear in the location literature. Copyright Kluwer Academic Publishers 2002

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020719718071 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:110:y:2002:i:1:p:133-151:10.1023/a:1020719718071

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020719718071

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().