Irregular polyomino tiling via integer programming with application in phased array antenna design
- 352 Downloads
A polyomino is a generalization of the domino and is created by connecting a fixed number of unit squares along edges. Tiling a region with a given set of polyominoes is a hard combinatorial optimization problem. This paper is motivated by a recent application of irregular polyomino tilings in the design of phased array antennas. Specifically, we formulate the irregular polyomino tiling problem as a nonlinear exact set covering model, where irregularity is incorporated into the objective function using the information-theoretic entropy concept. An exact solution method based on a branch-and-price framework along with novel branching and lower-bounding schemes is proposed. The developed method is shown to be effective for small- and medium-size instances of the problem. For large-size instances, efficient heuristics and approximation algorithms are provided. Encouraging computational results including phased array antenna simulations are reported.
KeywordsPolyomino Entropy Set partitioning Phased array antenna
The first two authors were supported by AFOSR Grant FA9550-08-1-0268. The third author was supported by AFOSR Grant FA9550-12-1-0105. The authors thank Dr. Osman Y. Özaltın and Gabriel L. Zenarosa for their valuable comments on the earlier draft of the paper and Dr. Scott Santarelli for his assistance with antenna simulation software. The first two authors also acknowledge Dr. Arje Nachman and Dr. Donald W. Hearn from AFOSR for introducing them to the considered application. Finally, the authors thank the reviewers and the AE for their helpful comments.
- 9.Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. No. 66, 72 (1966)Google Scholar
- 10.Bodini, O.: Tiling a rectangle with polyominoes. Discrete Math. Theor. C pp. 81–88 (2003)Google Scholar
- 14.COIN-OR: Branch-Cut-Price Framework 1.3.1. https://projects.coin-or.org/Bcp (2011)
- 27.Haus, U., Michaels, D., Savchenko, A.: Extended formulations for MINLP problems by value decompositions. In: EngOpt 2008 (2008)Google Scholar
- 28.IBM: IBM ILOG CPLEX 12.2. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/ (2011)
- 36.Mailloux, R., Santarelli, S., Roberts, T., Luu, D.: Irregular polyomino-shaped subarrays for space-based active arrays. Int. J. Antennas Propag. 2009 (2009)Google Scholar
- 37.Mollin, R.: An Introduction to Cryptography. Discrete Mathematics and Its Applications. Chapman & Hall, London (2007)Google Scholar
- 39.Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Books on Mathematics. Dover Publications, NY (1998)Google Scholar
- 41.Reid, M.: Tiling with similar polyominoes. J. Recreat. Math. 31(1), 15–24 (2002)Google Scholar
- 42.Ryan, D., & Foster, B.: An integer programming approach to scheduling. In: Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269–280 (1981)Google Scholar