Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems

DOI10.1007/978-3-319-11271-8_6zbMath1348.68231DBLPconf/ijcci/Mohabbati-Kalejahi12OpenAlexW2221267147WikidataQ60691733 ScholiaQ60691733MaRDI QIDQ2829663

Hossein Akbaripour, Ellips Masehian, Nasrin Mohabbati-Kalejahi

Publication date: 8 November 2016

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11271-8_6

zbMATH Keywords

imperialist competitive algorithmhybrid imperialist competitive algorithmeffective swap operatornon-attacking \(n\)-queens problemnon-dominating \(n\)-queens problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• OEIS

Cites Work

• New decision rules for exact search in \(N\)-queens
• A survey of known results and research areas for \(n\)-queens
• A dynamic programming solution to the \(n\)-queens problem
• Context-Independent Scatter and Tabu Search for Permutation Problems

This page was built for publication: Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems