1 Ocak 2021 Dergi makalesi Açık Erişim

Aydilek, Ibrahim Berkan; Karacizmeli, Izzettin Hakan; Tenekeci, Mehmet Emin; Kaya, Serkan; Gumuscu, Abdulkadir

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Aydilek, Ibrahim Berkan</dc:creator>
  <dc:creator>Karacizmeli, Izzettin Hakan</dc:creator>
  <dc:creator>Tenekeci, Mehmet Emin</dc:creator>
  <dc:creator>Kaya, Serkan</dc:creator>
  <dc:creator>Gumuscu, Abdulkadir</dc:creator>
  <dc:date>2021-01-01</dc:date>
  <dc:description>Optimization becomes more important and the use of optimization methods is becoming widespread with the developments in computer sciences. Researchers from different scientific fields are looking for better solutions to solve complex problems with optimization methods. In some complex problems, optimal results can be obtained utilizing metaheuristic algorithms. Researchers carry out different studies to improve the performance of present metaheuristic algorithms. Although the success of metaheuristic algorithms has been seen in previous studies, there are some weaknesses in these algorithms. Therefore, successful results cannot be obtained for each problem sometimes. In order to overcome this problem, more successful algorithms can be obtained by hybridizing the strong points of the different methods together. In addition, one of the important factors affecting the success of optimization algorithms is scanning ability of the solution space in order to find the optima. Exploring search space is carried out using random variables by some metaheuristic algorithms. The chaotic values that are generated by chaotic maps can be used instead of random values. Thus, search ability of algorithms performs more dynamically. In this study, hybrid firefly and particle swarm optimization algorithms are transformed to a chaotic-based algorithm by use of 10 different chaotic maps. Random valued parameters are generated by chaotic maps. In order to indicate the performances between different dimensions, CEC 2015 benchmark and constraint problems are used in experimental studies. Chaos enhanced methods are compared against canonical and hybrid optimization algorithms. It has been seen that obtained results of the proposed method were sufficiently successful and reliable.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/231538</dc:identifier>
  <dc:identifier>oai:aperta.ulakbim.gov.tr:231538</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 46(2)</dc:source>
  <dc:title>Using chaos enhanced hybrid firefly particle swarm optimization algorithm for solving continuous optimization problems</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>