The past decade has seen advances in general methods for symmetry breaking in mixed-integer linear programming. These methods are advantageous for general problems with general symmetry groups. Some important classes of mixed integer linear programming problems, such as bin packing and graph coloring, contain highly structured symmetry groups. This observation has motivated the development of problem-specific techniques. In this paper we show how to strengthen orbital branching in order to exploit special structures in a problem’s symmetry group. The proposed technique, to which we refer as modified orbital branching, is able to solve problems with structured symmetry groups more efficiently. One class of problems for which this technique is effective is when the solution variables can be expressed as 0/1 matrices where the problem’s symmetry group contains all permutations of the columns. We use the unit commitment problem, an important problem in power systems, to demonstrate the strength of modified orbital branching.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Anjos, M.F.: Recent progress in modeling unit commitment problems. In: Zuluaga, L., Terlaky, T. (eds.) Modeling and Optimization: Theory and Applications: Selected Contributions from the MOPTA 2012 Conference, Springer Proceedings in Mathematics & Statistics, vol. 84. Springer (2013)
Arroyo, J.M., Conejo, A.J.: Optimal response of a thermal unit to an electricity spot market. IEEE Trans. Power Syst. 15(3), 1098–1104 (2000)
Carrion, M., Arroyo, J.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21(3), 1371–1378 (2006)
Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Program. 106, 226–236 (2006)
Frangioni, A., Gentile, C., Lacalandra, F.: Tighter approximated milp formulations for unit commitment problems. IEEE Trans. Power Syst. 24(1), 105–113 (2009)
Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications, Lecture Notes in Computer Science, vol. 4616. Springer, pp. 146–153 (2007)
Gattermann, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192, 95–128 (2004)
Jeroslow, R.: Trivial integer programs unsolvable by branch-and-bound. Math. Program. 6, 105–109 (1974)
Kaibel, V., Loos, A.: Branched polyhedral systems. In: IPCO 2010: The Fourteenth Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 6080. Springer, pp. 177–190 (2010)
Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discret. Optim. 8(4), 595–610 (2011)
Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program. 114, 1–36 (2008)
Liu, C., Shahidehpour, M., Li, Z., Fotuhi-Firuzabad, M.: Component and mode models for the short-term scheduling of combined-cycle units. IEEE Trans. Power Syst. 24(2), 976–990 (2009)
Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94, 71–90 (2002)
Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. Ser. B 98, 3–21 (2003)
Margot, F.: Symmetry in integer linear programming. In: Jünger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958–2008, pp. 647–686. Springer, Berlin (2010)
Ostrowski, J., Anjos, M.F., Vannelli, A.: Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Trans. Power Syst. 27(1), 39–46 (2012)
Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147–178 (2009)
Rajan, D., Takriti, S.: Minimum up/down polytopes of the unit commitment problem with start-up costs. Tech. rep., IBM Research Report (2005)
Sherali, H.D., Smith, J.C.: Improving zero-one model representations via symmetry considerations. Manag. Sci. 47(10), 1396–1407 (2001)
Zhai, Q., Guan, X., Cui, J.: Unit commitment with identical units successive subproblem solving method based on Lagrangian relaxation. IEEE Trans. Power Syst. 17(4), 1250–1257 (2002)
The authors thank an anonymous referee for the constructive reports that helped greatly improve this paper. The research of the first author was supported by NSF CMMI Grant 1332662. The research of the second and third authors was partially supported by NSERC, the Natural Sciences and Engineering Research Council of Canada.
About this article
Cite this article
Ostrowski, J., Anjos, M.F. & Vannelli, A. Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150, 99–129 (2015). https://doi.org/10.1007/s10107-014-0812-y
- Integer programming
- Orbital branching
- Unit commitment
Mathematics Subject Classification