Landscape analysis and efficient metaheuristics for solving the n-queens problem

DOI10.1007/S10589-013-9578-ZMaRDI QIDQ2636616zbMATH OpenOpenAlexWikidataFDO

Authors Ellips Masehian, Hossein Akbaripour, Nasrin Mohabbati-Kalejahi

Publication date 30 January 2014

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-013-9578-z

zbMATH Keywords

simulated annealinglocal searchparameter tuningscatter searchTOPSIS method\(n\)-queens problemfitness analysis of landscape

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• Fast search algorithms for the n-queens problem
• Complexity of \(n\)-queens completion
• Solving the \(N\)-Queens problem using hyperbrid genetic algorithm
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem

Cites work

• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 2209646 (Why is no real title available?)
• A comparison of simulated annealing cooling strategies
• A dynamic programming solution to the n-queens problem
• A survey of known results and research areas for \(n\)-queens
• An almost perfect heuristic for the N nonattacking queens problem
• Context-independent scatter and tabu search for permutation problems
• Metaheuristics. From design to implementation.
• Multiple attribute decision making. Methods and applications. A state-of- the-art survey
• New decision rules for exact search in \(N\)-queens
• Optimization by simulated annealing
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The On-Line Encyclopedia of Integer Sequences

Cited in

(4)

• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems
• An analytical evidence for Kalé's heuristic for the \(N\) queens problem
• Solving the \(N\)-Queens problem using hyperbrid genetic algorithm

Describes a project that uses

Uses Software

• OEIS
• Scatter Search

This page was built for publication: Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem

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