Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs

Computers and Operations Research

Volumn 97, Issue , 2018, Pages 96-110

  Vo Thanh, Nha ^a,b   Jans, Raf ^c   Schoen, Eric D ^b,d   Goos, Peter ^b,e  

^a UNIVERSITY OF HOHENHEIM   (Germany)

^b UNIVERSITY OF ANTWERP   (Belgium)

^c HEC MONTRÉAL   (Canada)

^d TNO   (Netherlands)

^e Katholieke Universiteit Leuven   (Belgium)

Author keywords

Asymmetric representatives formulation; Confounding; Integer linear programing; Orthogonal blocking; Symmetry breaking constraints

Indexed keywords

DESIGN OF EXPERIMENTS; STATISTICS;

ASYMMETRIC REPRESENTATIVES FORMULATION; CONFOUNDING; INTEGER LINEAR PROGRAMING; ORTHOGONAL BLOCKING; SYMMETRY BREAKING CONSTRAINTS;

INTEGER PROGRAMMING;

EID: 85047010577     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2018.04.001     Document Type: Article

References (39)

1. Adulyasak, Y., Cordeau, J.F., Jans, R., Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26 (2014), 103–120.
2. Altinakar, S., Caporossi, G., Hertz, A., A comparison of integer and constraint programming models for the deficiency problem. Comput. Oper. Res. 68 (2016), 89–96.
3. Bard, J.F., Wan, L., Workforce design with movement restrictions between workstation groups. Manuf. Serv. Oper. Manag. 10 (2008), 24–42.
4. Boland, N., Hughes, B.D., Merlot, L.T., Stuckey, P.J., New integer linear programming approaches for course timetabling. Comput. Oper. Res. 35 (2008), 2209–2233.
5. Campêlo, M., Campos, V.A., Corrêa, R.C., On the asymmetric representatives formulation for the vertex coloring polytope. Discrete Appl. Math. 156 (2008), 1097–1111.
6. Catanzaro, D., Godi, A., Labbé M., Class representative model for pure parsimony haplotyping. INFORMS J. Comput. 22 (2010), 159–209.
7. Coelho, L.C., Laporte, G., The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40 (2013), 558–565.
8. Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Economics 155 (2014), 391–397.
9. Denton, B.T., Miller, A.J., Balasubramanian, H.J., Huschka, T.R., Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58 (2010), 802–816.
10. Ghoniem, A., Sherali, H.D., Defeating symmetry in combinatorial optimization via objective perturbations and hierarchical constraints. IIE Trans. 43 (2011), 575–588.
11. Hedayat, A.S., Sloane, N.J.A., Stufken, J., Orthogonal Arrays: Theory and Applications. 1999, Springer-Verlag, New York.
12. Ignizio, J.P., Generalized goal programming an overview. Comput. Oper. Res. 10 (1983), 227–289.
13. Jans, R., Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints. INFORMS J. Comput. 21 (2009), 123–136.
14. Jans, R., Degraeve, Z., Schepens, L., Analysis of an industrial component commonality problem. Eur. J. Oper. Res. 186 (2008), 801–811.
15. Jans, R., Desrosiers, J., Binary clustering problems: symmetric, asymmetric and decomposition formulations. GERAD Technical Report G-2010-44, 15 pages, 2010.
16. Jans, R., Desrosiers, J., Efficient symmetry breaking formulations for the job grouping problem. Comput. Oper. Res. 40 (2013), 1132–1142.
17. Junglas, D., Optimised Grid-Partitioning for Block Structured Grids in Parallel Computation. PhD thesis, 2007, Darmstadt, Germany.
18. Kaibel, V., Peinhardt, M., Pfetsch, M.E., Orbitopal fixing. Discrete Optim. 8 (2011), 595–610.
19. Kaibel, V., Pfetsch, M., Packing and partitioning orbitopes. Math. Programm. 114 (2008), 1–36.
20. Linderoth, J., Margot, F., Thain, G., Improving bounds on the football pool problem by integer programming and high-throughput computing. INFORMS J. Comput. 21 (2009), 445–457.
21. Margot, F., Pruning by isomorphism in branch-and-cut. Math. Programm. 94 (2002), 71–90.
22. Margot, F., Exploiting orbits in symmetric ILP. Math. Programm. 98 (2003), 3–21.
23. Margot, F., Symmetry in integer linear programming. 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, 2010, Springer Berlin Heidelberg, 647–686.
24. Mee, R.W., A Comprehensive Guide to Factorial Two-Level Experimentation. 2009, Springer-Verlag, New York, NY, USA.
25. Melo, R.A., Ribeiro, C.C., Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking. Comput. Industr. Eng. 85 (2015), 402–413.
26. Montgomery, D.C., Design and Analysis of Experiments. Seventh Edition, 2009, Wiley, New York.
27. Ostrowski, J., Anjos, M.F., Vannelli, A., Modified orbital branching for structured symmetry with an application to unit commitment. Math. Programm. 150:1 (2015), 99–129.
28. Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S., Orbital branching. Math. Programm. 126 (2011), 147–178.
29. Sartono, B., Goos, P., Schoen, E.D., Blocking orthogonal designs with mixed integer linear programming. Technometrics 57 (2015), 428–439.
30. Sartono, B., Goos, P., Schoen, E.D., Constructing general orthogonal fractional factorial split-plot designs. Technometrics 57 (2015), 488–502.
31. Schoen, E.D., Eendebak, P.T., Nguyen, M.V.M., Complete enumeration of pure-level and mixed-level orthogonal arrays. J. Combinat. Designs 18 (2010), 123–140.
32. Schoen, E.D., Mee, R.W., Two-level designs of strength 3 and up to 48 runs. J. R. Stat. Soc. Ser. C 61 (2012), 163–174.
33. Schoen, E.D., Sartono, B., Goos, P., Optimum blocking for general resolution-3 designs. J. Qual. Technol. 45 (2013), 166–187.
34. Schoen, E.D., Vo-Thanh, N., Goos, P., Two-level orthogonal screening designs with 24, 28, 32 and 36 runs. J. Am. Stat. Assoc. 112 (2017), 1354–1369.
35. Schoen, E.D., Vo-Thanh, N., Goos, P., Orthogonal blocking arrangements for 24-run and 28-run two-level designs. J. Qual. Tech., 50, 2018, To appear.
36. Sherali, H.D., Fraticelli, B.M., Meller, R.D., Enhanced model formulations for optimal facility layout. Oper. Res. 51 (2003), 629–644.
37. Van der Gaast, J.P., Rietveld, C.A., Gabor, A.F., Zhang, Y., A tabu search algorithm for application placement in computer clustering. Comput. Oper. Res. 50 (2014), 38–46.
38. Wolsey, L.A., Integer Programming. 1988, Wiley.
39. Wu, C.F.J., Hamada, M.S., Experiments: Planning, Analysis, and Optimization. 2009, 2nd edition, Wiley, New York, NY, USA.