Konferans bildirisi Açık Erişim
Altinoz, O. Tolga; Yilmaz, A. Egemen; Duca, Anton; Ciuprina, Gabriela
<?xml version='1.0' encoding='UTF-8'?> <record xmlns="http://www.loc.gov/MARC21/slim"> <leader>00000nam##2200000uu#4500</leader> <datafield tag="245" ind1=" " ind2=" "> <subfield code="a">Particle Swarm Optimization with Social Exclusion and its Application in Electromagnetics</subfield> </datafield> <datafield tag="024" ind1=" " ind2=" "> <subfield code="a">10.81043/aperta.61393</subfield> <subfield code="2">doi</subfield> </datafield> <controlfield tag="001">61393</controlfield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="520" ind1=" " ind2=" "> <subfield code="a">The behavior of Particle Swarm Optimization (PSO), a population based optimization algorithm, depends on the movements of the particles and the attractions among them. This behavior was extracted from the observations of the swarms in nature. Every swarm desires to remain powerful in order to survive in nature and to protect its descendants. Therefore, the weakest members in the swarm are isolated, and generally abandoned to live on their own resources. This act is known as social exclusion. In this research, this phenomenon is incorporated to PSO. At the early phase of time-line, the swarm is divided into two groups based on their cost/fitness values. Each group proceeds their own journey without the knowledge of other group. This new algorithm is named as Social Exclusion-PSO (SEPSO). First, the performance of this new algorithm was evaluated/compared with an inertia weight PSO via unimodal, multimodal, expended benchmark functions, and then, it is applied to the circular antenna array design problem. For each implementation, the performance of two sub-populations and the undivided population are presented to demonstrate and compare the behaviour of the socially excluded swarm. The results show that excluding the members with the worst cost values from the population increases the performance of the algorithm in terms of global best solution with approximately 20% smaller number of function evaluations.</subfield> </datafield> <datafield tag="650" ind1="1" ind2="7"> <subfield code="2">opendefinition.org</subfield> <subfield code="a">cc-by</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Ankara Univ, Dept Elect & Elect Engn, Ankara, Turkey</subfield> <subfield code="a">Yilmaz, A. Egemen</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Univ Politehn Bucuresti, Fac Elect Engn, Bucharest, Romania</subfield> <subfield code="a">Duca, Anton</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Univ Politehn Bucuresti, Fac Elect Engn, Bucharest, Romania</subfield> <subfield code="a">Ciuprina, Gabriela</subfield> </datafield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="b">conferencepaper</subfield> <subfield code="a">publication</subfield> </datafield> <datafield tag="542" ind1=" " ind2=" "> <subfield code="l">open</subfield> </datafield> <datafield tag="100" ind1=" " ind2=" "> <subfield code="u">TED Univ, Dept Elect & Elect Engn, Ankara, Turkey</subfield> <subfield code="a">Altinoz, O. Tolga</subfield> </datafield> <datafield tag="711" ind1=" " ind2=" "> <subfield code="a">2014 INTERNATIONAL CONFERENCE ON OPTIMIZATION OF ELECTRICAL AND ELECTRONIC EQUIPMENT (OPTIM)</subfield> </datafield> <datafield tag="260" ind1=" " ind2=" "> <subfield code="c">2014-01-01</subfield> </datafield> <controlfield tag="005">20210316011246.0</controlfield> <datafield tag="773" ind1=" " ind2=" "> <subfield code="n">doi</subfield> <subfield code="a">10.81043/aperta.61392</subfield> <subfield code="i">isVersionOf</subfield> </datafield> <datafield tag="909" ind1="C" ind2="O"> <subfield code="o">oai:zenodo.org:61393</subfield> <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="856" ind1="4" ind2=" "> <subfield code="z">md5:dcc275cd2d542e8ced9808e0e53420de</subfield> <subfield code="s">240</subfield> <subfield code="u">https://aperta.ulakbim.gov.trrecord/61393/files/bib-20a1c494-2e96-46fc-b366-bb3b8e792ce1.txt</subfield> </datafield> <datafield tag="540" ind1=" " ind2=" "> <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield> <subfield code="a">Creative Commons Attribution</subfield> </datafield> </record>
Görüntülenme | 36 |
İndirme | 11 |
Veri hacmi | 2.6 kB |
Tekil görüntülenme | 33 |
Tekil indirme | 11 |