Application of New Hybrid Harmony Search Algorithms Based on Cellular Automata Theory for Solving Magic Square Problems

Magic square construction is a complex and hard permutation problem of recreational combinatorics with a long history. The complexity level enhances rapidly when the number of magic squares increases with the order of magic square. This paper proposes two hybrid metaheuristic algorithms, so-called cellular harmony search (CHS) and smallest-small-world cellular harmony search (SSWCHS) for solving magic square problems. The inspiration of the CHS is based on the cellular automata (CA) formation, while the SSWCHS is inspired by the structure of smallest-small-world network (SSWN) and CA using the concept of HS. Numerical optimization results obtained are compared with different optimizers in terms of statistical results and number of found feasible solutions. Computational results show that the proposed hybrid optimizers are computationally effective and highly efficient for tackling magic square problems.

[1]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[2]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  Adilson E Motter,et al.  Smallest small-world network. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Broderick Crawford,et al.  Using Local Search for Guiding Enumeration in Constraint Solving , 2006, AIMSA.

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  K. Pinn,et al.  Number of Magic Squares from Parallel Tempering Monte Carlo , 1998, cond-mat/9804109.

[10]  Gakuho Abe,et al.  Unsolved problems on magic squares , 1994, Discret. Math..

[11]  Lishan Kang,et al.  An evolutionary algorithm for magic squares , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[12]  Toni Mancini,et al.  SAT as an Effective Solving Technology for Constraint Problems , 2006, ISMIS.

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Do Guen Yoo,et al.  Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems , 2013, J. Appl. Math..

[15]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[16]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[17]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[18]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[19]  Barbara M. Smith,et al.  Value Ordering for Finding All Solutions , 2005, IJCAI.