{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:27:57Z","timestamp":1764174477367,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2797059","type":"journal-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T14:18:08Z","timestamp":1516717088000},"page":"9975-9990","source":"Crossref","is-referenced-by-count":19,"title":["Next Generation Metaheuristic: Jaguar Algorithm"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3254-5510","authenticated-orcid":false,"given":"Yao-Hsin","family":"Chou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Yu","family":"Kuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Sheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Yun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299374"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"yao","year":"1999","journal-title":"IEEE Trans Evol Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256112"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823467"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2011.0382"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2001858.2001891"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1203-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2474153"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2508101"},{"key":"ref28","first-page":"1","author":"zuras","year":"2008","journal-title":"IEEE Standard for Floating-Point Arithmetic"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.11.013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2009.2030359"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557680"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1996.542711"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-79119-2_1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/00207160210939"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568167"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2059031"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2352261"},{"key":"ref9","volume":"1","author":"koza","year":"1992","journal-title":"Genetic Programming—On the Programming of Computers by Means of Natural Selection"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2015.498"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2503422"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9342-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.08.049"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","article-title":"A new metaheuristic bat-inspired algorithm","volume":"284","author":"yang","year":"2010","journal-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref26","first-page":"823","article-title":"Improved quantum-inspired tabu search algorithm for solving function optimization problem","author":"yang","year":"2013","journal-title":"Proc IEEE Int Conf Syst Man Cybern (SMC)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1504\/IJCISTUDIES.2009.515637"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08267218.pdf?arnumber=8267218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:51Z","timestamp":1641987591000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8267218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2797059","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}