Cargando…
An improved tangent search algorithm
The Tangent Search Algorithm (TSA) is a newly developed population-based meta-heuristic algorithm to solve complex optimization problems. It is based on the tangent function, which steers the given solution towards more promising regions of the search space. Though TSA has performed well for many op...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9489808/ https://www.ncbi.nlm.nih.gov/pubmed/36160108 http://dx.doi.org/10.1016/j.mex.2022.101839 |
_version_ | 1784792950014738432 |
---|---|
author | Pachung, Probhat Bansal, Jagdish Chand |
author_facet | Pachung, Probhat Bansal, Jagdish Chand |
author_sort | Pachung, Probhat |
collection | PubMed |
description | The Tangent Search Algorithm (TSA) is a newly developed population-based meta-heuristic algorithm to solve complex optimization problems. It is based on the tangent function, which steers the given solution towards more promising regions of the search space. Though TSA has performed well for many optimization problems, the experimental analyses show that it suffers from the low exploration ability and slow convergence rate. This article proposes an improved TSA algorithm (iTSA). Using two concepts, ‘Fitness Weighted Search Strategy’ (FWSS) and ‘Opposition Based learning’ (OBL), iTSA is better in terms of exploration while maintaining the high convergence rate of TSA. • Fitness weighted search strategy (FWSS) is used to increase the exploration ability of TSA. • Opposition based learning (OBL) is used to increase the convergence speed of TSA. • Together, OBL and FWSS into iTSA outperformed the classical TSA and other considered state-of-the-art algorithms. The performance of the proposed iTSA is validated on two sets of test functions: CEC14 benchmark functions and a set of 21 well-known classical benchmark functions. The obtained results are compared with those obtained from the basic TSA and other considered state-of-the-art algorithms. |
format | Online Article Text |
id | pubmed-9489808 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Elsevier |
record_format | MEDLINE/PubMed |
spelling | pubmed-94898082022-09-22 An improved tangent search algorithm Pachung, Probhat Bansal, Jagdish Chand MethodsX Method Article The Tangent Search Algorithm (TSA) is a newly developed population-based meta-heuristic algorithm to solve complex optimization problems. It is based on the tangent function, which steers the given solution towards more promising regions of the search space. Though TSA has performed well for many optimization problems, the experimental analyses show that it suffers from the low exploration ability and slow convergence rate. This article proposes an improved TSA algorithm (iTSA). Using two concepts, ‘Fitness Weighted Search Strategy’ (FWSS) and ‘Opposition Based learning’ (OBL), iTSA is better in terms of exploration while maintaining the high convergence rate of TSA. • Fitness weighted search strategy (FWSS) is used to increase the exploration ability of TSA. • Opposition based learning (OBL) is used to increase the convergence speed of TSA. • Together, OBL and FWSS into iTSA outperformed the classical TSA and other considered state-of-the-art algorithms. The performance of the proposed iTSA is validated on two sets of test functions: CEC14 benchmark functions and a set of 21 well-known classical benchmark functions. The obtained results are compared with those obtained from the basic TSA and other considered state-of-the-art algorithms. Elsevier 2022-09-03 /pmc/articles/PMC9489808/ /pubmed/36160108 http://dx.doi.org/10.1016/j.mex.2022.101839 Text en © 2022 The Author(s) https://creativecommons.org/licenses/by-nc-nd/4.0/This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). |
spellingShingle | Method Article Pachung, Probhat Bansal, Jagdish Chand An improved tangent search algorithm |
title | An improved tangent search algorithm |
title_full | An improved tangent search algorithm |
title_fullStr | An improved tangent search algorithm |
title_full_unstemmed | An improved tangent search algorithm |
title_short | An improved tangent search algorithm |
title_sort | improved tangent search algorithm |
topic | Method Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9489808/ https://www.ncbi.nlm.nih.gov/pubmed/36160108 http://dx.doi.org/10.1016/j.mex.2022.101839 |
work_keys_str_mv | AT pachungprobhat animprovedtangentsearchalgorithm AT bansaljagdishchand animprovedtangentsearchalgorithm AT pachungprobhat improvedtangentsearchalgorithm AT bansaljagdishchand improvedtangentsearchalgorithm |