<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462016000100055</article-id>
<article-id pub-id-type="doi">10.13053/cys-20-1-2228</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Comparative Analysis of Selection Schemes in the Artificial Bee Colony Algorithm]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[Ajit]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[Dharmender]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Jarial]]></surname>
<given-names><![CDATA[S.K.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Science and Technology  ]]></institution>
<addr-line><![CDATA[Murthal Sonepat]]></addr-line>
<country>India</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,University of Science and Technology  ]]></institution>
<addr-line><![CDATA[Hisar Haryana]]></addr-line>
<country>India</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2016</year>
</pub-date>
<volume>20</volume>
<numero>1</numero>
<fpage>55</fpage>
<lpage>66</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462016000100055&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462016000100055&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462016000100055&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract. The Artificial Bee Colony (ABC) algorithm is a popular swarm based algorithm inspired by the intelligent foraging behavior of honey bees. In the past, many swarm intelligence based techniques were introduced and proved their effective performance in solving various optimization problems. The exploitation of food sources is performed by onlooker bees in accordance with a proportional selection scheme that can be further modified to avoid such shortcomings as population diversity and premature convergence. In this paper, different selection schemes, namely, tournament selection, truncation selection, disruptive selection, linear dynamic scaling, linear ranking, sigma truncation, and exponential ranking have been used to analyze the performance of the ABC algorithm by testing on standard benchmark functions. From the simulation results, the schemes other than the standard ABC prove their efficient performance.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Swarm based algorithm]]></kwd>
<kwd lng="en"><![CDATA[artificial bee colony]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[selection scheme]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A model of collective nectar source by honey bees: Self-organization through simple rules]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camazine]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sneyd]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Theoretical Biology]]></source>
<year>1991</year>
<volume>149</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>547-71</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Collective decision-making in honey bees: how colonies choose among nectar sources]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seeley]]></surname>
<given-names><![CDATA[T.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Camazine]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sneyd]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Behav Ecol Sociobiol]]></source>
<year>1991</year>
<volume>28</volume>
<page-range>277-90</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Computing with bees: attacking complex transportation engineering problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lucic]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Teodorovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal on Artificial Intelligence Tools]]></source>
<year>2003</year>
<volume>12</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>375-94</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Transport modeling by multi-agent systems: a swarm intelligence approach]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teodorovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transport Plan Technol]]></source>
<year>2003</year>
<volume>26</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>289-312</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teodorovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Orco]]></surname>
<given-names><![CDATA[M.D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bee colony optimization - a cooperative learning approach to complex transportation problems]]></source>
<year>2005</year>
<conf-name><![CDATA[ 16Mini-EURO conf. AI Transportation]]></conf-name>
<conf-loc>Poznan, Poland </conf-loc>
<page-range>51 -60</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teodorovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Lucic]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Markovic]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Orco]]></surname>
<given-names><![CDATA[M.D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bee colony optimization: principles and applications]]></source>
<year>2006</year>
<conf-name><![CDATA[ 8Seminar on Neural Network Applications in Electrical Engineering (NEUREL)]]></conf-name>
<conf-loc>Belgrade, Serbia & Montenegro </conf-loc>
<page-range>151-6</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A comprehensive survey: artificial bee colony (ABC) algorithm and applications]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gorkemli]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ozturk]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>2012</year>
<volume>42</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-57</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bitam]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Batouche]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[A survey on bee colony algorithms]]></source>
<year>2010</year>
<conf-name><![CDATA[ 24IEEE Int'l Parallel and Distri Proces Sympos]]></conf-name>
<conf-loc>Atlanta, USA </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An idea based on honey bee swarm for numerical optimization]]></source>
<year>2005</year>
<publisher-name><![CDATA[Erciyes University, Engineering Faculty, Computer Engineering Department]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A novel clustering approach: ABC algorithm]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Karaboga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ozturk]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Applied Soft Computing]]></source>
<year>2011</year>
<volume>11</volume>
<page-range>652-7</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zeng]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comparison and analysis of the selection mechanism in the artificial bee colony algorithm]]></source>
<year>2009</year>
<conf-name><![CDATA[ NinthInt'l Conf. Hybrid Intelligent Systems (HIS'09)]]></conf-name>
<conf-loc>Shenyang, China </conf-loc>
<page-range>411-6</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Back]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Selective pressure in evolutionary algorithms: a characterization of selection mechanisms]]></source>
<year>1994</year>
<conf-name><![CDATA[ Conference on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>57-62</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blickle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Thiele]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Eshelman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[A mathematical analysis of tournament selection]]></source>
<year>1995</year>
<conf-name><![CDATA[ SixthInternational Conf. Genetic Algorithms (ICGA95)]]></conf-name>
<conf-loc>San Francisco, CA </conf-loc>
<page-range>9-16</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Genetic algorithms, tournament selection, and the effects of noise]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[B.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Complex Systems]]></source>
<year>1995</year>
<volume>9</volume>
<page-range>193-212</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Predictive models for the breeder genetic algorithm]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muhlenbein]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Voosen]]></surname>
<given-names><![CDATA[D.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionary Computation]]></source>
<year>1993</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>25-49</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blickle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Thiele]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[A comparison of selection schemes used in genetic algorithm]]></source>
<year>1995</year>
<publisher-loc><![CDATA[Switzerland ]]></publisher-loc>
<publisher-name><![CDATA[Swiss Federal Institute of Technology, Computer Engineering and Communication Networks Lab]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuo]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[S.Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[A genetic algorithm with disruptive selection]]></source>
<year>1996</year>
<volume>26</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>299-307</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Using disruptive selection to maintain diversity in genetic algorithms]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuo]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[S.Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Intelligence]]></source>
<year>1997</year>
<volume>7</volume>
<page-range>257-67</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sivanandam]]></surname>
<given-names><![CDATA[S.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Deepa]]></surname>
<given-names><![CDATA[S.N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Genetic Algorithms]]></source>
<year>2008</year>
<page-range>71</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Genetic algorithms: A survey]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Srinivas]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Patnaik]]></surname>
<given-names><![CDATA[L.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer]]></source>
<year>1994</year>
<volume>27</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>17-26</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Genetic algorithms, selection schemes, and the varying effects of noise]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[B.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[D.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionary Computation]]></source>
<year>1996</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>113-31</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
