Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
DOI10.1007/S10589-013-9578-ZzbMath1287.90057OpenAlexW1968921752WikidataQ60691973 ScholiaQ60691973MaRDI QIDQ2636616
Hossein Akbaripour, Nasrin Mohabbati-Kalejahi, Ellips Masehian
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
simulated annealinglocal searchTOPSIS methodscatter searchparameter tuning\(n\)-queens problemfitness analysis of landscape
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- New decision rules for exact search in \(N\)-queens
- An almost perfect heuristic for the N nonattacking queens problem
- A survey of known results and research areas for \(n\)-queens
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- A dynamic programming solution to the \(n\)-queens problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Context-Independent Scatter and Tabu Search for Permutation Problems
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- A comparison of simulated annealing cooling strategies
This page was built for publication: Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem