Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Benyamin AbdollahZadeh"'
Autor:
Farhad Soleimanian Gharehchopogh, Mohammad H. Nadimi-Shahraki, Saeid Barshandeh, Benyamin Abdollahzadeh, Hoda Zamani
Publikováno v:
Journal of Bionic Engineering. 20:158-183
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78226a0e12b406d92ac5377cad3c8516
https://doi.org/10.1007/s42235-022-00255-4
https://doi.org/10.1007/s42235-022-00255-4
Publikováno v:
Archives of Computational Methods in Engineering. 30:427-455
Mathematical programming and meta-heuristics are two types of optimization methods. Meta-heuristic algorithms can identify optimal/near-optimal solutions by mimicking natural behaviours or occurrences and provide benefits such as simplicity of execut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff75b48383e972cbdc17f1024fa37e7
https://doi.org/10.1007/s11831-022-09804-w
https://doi.org/10.1007/s11831-022-09804-w
Autor:
Benyamin Abdollahzadeh, Silifat Adaramaja Abdulraheem, Iyad Abu-Doush, Mohammed Azmi Al-Betar, Yusuf Sahabi Ali, Khalifa Al-Jabri, Ghazi Al-Rawas, Ankush Anand, Mohammed A. Awadallah, Parnian Hashempour Bakhtiari, P. Shanthi Bala, Kusum Kumari Bharti, Gautam M. Borkar, Malik Shehadeh Braik, Özay Can, Soumitri Chattopadhyay, Aybike Özyüksel Çiftçioğlu, Ahmet Cevahir Cinar, Serdar Ekinci, Hasan Eroğlu, Amir H. Gandomi, Mohammadali Geranmehr, Farhad Soleimanian Gharehchopogh, Ibrahim Hayatu Hassan, Davut Izci, Sehej Jain, Isuwa Jeremiah, Ersin Kaya, Muhammad Najeeb Khan, Nima Khodadadi, Hisham M. Khudhur, Krishanu Kundu, Aritra Marik, Mansur Aliyu Masama, Mwangi Mbuthia, Seyedali Mirjalili, Abdullahi Mohammed, Rafaa Mraihi, Mohammad Reza Nikoo, Abraham Nyete, Ali Öztürk, Narendra Nath Pathak, Anita R. Patil, Rishav Pramanik, Bochra Rabbouch, Hana Rabbouch, Sajad Ahmad Rather, Foued Saâdaoui, Davies Segera, Sevil Sen, Amit Kumar Sinha, Bahaeddin Turkoglu, Sait Ali Uymaz, Selim Yilmaz, Ehsan Yousefi-Khoshqalb
Publikováno v:
Comprehensive Metaheuristics ISBN: 9780323917810
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dd6226b3aa5e931607ec81c35cf9841
https://doi.org/10.1016/b978-0-323-91781-0.09992-0
https://doi.org/10.1016/b978-0-323-91781-0.09992-0
Publikováno v:
Comprehensive Metaheuristics ISBN: 9780323917810
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd4c1962c1b73c5fda2bac000e05e59c
https://doi.org/10.1016/b978-0-323-91781-0.00020-x
https://doi.org/10.1016/b978-0-323-91781-0.00020-x
Publikováno v:
Comprehensive Metaheuristics ISBN: 9780323917810
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd5ab9310ea1cde02f444f9035574fe6
https://doi.org/10.1016/b978-0-323-91781-0.00009-0
https://doi.org/10.1016/b978-0-323-91781-0.00009-0
Publikováno v:
Studies in Computational Intelligence ISBN: 9783031098345
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a79ea2d0e1872d6344113c25f76e63b
https://doi.org/10.1007/978-3-031-09835-2_13
https://doi.org/10.1007/978-3-031-09835-2_13
Publikováno v:
International Journal of Intelligent Systems. 36:5887-5958
Metaheuristics play a critical role in solving optimization problems, and most of them have been inspired by the collective intelligence of natural organisms in nature. This paper proposes a new metaheuristic algorithm inspired by gorilla troops' soc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca1da6d78133afd89f43795126a4cab1
https://doi.org/10.1002/int.22535
https://doi.org/10.1002/int.22535
Publikováno v:
Cluster Computing. 25:1981-2005
Travelling Salesman Problem (TSP) is an Np-Hard problem, for which various solutions have been offered so far. Using the Harris Hawk Optimization (HHO) algorithm, this paper presented a new method that uses random-key encoding to generate a tour. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb79ddaf1033a102312ac8aefe533b4f
https://doi.org/10.1007/s10586-021-03304-5
https://doi.org/10.1007/s10586-021-03304-5
Publikováno v:
Engineering with Computers. 38:1845-1863
Feature selection (FS) is a critical step in data mining, and machine learning algorithms play a crucial role in algorithms performance. It reduces the processing time and accuracy of the categories. In this paper, three different solutions are propo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::240b5450954cb15db18edb2735a38556
https://doi.org/10.1007/s00366-021-01369-9
https://doi.org/10.1007/s00366-021-01369-9
Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem considered NP-hard. TSP aims to discover the shortest Hamilton route that visits each city precisely once and then returns to the starting point, making it the shortest route
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9cc8ecaba4b242cfadfcc82c3855a0d
https://hdl.handle.net/20.500.12713/3320
https://hdl.handle.net/20.500.12713/3320