{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T00:12:34Z","timestamp":1773360754386,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2019R1A2B5B03069810"],"award-info":[{"award-number":["2019R1A2B5B03069810"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002642","name":"Korea University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002642","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00500-019-04363-y","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T15:18:41Z","timestamp":1568992721000},"page":"7383-7393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Performance comparison of metaheuristic algorithms using a modified Gaussian fitness landscape generator"],"prefix":"10.1007","volume":"24","author":[{"given":"Ho Min","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghwi","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Sadollah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3729-7560","authenticated-orcid":false,"given":"Joong Hoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"4363_CR1","first-page":"37","volume-title":"Optimization","author":"J Abadie","year":"1969","unstructured":"Abadie J, Carpentier J (1969) Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints. In: Fletcher R (ed) Optimization. Academic Press, New York, pp 37\u201347"},{"key":"4363_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T Back","year":"1996","unstructured":"Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"4363_CR3","doi-asserted-by":"crossref","unstructured":"Back T, Schutz M (1996) Intelligent mutation rate control in canonical genetic algorithms. In: International symposium on methodologies for intelligent systems. Springer, Berlin, pp 158\u2013167","DOI":"10.1007\/3-540-61286-6_141"},{"issue":"3","key":"4363_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden CG (1970) The convergence of a class of double-rank minimization algorithms: 2. The new algorithm. IMA J Appl Math 6(3):222\u2013231","journal-title":"IMA J Appl Math"},{"key":"4363_CR5","unstructured":"Colorni A, Dorigo M, Maniezzo V (1992) Distributed optimization by ant colonies. In: Toward a practice of autonomous systems: proceedings of the first European conference on artificial life. MIT Press, p 134"},{"key":"4363_CR6","doi-asserted-by":"crossref","unstructured":"Crossley M, Nisbet A, Amos M (2013) Fitness landscape-based characterisation of nature-inspired algorithms. In: International conference on adaptive and natural computing algorithms. Springer, Berlin, pp 110\u2013119","DOI":"10.1007\/978-3-642-37213-1_12"},{"issue":"2","key":"4363_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"GB Dantzig","year":"1957","unstructured":"Dantzig GB (1957) Discrete-variable extremum problems. Oper Res 5(2):266\u2013288","journal-title":"Oper Res"},{"issue":"4","key":"4363_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/00207160210939","volume":"79","author":"JG Digalakis","year":"2002","unstructured":"Digalakis JG, Margaritis KG (2002) An experimental study of benchmarking functions for genetic algorithms. Int J Comput Math 79(4):403\u2013416","journal-title":"Int J Comput Math"},{"issue":"15","key":"4363_CR9","doi-asserted-by":"publisher","first-page":"3096","DOI":"10.1016\/j.ins.2008.01.020","volume":"178","author":"W Du","year":"2008","unstructured":"Du W, Li B (2008) Multi-strategy ensemble particle swarm optimization for dynamic optimization. Inf Sci 178(15):3096\u20133109","journal-title":"Inf Sci"},{"key":"4363_CR10","doi-asserted-by":"crossref","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS\u201995. IEEE, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"key":"4363_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.compstruc.2012.07.010","volume":"110","author":"H Eskandar","year":"2012","unstructured":"Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm\u2014a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110:151\u2013166","journal-title":"Comput Struct"},{"issue":"3","key":"4363_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher R (1970) A new approach to variable metric algorithms. Comput J 13(3):317\u2013322","journal-title":"Comput J"},{"issue":"5","key":"4363_CR13","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/TEVC.2005.863628","volume":"10","author":"M Gallagher","year":"2006","unstructured":"Gallagher M, Yuan B (2006) A general-purpose tunable landscape generator. IEEE Trans Evol Comput 10(5):590\u2013603","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"4363_CR14","first-page":"3881","volume":"217","author":"ZW Geem","year":"2010","unstructured":"Geem ZW, Sim KB (2010) Parameter-setting-free harmony search algorithm. Appl Math Comput 217(8):3881\u20133889","journal-title":"Appl Math Comput"},{"issue":"2","key":"4363_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"5","key":"4363_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"2","key":"4363_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95\u201399","journal-title":"Mach Learn"},{"issue":"109","key":"4363_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb D (1970) A family of variable-metric methods derived by variational means. Math Comput 24(109):23\u201326","journal-title":"Math Comput"},{"issue":"5","key":"4363_CR19","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1080\/1055678021000030084","volume":"17","author":"AR Hedar","year":"2002","unstructured":"Hedar AR, Fukushima M (2002) Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. Optim Methods Softw 17(5):891\u2013912","journal-title":"Optim Methods Softw"},{"key":"4363_CR20","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/635608","author":"SS Im","year":"2013","unstructured":"Im SS, Yoo DG, Kim JH (2013) Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems. J Appl Math. https:\/\/doi.org\/10.1155\/2013\/635608","journal-title":"J Appl Math"},{"key":"4363_CR21","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization, vol 200. Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"4363_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-662-47926-1_2","volume-title":"Harmony search algorithm","author":"JH Kim","year":"2016","unstructured":"Kim JH, Lee HM, Jung D, Sadollah A (2016) Performance measures of metaheuristic algorithms. In: Kim J, Geem Z (eds) Harmony search algorithm. Springer, Berlin, pp 11\u201317"},{"issue":"4598","key":"4363_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"4363_CR24","unstructured":"Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of the second Berkeley symposium on mathematical statistics nd Probability, pp 481\u2013492"},{"key":"4363_CR25","unstructured":"Lagrange JL (1811) Mechanique analytique, vol 2, 2nd edn. Courcier, Paris, p 1815"},{"key":"4363_CR26","first-page":"497","volume-title":"An automatic method of solving discrete programming problems","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. J Econ Soc, Econ., pp 497\u2013520"},{"key":"4363_CR27","unstructured":"Lee HM, Jung D, Sadollah A, Kim JH (2016) Test problem generation using a modified Gaussian fitness landscape generator. In: The 12th international conference on hydroinformatics (HIC 2016)"},{"issue":"4","key":"4363_CR28","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.asoc.2010.05.007","volume":"10","author":"TW Liao","year":"2010","unstructured":"Liao TW (2010) Two hybrid differential evolution algorithms for engineering design optimization. Appl Soft Comput 10(4):1188\u20131199","journal-title":"Appl Soft Comput"},{"issue":"4","key":"4363_CR29","doi-asserted-by":"publisher","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(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4363_CR30","first-page":"1","volume":"2","author":"A Milad","year":"2013","unstructured":"Milad A (2013) Harmony search algorithm: strengths and weaknesses. J Comput Eng Inf Technol 2(1):1\u20137","journal-title":"J Comput Eng Inf Technol"},{"key":"4363_CR31","doi-asserted-by":"crossref","unstructured":"R\u00f6nkk\u00f6nen J, Li X, Kyrki V, Lampinen J (2008) A generator for multimodal test functions with multiple global optima. In: Asia-Pacific conference on simulated evolution and learning. Springer, Berlin, pp 239\u2013248","DOI":"10.1007\/978-3-540-89694-4_25"},{"issue":"5","key":"4363_CR32","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1016\/j.asoc.2012.11.026","volume":"13","author":"A Sadollah","year":"2013","unstructured":"Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592\u20132612","journal-title":"Appl Soft Comput"},{"key":"4363_CR33","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.asoc.2015.01.050","volume":"30","author":"A Sadollah","year":"2015","unstructured":"Sadollah A, Eskandar H, Bahreininejad A, Kim JH (2015) Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems. Appl Soft Comput 30:58\u201371","journal-title":"Appl Soft Comput"},{"issue":"111","key":"4363_CR34","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno DF (1970) Conditioning of quasi-Newton methods for function minimization. Math Comput 24(111):647\u2013656","journal-title":"Math Comput"},{"issue":"4","key":"4363_CR35","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359","journal-title":"J Glob Optim"},{"issue":"4","key":"4363_CR36","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","volume":"37","author":"CM Wang","year":"2010","unstructured":"Wang CM, Huang YF (2010) Self-adaptive harmony search algorithm for optimization. Expert Syst Appl 37(4):2826\u20132837","journal-title":"Expert Syst Appl"},{"key":"4363_CR37","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, Bristol"},{"key":"4363_CR38","unstructured":"Yang XS, Deb S (2009) Cuckoo search via Levy flights. In: World congress on nature & biologically inspired computing, 2009. NaBIC 2009. IEEE, pp 210\u2013214"},{"key":"4363_CR39","doi-asserted-by":"crossref","unstructured":"Yuan B, Gallagher M (2003) On building a principled framework for evaluating and testing evolutionary algorithms: a continuous landscape generator. In: The 2003 congress on evolutionary computation, 2003. CEC\u201903, vol 1. IEEE, pp 451\u2013458","DOI":"10.1109\/CEC.2003.1299610"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04363-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T18:58:00Z","timestamp":1611255480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04363-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":39,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["4363"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04363-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,20]]},"assertion":[{"value":"20 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}