DOI:10.32604/cmc.2022.020769
| Computers, Materials & Continua DOI:10.32604/cmc.2022.020769 | |
| Article |
Improved Dragonfly Optimizer for Intrusion Detection Using Deep Clustering CNN-PSO Classifier
1Department of Computer Sceince and Engineering, Karpagam College of Engineering, Coimbatore, 641032, India
2Department of Computer Science and Engineering, CHRIST (Deemed to be University), Bangalore, 560074, India
3Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, Hradec Králové, 50003, Czech Republic
4Department of Mathematics, Faculty of Science, University of Hradec Králové, Hradec Králové, 50003, Czech Republic
5Department of Computer Sceince, CHRIST(Deemed to be University), Bangalore, 560074, India
*Corresponding Author: S. Hubalovsky. Email: stepan.hubalovsky@uhk.cz
Received: 06 June 2021; Accepted: 07 July 2021
Abstract: With the rapid growth of internet based services and the data generated on these services are attracted by the attackers to intrude the networking services and information. Based on the characteristics of these intruders, many researchers attempted to aim to detect the intrusion with the help of automating process. Since, the large volume of data is generated and transferred through network, the security and performance are remained an issue. IDS (Intrusion Detection System) was developed to detect and prevent the intruders and secure the network systems. The performance and loss are still an issue because of the features space grows while detecting the intruders. In this paper, deep clustering based CNN have been used to detect the intruders with the help of Meta heuristic algorithms for feature selection and preprocessing. The proposed system includes three phases such as preprocessing, feature selection and classification. In the first phase, KDD dataset is preprocessed by using Binning normalization and Eigen-PCA based discretization method. In second phase, feature selection is performed by using Information Gain based Dragonfly Optimizer (IGDFO). Finally, Deep clustering based Convolutional Neural Network (CCNN) classifier optimized with Particle Swarm Optimization (PSO) identifies intrusion attacks efficiently. The clustering loss and network loss can be reduced with the optimization algorithm. We evaluate the proposed IDS model with the NSL-KDD dataset in terms of evaluation metrics. The experimental results show that proposed system achieves better performance compared with the existing system in terms of accuracy, precision, recall, f-measure and false detection rate.
Keywords: Intrusion detection system; binning normalization; deep clustering; convolutional neural network; information gain; dragonfly optimizer
Over the years, computer networks are the area which effectively used in the applications such as business data processing, education and learning, widespread data acquisition and collaboration and entertainment. The connected devices over the internet for this application are increasing day by day and generate large amount of data for transfer and processing. This unauthorized access also aims to access the systems that will break the confidentiality, availability and integrity which is called as attack/intrusion. To monitor the malicious activity of the system and alert if there is any such attack happened is controlled by the Intrusion detection system (IDS). IDS provides the security from the attackers [1]. IDS can be classified either networkbased or hostbased attacks. Network based attacks are the anomaly based attacks that are detected from the computer systems interconnections and the system can communicate to other via routers and switches, attacks also sent through these ones. Host based attacks are found from the single computer system and also it is easy to prevent from attacks. These are occurred from the external devices connected to the systems. Web based attacks are enabled during connecting to the internet and these systems attack to other system over the mail and downloading.
For this IDS development, data mining and Machine learning techniques are widely used. Network feature selection is declared by selecting the most important features for the entire network without the loss of information. In terms of feature selection and classification on IDS, various ML algorithms have been used such as K nearest neighbor (KNN), Support Vector Machine (SVM), Random forest (RF) and Multi-layer perceptron (MLP) [2]. IDS based deep learning algorithm called convolutional neural network are discussed in paper [3] to handle the imbalanced network traffic. The existing deep learning and machine learning algorithms are still lack in improving the IDS performance. The improved deep learning based algorithm has been used to overcome the issues in the existing systems in terms of improving the performance of the IDS and reduce the generalization error in this paper. The benefits of this contribution are as follows:
• The raw input IDS data set is preprocessed with binning normalization process to remove the missing values and handle the data that are out of the range. The high dimension of raw data is then transformed using the discretization method called Eigen-PCA.
• The transmitted data are then used for feature selection process. This proposed work introduced evolutionary algorithm called improved dragonfly optimizer with information gain (IG-DFO) for selecting the relevant features. For feature selection, the weight and the number of iterations will produce the optimal solution. Dragonfly optimizer with information gain is used here to produce the optimal feature selection.
• Classification with deep clustering convolutional neural network has been used. Compare to traditional CNN, deep clusteringcan reduce the clustering loss and improve accuracy of the classification. The network loss can be reduced with the optimization algorithm called PSO. Thus, the PSO optimized by clustering convolutional neural network (PSO-CCNN) can reduce the generalization error, training time and improved the classification accuracy with minimum noise.
• The proposed feature selection based classification on IDS data has been experimented and compared with existing feature selection and classification algorithms in terms of evaluation metrics.
The paper has been organized as follows: Section 2 describes the review of the literature, Section 3 introduces evolutionary based feature selection and deep learning classification approaches, Section 4 discusses about the experimented results and Section 5 concludes the paper with future directions.
This section describes various literature and recent research related to IDS. In paper [4], various classification algorithms are analyzed with NSL-KDD data set. This can analyzethe protocols with the attacks by the intruders using WEKA tool. They used CFS based dimensionality reduction to improve the classification accuracy. Least square support vector machine (LSSSVM) based on IDS was proposed in paper [5]. It used mutual information based on feature selection method to handle linear and nonlinear correlated features. They used KDD cup 99, NSL-KDD and Kyoto 2006 + datasets. The proposed approach obtained better accuracy and computational cost than other existing algorithms.
The Paper [6] proposed an ensemble method to improve the IDS performance. They used two methods such as boosting and bagging with tree based classifiers. It extracted 35 features and used NSL-KDD dataset for evaluation and concluded that bagging with J48 classifier performs better. Recurrent Neural Network (RNN) [7] is used for IDS with supervised learning classifier. The RNN-IDS was compared with the classification models such as J48, Random forest and SVM in terms of accuracy. For binary classification, the RNN consist of 80 hidden nodes with the learning rate of 0.1. RNN-IDS obtains 83.28% accuracy for binary classification and 80 hidden nodes with the learning rate of 0.5 and accuracy of 81.29% for multi class classification. Feature selection based on Ant Colony Optimization (ACO) [8] is used for classification of features with accuracy.
Filter based on feature selection XGBoost [9] is used for detecting network attacks by using machine learning classification techniques with 91% accuracy. Feature selection approach [10] uses correlation techniques as naive bays (NB), Random Forest (RF), J48, and ZeroR. Study of various IDS techniques [11] for identifying attacks using classification algorithms. IDS in the IOT network is very important issue and studiesare conducted [12,13]. This paper gives detail review about the existing IoT based on secure communication on IDS. It also discussed about the IoT based on classifications and discussed about the future research challenges. Best feature selection strategy is implemented [14] using genetic algorithm with logistic regression techniques. Swarm intelligent technique for feature extraction [15] uses Pigeon Inspired optimizer with sigmoid function. Feature extraction using Particle Swarm Optimization (PSO), Firefly Optimization (FO), Grey Wolf Optimization (GO) and Genetic Algorithm (GA) [16] are discussed with accuracy rate. Deep learning clustering techniques for IDS system [17,18] uses contextual deep clustering with Euclidean distance based deep analysis. It can find out clusters accurately for IDS. Convolutional neural network model used for detecting the DoS attacks [19] in big networks are discussed for identifying optimal solution.
3 Proposed Deep Clustering PSO Based IDS Model
The proposed approach includes three phases such as Preprocessing, Feature selection and Classification. The overview of the approach is shown in Fig. 1. Initially the network data set is divided into two datasets-training dataset and testing dataset in the ratio of 6:4. In all classification algorithm approaches, preprocessing plays on vital role on improving the accuracy. From the raw data, the irrelevant and missing data are handled with this preprocessing process.
Figure 1: Overview of proposed IDS
In this proposed work, preprocessing stage includes normalization and discretization. The phases are:
(i) Preprocessing using Binning method to handle the missing values. Binning method is used to handle the missing values for both numerical and categorical data. It is used to enhance the model more robust and prevent from overfitting.
(ii) Dimensionality reduction using Eigen PCA. This method is used to reduce the n dimension data into m where
(iii) Feature selection using proposed information gain with Dragonfly optimizer (IG-DFO). This method is used to select the reduced number of feature set for further processing.
(iv) Classification using proposed PSO optimized-Clustering Convolutional neural network (PSO-CCNN). Among the various machine learning and deep learning techniques, CNN proven to be the generative model that contains multiple layers of latent and stochastic variables. These deep clustering and evolutionary algorithms analyzed with the intrusion detection dataset to prove the efficiency of the proposed work in terms of performance measures.
3.1 Preprocessing Using Binning Normalization
The raw input data set are complex to process due to noise and missing values. It is also difficult to process the dataset with whole features of numeric and non-numeric data. Hence, the raw input data are to be preprocessed before proceeding for further analysis improvement. Initially, the symbols in the data are replaced with the unique numeric value using the mapping function available in Python library which is mathematically represented using the logarithmic equation [20] of the dataset X which is represented in Eq. (1)
The data features having missing values may also have some useful information. Avoiding the missing values data may affect the performance of the classification. Those missing values are handled using the binning method. In this method, the data are smoothened and the missing values are handled. The bin have equal width with the range of each bin are defined as Eq. (2)
where
In general, the larger the width, the greater the data get smoothened. In this work, the Binning method combined with discretization to transform the data using the dimensionality reduction technique called Eigen-PCA which is described in the Section 3.2.
3.2 Dimensionality Reduction Using Eigen- PCA
To make the database as an elegant one for processing, dimensionality reduction is important step to reduce the dimension of the input data into low dimensional space. Here, Eigen-PCA has been used to reduce the dimension of feature space. Principal Component Analysis (PCA) has been used to reduce the high dimensional space of the data into low dimension space of features. PCA is used here for calculationof the eigenvector of covariance matrix. The high dimensional data space is transformed into low dimensional space with the eigenvectors with larger eigenvalues. The Nrepresents the number of features in the data set and the set is represented as [
The covariance matrix C is calculated based on Eq. (5)
The eigenvalues and eigenvectors are calculated based on Eq. (6)
where V are eigen vectors
All the input image setsare projected into the eigen-subspace and they are represented by Eq. (7)
where
The input dataset is the combination of number of principal components. The final reduced dataset dimension is represented as in Eq. (8)
3.3 Optimized Feature Selection Using Enhanced IG-DFO
This section will select the optimal features that are relevant to classify the intruders with improvement. The irrelevant features in the dataset will lead to slow the training and testing process for classification. Reducing the irrelevant features will reduce the complexity of the system, speed up the computation process and improve the overall performance of the Intrusion Detection Systems. The information Gain [21] is formed from the information theory [22] is used to find the features that are relevant to the class. The Dataset
where P(x) is probability of
The conditional entropy of two random features
The enhanced Information Gain is calculated from Eqs. (9) and (10)
Hence, the feature
DFO is mimicking the behavior of the dragonfly for the reason of migration or hunting. The swarming behavior may be static or dynamic. In static swarm, small group of dragonflies are moved to hunt other swarms in small area with the local movement of abrupt changes. In dynamic swarm, larger volume of dragonflies is moved towards in one direction for long distance as a group. The dragonflies behavior of static and dynamic swarm is shown in Fig. 2. Artificial dragon flies movement direction is based on five weights such as:
• separation weight (s);
• alignment weight (a);
• cohesion weight (c);
• food factor (f);
• enemy factor (e);
• the inertia weight (w).
Figure 2: Dragonfly characteristics attraction to food distraction from enemy
To optimize the process of exploration and exploitation, the five weights have to be tuned. The weight factors such as separation, alignment, cohesion, attraction to food and distraction from enemy of DFO has been mathematically explored and computed.
The work process of proposed IIW-DFO has been shown in Fig. 3. Until the maximum iterations satisfied the five weight vectors, velocity and position vectors are updated with the improved inertia weight. If the dragonflies have neighbors then the position also are updated. Now the optimized features are given as input to the deep clustering algorithm called PSO optimized clustering convolutional neural network for identification of the intruders.
Figure 3: Work flow of proposed IG-DFO
3.4 Classification Using Proposed PSO Optimized-Clustering CNN
Deep clustering adopts deep neural network to learn the clustering method to reduce the loss. To train the neural network, Clustering deep neural network algorithms are used in the clustering loss. The network can be either fully connected network (FCN) or convolutional neural network (CNN) or deep belief network (DBN). The clustering related loss functions are categorized into principal clustering loss and auxiliary clustering loss. The principal clustering loss contains cluster centroid and sample cluster assignment. This includes the losses such as k means loss, cluster assignment hardening loss, agglomerative clustering loss, and nonparametric maximum margin clustering and so on. Auxiliary clustering loss runs the clustering method after the neural network training with deep clustering loss such as locality-preserving loss, group sparsity loss and subspace clustering loss. The deep clustering loss function is formulated as in Eq. (12)
where
Clustering convolutional neural network of deep clustering is a type of supervised pre-trained network. This uses the CNN framework to learn the clustering and reduce the loss. It picks ‘ k’ samples initially and extract k features as initial cluster Centroid.
The proposed preprocessing, feature selection and classification algorithms are efficient in terms of accuracy and reducing the error. Accuracy of IDS has been obtained with the preprocessing followed by relevant feature selection using information gain based DFO. This meta heuristic algorithm improves the classification accuracy. The proposed deep clustering method with PSO reduces the network loss error. It improves the QoS of the proposed IDS. Hence, the proposed preprocessing, feature selection and classification algorithms are efficient and accurate on predicting the intruders around the network communications.
This section describes about the experimented results and discussions of the proposed feature selection and classification on IDS. This analysis used binary classification on NSL-KDD dataset and it was implemented using Python deep learning library called Keras.
To analyze the performance of the proposed IIW-DFO with IDBCNN based IDS system, the benchmark network traffic dataset called NSL-KDD is used. It is proven to be the best dataset for testing the IDS [4]. There are 41 features that are divided as basic, content based and time based attributes. The NSL-KDD dataset consists of three types of features such as Nominal (3 features), Binary (6 features) and Numeric (32 features). Training set consists of 22 attacks and 16 attacks are considered as testing set. The attacks are categorized as:
1) Denial of Service attacks (DoS);
2) Probe Attacks (PA);
3) Remote to Local attacks (R2L);
4) User to Root attacks (U2R).
The IDS attacks with detailed explanation and the training, testing data are shown in Tab. 1. with the binary class.
4.2 Optimized Features Selection Using IG-DFO
The NSL-KDD dataset consists of 41 features and 1 class label which is represented with example in Tab. 2. The proposed optimized feature selection approach called IG-DFO select seven relevant optimal features from this feature set which will improve the classification accuracy. This feature selection approach is compared to other existing feature selection approaches which are represented in Tab. 3. And the selected feature names of the proposed approach are represented in Tab. 4.
4.3 Evaluation Using Performance Metrics
The proposed IGDFO-PSOCCNN-IDS system is compared with the existing approaches to analyze the performance using the performance metrics such as Accuracy (ACC), False positive rate (FPR), False negative rate (FNR), Sensitivity/True positive rate (SN), Specificity/True negative rate (SP) and recall/Attack Detection rate (ADR). The evaluation metrics equations are represented by Eqs. (16)–(18)
4.4 Performance Evaluation Based on NSL Feature Selection Approaches
The proposed IDS performance based on the original and selected input features are represented in graph. The original 41 features are normalized using feature selection IGDFO. The selected 7 features are represented. The graph proves the importance of preprocessing method called two step normalization with binning process to avoid the network traffic data. This feature selection process also overcomes the over fitting issue and enhance the overall performance of the IDS to improve the accuracy of classification, decreases the error rate and detection time and also minimize the computational complexity.
The proposed feature selection performance is compared with the existing FS on IDS such as standard DFO, FMIFS, FLCFS, and SMOTE-ENN [3]. The proposed IG-DFO FS obtains higher accuracy with lower complexity analysis than other existing contemporary techniques which indicate that these selected features improves the classification accuracy on protect the computer network from intruders. The graphical illustration from Fig. 4 also clearly shows that the increase percentage of accuracy, sensitivity, specificity and attack detection rateare shown in proposed FS approach more than other techniques.
Figure 4: Performance comparison of existing vs. proposed approaches
4.5 Performance Evaluation of Proposed IGDFO-PSOCCNN IDS with Existing IDS Systems
In order to prove the deep neural network based IDS systems, our proposed convolutional deep neural network based on IDS is compared with the existing IDS systems such as DMNB, DBN-SVM, PSOM [1], and SMOTE-ENN [3]. The proposed Information Gain Dragonfly optimizer with improved deep clustering convolutional neural network with PSO based on IDS obtains higher accuracy and lowerFPR rate than other existing IDS approaches including our previous work. The proposed system obtains 98.71% of accuracy on detecting the intruders and 0.12 of False Positive Rate. The IGDFO-PSOCCNN IDS obtains this high accuracy due to the optimization process. The graphical representations of these results are shown in Figs. 5 and 6 for better understanding.
Figure 5: Accuracy comparison of various IDS
Figure 6: FPR comparison of various IDS
Hence, the various experimented results of IDS process show that our proposed IG-DFO-PSOCCNN have higher classification accuracy, minimum error, and reduce the computational complexity. Even though our previous work performs better on detecting the intruders, this work with optimization process also increases the classification accuracy and reduces the loss than our previous work. The clustering based convolutional neural network withPSO can reduce the loss of the network efficiently. Hence, to detect intruders with high accuracy and low error, the preprocessing based IGDFO feature selection with deep clustering method (PSO-CCNN) is better than other existing algorithms in terms efficiency and accurate classification.
An information gain dragonfly optimizer based feature selection and improved Deep bagging convolutional neural network has been proposed in this paper for IDS. Due to the large number of features and large amount of data in the data set, an improved proposed classification technology based on evolutionary and deep learning algorithms is proposed to improve the classification accuracy and prediction of the intruders in the network. Optimization based feature selection algorithm proves that it is the best for finding the relevant features. Deep clustering based CNN with PSO optimization improves the accuracy and stability of the system. Main advantage of using this technique is, swarm intelligence with evolutionary strategy give accurate optimization result. The proposed system is implemented using NSL KDD dataset. The efficiency of the algorithm is proved with the comparative analysis of existing contemporary algorithms in terms of feature selection and classification. The experimental results show that the proposed evolutionary based deep clustering algorithm outperforms in terms of Accuracy (98.71%) and False Positive Rate (0.12). Deep clustering with PSO optimization can reduce the clustering and network loss. Hence, the proposed IDS system will reduce the generalization error, training time, reduced noise and improve the classification accuracy. In the future, the proposed algorithm will be experimented with small number of datasets. The future aim is also to increase the detection rate of the attacks in the NSL KDD dataset.
Funding Statement: The third and fourth authors were supported by the Project of Specific Research PrF UHK No. 2101/2021 and Long-term development plan of UHK, University of Hradec Králové, Czech Republic.
Conflicts of Interest: The authors declare that they have no conflicts of interest to report regarding the present study.
1. M. M. Sakr, M. A. Tawfeeq and A. B. El-Sisi, “Filter versus wrapper feature selection for network intrusion detection system,” in Proc. ICICIS, Cairo, Egypt, 2019. [Google Scholar]
2. S. M. Kasongo and Y. Sun, “A deep learning method with filter based feature engineering for wireless intrusion detection system,” IEEE Access, vol. 7, pp. 38597–38607, 2019. [Google Scholar]
3. X. Zhang, J. Ran and J. Mi, “An intrusion detection system based on convolutional neural network for imbalanced network raffic, in Proc. ICCSNT, Dalian, China, pp. 456–460, 2019. [Google Scholar]
4. L. Dhanabal and S. P. Shantharadah, “A study on NSLKDD dataset for intrusion detection system based on classification algorithms,” International Journal of Advanced Research in Computer and Communication Engineering, vol. 4, no. 6, pp. 446–452, 2015. [Google Scholar]
5. M. A. Ambusaidi, X. He, P. Nanda and Z. Tan, “Building an intrusion detection system using a filter-based feature selection algorithm,” IEEE Transactions on Computers, vol. 65, no. 10, pp. 2986–2998, 2016. [Google Scholar]
6. T. Pham, E. Foo, S. Suriadi and H. Jeffrey, “Improving performance of intrusion detection system using ensemble methods and feature selection,” Australasian Computer Science Week Multi-Conference, vol. 2, pp. 1–6, 2018. [Google Scholar]
7. C. Yin, Y. Zhu, J. Fei and X. He, “A deep learning approach for intrusion detection using recurrent neural networks,’’ IEEE Access, vol. 5, pp. 21954–21961, 2017. [Google Scholar]
8. T. Mehmod and H. B. M. Rais, “Ant colony optimization and feature selection for intrusion detection,” Advances in Machine Learning and Signal Processing, vol. 387, pp. 305–312, 2016. [Google Scholar]
9. S. M. Kasongo and Y. Sun, “Performance analysis of intrusion detection systems using a feature selection method on the UNSW NB15 dataset,” Journal of Big Data, vol. 7, 2020. [Google Scholar]
10. M. Hammad, W. E. Medany and Y. Ismail, “Intrusion detection system using feature selection with clustering and classification machine learning algorithms on the UNSW NB15 dataset,” in Proc. ICIIICT, Sakheer, Bahrain, pp. 1–6, 2020. [Google Scholar]
11. N. Misiko Jacob and M. Yusuf Wanjala, “A review of intrusion detection systems,”, Global Journal of Computer Science and Technology: C Software and Data Engineering, vol. 17, no. 3, 2017. [Google Scholar]
12. A. Khraisa and A. Alazab, “A critical review of intrusion detection systems in the internet of things: Techniques, deployment strategy validation strategy attacks public datasets and challenges, Cybersecurity, vol. 4, no. 18, 2021. [Google Scholar]
13. A. Chauhan, R. Singh and P. Jain, “A literature review: Intrusion detection systems in internet of things,” in Proc. CMVIT, Sanya, China, 2020. [Google Scholar]
14. C. Khammassi and S. A. Krichen, “A GA LR wrapper approach for feature selection in network intrusion detection,” Computer Security, pp. 255–277, 2017. [Google Scholar]
15. H. Alazzam, A. Sharieh and K. E. Sabri, “A feature selection algorithm for intrusion detection system based on pigeon inspired optimizer,” Expert System with Application Expert, vol. 148, 2020. [Google Scholar]
16. O. Almomani, “A feature selection model for network intrusion detection system based on PSO, GWO, FFA and GA algorithms,” Symmetry, vol. 6, no. 12, pp. 1–18, 2020. [Google Scholar]
17. B. Sudhakar, V. B. Narsimha and G. Narsimha, “A contextual deep clustering based intrusion detection method for cloud,” International Journal of Advanced Science and Technology, vol. 28, no. 18, pp. 349–359, 2019. [Google Scholar]
18. A. Genevay, G. Dulac Arnold and V. Jean-Philippe, “Differentiable deep clustering with cluster size constraints,” Cornell University, Machine Learning, vol. 3, pp. 1–14, 2019. [Google Scholar]
19. J. Kim, H. Kim, M. Shim and E. Choi, “CNN-Based network intrusion detection against denial-of-service attacks,” Electronics, vol. 9, pp. 1–21, 2020. [Google Scholar]
20. R. Eberhart and J. Kennedy, “Particle swarm optimization,” in Proc. ICNN, Piscataway, Newyork, vol. 4, pp. 1942–1948, 1995. [Google Scholar]
21. Z. Gao, Y. Xu, F. Meng, F. Qi and Z. Lin, “Improved information gain based feature selection for text categorization,” in Proc. ICWC, Chennai, India, pp. 1–5, 2011. [Google Scholar]
22. C. E. Shannon, “A mathematical theory of communication,” ACM SIGMOBILE Mobile Computer. Communication Review, vol. 5, no. 1, pp. 3–55, 2001. [Google Scholar]
23. X. S. Yang and X. He, “Swarm intelligence and evolutionary computation: overview and analysis,” in Proc. Studies in Computational Intelligence, Cham, Switzerland, pp. 1–23, 2014. [Google Scholar]
24. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proc. ICNN, Perth, Australia, 1995. [Google Scholar]
25. M. Dorigo and D. Carro, “Ant colony optimization: A new meta-heuristic,” in Proc. CEC99, Wisconsin, United States, 2002. [Google Scholar]
26. S. C. Chu, P. W. Tsai and J. S. Pan, “Cat swarm optimization,” in Lecture Notes in Computer Science, Springer, Berlin, pp. 854–858, 2006. [Google Scholar]
27. S. Mirjalili, S. M. Mirjalili and A. Lewis, “Grey wolf optimizer,” Advances in Engineering Software, vol. 69, pp. 46–61, 2014. [Google Scholar]
28. D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007. [Google Scholar]
29. J. M. Abdullah and T. Ahmed, “Fitness dependent optimizer: Inspired by the bee swarming reproductive process,” IEEE Access, vol. 7, pp. 43473–43486, 2019. [Google Scholar]
30. A. S. Shamsaldin, T. A. Rashid, R. A. Al-Rashid Agha, N. K. Al.Salihi and M. Mohammadi, “Donkey and smuggler optimization algorithm: A collaborative working approach to path finding,” Journal of Computational Design and Engineering, vol. 6, no. 4, pp. 562–583, 2019. [Google Scholar]
31. X. Yang, “Firefly algorithms for multimodal optimization,” Stochastic Algorithms: Foundations and Applications, pp. 169–178, 2009. [Google Scholar]
32. X. Yang and S. Deb, “Cuckoo search via levy flights,” in Proc. NaBIC, Coimbatore, India, 2009. [Google Scholar]
33. R. Storn and K. Price, “Differential evolution a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. [Google Scholar]
 | This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |