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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cheng, B.M.W., Choi, K.M.F., Lee, J.H.M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: an experience report. Constraints 4, 167–192 (1999)
Choueiry, B.Y., Noubir, G.: On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In: AAAI 1998, pp. 326–333 (1998)
Frisch, A.M., Hnich, B., Miguel, I., Smith, B.M., Walsh, T.: Towards Model Reformulation at Multiple Levels of Abstraction. In: Frisch, A.M. (ed.) Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems: Towards Systematisation and Automation (2002)
Frisch, A.M., Miguel, I., Walsh, T.: Modelling a Steel Mill Slab Design Problem. In: Proceedings of the IJCAI 2001 Workshop on Modelling and Solving Problems with Constraints, pp. 39–45 (2001)
Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Horn, W. (ed.) Proceedings ECAI 2000, pp. 599–603 (2000)
Régin, J.-C.: Using Constraint Programming to Solve the Maximum Clique Problem. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 634–648. Springer, Heidelberg (2003)
Sherali, H.D., Smith, J.C.: Improving Discrete Model Representations Via Symmetry Considerations. Management Science 47, 1396–1407 (2001)
Sherali, H.D., Smith, J.C., Lee, Y.: A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem allowing demand splitting. INFORMS J. on Computing 12, 284–298 (2000)
Smith, B.M.: Search Strategies for Optimization: Modelling the SONET Problem. Report APES-70-2003 (August 2003); Presented at the CP 2003 Workshop on Modelling and Reformulating Constraint Satisfaction Problems
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, B.M. (2005). Symmetry and Search in a Network Design Problem. In: Barták, R., Milano, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2005. Lecture Notes in Computer Science, vol 3524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493853_25
Download citation
DOI: https://doi.org/10.1007/11493853_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26152-0
Online ISBN: 978-3-540-32264-1
eBook Packages: Computer ScienceComputer Science (R0)