Algorithms for the Model Configuration Problem

The model configuration problem is a combinatorial optimization problem that arises in the context of switching cabinet manufacturing in the telecommunication industry. We discuss the manufacturing environment and define the q-model problem in this context, for q >= 1. We then discuss the structural properties of the q-model problem, and propose an efficient procedure for solving the 1-model problem. We also propose several heuristic procedures for solving the 2-model problem, and present an evaluation of these procedures through an extensive computational experiment.