Solving the N-Queens problem using hyperbrid genetic algorithm

MaRDI QIDQ3537136zbMATH OpenFDO

Authors Juan Liu, Jianquan Ouyang, Liangjun Chen

Publication date 24 November 2008

zbMATH Keywords

local searchgenetic algorithmfitness\(N\)-Queens problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• A bit computing algorithm for the \(N\)-queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
• A linear time solution for \(N\)-queens problem using generalized networks of evolutionary polarized processors

Cited in

(5)

• A brute-force solution to the 27-queens puzzle using a distributed computation
• A bit computing algorithm for the \(N\)-queens problem
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Mathematical approach for N-Queens problem with isomorphism
• Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem

This page was built for publication: Solving the \(N\)-Queens problem using hyperbrid genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537136)