{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T01:35:50Z","timestamp":1765157750216},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/tii.2011.2166799","type":"journal-article","created":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T05:19:28Z","timestamp":1316063968000},"page":"592-600","source":"Crossref","is-referenced-by-count":52,"title":["Comparative Study of Derivative Free Optimization Algorithms"],"prefix":"10.1109","volume":"7","author":[{"given":"Nam","family":"Pham","sequence":"first","affiliation":[]},{"given":"A.","family":"Malinowski","sequence":"additional","affiliation":[]},{"given":"T.","family":"Bartczak","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014842520519"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014849028575"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2008.927987"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TEVC.2005.863128","article-title":"Graph-based evolutionary algorithms","volume":"10","author":"bryden","year":"2006","journal-title":"IEEE Trans Evol Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2010.2089060"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2008.2008642"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2008.2009533"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2007.903974"},{"key":"ref14","first-page":"93","article-title":"Improving crossover and mutation for adaptive genetic algorithm","volume":"12","author":"hangyu","year":"2006","journal-title":"Comput Eng Appl"},{"key":"ref15","first-page":"22","article-title":"Genetic algorithm with a hybrid crossover operator and its convergence","volume":"16","author":"cheng","year":"2006","journal-title":"Comput Eng Appl"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.927706"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/03052150701364022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2010.2062474"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.914767"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/355934.355943"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3912-z"},{"key":"ref27","article-title":"Function optimization using evolutionary programming with self-adaptive cultural algorithms","author":"chung","year":"0","journal-title":"Proc SEAL'96 Selected Papers from the 1st Asia-Pacific Conf Simulated Evol Learning"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1090\/qam\/10666","article-title":"A method for the solution of certain problems in least squares","volume":"2","author":"levenberg","year":"1944","journal-title":"Quart Appl Mach"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2009.2018535"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932656"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497315203"},{"key":"ref8","first-page":"79","author":"price","year":"1999","journal-title":"New Ideas in Optimization"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9083-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2008.928111"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2009.2022542"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496303470"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.810908"},{"key":"ref24","author":"torczon","year":"1989","journal-title":"V Multi-directional search A direct search algorithm for parallel machines"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9329-3"},{"key":"ref26","first-page":"55","article-title":"Improved Nedler Mead's simplex method and applications","volume":"3","author":"pham","year":"2011","journal-title":"J Comput"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIE.2003.1267901"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9424\/6056501\/06011694.pdf?arnumber=6011694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:24Z","timestamp":1633909584000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6011694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tii.2011.2166799","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}