{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:31:28Z","timestamp":1763105488062},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00500-016-2397-2","type":"journal-article","created":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T01:03:46Z","timestamp":1476234226000},"page":"921-948","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Continuous fitness landscape analysis using a chaos-based random walk algorithm"],"prefix":"10.1007","volume":"22","author":[{"given":"Nanda Dulal","family":"Jana","sequence":"first","affiliation":[]},{"given":"Jaya","family":"Sil","sequence":"additional","affiliation":[]},{"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,12]]},"reference":[{"key":"2397_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-74089-6_2","volume-title":"Swarm intelligence. Natural computing series","author":"C Blum","year":"2008","unstructured":"Blum C, Li X (2008) Swarm intelligence in optimization. In: Blum C, Merkle D (eds) Swarm intelligence. Natural computing series. Springer, Berlin, pp 43\u201385"},{"key":"2397_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2013.12.044","volume":"265","author":"F Caraffini","year":"2014","unstructured":"Caraffini F, Neri F, Picinali L (2014) An analysis on separability for memetic computing automatic design. Inf Sci 265:1\u201322","journal-title":"Inf Sci"},{"key":"2397_CR3","doi-asserted-by":"publisher","first-page":"052105","DOI":"10.1103\/PhysRevE.65.052105","volume":"65","author":"SY Huang","year":"2002","unstructured":"Huang SY, Zou XW, Jin ZZ (2002) Directed random walks in continuous space. Phys Rev E 65:052105. doi: 10.1103\/PhysRevE.65.052105","journal-title":"Phys Rev E"},{"key":"2397_CR4","unstructured":"Iba T, Shimonishi K (2011) The origin of diversity: thinking with chaotic walk. In: Proceedings of the eighth international conference on complex systems, pp 447\u2013461"},{"key":"2397_CR5","unstructured":"Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Sixth international conference on genetic algorithms, pp 184\u2013192"},{"key":"2397_CR6","first-page":"1","volume-title":"Parameter setting in evolutionary algorithms. Studies in Computational Intelligence","author":"KD Jong","year":"2005","unstructured":"Jong KD (2005) Parameter setting in eas: a 30 year perspective. In: Lobo FG, Lima CF, Michalewicz Z (eds) Parameter setting in evolutionary algorithms. Studies in Computational Intelligence, vol 54. Springer, Berlin, pp 1\u201318"},{"key":"2397_CR7","unstructured":"Liang JJ, Qu BY, Suganthan PN, Hernandez-Diaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical Report DAMTP 2000\/NA10. Nanyang Technological University. Singapore"},{"key":"2397_CR8","doi-asserted-by":"crossref","unstructured":"Lu G, Li J, Yao X (2011) Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms. In: 11th European conference on evolutionary computation in combinatorial optimization (EvoCOP\u201911), pp 108\u2013117","DOI":"10.1007\/978-3-642-20364-0_10"},{"key":"2397_CR9","doi-asserted-by":"crossref","unstructured":"Lunacek M, Whitley D (2006) The dispersion metric and the cma evolution strategy. In: 8th Annual conference on genetic and evolutionary computation, pp 477\u2013484","DOI":"10.1145\/1143997.1144085"},{"key":"2397_CR10","doi-asserted-by":"crossref","unstructured":"Malan KM, Engelbrecht AP (2009) Quantifying ruggedness of continuous landscapes using entropy. In: IEEE Congress on evolutionary computation (CEC\u201909), pp 1440\u20131447","DOI":"10.1109\/CEC.2009.4983112"},{"key":"2397_CR11","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan KM, Engelbrecht AP (2013) A survey of techniques for characterising fitness landscapes and some possible ways forward. Inf Sci 241:148\u2013163","journal-title":"Inf Sci"},{"key":"2397_CR12","doi-asserted-by":"crossref","unstructured":"Malan KM, Engelbrecht AP (2014a) Fitness landscape analysis for metaheuristic performance prediction. In: Richter H, Engelbrecht AP (eds) Recent advances in the theory and application of fitness landscapes. Emergence, Complexity and Computation, vol\u00a06. Springer, Berlin, pp 103\u2013132","DOI":"10.1007\/978-3-642-41888-4_4"},{"key":"2397_CR13","doi-asserted-by":"crossref","unstructured":"Malan KM, Engelbrecht AP (2014b) A progressive random walk algorithm for sampling continuous fitness landscapes. In: IEEE congress on evolutionary computation (CEC\u201914), pp 2507\u20132514","DOI":"10.1109\/CEC.2014.6900576"},{"key":"2397_CR14","doi-asserted-by":"crossref","unstructured":"May RM (1976) Simple mathematical models with very complicated dynamics. Nature 261:459\u2013467","DOI":"10.1038\/261459a0"},{"key":"2397_CR15","doi-asserted-by":"crossref","unstructured":"Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G (2011) Exploratory landscape analysis. In: 13th Annual conference on genetic and evolutionary computation (GECCO\u201911), pp 829\u2013836","DOI":"10.1145\/2001576.2001690"},{"key":"2397_CR16","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 Evol Comput 4:337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"key":"2397_CR17","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TEVC.2013.2281502","volume":"18","author":"HTN Mohammad","year":"2014","unstructured":"Mohammad HTN, Bennett AP (2014) On the landscape of combinatorial optimization problems. IEEE Trans Evol Comput 18:420\u2013434","journal-title":"IEEE Trans Evol Comput"},{"key":"2397_CR18","doi-asserted-by":"crossref","unstructured":"Morgan R, Gallagher M (2012) Length scale for characterising continuous optimization problems. In: 12th International conference on parallel problem solving from nature\u2014part I, pp 407\u2013416","DOI":"10.1007\/978-3-642-32937-1_41"},{"key":"2397_CR19","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TEVC.2013.2281521","volume":"18","author":"R Morgan","year":"2014","unstructured":"Morgan R, Gallagher M (2014) Sampling techniques and distance metrics in high dimensional continuous landscape analysis: Limitations and improvements. IEEE Trans Evol Comput 18:456\u2013461","journal-title":"IEEE Trans Evol Comput"},{"key":"2397_CR20","doi-asserted-by":"publisher","unstructured":"Munoz M, Kirley M, Halgamuge S (2014) Exploratory landscape analysis of continuous space optimization problems using information content. IEEE Trans Evol Comput. doi: 10.1109\/TEVC.2014.2302006","DOI":"10.1109\/TEVC.2014.2302006"},{"key":"2397_CR21","doi-asserted-by":"crossref","unstructured":"Munoz MA, Kirley M, Halgamuge S (2012) Landscape characterization of numerical optimization problems using biased scattered data. In: IEEE congress on evolutionary computation (CEC\u201912), pp 1\u20138","DOI":"10.1109\/CEC.2012.6256490"},{"key":"2397_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/4235.843491","volume":"4","author":"B Naudts","year":"2000","unstructured":"Naudts B, Kallel L (2000) A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Trans Evol Comput 4:1\u201315","journal-title":"IEEE Trans Evol Comput"},{"key":"2397_CR23","doi-asserted-by":"crossref","first-page":"294, 318, 342","DOI":"10.1038\/072294b0","volume":"72","author":"K Pearson","year":"1905","unstructured":"Pearson K (1905) The problem of the random walk. Nature 72:294, 318, 342","journal-title":"Nature"},{"key":"2397_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4740-9","volume-title":"Chaos and fractals","author":"H Peitgen","year":"1992","unstructured":"Peitgen H, Jurgens H, Saupe D (1992) Chaos and fractals. Springer, Berlin"},{"key":"2397_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/b101880","volume-title":"Genetic algorithms\u2014principles and perspectives: a guide to GA theory","author":"CR Reeves","year":"2002","unstructured":"Reeves CR, Rowe JE (2002) Genetic algorithms\u2014principles and perspectives: a guide to GA theory. Kluwer Academic Publishers, Norwell"},{"key":"2397_CR26","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0096-3003(99)00166-6","volume":"117","author":"CM Reidys","year":"2001","unstructured":"Reidys CM, Stadler PF (2001) Neutrality in fitness landscapes. Appl Math Comput 117:321\u2013350","journal-title":"Appl Math Comput"},{"key":"2397_CR27","doi-asserted-by":"crossref","unstructured":"Rose H, Ebeling W, Asselmeyer T (1996) The density of states\u2014a measure of the difficulty of optimisation problems. In: 4th International conference on parallel problem solving from nature, pp 208\u2013217","DOI":"10.1007\/3-540-61723-X_985"},{"key":"2397_CR28","doi-asserted-by":"crossref","unstructured":"Steer K, Wirth A, Halgamuge S (2008) Information theoretic classification of problems for metaheuristics. In: Simulated evolution and learning, pp 319\u2013328","DOI":"10.1007\/978-3-540-89694-4_33"},{"key":"2397_CR29","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 Part B Cybern 38:604\u2013616","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"2397_CR30","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1016\/j.amc.2006.09.087","volume":"187","author":"MS Tavazoei","year":"2007","unstructured":"Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187:1076\u20131085","journal-title":"Appl Math Comput"},{"key":"2397_CR31","doi-asserted-by":"crossref","unstructured":"Vanneschi L, Clergue M, Collard P, Tomassini M, Verel S (2004) Fitness clouds and problem hardness in genetic programming. In: Genetic and evolutionary computation (GECCO\u201904), pp 690\u2013701","DOI":"10.1007\/978-3-540-24855-2_76"},{"key":"2397_CR32","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1162\/106365600568095","volume":"8","author":"VK Vassilev","year":"2000","unstructured":"Vassilev VK, Fogarty TC, Miller JF (2000) Information characteristics and the structure of landscapes. Evol Comput 8:31\u201360","journal-title":"Evol Comput"},{"key":"2397_CR33","doi-asserted-by":"crossref","unstructured":"Vassilev VK, Fogarty TC, Miller JF (2003) Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In: Advances in evolutionary computing. Natural Computing series. Springer, Berlin, pp 3\u201344","DOI":"10.1007\/978-3-642-18965-4_1"},{"key":"2397_CR34","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4258\/hir.2013.19.2.137","volume":"19","author":"A Venkatesan","year":"2013","unstructured":"Venkatesan A et al (2013) Computational approach for protein structure prediction. Healthc Inf Res 19:137\u2013147","journal-title":"Healthc Inf Res"},{"key":"2397_CR35","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"2397_CR36","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1007\/s00500-014-1336-3","volume":"19","author":"X Yuan","year":"2015","unstructured":"Yuan X, Dai X, Wu L (2015) A mutative-scale pseudo-parallel chaos optimization algorithm. Soft Comput 19:1215\u20131227","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2397-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2397-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2397-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T15:28:45Z","timestamp":1601134125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2397-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,12]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["2397"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2397-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,12]]}}}