A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection

Simple item page
dc.contributor.authorAltay O.
dc.contributor.authorAltay E.V.
dc.date.accessioned2024-07-22T08:03:22Z
dc.date.available2024-07-22T08:03:22Z
dc.date.issued2023
dc.description.abstractMetaheuristic optimization algorithms manage the search process to explore search domains efficiently and are used efficiently in large-scale, complex problems. Transient Search Algorithm (TSO) is a recently proposed physics-based metaheuristic method inspired by the transient behavior of switched electrical circuits containing storage elements such as inductance and capacitance. TSO is still a new metaheuristic method; it tends to get stuck with local optimal solutions and offers solutions with low precision and a sluggish convergence rate. In order to improve the performance of metaheuristic methods, different approaches can be integrated and methods can be hybridized to achieve faster convergence with high accuracy by balancing the exploitation and exploration stages. Chaotic maps are effectively used to improve the performance of metaheuristic methods by escaping the local optimum and increasing the convergence rate. In this study, chaotic maps are included in the TSO search process to improve performance and accelerate global convergence. In order to prevent the slow convergence rate and the classical TSO algorithm from getting stuck in local solutions, 10 different chaotic maps that generate chaotic values instead of random values in TSO processes are proposed for the first time. Thus, ergodicity and non-repeatability are improved, and convergence speed and accuracy are increased. The performance of Chaotic Transient Search Algorithm (CTSO) in global optimization was investigated using the IEEE Congress on Evolutionary Computation (CEC)’17 benchmarking functions. Its performance in real-world engineering problems was investigated for speed reducer, tension compression spring, welded beam design, pressure vessel, and three-bar truss design problems. In addition, the performance of CTSO as a feature selection method was evaluated on 10 different University of California, Irvine (UCI) standard datasets. The results of the simulation showed that Gaussian and Sinusoidal maps in most of the comparison functions, Sinusoidal map in most of the real-world engineering problems, and finally the generally proposed CTSOs in feature selection outperform standard TSO and other competitive metaheuristic methods. Real application results demonstrate that the suggested approach is more effective than standard TSO. © 2023 Altay and Varol Altay
dc.identifier.DOI-ID10.7717/peerj-cs.1526
dc.identifier.issn23765992
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/12258
dc.language.isoEnglish
dc.publisherPeerJ Inc.
dc.rightsAll Open Access; Gold Open Access; Green Open Access
dc.subjectBalancing
dc.subjectBenchmarking
dc.subjectChaotic systems
dc.subjectEvolutionary algorithms
dc.subjectFeature Selection
dc.subjectLearning algorithms
dc.subjectLyapunov methods
dc.subjectBenchmark functions
dc.subjectChaotic map
dc.subjectChaotic transient search optimization algorithm
dc.subjectChaotic transients
dc.subjectEngineering problems
dc.subjectFeatures selection
dc.subjectOptimization algorithms
dc.subjectReal-world
dc.subjectReal-world engineering problem
dc.subjectSearch optimization
dc.subjectGlobal optimization
dc.titleA novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection
dc.typeArticle

Files

Collections

Scopus Koleksiyonu