A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection
Metaheuristic 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 e...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2023-08-01
|
| Series: | PeerJ Computer Science |
| Subjects: | |
| Online Access: | https://peerj.com/articles/cs-1526.pdf |
| _version_ | 1797737463932780544 |
|---|---|
| author | Osman Altay Elif Varol Altay |
| author_facet | Osman Altay Elif Varol Altay |
| author_sort | Osman Altay |
| collection | DOAJ |
| description | Metaheuristic 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. |
| first_indexed | 2024-03-12T13:30:06Z |
| format | Article |
| id | doaj.art-101123a0d20f48819f56eeaf799c69c2 |
| institution | Directory Open Access Journal |
| issn | 2376-5992 |
| language | English |
| last_indexed | 2024-03-12T13:30:06Z |
| publishDate | 2023-08-01 |
| publisher | PeerJ Inc. |
| record_format | Article |
| series | PeerJ Computer Science |
| spelling | doaj.art-101123a0d20f48819f56eeaf799c69c22023-08-24T15:05:11ZengPeerJ Inc.PeerJ Computer Science2376-59922023-08-019e152610.7717/peerj-cs.1526A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selectionOsman AltayElif Varol AltayMetaheuristic 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.https://peerj.com/articles/cs-1526.pdfChaotic transient search optimization algorithmChaotic mapsBenchmark functionsReal-world engineering problemsFeature selection |
| spellingShingle | Osman Altay Elif Varol Altay A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection PeerJ Computer Science Chaotic transient search optimization algorithm Chaotic maps Benchmark functions Real-world engineering problems Feature selection |
| title | A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection |
| title_full | A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection |
| title_fullStr | A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection |
| title_full_unstemmed | A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection |
| title_short | A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection |
| title_sort | novel chaotic transient search optimization algorithm for global optimization real world engineering problems and feature selection |
| topic | Chaotic transient search optimization algorithm Chaotic maps Benchmark functions Real-world engineering problems Feature selection |
| url | https://peerj.com/articles/cs-1526.pdf |
| work_keys_str_mv | AT osmanaltay anovelchaotictransientsearchoptimizationalgorithmforglobaloptimizationrealworldengineeringproblemsandfeatureselection AT elifvarolaltay anovelchaotictransientsearchoptimizationalgorithmforglobaloptimizationrealworldengineeringproblemsandfeatureselection AT osmanaltay novelchaotictransientsearchoptimizationalgorithmforglobaloptimizationrealworldengineeringproblemsandfeatureselection AT elifvarolaltay novelchaotictransientsearchoptimizationalgorithmforglobaloptimizationrealworldengineeringproblemsandfeatureselection |