Abstract—Various heuristic algorithms have been proposed in the literature for solving optimization problems. Tree-seed algorithm (TSA) is inspired from relation between trees and seeds that a population-based evolutionary algorithm. when create process of a seed occur in TSA, the position updating of each dimension of the seed is calculated separately. In scope this study, Some changes have been implemented to original TSA. A new operator was added to the position update equation of original TSA when create a seed from tree. This operator is calculated by dynamically according to the dimension of the problem. As the dimension of the problem increases, the value of the this operator decreases. In addition, we determined an upper and a lower bound for the update process of the seed. The Improved Tree Seed Algorithm (ITSA) proposed in this study and the TSA have been tested on some benchmark functions in the literature. As a result, when the experimental results are taken into consideration, it is understood that the proposed algorithm ITSA is obtained more effective results for benchmark functions than TSA. Moreover, it is observed that ITSA found quite successful results compared with TSA for large-scale benchmark problems.
Index Terms—Evolutionary calculation, heuristic search, optimization problems, tree seed algorithm.
The Authors are with the Computer Engineering Department, Selçuk University, Konya, Turkey (e-mail: murataslan@selcuk.edu.tr).
Cite: Murat Aslan, Mehmet Beskirli, Halife Kodaz, and Mustafa Servet Kıran, "An Improved Tree Seed Algorithm for Optimization Problems," International Journal of Machine Learning and Computing vol. 8, no. 1, pp. 20-25, 2018.