{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:21:35Z","timestamp":1778084495595,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T00:00:00Z","timestamp":1372809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10589-013-9578-z","type":"journal-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T16:44:03Z","timestamp":1372783443000},"page":"735-764","source":"Crossref","is-referenced-by-count":16,"title":["Landscape analysis and efficient metaheuristics for solving the n-queens problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Ellips","family":"Masehian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Akbaripour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasrin","family":"Mohabbati-Kalejahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,3]]},"reference":[{"key":"9578_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E.H.L. Aarts","year":"1997","unstructured":"Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"issue":"3","key":"9578_CR2","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/0743-7315(89)90011-7","volume":"6","author":"B. Abramson","year":"1989","unstructured":"Abramson, B., Yung, M.: Divide and conquer under global constraints: a solution to the N-queens problem. J. Parallel Distrib. Comput. 6(3), 649\u2013662 (1989)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9578_CR3","volume-title":"3rd International Conference on Electronics Computer Technology","author":"A. Amooshahi","year":"2011","unstructured":"Amooshahi, A., Joudaki, M., Imani, M., Mazhari, N.: Presenting a new method based on cooperative PSO to solve permutation problems: a case study of n-queen problem. In: 3rd International Conference on Electronics Computer Technology (2011)"},{"key":"9578_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J. Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for n-queens. Discrete Math. 309, 1\u201331 (2009)","journal-title":"Discrete Math."},{"key":"9578_CR5","unstructured":"Bezzel, M.: Proposal of 8-queens problem, Berliner Schachzeitung 3, 363 (1848)"},{"key":"9578_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","volume":"17","author":"V. Campos","year":"2005","unstructured":"Campos, V., Laguna, M., Mart, R.: Context-independent scatter search and tabu search for permutation problems. INFORMS J. Comput. 17, 111\u2013122 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9578_CR7","volume-title":"International Conference on Signal Processing Systems","author":"S. Dirakkhunakon","year":"2009","unstructured":"Dirakkhunakon, S., Suansook, Y.: Simulated annealing with iterative improvement. In: International Conference on Signal Processing Systems (2009). doi: 10.1109\/ICSPS.2009.61"},{"key":"9578_CR8","first-page":"145","volume-title":"Proceedings of the 7th International Symposium on Programming and Systems","author":"A. Draa","year":"2005","unstructured":"Draa, A., Talbi, H., Batouche, M.: A quantum inspired genetic algorithm for solving the N-queens problem. In: Proceedings of the 7th International Symposium on Programming and Systems, Algiers, pp. 145\u2013152 (2005)"},{"key":"9578_CR9","first-page":"21","volume":"7","author":"A. Draa","year":"2010","unstructured":"Draa, A., Meshoul, S., Talbi, H., Batouche, M.: A quantum-inspired differential evolution algorithm for solving the N-queens problem. Int. Arab J. Inf. Technol. 7, 21\u201327 (2010)","journal-title":"Int. Arab J. Inf. Technol."},{"key":"9578_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/131214.131227","volume-title":"Proceedings of the 1992 ACM Annual Conference on Communications","author":"C. Erbas","year":"1992","unstructured":"Erbas, C., Sarkeshik, S., Tanik, M.M.: Different perspectives of the n-queens problem. In: Proceedings of the 1992 ACM Annual Conference on Communications, pp. 99\u2013108. ACM Press, New York (1992)"},{"key":"9578_CR11","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721\u2013741 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9578_CR12","first-page":"13","volume-title":"Lecture Notes in Computer Science","author":"F. Glover","year":"1997","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J.K., Lutton, E., Ronald, E., Schoenauer, D., Snyers, D. (eds.) Lecture Notes in Computer Science, vol.\u00a01363, pp.\u00a013\u201354 (1997)"},{"key":"9578_CR13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9578_CR14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/SECON.1992.202348","volume-title":"Proceedings IEEE Southeast Conference","author":"A. Homaifar","year":"1992","unstructured":"Homaifar, A., Turner, J., Ali, S.: The n-queens problem and genetic algorithms. In: Proceedings IEEE Southeast Conference, vol. 1, pp. 262\u2013267 (1992)"},{"key":"9578_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48318-9","volume-title":"Multiple Attribute Decision Making-Method and Applications, a State-of-the-Art Survey","author":"C.L. Hwang","year":"1981","unstructured":"Hwang, C.L., Yoon, K.: Multiple Attribute Decision Making-Method and Applications, a State-of-the-Art Survey. Springer, New York (1981)"},{"key":"9578_CR16","volume-title":"IEEE International Conference on Neural Networks","author":"A. Jagota","year":"1993","unstructured":"Jagota, A.: Optimization by reduction to maximum clique. In: IEEE International Conference on Neural Networks (1993)"},{"key":"9578_CR17","first-page":"184","volume-title":"Proceedings of the 6th International Conference on GeneticAlgorithms","author":"T. Jones","year":"1995","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on GeneticAlgorithms, pp. 184\u2013192. Morgan Kaufmann, San Francisco (1995)"},{"key":"9578_CR18","unstructured":"Jones, T.: Evolutionary algorithms, fitness landscapes and search. PhD thesis, University of New Mexico, Albuquerque, NM (1995)"},{"key":"9578_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(90)90156-R","volume":"34","author":"L.V. Kale","year":"1990","unstructured":"Kale, L.V.: An almost perfect heuristic for the n non-attacking queens problem. Inf. Process. Lett. 34, 173\u2013178 (1990)","journal-title":"Inf. Process. Lett."},{"key":"9578_CR20","volume-title":"IEEE 13th International Multitopic Conference","author":"S. Khan","year":"2009","unstructured":"Khan, S., Bilal, M., Sharif, M., Sajid, M., Baig, R.: Solution of n-queen problem using ACO. In: IEEE 13th International Multitopic Conference, Art. No. 5383157 (2009)."},{"key":"9578_CR21","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelet, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 621\u2013630 (1983)","journal-title":"Science"},{"key":"9578_CR22","unstructured":"Kosters, W.: n-queens bibliography. Retrieved May 4 (2012). http:\/\/www.liacs.nl\/~kosters\/nqueens\/"},{"key":"9578_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search: Methodology and Implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Marti, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic, Boston (2003)"},{"key":"9578_CR24","first-page":"560","volume":"8","author":"F.J.E. Lionnet","year":"1869","unstructured":"Lionnet, F.J.E.: Question 963. Nouv. Ann. Math., Ser. 2 8, 560 (1869)","journal-title":"Nouv. Ann. Math., Ser. 2"},{"key":"9578_CR25","volume-title":"Adaptive Memory and Evolution: Tabu Search and Scatter Search","author":"R. Mart\u00ed","year":"2004","unstructured":"Mart\u00ed, R., Laguna, M., Campos, V.: Scatter search vs. genetic algorithms: an experimental evaluation with permutation problems. In: Rego, C., Alidaee, B. (eds.) Adaptive Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic, Dordrecht (2004)"},{"key":"9578_CR26","first-page":"25","volume-title":"Proceedings of the ITI 2007 29th Int. Conf. on Information Technology Interfaces","author":"I. Martinjak","year":"2007","unstructured":"Martinjak, I., Golub, M.: Comparison of heuristic algorithms for the N-queen problem. In: Proceedings of the ITI 2007 29th Int. Conf. on Information Technology Interfaces, Cavtat, Croatia, pp. 25\u201328 (2007)"},{"key":"9578_CR27","doi-asserted-by":"crossref","first-page":"8373","DOI":"10.1088\/0305-4470\/31\/41\/011","volume":"31","author":"Y. Nouraniy","year":"1998","unstructured":"Nouraniy, Y., Andresenz, B.: A comparison of simulated annealing cooling strategies. J. Phys. A, Math. Gen. 31, 8373\u20138385 (1998)","journal-title":"J. Phys. A, Math. Gen."},{"issue":"9","key":"9578_CR28","first-page":"257","volume":"29","author":"E. Pauls","year":"1874","unstructured":"Pauls, E.: Das Maximalproblem der Damen auf dem Schachbrete, II, Deutsche Schachzeitung. Organ fur das Gesammte Schachleben 29(9), 257\u2013267 (1874)","journal-title":"Organ fur das Gesammte Schachleben"},{"key":"9578_CR29","unstructured":"Rego, C., Le\u00e3o, P.: A scatter search tutorial for graph-based permutation problems. Research Paper HCES-10-00, Hearin Center for Enterprise Science, University of Mississippi, MS 38677, USA (2009)"},{"key":"9578_CR30","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(92)90168-U","volume":"41","author":"I. Rivin","year":"1992","unstructured":"Rivin, I., Zabih, R.: A dynamic programming solution to the n-queens problem. Inf. Process. Lett. 41, 253\u2013256 (1992)","journal-title":"Inf. Process. Lett."},{"key":"9578_CR31","volume-title":"Artificial Intelligence a Modern Approach","author":"S.J. Russell","year":"1995","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence a Modern Approach Prentice-Hall, Englewood Cliffs (1995)"},{"key":"9578_CR32","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10898-011-9653-x","volume":"51","author":"P.S. Segundo","year":"2011","unstructured":"Segundo, P.S.: New decision rules for exact search in N-queens. J. Glob. Optim. 51, 497\u2013514 (2011). doi: 10.1007\/s10898-011-9653-x","journal-title":"J. Glob. Optim."},{"key":"9578_CR33","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2012). http:\/\/oeis.org\/A000170"},{"key":"9578_CR34","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/69.317698","volume":"6E","author":"R. Sosic","year":"1994","unstructured":"Sosic, R., Gu, J.: Efficient local search with conflict minimization. IEEE Trans. Knowl. Data Eng. 6E, 661\u2013668 (1994)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9578_CR35","volume-title":"Taguchi Methods: Design of Experiments","author":"G. Taguchi","year":"1993","unstructured":"Taguchi, G., Yokoyama, Y.: Taguchi Methods: Design of Experiments. Am. Supplier Inst. Press, Millersburg (1993)"},{"key":"9578_CR36","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics from Design to Implementation","author":"E.-G. Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics from Design to Implementation. Wiley, Hoboken (2009)"},{"key":"9578_CR37","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1002\/(SICI)1098-111X(199710)12:10<739::AID-INT3>3.0.CO;2-Z","volume":"12","author":"T. Tambouratzis","year":"1997","unstructured":"Tambouratzis, T.: A simulated annealing artificial neural network implementation of the n-queens problem. Int. J. Intell. Syst. 12, 739\u2013752 (1997)","journal-title":"Int. J. Intell. Syst."},{"key":"9578_CR38","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00170-004-2157-9","volume":"27","author":"L.I. Tong","year":"2005","unstructured":"Tong, L.I., Wang, Ch.H., Chen, H.C.: Optimization of multiple responses using principal component analysis and technique for order preference by similarity to ideal solution. Int. J. Adv. Manuf. Technol. 27, 407\u2013414 (2005)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"9578_CR39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.W. Wolpert","year":"1997","unstructured":"Wolpert, D.W., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9578_CR40","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/j.asoc.2010.05.029","volume":"11","author":"Z. Xinchao","year":"2011","unstructured":"Xinchao, Z.: Simulated annealing algorithm with adaptive neighborhood. Appl. Soft Comput. 11, 1827\u20131836 (2011)","journal-title":"Appl. Soft Comput."},{"key":"9578_CR41","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"X.-S. Yang","year":"2010","unstructured":"Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2010)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9578-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9578-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9578-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T17:12:25Z","timestamp":1715620345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9578-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,3]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9578"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9578-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,3]]}}}