TriTSA: Triple Tree-Seed Algorithm for dimensional continuous optimization and constrained engineering problems

2021 ◽  
Vol 104 ◽  
pp. 104303
Author(s):  
Jianhua Jiang ◽  
Yutong Liu ◽  
Ziying Zhao
Keyword(s):  
Continuous Optimization ◽  
Engineering Problems ◽  
Tree Seed

scholarly journals Tree-Seed Algorithm for Large-Scale Binary Optimization

2018 ◽  
Vol 3 (1) ◽  
pp. 48 ◽  
Author(s):  
Ahmet Cevahir Cinar ◽  
Hazim Iscan ◽  
Mustafa Servet Kiran
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Logic Gate ◽  
Continuous Optimization ◽  
Population Based ◽  
Benchmark Problems ◽  
Binary Optimization ◽  
Continuous Optimization Problems ◽  
Computation Algorithms ◽  
Tree Seed

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

TSASC: tree–seed algorithm with sine–cosine enhancement for continuous optimization problems

2020 ◽  
Vol 24 (24) ◽  
pp. 18627-18646
Author(s):  
Jianhua Jiang ◽  
Rui Han ◽  
Xianqiu Meng ◽  
Keqin Li
Keyword(s):  
Optimization Problems ◽  
Continuous Optimization ◽  
Continuous Optimization Problems ◽  
Tree Seed

scholarly journals An Improved Novel Global Harmony Search Algorithm Based on Selective Acceptance

2020 ◽  
Vol 10 (6) ◽  
pp. 1910 ◽  
Author(s):  
Hui Li ◽  
Po-Chou Shih ◽  
Xizhao Zhou ◽  
Chunming Ye ◽  
Li Huang
Keyword(s):  
Optimization Problems ◽  
Search Algorithm ◽  
Harmony Search ◽  
Continuous Optimization ◽  
Harmony Search Algorithm ◽  
Experimental Results ◽  
Metaheuristic Algorithms ◽  
Engineering Problems ◽  
New Harmony ◽  
Continuous Optimization Problems

The novel global harmony search (NGHS) algorithm is proposed in 2010, and it is an improved harmony search (HS) algorithm which combines the particle swarm optimization (PSO) and the genetic algorithm (GA). One of the main differences between the HS and NGHS algorithms is that of using different mechanisms to renew the harmony memory (HM). In the HS algorithm, in each iteration, the new harmony is accepted and replaced the worst harmony in the HM while the fitness of the new harmony is better than the worst harmony in the HM. Conversely, in the NGHS algorithm, the new harmony replaces the worst harmony in the HM without any precondition. However, in addition to these two mechanisms, there is one old mechanism, the selective acceptance mechanism, which is used in the simulated annealing (SA) algorithm. Therefore, in this paper, we proposed the selective acceptance novel global harmony search (SANGHS) algorithm which combines the NGHS algorithm with a selective acceptance mechanism. The advantage of the SANGHS algorithm is that it balances the global exploration and local exploitation ability. Moreover, to verify the search ability of the SANGHS algorithm, we used the SANGHS algorithm in ten well-known benchmark continuous optimization problems and two engineering problems and compared the experimental results with other metaheuristic algorithms. The experimental results show that the SANGHS algorithm has better search ability than the other four harmony search algorithms in ten continuous optimization problems. In addition, in two engineering problems, the SANGHS algorithm also provided a competition solution compared with other state-of-the-art metaheuristic algorithms.

TSA: Tree-seed algorithm for continuous optimization

2015 ◽  
Vol 42 (19) ◽  
pp. 6686-6698 ◽  
Author(s):  
Mustafa Servet Kiran
Keyword(s):  
Continuous Optimization ◽  
Tree Seed
Sign in / Sign up

Export Citation Format

Share Document