Tree-Seed Algorithm for Large-Scale Binary Optimization

  • Cinar A
  • Iscan H
  • Kiran M
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Population-based swarm or evolutionary computation algorithms in optimization are attracted the interest of the researchers due their simple structure, optimization performance, easy-adaptation. Binary optimization problems can be also solved by using these algorithms. This paper focuses on solving large scale binary optimization problems by using Tree-Seed Algorithm (TSA) proposed for solving continuous optimization problems by imitating relationship between the trees and their seeds in nature. The basic TSA is modified by using xor logic gate for solving binary optimization problems in this study. In order to investigate the performance of the proposed algorithm, the numeric benchmark problems with the different dimensions are considered and obtained results show that the proposed algorithm produces effective and comparable solutions in terms of solution quality.Keywords: binary optimization, tree-seed algorithm, xor-gate, large-scale optimization

Cite

CITATION STYLE

APA

Cinar, A. C., Iscan, H., & Kiran, M. S. (2018). Tree-Seed Algorithm for Large-Scale Binary Optimization. KnE Social Sciences, 3(1), 48. https://doi.org/10.18502/kss.v3i1.1396

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free