{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:02:39Z","timestamp":1760608959964},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p> Cuckoo Search (CS) is a recent addition to the field of swarm-based metaheuristics. It has been shown to be an efficient approach for global optimization. Moreover, its application for solving Multi-objective Optimization (MOO) shows very promising results as well. In multi-objective context, a bounded archive is required to store the set of nondominated solutions. But, what is the best archiving strategy to use in order to maintain a bounded set with good characteristics is a critical issue that may lead to a questionable choice. In this work, the behavior of the developed multi-objective CS is studied under several archiving strategies. An extensive experimental study has been conducted using several test problems and two performance metrics related to convergence and diversity. A nonparametric test for statistical analysis is performed. In addition, we used a Multi-Objective Particle Swarm Optimization (MOPSO) for further analysis and comparison. The results revealed that archiving strategies play an important role as they can impact differently on the quality of obtained fronts depending on the problem\u2019s characteristics. Also, this study confirms that the proposed MOCS algorithm is a very promising approach for MOPs compared to the widely used MOPSO. <\/jats:p>","DOI":"10.1142\/s1469026816500206","type":"journal-article","created":{"date-parts":[[2016,11,28]],"date-time":"2016-11-28T02:02:06Z","timestamp":1480298526000},"page":"1650020","source":"Crossref","is-referenced-by-count":4,"title":["Multi-Objective Cuckoo Search Under Multiple Archiving Strategies"],"prefix":"10.1142","volume":"15","author":[{"given":"Kamel","family":"Zeltni","sequence":"first","affiliation":[{"name":"Departement IFA, Faculty NTIC, University of Constantine 2 - Abdelhamid Mehri, Constantine, Algeria"}]},{"given":"Souham","family":"Meshoul","sequence":"additional","affiliation":[{"name":"Departement IFA, Faculty NTIC, University of Constantine 2 - Abdelhamid Mehri, Constantine, Algeria"}]}],"member":"219","published-online":{"date-parts":[[2016,12,27]]},"reference":[{"key":"S1469026816500206BIB001","volume-title":"Multi-objective Swarm Intelligent Systems: Theory & Experiences","volume":"261","author":"Nadia N.","year":"2009"},{"key":"S1469026816500206BIB002","volume-title":"Multi-Objective Particle Swarm Optimizers: An Experimental Comparison, Evolutionary Multi-Criterion Optimization","author":"Durillo J. J.","year":"2009"},{"key":"S1469026816500206BIB004","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-319-09174-7_36","volume-title":"International Symposium on Combinatorial Optimization","author":"Zeltni K.","year":"2014"},{"key":"S1469026816500206BIB006","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"Coello C. C.","year":"2007"},{"key":"S1469026816500206BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"S1469026816500206BIB009","volume-title":"Computer Engineering and Networks Laboratory (TIK)","volume":"43","author":"Zitzler E.","year":"1998"},{"issue":"2","key":"S1469026816500206BIB010","first-page":"189","volume":"3","author":"Balling R. J.","year":"2000","journal-title":"J. Eng. Val. Cost Anal."},{"key":"S1469026816500206BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37140-0_24"},{"key":"S1469026816500206BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.09.026"},{"key":"S1469026816500206BIB019","doi-asserted-by":"publisher","DOI":"10.5772\/5098"},{"key":"S1469026816500206BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30976-2_9"},{"key":"S1469026816500206BIB023","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00104"},{"key":"S1469026816500206BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11857-4_25"},{"key":"S1469026816500206BIB028","doi-asserted-by":"publisher","DOI":"10.1007\/11903697_51"},{"key":"S1469026816500206BIB030","doi-asserted-by":"publisher","DOI":"10.1109\/3468.650320"},{"key":"S1469026816500206BIB032","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029752"},{"key":"S1469026816500206BIB033","first-page":"397","volume-title":"Genetic Algorithms in Engineering and Computer Science","volume":"33","author":"Poloni C.","year":"1995"},{"key":"S1469026816500206BIB036","volume-title":"Practical Nonparametric Statistics","author":"Conover W. J.","year":"1999","edition":"3"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026816500206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:31:29Z","timestamp":1565123489000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1469026816500206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":18,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,12,27]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1142\/S1469026816500206"],"URL":"https:\/\/doi.org\/10.1142\/s1469026816500206","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"value":"1469-0268","type":"print"},{"value":"1757-5885","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}