The Design of Multiactivity Multifacility Systems
Abstract
We consider a service/distribution system in which each of N activities is to be carried out at one or several facility locations according to one of a specified set of configurations; each configuration is a specific subset of the set of L facilities being considered, along with a specific strategy for their use. We call such a system a multiactivity multifacility system and present a mathematical formulation for its optimal design that includes capacity restrictions at the facilities and the treatment of multiple criteria. The design problem is simply to choose an appropriate configuration for each of the N activities. We discuss various criteria and we show that the multiactivity multifacility design problem includes many familiar discrete location problems as special cases. We introduce a 0-1 linear optimization model called the team generalized assignment problem (T-GAP) and show that parametric solution of a T-GAP will yield all efficient solutions of the multiactivity multifacility design problem with multiple criteria. Rather than attempting to find all efficient solutions, however, we advocate an interactive approach and describe an interactive branch-and-bound algorithm that solves the design problem as a finite sequence of T-GAPs. We also discuss efficient ways to solve T-GAPs.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 15, 1981
- Accession Number
- ADA107670
Entities
People
- Richard M. Soland
Organizations
- George Washington University