IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v56y2013i3p735-764.html
   My bibliography  Save this article

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

Author

Listed:
  • Ellips Masehian
  • Hossein Akbaripour
  • Nasrin Mohabbati-Kalejahi

Abstract

The n-queens problem is a classical combinatorial optimization problem which has been proved to be NP-hard. The goal is to place n non-attacking queens on an n×n chessboard. In this paper, two single-solution-based (Local Search (LS) and Tuned Simulated Annealing (SA)) and two population-based metaheuristics (two versions of Scatter Search (SS)) are presented for solving the problem. Since parameters of heuristic and metaheuristic algorithms have great influence on their performance, a TOPSIS-Taguchi based parameter tuning method is proposed, which not only considers the number of fitness function evaluations, but also aims to minimize the runtime of the presented metaheuristics. The performance of the suggested approaches was investigated through computational analyses, which showed that the Local Search method outperformed the other two algorithms in terms of average runtimes and average number of fitness function evaluations. The LS was also compared to the Cooperative PSO (CPSO) and SA algorithms, which are currently the best algorithms in the literature for finding the first solution to the n-queens problem, and the results showed that the average fitness function evaluation of the LS is approximately 21 and 8 times less than that of SA and CPSO, respectively. Also, a fitness analysis of landscape for the n-queens problem was conducted which indicated that the distribution of local optima is uniformly random and scattered over the search space. The landscape is rugged and there is no significant correlation between fitness and distance of solutions, and so a local search heuristic can search a rugged plain landscape effectively and find a solution quickly. As a result, it was statistically and analytically proved that single-solution-based metaheuristics outperform population-based metaheuristics in finding the first solution of the n-queens problem. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Ellips Masehian & Hossein Akbaripour & Nasrin Mohabbati-Kalejahi, 2013. "Landscape analysis and efficient metaheuristics for solving the n-queens problem," Computational Optimization and Applications, Springer, vol. 56(3), pages 735-764, December.
    • Handle: RePEc:spr:coopap:v:56:y:2013:i:3:p:735-764
    DOI: 10.1007/s10589-013-9578-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9578-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9578-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Terry Jones, 1995. "Evolutionary Algorithms, Fitness Landscapes and Search," Working Papers 95-05-048, Santa Fe Institute.
    2. Pablo San Segundo, 2011. "New decision rules for exact search in N-Queens," Journal of Global Optimization, Springer, vol. 51(3), pages 497-514, November.
    3. Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Saad Alharbi & Ibrahim Venkat, 2017. "A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem," Journal of Optimization, Hindawi, vol. 2017, pages 1-8, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Christian M. Reidys & Peter F. Stadler, 1998. "Neutrality in Fitness Landscapes," Working Papers 98-10-089, Santa Fe Institute.
    2. Koen Frenken & Luigi Marengo & Marco Valente, 1999. "Interdependencies, nearly-decomposability and adaption," CEEL Working Papers 9903, Cognitive and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
    3. W. Art Chaovalitwongse & Carlos A. S. Oliveira & Bruno Chiarini & Panos M. Pardalos & Mauricio G. C. Resende, 2011. "Revised GRASP with path-relinking for the linear ordering problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 572-593, November.
    4. Peter F. Stadler & Robert Happel, 1995. "Random Field Models for Fitness Landscapes," Working Papers 95-07-069, Santa Fe Institute.
    5. Terry Jones & Stephanie Forrest, 1995. "Genetic Algorithms and Heuristic Search," Working Papers 95-02-021, Santa Fe Institute.
    6. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    7. Bill McKelvey, 1999. "Avoiding Complexity Catastrophe in Coevolutionary Pockets: Strategies for Rugged Landscapes," Organization Science, INFORMS, vol. 10(3), pages 294-321, June.
    8. Gunter P. Wagner & Peter F. Stadler, 1997. "Complex Adaptations and the Structure of Recombination Spaces," Working Papers 97-03-029, Santa Fe Institute.
    9. David Kane, 1996. "Local Hillclimbing on an Economic Landscape," Working Papers 96-08-065, Santa Fe Institute.
    10. Daniel Porumbel & Jin-Kao Hao, 2020. "Distance-guided local search," Journal of Heuristics, Springer, vol. 26(5), pages 711-741, October.
    11. Fred Glover & Gary Kochenberger & Weihong Xie & Jianbin Luo, 2019. "Diversification methods for zero-one optimization," Journal of Heuristics, Springer, vol. 25(4), pages 643-671, October.
    12. Peter F. Stadler & Rudi Seitz & Günter P. Wagner, 1999. "Evolvability of Complex Characters," Working Papers 99-01-001, Santa Fe Institute.
    13. Wim Hordijk, 1995. "A Measure of Landscapes," Working Papers 95-05-049, Santa Fe Institute.
    14. Ghaith Jaradat & Masri Ayob & Zulkifli Ahmad, 2014. "On the performance of Scatter Search for post-enrolment course timetabling problems," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 417-439, April.
    15. A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna, 2021. "A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 629-642, May.
    16. Xue Bai & Rema Padman & Joseph Ramsey & Peter Spirtes, 2008. "Tabu Search-Enhanced Graphical Models for Classification in High Dimensions," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 423-437, August.
    17. Terry Jones, 1995. "One Operator, One Landscape," Working Papers 95-02-025, Santa Fe Institute.
    18. M Laguna & J Molina & F Pérez & R Caballero & A G Hernández-Díaz, 2010. "The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 53-67, January.
    19. C R Reeves & A V Eremeev, 2004. "Statistical analysis of local search landscapes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 687-693, July.
    20. Peter F. Stadler & Gunjter P. Wagner, 1996. "The Algebraic Theory of Recombination Spaces," Working Papers 96-07-046, Santa Fe Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:56:y:2013:i:3:p:735-764. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.