{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:39:17Z","timestamp":1760783957097,"version":"3.41.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,22]],"date-time":"2015-05-22T00:00:00Z","timestamp":1432252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s12065-015-0132-z","type":"journal-article","created":{"date-parts":[[2015,5,21]],"date-time":"2015-05-21T06:23:32Z","timestamp":1432189412000},"page":"165-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Quadratic assignment problem: a landscape analysis"],"prefix":"10.1007","volume":"8","author":[{"given":"Mohammad-H.","family":"Tayarani-N.","sequence":"first","affiliation":[]},{"given":"Adam","family":"Pr\u00fcgel-Bennett","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,22]]},"reference":[{"key":"132_CR1","unstructured":"Wright S (1932) The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In: Proceedings of 6th congress of genetics, vol 1. ACM Press, p 365"},{"issue":"2","key":"132_CR2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1108\/01443570410514858","volume":"24","author":"IP McCarthy","year":"2008","unstructured":"McCarthy IP (2008) Manufacturing strategy: understanding the fitness landscape. Int J Oper Prod Manag 24(2):124\u2013150","journal-title":"Int J Oper Prod Manag"},{"key":"132_CR3","doi-asserted-by":"crossref","unstructured":"Tavares J, Pereira F, Costa E (2006) The role of representation on the multidimensional knapsack problem by means of fitness landscape analysis. In: IEEE congress on evolutionary computation, 2006. CEC 2006, pp 2307\u20132314","DOI":"10.1109\/CEC.2006.1688593"},{"issue":"3","key":"132_CR4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TSMCB.2008.915539","volume":"38","author":"J Tavares","year":"2008","unstructured":"Tavares J, Pereira FB, Costa E (2008) Multidimensional knapsack problem: a fitness landscape analysis. IEEE Trans Syst Man Cybern B 38(3):604\u2013616","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"132_CR5","doi-asserted-by":"crossref","unstructured":"Riley J, Ciesielski V (2010) Fitness landscape analysis for evolutionary non-photorealistic rendering. In: Proceedings of IEEE world congress on computational intelligence, Barcelona","DOI":"10.1109\/CEC.2010.5586013"},{"key":"132_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.25088\/ComplexSystems.16.4.317","volume":"16","author":"D Newth","year":"2006","unstructured":"Newth D, Brede M (2006) Fitness landscape analysis and optimisation of coupled oscillators. J Complex Syst 16:317\u2013331","journal-title":"J Complex Syst"},{"key":"132_CR7","doi-asserted-by":"crossref","unstructured":"Slany K, Sekanina L (2007) Fitness landscape analysis and image filter evolution using functional-level cgp. In: Proceedings of the 10th European conference on genetic programming, pp 311\u2013320","DOI":"10.1007\/978-3-540-71605-1_29"},{"key":"132_CR8","doi-asserted-by":"crossref","unstructured":"Merz P, Freisleben B (1998) Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, ser. Lecture notes in computer science, vol 1498. Springer, Berlin","DOI":"10.1007\/BFb0056918"},{"key":"132_CR9","doi-asserted-by":"crossref","unstructured":"Czogalla J, Fink A (2009) Fitness landscape analysis for the resource constrained project scheduling problem, ser. Lecture notes in computer science, vol 5851. Springer, Berlin","DOI":"10.1007\/978-3-642-11169-3_8"},{"key":"132_CR10","unstructured":"Moscato P (1989) On evolution, search, optimisation, genetic algorithms and martial arts: toward memetic algorithms. California Institute of Technology, Pasadena. Technical report"},{"key":"132_CR11","unstructured":"Moscato P, Norman MG (1992) A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimisation on message-passing systems. In Proceedings of the international conference on parallel computing and transputer applications, pp 177\u2013186"},{"key":"132_CR12","doi-asserted-by":"crossref","unstructured":"Qasem M, Pr\u00fcgel-Bennett A (2008) Complexity of max-sat using stochastic algorithms. In: Genetic and evolutionary computation conference, GECCO 2008, proceedings, Atlanta, GA, USA, July 12\u201316, 2008. ACM, pp 615\u2013616","DOI":"10.1145\/1389095.1389219"},{"issue":"6","key":"132_CR13","first-page":"1073","volume":"12","author":"W Shaowei","year":"2007","unstructured":"Shaowei W, Qiuping Z (2007) Fitness landscape analysis for optimum multiuser detection problem. J Nat Sci 12(6):1073\u20131076","journal-title":"J Nat Sci"},{"issue":"2","key":"132_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/1621076.1621080","volume":"13","author":"D Huanga","year":"2009","unstructured":"Huanga D, Shenb Z, Miaoa C, Leungc C (2009) Fitness landscape analysis for resource allocation in multiuser OFDM based cognitive radio systems. Mob Comput Commun Rev 13(2):26\u201336","journal-title":"Mob Comput Commun Rev"},{"key":"132_CR15","unstructured":"Mathias K, Whitley D (1992) Genetic operators, the fitness landscape and the traveling salesman problem. In: Parallel problem solving from nature. Elsevier, pp 219\u2013228"},{"key":"132_CR16","doi-asserted-by":"crossref","unstructured":"Stadler PF, Schnabl W, (1992) The landscape of the traveling salesman problem. Phys Lett A 161(4):337\u2013344. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0375960192905573","DOI":"10.1016\/0375-9601(92)90557-3"},{"key":"132_CR17","unstructured":"Boese KD (1995) Cost versus distance in the travelling salesman problem. UCLA computer science department, Los Angeles. Technical report"},{"key":"132_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)90212-7","volume":"49","author":"A Hertz","year":"1994","unstructured":"Hertz A, Jaumard B, de Arag\u00e3o MP (1994) Local optima topology for the k-coloring problem. Discrete Appl Math 49:257\u2013280","journal-title":"Discrete Appl Math"},{"key":"132_CR19","unstructured":"Hamiez JP, Hao JK (2001) An analysis of solution properties of the graph coloring problem. In 4th Metaheuristics international conference, Porto, Portugal"},{"key":"132_CR20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0304-3975(01)00164-5","volume":"265","author":"J Culberson","year":"2001","unstructured":"Culberson J, Gent I (2001) Frozen development in graph coloring. Theor Comput Sci 265:227\u2013264","journal-title":"Theor Comput Sci"},{"issue":"3","key":"132_CR21","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/s10878-009-9249-2","volume":"21","author":"H Bouziri","year":"2009","unstructured":"Bouziri H, Mellouli K, Talbi EG (2009) Fitness landscape analysis for optimum multiuser detection problem. J Comb Optim 21(3):306\u2013329","journal-title":"J Comb Optim"},{"key":"132_CR22","doi-asserted-by":"crossref","unstructured":"Yoshizawa H, Hashimoto S (2000) Landscape analyses and global search of knapsack problems. In: 2000 IEEE international conference on systems, man, and cybernetics, vol 3, pp 2311\u20132315","DOI":"10.1109\/ICSMC.2000.886461"},{"key":"132_CR23","doi-asserted-by":"crossref","unstructured":"Weixiong, Zhang (2004) Configuration landscape analysis and backbone guided local search. Part I: satisfiability and maximum satisfiability. Artif Intell 158(1):1\u201326. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370204000542","DOI":"10.1016\/j.artint.2004.04.001"},{"issue":"4","key":"132_CR24","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TEVC.2009.2033579","volume":"14","author":"M Qasem","year":"2010","unstructured":"Qasem M, Pr\u00fcgel-Bennett A (2010) Learning the large-scale structure of the MAX-SAT landscape using populations. IEEE Trans Evolut Comput 14(4):518\u2013529","journal-title":"IEEE Trans Evolut Comput"},{"key":"132_CR25","unstructured":"Czogalla J (2008) Fitness landscape analysis for the continuous flow-shop scheduling problem. In: Proceedings of 3rd European workshop, Evo, Naples"},{"key":"132_CR26","doi-asserted-by":"crossref","unstructured":"Lefticaru R, Ipate F (2008) A comparative landscape analysis of fitness functions for search-based testing. In IEEE 10th international symposium on symbolic and numeric algorithms for scientific computing, USA","DOI":"10.1109\/SYNASC.2008.69"},{"issue":"4","key":"132_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evolut Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evolut Comput"},{"key":"132_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","volume":"63","author":"ED Weinberger","year":"1990","unstructured":"Weinberger ED (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 63:325\u2013336","journal-title":"Biol Cybern"},{"key":"132_CR29","unstructured":"Jones T (1995) Evolutionary algorithms, fitness landscapes and search. Ph.D. dissertation, University of New Mexico, Albuquerque"},{"key":"132_CR30","unstructured":"Manderick B, de Weger M, Spiessens P (1991) The genetic algorithm and the structure of the fitness landscape. In Proceedings of 4th international conference on genetic algorithms, pp 143\u2013150"},{"key":"132_CR31","unstructured":"Altenberg L (1997) Fitness distance correlation analysis: an instructive counterexample. In: B\u00e4ck T (ed) Proceedings of the seventh international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 57\u201364"},{"key":"132_CR32","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","volume":"12","author":"LK Grover","year":"1992","unstructured":"Grover LK (1992) Local search and the local structure of NP-complete problems. Oper Res Lett 12:235\u2013243","journal-title":"Oper Res Lett"},{"key":"132_CR33","doi-asserted-by":"crossref","unstructured":"Stadler P (1995) Towards a theory of landscapes. In: Complex systems and binary networks, pp 78\u2013163","DOI":"10.1007\/BFb0103571"},{"key":"132_CR34","doi-asserted-by":"crossref","unstructured":"Angel E, Zissimopoulos V (2001) On the landscape ruggedness of the quadratic assignment problem. Theor Comput Sci 263(12):159\u2013172 (combinatorics and computer science). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397500002395","DOI":"10.1016\/S0304-3975(00)00239-5"},{"key":"132_CR35","first-page":"271","volume-title":"Soft computing systems: design, management and applications","author":"J Knowles","year":"2002","unstructured":"Knowles J, Corne D (2002) Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. In: Abraham MKA, Ruiz-del-Solar J (eds) Soft computing systems: design, management and applications. IOS Press, Amsterdam, pp 271\u2013279"},{"key":"132_CR36","doi-asserted-by":"crossref","unstructured":"Chicano F, Luque G, Alba E (2010) Elementary landscape decomposition of the quadratic assignment problem. In: Proceedings of the 12th annual conference on genetic and evolutionary computation, ser. GECCO \u201910. ACM, New York, NY, USA, pp 1425\u20131432. doi: 10.1145\/1830483.1830745","DOI":"10.1145\/1830483.1830745"},{"key":"132_CR37","doi-asserted-by":"crossref","unstructured":"Chicano F, Alba E (2011) Elementary landscape decomposition of the 0\u20131 unconstrained quadratic optimization. J Heuristics 1\u201318. doi: 10.1007\/s10732-011-9170-6","DOI":"10.1007\/s10732-011-9170-6"},{"issue":"4","key":"132_CR38","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TEVC.2005.846818","volume":"9","author":"J Hallam","year":"2005","unstructured":"Hallam J, Pr\u00fcgel-Bennett A (2005) Large barrier trees for studying search. IEEE Trans Evolut Comput 9(4):385\u2013397","journal-title":"IEEE Trans Evolut Comput"},{"key":"132_CR39","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.tcs.2007.06.005","volume":"386","author":"W Benfold","year":"2007","unstructured":"Benfold W, Hallam J, Pr\u00fcgel-Bennett A (2007) Optimal parameters for search using a barrier tree Markov model. Theor Comput Sci 386:94\u2013113","journal-title":"Theor Comput Sci"},{"issue":"1","key":"132_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01165154","volume":"20","author":"P Stadler","year":"1996","unstructured":"Stadler P (1996) Landscapes and their correlation functions. J Math Chem 20(1):1\u201345","journal-title":"J Math Chem"},{"key":"132_CR41","first-page":"319","volume":"15","author":"A Pr\u00fcgel-Bennett","year":"2011","unstructured":"Pr\u00fcgel-Bennett A, Tayarani-N. M-H (2011) Maximum satisfiability: anatomy of the fitness landscape for a hard combinatorial optimisation problem. IEEE Trans Evolut Comput 15:319\u2013338","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"132_CR42","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TEVC.2013.2281502","volume":"18","author":"M-H Tayarani-N.","year":"2014","unstructured":"Tayarani-N. M-H, Prugel-Bennett A (2014) On the landscape of combinatorial optimization problems. IEEE Trans Evolut Comput 18(3):420\u2013434","journal-title":"IEEE Trans Evolut Comput"},{"key":"132_CR43","first-page":"1","volume":"10","author":"MH Tayarani-N.","year":"2011","unstructured":"Tayarani-N. MH, Pr\u00fcgel Bennett A (2011) Anatomy of the fitness landscape for graph-colouring problem. J Swarm Evolut Comput 10:1","journal-title":"J Swarm Evolut Comput"},{"key":"132_CR44","first-page":"1","volume":"10","author":"MH Tayarani-N.","year":"2012","unstructured":"Tayarani-N. MH, Pr\u00fcgel Bennett A (2012) Travelling salesman problem: a landscape analysis. IEEE Trans Evolut Comput 10:1","journal-title":"IEEE Trans Evolut Comput"},{"key":"132_CR45","doi-asserted-by":"crossref","unstructured":"Boese K, Kahng A, Muddu S (1994) On the big valley and adaptive multi-start for discrete global optimizations. Oper Res Lett 16(2)","DOI":"10.1016\/0167-6377(94)90065-5"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-015-0132-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-015-0132-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-015-0132-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T01:50:10Z","timestamp":1748397010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-015-0132-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,22]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["132"],"URL":"https:\/\/doi.org\/10.1007\/s12065-015-0132-z","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2015,5,22]]}}}