An Integer Coding Based Optimization Model for Queen Problems

HTML  XML Download Download as PDF (Size: 302KB)  PP. 32-36  
DOI: 10.4236/ajcm.2016.61004    1,739 Downloads   2,408 Views  Citations
Author(s)

ABSTRACT

Queen problems are unstructured problems, whose solution scheme can be applied in the actual job scheduling. As for the n-queen problem, backtracking algorithm is considered as an effective approach when the value of n is small. However, in case the value of n is large, the phenomenon of combination explosion is expected to occur. In order to solve the aforementioned problem, queen problems are firstly converted into the problem of function optimization with constraints, and then the corresponding mathematical model is established. Afterwards, the n-queen problem is solved by constructing the genetic operators and adaption functions using the integer coding based on the population search technology of the evolutionary computation. The experimental results demonstrate that the proposed algorithm is endowed with rapid calculation speed and high efficiency, and the model presents simple structure and is readily implemented.

Share and Cite:

Hu, N. (2016) An Integer Coding Based Optimization Model for Queen Problems. American Journal of Computational Mathematics, 6, 32-36. doi: 10.4236/ajcm.2016.61004.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.