Optimal Design of Multiactivity Multifacility Systems by Branch and Bound
暂无分享,去创建一个
This paper presents a model for designing multiactivity, multifacility systems. Given the maximum number of facilities and their possible locations, the problem is to determine which facilities to include in the system and which activities should be carried on at each facility in order to minimize the cost of the system. A branch-and-bound algorithm for solving the problem is given; the subproblems solved by the algorithm are tractable integer linear programs. The model can be used in the design of such diverse systems as neighborhood health centers, schools, and multiproduct inventory distribution systems.
[1] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .
[2] F. L. Hitchcock. The Distribution of a Product from Several Sources to Numerous Localities , 1941 .
[3] R. Soland,et al. A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems , 1969 .