Capacitated heuristic program for multiactivity, multi‐facility system designs
针对多活动、多设施系统设计问题，提出一种高效启发式程序，可求解有容量和无容量限制的设施选址与活动配置问题，计算实验表明其性能接近最优解。
Abstract Multi‐activity, multi‐facility design systems occur in a wide variety of industrial and service applications: e.g.: regional health care centers with configurations of activities at each center, and multi‐echelon inventory distribution systems. The problem in designing such systems is to determine from a candidate set of possible locations what facility locations should be opened and what types of activities should be carried out at each of the open facilities. This article presents an efficient heuristic procedure for such a problem. The heuristic procedure described can be used to solve both the uncapacitated and the capacitated problems where capacity is expressed in terms of the number of activities which can be supported by the facilities. Extensive computational experience with the heuristic is presented. The performance of the heuristic is compared against optimal solutions and the results look very encouraging.