On the Finite Optimality Set of the Vector Assignment p‐Median Problem1. Issue 2 (31st August 2014)

• Record Type: Journal Article
• Authors: Lei, Ting L.; Church, Richard L.
• Is Part Of: Geographical analysis. Volume 47:Issue 2(2015)
• Page Start: 134
• Page End: 145
• Publication Date: 2014-08-31
• Subjects: Geography -- Methodology -- Periodicals; Electronic journals; 910.00182
• DOI: 10.1111/gean.12043
• Languages: English
• ISSNs: 0016-7363

Abstract

Abstract : The vector assignment p ‐median problem (VAPMP) is one of the first discrete location problems to account for the service of a demand by multiple facilities, and has been used to model a variety of location problems in addressing issues such as system vulnerability and reliability. Specifically, it involves the location of a fixed number of facilities when the assumption is that each demand point is served a certain fraction of the time by its closest facility, a certain fraction of the time by its second closest facility, and so on. The assignment vector represents the fraction of the time a facility of a given closeness order serves a specific demand point. Weaver and Church showed that when the fractions of assignment to closer facilities are greater than more distant facilities, an optimal all‐node solution always exists. However, the general form of the VAPMP does not have this property. Hooker and Garfinkel provided a counterexample of this property for the nonmonotonic VAPMP. However, they do not conjecture as to what a finite set may be in general. The question of whether there exists a finite set of locations that contains an optimal solution has remained open to conjecture. In this article, we prove that a finite optimality set for the VAPMP consisting of "equidistant points" does exist. We also show a stronger result when the underlying network is a tree graph.