<?xml version="1.0" encoding="UTF-8"?>

<article xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.3" xml:lang="tr">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher">setsci</journal-id>
   <journal-title-group>
    <journal-title>SETSCI Conference Proceedings</journal-title>
   </journal-title-group>
   <issn publication-format="electronic">2687-5527</issn>
   <publisher>
    <publisher-name>SET Technology</publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">10.36287/setsci.4.6.144</article-id>
   <article-id pub-id-type="publisher-id">bac43dee-de5d-4ea2-9a8e-26c18dcdffcc</article-id>
   <title-group>
    <article-title>MOEA/D Algoritmasının En Önemli İki Ayrıştırma Yöntemi Olan PBI ve TCH’ın Analizi</article-title>
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" corresp="yes">
     <name>
      <surname>Altıok</surname>
      <given-names>Mustafa</given-names>
     </name>
     <xref ref-type="aff" rid="aff1"/>
    </contrib>
    <contrib contrib-type="author">
     <name>
      <surname>Koçer</surname>
      <given-names>Barış</given-names>
     </name>
     <xref ref-type="aff" rid="aff2"/>
    </contrib>
   </contrib-group>
   <aff id="aff1">
    <institution>Tokat Gaziosmanpaşa University</institution>
   </aff>
   <aff id="aff2">
    <institution>Konya Technical University</institution>
   </aff>
   <pub-date date-type="pub">
    <day>22</day>
    <month>12</month>
    <year>2019</year>
   </pub-date>
   <volume>9</volume>
   <fpage>502</fpage>
   <lpage>507</lpage>
   <permissions>
    <copyright-statement>© 2019 SET Technology</copyright-statement>
    <copyright-year>2019</copyright-year>
    <copyright-holder>SET Technology</copyright-holder>
    <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
     <license-p>CC BY 4.0</license-p>
    </license>
   </permissions>
   <abstract>
    <p>Günümüzde, birçok araştırmacı optimizasyon problemleri çözen algoritmaları geliştirme eğilimindedir. Gerçek dünya problemleri ise genelde birden çok amaca sahip oldukları için çok amaçlı optimizasyon problemleri üzerine geliştirilen algoritmalar trend olmuştur. Bu çalışmada, çok amaçlı optimizasyon algoritması olan Multi Objective Evulation Algorithm(MOEA/D) incelendi ve algoritma içerisinde yer alan ve genelde amaçların tek bir amaç olarak ifade edilmesini sağlayan en önemli iki metot Tchebycheff (TCH) ve Penalty-based Boundary Intersection (PBI) metotları  iki ve üç amaçlı 11 benchmark(DTLZ ve ZDT ailesi) ile test edildi ve bu alanda en çok kullanılan Hypervolume(HV), Inverted Generation Distance(IGD) ve EPSİLON adında üç adet metrik ile bu sonuçlar kıyaslandı. Bu algoritmanın artıları ve eksileri öne çıkarıldı. Sonuçta MOEA/D hangi yöntem ile kullanılırsa daha verimli olacağı gösterilmiş oldu. Bilim her zaman üzerine koyarak ilerleyen bir gerçeklik olduğu için, bu çalışma MOEA/D üzerine çalışma yapacak araştırmacılara yön gösterici bir çalışma oldu.</p>
   </abstract>
   <kwd-group xml:lang="en">
    <kwd>Optimizasyon, Çok amaçlı optimizasyon, MOEA/D, algoritma,Ayrıştırma yöntemi</kwd>
   </kwd-group>
  </article-meta>
 </front>
 <back>
  <ref-list>
   <ref id="ref1">
    <mixed-citation>A. OZKIS, &quot;Girdap arama ve yapay alg algoritmalarının çok amaçli optimzasyon problemlerine uyarlanmasi,&quot; phD, Computer Engineering, Selcuk Universty, KONYA, 2018.</mixed-citation>
   </ref>
   <ref id="ref2">
    <mixed-citation>A. Özkış and A. Babalık, &quot;A novel metaheuristic for multi-objective optimization problems: The multi-objective vortex search algorithm,&quot; Information Sciences, vol. 402, pp. 124-148, 2017.</mixed-citation>
   </ref>
   <ref id="ref3">
    <mixed-citation>J. Schaffer, &quot;Multiple objective optimization with vector evaluated,&quot; ph.D., Genetic Algorithms, Vanderbilt Universty, 1984.</mixed-citation>
   </ref>
   <ref id="ref4">
    <mixed-citation>K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, &quot;A fast and elitist multiobjective genetic algorithm: NSGA-II,&quot; IEEE transactions on evolutionary computation, vol. 6, no. 2, pp. 182-197, 2002.</mixed-citation>
   </ref>
   <ref id="ref5">
    <mixed-citation>C. A. C. Coello, G. T. Pulido, and M. S. Lechuga, &quot;Handling multiple objectives with particle swarm optimization,&quot; IEEE Transactions on evolutionary computation, vol. 8, no. 3, pp. 256-279, 2004.</mixed-citation>
   </ref>
   <ref id="ref6">
    <mixed-citation>E. Zitzler and S. Künzli, &quot;Indicator-based selection in multiobjective search,&quot; in International Conference on Parallel Problem Solving from Nature, 2004, pp. 832-842: Springer.</mixed-citation>
   </ref>
   <ref id="ref7">
    <mixed-citation>Q. F. Zhang and H. Li, &quot;MOEA/D: A multiobjective evolutionary algorithm based on decomposition,&quot; (in English), Ieee Transactions on Evolutionary Computation, vol. 11, no. 6, pp. 712-731, Dec 2007.</mixed-citation>
   </ref>
   <ref id="ref8">
    <mixed-citation>J. Bai and H. Liu, &quot;Multi-objective artificial bee algorithm based on decomposition by PBI method,&quot; Applied Intelligence, vol. 45, no. 4, pp. 976-991, 2016.</mixed-citation>
   </ref>
   <ref id="ref9">
    <mixed-citation>E. ERGUL, &quot;Çok amaçlı genetik algoritmalar: Temelleri ve Uygulamaları,&quot; ph.D., Multi Objective Optimization, Ondokuz Mayıs University, SAMSUN, 2010.</mixed-citation>
   </ref>
   <ref id="ref10">
    <mixed-citation>A. J. Nebro and J. J. Durillo, &quot;A study of the parallelization of the multi-objective metaheuristic MOEA/D,&quot; in International Conference on Learning and Intelligent Optimization, 2010, pp. 303-317: Springer.</mixed-citation>
   </ref>
   <ref id="ref11">
    <mixed-citation>J. J. Durillo and A. J. Nebro, &quot;jMetal: A Java framework for multi-objective optimization,&quot; Advances in Engineering Software, vol. 42, no. 10, pp. 760-771, 2011.</mixed-citation>
   </ref>
   <ref id="ref12">
    <mixed-citation>E. Zitzler, K. Deb, and L. Thiele, &quot;Comparison of multiobjective evolutionary algorithms: Empirical results,&quot; Evolutionary computation, vol. 8, no. 2, pp. 173-195, 2000.</mixed-citation>
   </ref>
   <ref id="ref13">
    <mixed-citation>K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, &quot;Scalable test problems for evolutionary multiobjective optimization,&quot; in Evolutionary multiobjective optimization: Springer, 2005, pp. 105-145.</mixed-citation>
   </ref>
   <ref id="ref14">
    <mixed-citation>Q. Zhang, A. Zhou, S. Zhao, P. N. Suganthan, W. Liu, and S. Tiwari, &quot;Multiobjective optimization test instances for the CEC 2009 special session and competition,&quot; University of Essex, Colchester, UK and Nanyang technological University, Singapore, special session on performance assessment of multi-objective optimization algorithms, technical report, vol. 264, 2008.</mixed-citation>
   </ref>
   <ref id="ref15">
    <mixed-citation>A. Babalik, A. Ozkis, S. A. Uymaz, and M. S. Kiran, &quot;A multi-objective artificial algae algorithm,&quot; (in English), Applied Soft Computing, vol. 68, pp. 377-395, Jul 2018.</mixed-citation>
   </ref>
   <ref id="ref16">
    <mixed-citation>Y. Xiang, Y. Zhou, and H. Liu, &quot;An elitism based multi-objective artificial bee colony algorithm,&quot; European Journal of Operational Research, vol. 245, no. 1, pp. 168-193, 2015.</mixed-citation>
   </ref>
   <ref id="ref17">
    <mixed-citation>D. H. Wolpert and W. G. Macready, &quot;No free lunch theorems for optimization,&quot; IEEE transactions on evolutionary computation, vol. 1, no. 1, pp. 67-82, 1997.</mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>
