Symmetry and search in a network design problem

Authors:
Barbara M. Smith
Affiliations:
Cork Constraint Computation Centre, University College Cork, Ireland
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 4
Cited 8

On the computation of local interchangeability in discrete constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting

INFORMS Journal on Computing
Improving Discrete Model Representations via Symmetry Considerations

Management Science

Constraint models for graceful graphs

Constraints
A hybrid constraint model for the routing and wavelength assignment problem

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving the static design routing and wavelength assignment problem

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Constraint based resilience analysis

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Transforming and refining abstract constraint specifications

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
On the design of the next generation access networks

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Boosting set constraint propagation for network design

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cutting plane algorithms for solving a stochastic edge-partition problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.