Solving N-queen using modified genetic algorithm

this paper proposes an optimum way for solving combinatorial problems in large scales; using genetic algorithm (GA). N-Queen problem as a typical combination optimization problem which is an NP-hard problem was selected in order to check the reliability and efficiency of proposed algorithm. There are many N-queen solutions available but as the population of the queens grows; the problem becomes more complex thus more time consuming. Modifications made for genetic algorithm in this paper, lowers the solving time for this matter by immense amount. These modifications take place mostly in genetic algorithms core methods as in selection and mutation of genes. Results show that suggested modifications have a significant effect on speed and efficiency in which first viable solution gets found. Test results on big scales of N as number of queens shows validity and efficiency of the proposed method. it is also possible to get better results by altering problem parameters.

کلیدواژه ها:

N-Queens problem ، combinatorial problems ، genetic algorithms ، NP hard problems