Abstract
Genetic algorithm is applicable to a wide range of constraint satisfaction problems such as n-queens problem. In the absence of specialized solution for a particular problem, genetic algorithm would be efficient. But holism and random choices cause problem for genetic algorithm in searching large state spaces. So, the efficiency of this algorithm would be demoted when the size of state space of the problem grows exponentially. In this paper, we attempt to cover this weakness by using local search algorithm like minimal conflicts algorithm. Minimal conflicts algorithm is trying to provide partial view for genetic algorithm by locally searching the state space. This may cause genetic algorithm to take longer steps toward the solution. Modified genetic algorithm, is the result of collaboration between genetic algorithm and minimal conflicts algorithm. Comparing the results of applying standard genetic algorithm and modified genetic algorithm on n-queens problem in section VI, indicates the amount of performance improvement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
