Constructs for Multilevel Closest Assignment in Location Modeling

Abstract

In the classic p-median problem, it is assumed that each point of demand will be served by his or her closest located facility. The p-median problem can be thought of as a ‘‘single-level’’ allocation and location problem, as all demand at a specific location is assigned as a whole unit to the closest facility. In some service protocols, demand assignment has been defined as ‘‘multilevel’’ where each point of demand may be served a certain percentage of the time by the closest facility, a certain percentage of the time by the second closest facility, and so on. This article deals with the case in which there is a need for ‘‘explicit’’ closest assignment (ECA) constraints. The authors review past location modeling work that involves single-level ECA constraints as well as specific constraint constructs that have been proposed to ensure single-level closest assignment. They then show how each of the earlier proposed ECA constructs can be generalized for the ‘‘multilevel’’ case. Finally, the authors provide computational experience using these generalized ECA constructs for a novel multilevel facility interdiction problem introduced in this article. Altogether, this article proposes both a new set of constraint structures that can be used in location models involving multilevel assignment as well as a new facility interdiction model that can be used to optimize worst case levels of facility disruption.