Siamak Talatahari

Dr. Siamak Talatahari

Faculty of Engineering and IT, University of Technology Sydney, Sydney, NSW, Australia
orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 June 2022 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
MAMahdi Azizi
Mahdi Azizi
STSiamak Talatahari
Siamak Talatahari
Amir H GandomiAmir H Gandomi
Amir H Gandomi
This study proposes the Fire Hawk Optimizer (FHO) as a novel metaheuristic algorithm based on the foraging behavior of whistling kites, black kites and brown falcons. These birds are termed Fire Hawks considering the specific actions they perform to catch prey in nature, specifically by means of setting fire. Utilizing the proposed algorithm, a numerical investigation was conducted on 233 mathematical test functions with dimensions of 2–100, and 150,000 function evaluations were performed for optimization purposes. For comparison, a total of ten different classical and new metaheuristic algorithms were utilized as alternative approaches. The statistical measurements include the best, mean, median, and standard deviation of 100 independent optimization runs, while well-known statistical analyses, such as Kolmogorov–Smirnov, Wilcoxon, Mann–Whitney, Kruskal–Wallis, and Post-Hoc analysis, were also conducted. The obtained results prove that the FHO algorithm exhibits better performance than the compared algorithms from literature. In addition, two of the latest Competitions on Evolutionary Computation (CEC), such as CEC 2020 on bound constraint problems and CEC 2020 on real-world optimization problems including the well-known mechanical engineering design problems, were considered for performance evaluation of the FHO algorithm, which further demonstrated the superior capability of the optimizer over other metaheuristic algorithms in literature. The capability of the FHO is also evaluated in dealing with two of the real-size structural frames with 15 and 24 stories in which the new method outperforms the previously developed metaheuristics.

22 June 2020 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
STSiamak Talatahari
Siamak Talatahari
MAMahdi Azizi
Mahdi Azizi

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
HBHadi Bayzidi
Hadi Bayzidi
STSiamak Talatahari
Siamak Talatahari
MSMeysam Saraee
Meysam Saraee
Charles-Philippe LamarcheCharles-Philippe Lamarche
Charles-Philippe Lamarche
In this paper, a new metaheuristic optimization algorithm, called social network search (SNS), is employed for solving mixed continuous/discrete engineering optimization problems. The SNS algorithm mimics the social network user’s efforts to gain more popularity by modeling the decision moods in expressing their opinions. Four decision moods, including imitation, conversation, disputation, and innovation, are real‐world behaviors of users in social networks. These moods are used as optimization operators that model how users are affected and motivated to share their new views. The SNS algorithm was verified with 14 benchmark engineering optimization problems and one real application in the field of remote sensing. The performance of the proposed method is compared with various algorithms to show its effectiveness over other well‐known optimizers in terms of computational cost and accuracy. In most cases, the optimal solutions achieved by the SNS are better than the best solution obtained by the existing methods.

11 May 2021 in IEEE Access
Verified
Journal Article
Open access
STSiamak Talatahari
Siamak Talatahari
MAMahdi Azizi
Mahdi Azizi
MTMohamad Tolouei
Mohamad Tolouei
BTBabak Talatahari
Babak Talatahari
Pooya SarehPooya Sareh
Pooya Sareh
Metaheuristics are computational procedures that intelligently lead the search process through the efficient exploration of the search space associated with an optimization problem. With the progressive outburst of problems with large data sets in various fields, there is an ongoing quest for enhancing existing metaheuristic algorithms as well as developing new ones with greater accuracy and efficiency. In general, a powerful and efficient metaheuristic algorithm is based on a rich inspiration source, implemented effectively through a precise mathematical model. Aiming to develop a highly efficient, nature-inspired optimization algorithm, here we propose a novel metaheuristic called Crystal Structure Algorithm (CryStAl). This method is chiefly inspired by the principles underlying the formation of crystal structures from the addition of the basis to the lattice points, which is a natural phenomenon that can be seen in the symmetric arrangement of constituents (i.e. atoms, molecules, or ions) in crystalline minerals such as quartz. A total number of 239 mathematical functions which are categorized into four different groups are utilized to evaluate the overall performance of the proposed method. To validate the results of this novel algorithm, 12 different classical and modern metaheuristic algorithms are selected from the literature. The minimum, mean, and standard deviation values alongside the number of function evaluations for CryStAl and the other metaheuristics for a specific tolerance are calculated and presented accordingly. The obtained results, further supported by a complete statistical analysis, demonstrated that the proposed algorithm is capable of providing very competitive results, outperforming the other metaheuristics in most cases.

1 July 2020 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
STSiamak Talatahari
Siamak Talatahari
MAMahdi Azizi
Mahdi Azizi

22 June 2021 in IEEE Access
Verified
Journal Article
Open access
STSiamak Talatahari
Siamak Talatahari
HBHadi Bayzidi
Hadi Bayzidi
MSMeysam Saraee
Meysam Saraee
In this paper, a novel metaheuristic algorithm called Social Network Search (SNS) is developed for solving optimization problems. The SNS algorithm simulates the attempts of users in social networks to gain more popularity by modeling the moods of users in expressing their opinions. These moods are named Imitation, Conversation, Disputation, and Innovation, which are real-world behaviors of users in social networks. These moods are used as optimization operators and model how users are affected and motivated to share their new views. To evaluate the performance of the SNS algorithm, two comparative studies with different properties were conducted. In the first step, 210 mathematical functions have been chosen, which include 120 fixed-dimension, 60 N-dimension, and 30 CEC 2014 problems. Seven metaheuristics are selected from the literature, and the statistical results of these methods are calculated and analyzed. Also, to provide a valid judgment about the performance of the new algorithm, four nonparametric statistical tests have been used. In the next step, the performance of the proposed algorithm is compared to some state-of-the-art algorithms in dealing with CEC 2017 problems. According to the performance of algorithms, the SNS method is capable of achieving better results compared to the other metaheuristics in 101 cases (48%) and performed the same or comparatively in dealing with the other problems.