A Family of Location Models for Multiple‐Type Discrete Dispersion

One of the defining objectives in location science is to maximize dispersion. Facilities can be dispersed for a wide variety of purposes, including attempts to optimize competitive market advantage, disperse negative impacts, and optimize security. With one exception, all of the extant dispersion models consider only one type of facility, and ignore problems where multiple types of facilities must be located. We provide examples where multiple-type dispersion is appropriate and based on this develop a general class of facility location problems that optimize multiple-type dispersion. This family of models expands on the previously formulated definitions of dispersion for single types of facilities, by allowing the interactions among different types of facilities to determine the extent to which they will be spatially dispersed. We provide a set of integer-linear programming formulations for the principal models of this class and suggest a methodology for intelligent constraint elimination. We also present results of solving a range of multiple-type dispersion problems optimally and demonstrate that only the smallest versions of such problems can be solved in a reasonable amount of computer time using general-purpose optimization software. We conclude that the family of multiple-type dispersion models provides a more comprehensive, flexible, and realistic framework for locating facilities where weighted distances should be maximized, when compared with the special case of locating only a single type of facility.