{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:41:43Z","timestamp":1762623703996},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,9,21]],"date-time":"2015-09-21T00:00:00Z","timestamp":1442793600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00500-015-1868-1","type":"journal-article","created":{"date-parts":[[2015,10,8]],"date-time":"2015-10-08T00:41:46Z","timestamp":1444264906000},"page":"1549-1567","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A novel harmony search algorithm with gaussian mutation for multi-objective optimization"],"prefix":"10.1007","volume":"21","author":[{"given":"Xiangshan","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianghong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,21]]},"reference":[{"issue":"2","key":"1868_CR1","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.amc.2012.06.048","volume":"219","author":"J Chen","year":"2012","unstructured":"Chen J, Pan QK, Li JQ (2012) Harmony search algorithm with dynamic control parameters. Appl Math Comput 219(2):592\u2013604","journal-title":"Appl Math Comput"},{"issue":"3","key":"1868_CR2","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CA Coello","year":"2004","unstructured":"Coello CA, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279","journal-title":"IEEE Trans Evol Comput"},{"key":"1868_CR3","unstructured":"Corne DW, Jerram NR, Knowles JD et al. (2001) PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference, pp 283\u2013290"},{"issue":"2","key":"1868_CR4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1868_CR5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"key":"1868_CR6","unstructured":"Deb K, Thiele L, Laumanns M et al. (2001) Scalable test problems for evolutionary multi-objective optimization. In: Technical report, Comput Eng and Networks Lab (TIK), ETH Zurich, Switzerland"},{"issue":"6","key":"1868_CR7","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1109\/TSMCB.2012.2193613","volume":"42","author":"R Diao","year":"2012","unstructured":"Diao R, Shen Q (2012) Feature selection with harmony search. IEEE Trans Syst Man Cybern Part B Cybern 42(6):1509\u20131523","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"6","key":"1868_CR8","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garca","year":"2009","unstructured":"Garca S, Molina D, Lozano M et al (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithm behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"issue":"2","key":"1868_CR9","doi-asserted-by":"crossref","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":"6","key":"1868_CR10","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1061\/(ASCE)CO.1943-7862.0000167","volume":"136","author":"ZW Geem","year":"2010","unstructured":"Geem ZW (2010) Multiobjective optimization of time-cost trade-off using harmony search. Constr Eng Manage 136(6):711\u2013716","journal-title":"Constr Eng Manage"},{"issue":"7","key":"1868_CR11","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1109\/81.933333","volume":"48","author":"D He","year":"2001","unstructured":"He D, He C, Jiang LG et al (2001) Chaotic characteristics of a one-dimensional iterative map with infinite collapses. IEEE Trans Circuits Syst I Fundam Theor Appl 48(7):900\u2013906","journal-title":"IEEE Trans Circuits Syst I Fundam Theor Appl"},{"key":"1868_CR12","first-page":"325","volume":"1","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) M-PAES: A memetic algorithm for multiobjective optimization. Proc IEEE Conf Evolut Comput 1:325\u2013332","journal-title":"Proc IEEE Conf Evolut Comput"},{"key":"1868_CR13","unstructured":"Koenig AC (2002) A study of mutation methods for evolutionary algorithms. Adv Top Artif Intell 1\u20138"},{"issue":"1","key":"1868_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.engappai.2011.07.006","volume":"25","author":"S Kulluk","year":"2012","unstructured":"Kulluk S, Ozbakir L, Baykasoglu A (2012) Training neural networks with harmony search algorithms for classification problems. Eng Appl Artif Intell 25(1):11\u201319","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"1868_CR15","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/JSTSP.2012.2199463","volume":"6","author":"I Landa","year":"2012","unstructured":"Landa I, Ortiz E, Salcedo S et al (2012) Evaluating the internationalization success of companies through a hybrid grouping harmony search-extreme learning machine approach. IEEE J Sel Top Signal Process 6(4):388\u2013398","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"36\u201338","key":"1868_CR16","first-page":"3902","volume":"194","author":"KS Lee","year":"2005","unstructured":"Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continues engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36\u201338):3902\u20133933","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"2","key":"1868_CR17","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188(2):1567\u20131579","journal-title":"Appl Math Comput"},{"key":"1868_CR18","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BFb0056869","volume":"1498","author":"S Obayashi","year":"1998","unstructured":"Obayashi S, Takahashi S, Takeguchi Y (1998) Niching and elitist models for mogas. Lect Notes Comput Sci 1498:260\u2013269","journal-title":"Lect Notes Comput Sci"},{"key":"1868_CR19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BFb0056868","volume":"1498","author":"GT Parks","year":"1998","unstructured":"Parks GT, Miller I (1998) Selective breeding in a multiobjective genetic algorithm. Lect Notes Comput Sci 1498:250\u2013259","journal-title":"Lect Notes Comput Sci"},{"key":"1868_CR20","doi-asserted-by":"crossref","unstructured":"Pavelski LM, Almeida CP, Gon\u00e7alves RA (2012) Harmony search for multi-objective optimization. In: Proceedings 2012 Brazilian conference on neural networks, pp 220\u2013225","DOI":"10.1109\/SBRN.2012.19"},{"key":"1868_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.entcs.2011.11.025","volume":"281","author":"J Ricart","year":"2011","unstructured":"Ricart J, H\u00fcttermann G, Lima J et al (2011) Multiobjective harmony search algorithm proposals. Electron Notes Theor Comput Sci 281:51\u201367","journal-title":"Electron Notes Theor Comput Sci"},{"key":"1868_CR22","unstructured":"Shang RH, Zhou YJ, Hu CX et al. (2014) Distance computation based NSGA-II for multiobjective optimization. Bejing: sciencepaper online, pp 1\u201325. http:\/\/www.paper.edu.cn\/releasepaper\/content\/201403-40 . Accessed 25 Jan 2015"},{"issue":"3","key":"1868_CR23","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/j.ijepes.2010.12.031","volume":"33","author":"S Sivasubramani","year":"2011","unstructured":"Sivasubramani S, Swarup KS (2011) Multi-objective harmony search algorithm for optimal power flow problem. Int J Electr Power Energy Syst 33(3):745\u2013752","journal-title":"Int J Electr Power Energy Syst"},{"key":"1868_CR24","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the 2000 congress on evolutionary computation, vol 1, pp 204\u2013211","DOI":"10.1109\/CEC.2000.870296"},{"issue":"2","key":"1868_CR25","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"DA Veldhuizen Van","year":"2000","unstructured":"Van Veldhuizen DA, Lamont GB (2000) Multiobjective evolutionary algorithms: analyzing the state-of-the-art. Evol Comput 8(2):125\u2013147","journal-title":"Evol Comput"},{"issue":"10","key":"1868_CR26","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.ijepes.2007.06.006","volume":"29","author":"A Vasebi","year":"2007","unstructured":"Vasebi A, Fesanghary M, Bathaee SMT (2007) Combined heat and power economic dispatch by harmony search algorithm. Int J Electr Power Energy Syst 29(10):713\u2013719","journal-title":"Int J Electr Power Energy Syst"},{"issue":"3","key":"1868_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","volume":"14","author":"YN Wang","year":"2010","unstructured":"Wang YN, Wu LH, Yuan XF (2010) Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure. Soft Comput 14(3):193\u2013209","journal-title":"Soft Comput"},{"key":"1868_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.asoc.2013.12.016","volume":"17","author":"XF Yuan","year":"2014","unstructured":"Yuan XF, Zhao JY, Yang YM et al (2014) Hybrid parallel chaos optimization algorithm with harmony search algorithm. Appl Soft Comput J 17:12\u201322","journal-title":"Appl Soft Comput J"},{"issue":"6","key":"1868_CR29","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"1868_CR30","unstructured":"Zhang Q, Zhou A, Zhao S et al. (2009) Multiobjective optimization test instances for the CEC 2009 special session and competition. In: Technical Report CES-487, pp 1\u201330"},{"key":"1868_CR31","unstructured":"Zhou A, Jin Y, Zhang Q et al. (2006) Combing model-based and generics-based offspring generation for multi-objective optimization using a convergence criterion. In: Proceedings of the IEEE congress on evolutionary computation, pp 3234\u20133241"},{"issue":"2","key":"1868_CR32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"key":"1868_CR33","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithm. In: Technical report. Comput Eng and Networks Lab (TIK), ETH Zurich, Switzerland"},{"issue":"4","key":"1868_CR34","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"16\u201318","key":"1868_CR35","first-page":"3308","volume":"73","author":"DX Zou","year":"2010","unstructured":"Zou DX, Gao LQ, Wu JH et al (2010) Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16\u201318):3308\u20133318","journal-title":"Neurocomputing"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1868-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1868-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1868-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1868-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T20:41:42Z","timestamp":1653252102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1868-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,21]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1868"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1868-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,21]]}}}