Symmetry and Search in a Network Design Problem

An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A constraint programming model of the problem is described and compared with a mixed integer programming formulation. In the CP model the search is decomposed into two stages; first partially solving the problem by deciding how many rings each node should be on, and then making specific assignments of nodes to rings. The model includes implied constraints derived by considering optimal solutions to subproblems. In both the MIP and CP models, it is important to deal with the symmetry of the problem. In the CP model, two sources of symmetry are separated; one is eliminated dynamically during search and the other by assigning ranges rather than explicit values to one set of decision variables. The resulting CP model allows optimal solutions to be found easily for benchmark problems.