A neural network approach to tiling problems
Tatiana Tambouratzis · International Journal of Intelligent Systems · 2001
The family of tiling problems comprises combinatorial optimization problems involving a grid and a number of shapes. Appropriate placements of the shapes on the grid are sought such that specific constraints concerning shape overlap and grid coverage are satisfied. The family of tiling problems has links with graph theory and is, thus, interesting from a theoretical point of view. Being related to VLSI circuit design, tiling problems are also of practical importance. In this piece of research, parallel implementations of representative tiling problems are proposed by employing three distinct harmony theory-based artificial neural networks. Optimal solutions are always produced for appropriately selected values of the network parameters. Problem complexity has been found to affect the computational complexity of the solution. © 2001 John Wiley & Sons, Inc.