Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems

摘要

A branch-and-bound solution algorithm and a computer program implementing this algorithm are developed to solve multiactivity multifacility capacity-constrained 0-1 assignment problems. Such 0-1 integer programming problems have the objective of minimizing the sum of variable costs due to the assignment of the activities to designs and fixed costs due to the inclusion of the facilities chosen. The constraints ensure that each activity is assigned to a single design and that the capacities of the facilities chosen are not exceeded. Each design involves the use of one or more facilities, and the same design may be used by several activities. This document includes formulation of the problem, mathematical development of the branch-and-bound solution algorithm, a detailed test example, and computational test results using the computer program. The areas of application are identified, and consideration for further improvement of the branch-and-bound solution algorithm are also included. (Author)