摘要：Abstract The assignment of functions to controllers is a crucial step when building an operational control system architecture. We identified this problem as a Multiple Choice Vector Bin-Packing with Conflicts that is a generalization of the one-dimensional Bin-Packing problem. Such problems are known to be strongly NP-Hard and exact techniques to solve them are too time and/or space consuming because of the combinatorial explosion. Therefore, in this paper, we propose a fast First-Fit Decreasing based heuristic that derives an optimized number of controllers in polynomial time. The objective is to minimize the global cost of controllers while satisfying safety constraints. We show through experiments that the adopted approach allows us to obtain values that are in average very close to the optimum.
关键词：KeywordsControl FunctionBin-Packing ProblemMultiple ChoiceConflictsNP-hard Problem
