A new index‐based hyper‐heuristic algorithm for global optimisation problems
Abstract In this research study, a new combination search algorithm, based on indexing its constituent processes, is proposed to solve global optimisation problems. As optimisation problems become more complex, especially real‐world problems, the use of higher‐performance algorithms has become essen...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-10-01
|
| Series: | IET Software |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/sfw2.12065 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850217118258167808 |
|---|---|
| author | Mohammad Reza Hasanzadeh Farshid Keynia Maliheh Hashemipour |
| author_facet | Mohammad Reza Hasanzadeh Farshid Keynia Maliheh Hashemipour |
| author_sort | Mohammad Reza Hasanzadeh |
| collection | DOAJ |
| description | Abstract In this research study, a new combination search algorithm, based on indexing its constituent processes, is proposed to solve global optimisation problems. As optimisation problems become more complex, especially real‐world problems, the use of higher‐performance algorithms has become essential. One of the techniques that lead to design of an algorithm with stronger strategies in exploration and exploitation, as well as a better balance between these two strategies, is the appropriate combination of parent algorithm processes. The proposed algorithm was developed using a new innovation with the help of the supply‐demand‐based optimisation and the Harris hawks optimisation algorithms processes as parent algorithms. In this algorithm, the local and global search sections of its parent algorithms, are separated, and then based on a new indexing method in each iteration, according to the current population indexing, a global search and a local search are selected from the processes of its parent algorithms, and then the current population is updated with two selected sections. The performance and effectiveness of the proposed algorithm in solving well‐known standard benchmark problems and in solving real‐world engineering problems have been tested and validated by statistical tools. The results of the research study show that the proposed algorithm can provide very effective results compared to other competing algorithms as well as its parent algorithms in many tests. The results show that the proper combination of optimisation algorithm processes can be used as a technique to design more powerful algorithms to solve global optimisation problems, especially complex real‐world problems. |
| format | Article |
| id | doaj-art-3f5565818ec24e078623fd88d458d304 |
| institution | OA Journals |
| issn | 1751-8806 1751-8814 |
| language | English |
| publishDate | 2022-10-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Software |
| spelling | doaj-art-3f5565818ec24e078623fd88d458d3042025-08-20T02:08:08ZengWileyIET Software1751-88061751-88142022-10-0116549351510.1049/sfw2.12065A new index‐based hyper‐heuristic algorithm for global optimisation problemsMohammad Reza Hasanzadeh0Farshid Keynia1Maliheh Hashemipour2Department of Computer Engineering Kerman Branch Islamic Azad University Kerman IranDepartment of Energy Management and Optimization Institute of Science and High Technology and Environmental Sciences Graduate University of Advanced Technology Kerman IranDepartment of Computer Engineering Kerman Branch Islamic Azad University Kerman IranAbstract In this research study, a new combination search algorithm, based on indexing its constituent processes, is proposed to solve global optimisation problems. As optimisation problems become more complex, especially real‐world problems, the use of higher‐performance algorithms has become essential. One of the techniques that lead to design of an algorithm with stronger strategies in exploration and exploitation, as well as a better balance between these two strategies, is the appropriate combination of parent algorithm processes. The proposed algorithm was developed using a new innovation with the help of the supply‐demand‐based optimisation and the Harris hawks optimisation algorithms processes as parent algorithms. In this algorithm, the local and global search sections of its parent algorithms, are separated, and then based on a new indexing method in each iteration, according to the current population indexing, a global search and a local search are selected from the processes of its parent algorithms, and then the current population is updated with two selected sections. The performance and effectiveness of the proposed algorithm in solving well‐known standard benchmark problems and in solving real‐world engineering problems have been tested and validated by statistical tools. The results of the research study show that the proposed algorithm can provide very effective results compared to other competing algorithms as well as its parent algorithms in many tests. The results show that the proper combination of optimisation algorithm processes can be used as a technique to design more powerful algorithms to solve global optimisation problems, especially complex real‐world problems.https://doi.org/10.1049/sfw2.12065combination in meta‐heuristic algorithmsimproving meta‐heuristic strategiesindexing in meta‐heuristic algorithmsindexing meta‐heuristic processesperformance indices and evaluation |
| spellingShingle | Mohammad Reza Hasanzadeh Farshid Keynia Maliheh Hashemipour A new index‐based hyper‐heuristic algorithm for global optimisation problems IET Software combination in meta‐heuristic algorithms improving meta‐heuristic strategies indexing in meta‐heuristic algorithms indexing meta‐heuristic processes performance indices and evaluation |
| title | A new index‐based hyper‐heuristic algorithm for global optimisation problems |
| title_full | A new index‐based hyper‐heuristic algorithm for global optimisation problems |
| title_fullStr | A new index‐based hyper‐heuristic algorithm for global optimisation problems |
| title_full_unstemmed | A new index‐based hyper‐heuristic algorithm for global optimisation problems |
| title_short | A new index‐based hyper‐heuristic algorithm for global optimisation problems |
| title_sort | new index based hyper heuristic algorithm for global optimisation problems |
| topic | combination in meta‐heuristic algorithms improving meta‐heuristic strategies indexing in meta‐heuristic algorithms indexing meta‐heuristic processes performance indices and evaluation |
| url | https://doi.org/10.1049/sfw2.12065 |
| work_keys_str_mv | AT mohammadrezahasanzadeh anewindexbasedhyperheuristicalgorithmforglobaloptimisationproblems AT farshidkeynia anewindexbasedhyperheuristicalgorithmforglobaloptimisationproblems AT malihehhashemipour anewindexbasedhyperheuristicalgorithmforglobaloptimisationproblems AT mohammadrezahasanzadeh newindexbasedhyperheuristicalgorithmforglobaloptimisationproblems AT farshidkeynia newindexbasedhyperheuristicalgorithmforglobaloptimisationproblems AT malihehhashemipour newindexbasedhyperheuristicalgorithmforglobaloptimisationproblems |