1
|
Huang W, Tian H, Wang S, Zhang C, Zhang X. Integration of simulated annealing into pigeon inspired optimizer algorithm for feature selection in network intrusion detection systems. PeerJ Comput Sci 2024; 10:e2176. [PMID: 39145221 PMCID: PMC11322994 DOI: 10.7717/peerj-cs.2176] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/18/2024] [Accepted: 06/12/2024] [Indexed: 08/16/2024]
Abstract
In the context of the 5G network, the proliferation of access devices results in heightened network traffic and shifts in traffic patterns, and network intrusion detection faces greater challenges. A feature selection algorithm is proposed for network intrusion detection systems that uses an improved binary pigeon-inspired optimizer (SABPIO) algorithm to tackle the challenges posed by the high dimensionality and complexity of network traffic, resulting in complex models, reduced accuracy, and longer detection times. First, the raw dataset is pre-processed by uniquely one-hot encoded and standardized. Next, feature selection is performed using SABPIO, which employs simulated annealing and the population decay factor to identify the most relevant subset of features for subsequent review and evaluation. Finally, the selected subset of features is fed into decision trees and random forest classifiers to evaluate the effectiveness of SABPIO. The proposed algorithm has been validated through experimentation on three publicly available datasets: UNSW-NB15, NLS-KDD, and CIC-IDS-2017. The experimental findings demonstrate that SABPIO identifies the most indicative subset of features through rational computation. This method significantly abbreviates the system's training duration, enhances detection rates, and compared to the use of all features, minimally reduces the training and testing times by factors of 3.2 and 0.3, respectively. Furthermore, it enhances the F1-score of the feature subset selected by CPIO and Boost algorithms when compared to CPIO and XGBoost, resulting in improvements ranging from 1.21% to 2.19%, and 1.79% to 4.52%.
Collapse
Affiliation(s)
- Wanwei Huang
- College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, China
| | - Haobin Tian
- College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, China
| | - Sunan Wang
- Electronic & Communication Engineering, Shenzhen Polytechnic School, Shenzhen, Guangdong, China
| | - Chaoqin Zhang
- College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, China
| | - Xiaohui Zhang
- Henan Xinda Wangyu Technology Co. Ltd, Zhengzhou, Henan, China
| |
Collapse
|
2
|
Feng Q, Pan JS, Du ZG, Peng YJ, Chu SC. Multi-strategy improved parallel antlion algorithm and applied to feature selection. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2022. [DOI: 10.3233/jifs-219315] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
Antlion Optimization Algorithm (ALO) is a promising bionic swarm intelligence algorithm, which has good robustness and convergence, but there are still many areas to be improved and modified. Aiming at the fact that the ALO algorithm is more likely to fall into the local optimum, proposes three strategies to improve the classic ALO algorithm in this paper. First of all, we adopt a parallel idea in the algorithm, through the communication strategy between groups based on Quantum-Behaved to enhance the diversity of the population. Secondly, we adopted two strategies, Opposition Learning, and Gaussian Mutation, to balance the performance of exploration and exploitation during the execution of the algorithm, further formed the MSALO algorithm. The CEC2013 Benchmark function is selected as the standard, and MSALO is compared with other intelligent optimization algorithms. The experimental results show that MSALO has stronger optimization performance compared with other intelligent algorithms. Besides, we applied MSALO to the practical scenarios of feature selection, and use SVM classifiers as training evaluators to improve the accuracy of feature extraction from high-dimensional data.
Collapse
Affiliation(s)
- Qing Feng
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Zhi-Gang Du
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Yan-jun Peng
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
- College of Science and Engineering, Flinders University, Clovelly Park, SA, Australia
| |
Collapse
|
3
|
Jia HD, Li W, Pan JS, Chai QW, Chu SC. Multi-group multi-verse optimizer for energy efficient for routing algorithm in wireless sensor network. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2022. [DOI: 10.3233/jifs-219313] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
Wireless sensor network (WSN) is a network composed of a group of wireless sensors with limited energy. With the proliferation of sensor nodes, organization and management of sensor nodes become a challenging task. In this paper, a new topology is proposed to solve the routing problem in wireless sensor networks. Firstly, the sensor nodes are layered to avoid the ring path between cluster heads. Then the nodes of each layer are clustered to facilitate the integration of information and reduce energy dissipation. Moreover, we propose efficient multiverse optimization to mitigate the impact of local optimal solution prematurely and the population diversity declines prematurely. Extensive empirical studies on the CEC 2013 benchmark demonstrate the effectiveness of our new approach. The improved algorithm is further combined with the new topology to handle the routing problem in wireless sensor networks. The energy dissipation generated in routing is significantly lower than that of Multi-Verse Optimizer, Particle Swarm Optimization, and Parallel Particle Swarm Optimization in a wireless sensor network consisting of 5000 nodes.
Collapse
Affiliation(s)
- Han-Dong Jia
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Wei Li
- Faculty of the Built Environment, The University of New South Wales, NSW, Australia
| | - Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Qing-Wei Chai
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China
- College of Science and Engineering, Flinders University, Clovelly Park, SA, Australia
| |
Collapse
|
4
|
Wang GL, Chu SC, Tian AQ, Liu T, Pan JS. Improved Binary Grasshopper Optimization Algorithm for Feature Selection Problem. ENTROPY 2022; 24:e24060777. [PMID: 35741497 PMCID: PMC9223162 DOI: 10.3390/e24060777] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/09/2022] [Revised: 05/24/2022] [Accepted: 05/29/2022] [Indexed: 11/16/2022]
Abstract
The migration and predation of grasshoppers inspire the grasshopper optimization algorithm (GOA). It can be applied to practical problems. The binary grasshopper optimization algorithm (BGOA) is used for binary problems. To improve the algorithm’s exploration capability and the solution’s quality, this paper modifies the step size in BGOA. The step size is expanded and three new transfer functions are proposed based on the improvement. To demonstrate the availability of the algorithm, a comparative experiment with BGOA, particle swarm optimization (PSO), and binary gray wolf optimizer (BGWO) is conducted. The improved algorithm is tested on 23 benchmark test functions. Wilcoxon rank-sum and Friedman tests are used to verify the algorithm’s validity. The results indicate that the optimized algorithm is significantly more excellent than others in most functions. In the aspect of the application, this paper selects 23 datasets of UCI for feature selection implementation. The improved algorithm yields higher accuracy and fewer features.
Collapse
Affiliation(s)
- Gui-Ling Wang
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (G.-L.W.); (S.-C.C.); (A.-Q.T.); (T.L.)
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (G.-L.W.); (S.-C.C.); (A.-Q.T.); (T.L.)
- College of Science and Engineering, Flinders University, Adelaide 5042, Australia
| | - Ai-Qing Tian
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (G.-L.W.); (S.-C.C.); (A.-Q.T.); (T.L.)
| | - Tao Liu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (G.-L.W.); (S.-C.C.); (A.-Q.T.); (T.L.)
| | - Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (G.-L.W.); (S.-C.C.); (A.-Q.T.); (T.L.)
- Department of Information Management, Chaoyang University of Technology, Taichung 413, China
- Correspondence:
| |
Collapse
|
5
|
Du ZG, Pan JS, Chu SC, Chiu YJ. Multi-group discrete symbiotic organisms search applied in traveling salesman problems. Soft comput 2022. [DOI: 10.1007/s00500-022-06862-x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/30/2022]
|
6
|
Ye T, Wang H, Wang W, Zeng T, Zhang L, Huang Z. Artificial bee colony algorithm with an adaptive search manner and dimension perturbation. Neural Comput Appl 2022. [DOI: 10.1007/s00521-022-06981-4] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
7
|
On the use of single non-uniform mutation in lightweight metaheuristics. Soft comput 2021. [DOI: 10.1007/s00500-021-06495-6] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
8
|
Pustokhina IV, Pustokhin DA, RH A, Jayasankar T, Jeyalakshmi C, Díaz VG, Shankar K. Dynamic customer churn prediction strategy for business intelligence using text analytics with evolutionary optimization algorithms. Inf Process Manag 2021. [DOI: 10.1016/j.ipm.2021.102706] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
|
9
|
Wu JMT, Sun L, Srivastava G, Lin JCW. A Long Short-Term Memory Network Stock Price Prediction with Leading Indicators. BIG DATA 2021; 9:343-357. [PMID: 34287015 DOI: 10.1089/big.2020.0391] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
The accuracy of the prediction of stock price fluctuations is crucial for investors, and it helps investors manage funds better when formulating trading strategies. Using forecasting tools to get a predicted value that is closer to the actual value from a given financial data set has always been a major goal of financial researchers and a problem. In recent years, people have paid particular attention to stocks, and gradually used various tools to predict stock prices. There is more than one factor that affects financial trends, and people need to consider it from all aspects, so research on stock price fluctuations has also become extremely difficult. This paper mainly studies the impact of leading indicators on the stock market. The framework used in this article is proposed based on long short-term memory (LSTM). In this study, leading indicators that affect stock market volatility are added, and the proposed framework is thus named as a stock tending prediction framework based on LSTM with leading indicators (LSTMLI). This study uses stock markets in the United States and Taiwan, respectively, with historical data, futures, and options as data sets to predict stock prices in these two markets. We measure the predictive performance of LSTMLI relative to other neural network models, and the impact of leading indicators on stock prices is studied. Besides, when using LSTMLI to predict the rise and fall of stock prices in the article, the conventional regression method is not used, but the classification method is used, which can give a qualitative output based on the data set. The experimental results show that the LSTMLI model using the classification method can effectively reduce the prediction error. Also, the data set with leading indicators is better than the prediction results of the single historical data using the LSTMLI model.
Collapse
Affiliation(s)
- Jimmy Ming-Tai Wu
- College of Computer Science and Engineering, Sandong University of Science and Technology, Qingdao, China
| | - Lingyun Sun
- College of Computer Science and Engineering, Sandong University of Science and Technology, Qingdao, China
| | - Gautam Srivastava
- Department of Mathematics & Computer Science, Brandon University, Brandon, Canada
- Research Centre for Interneural Computing, China Medical University, Taichung City, Taiwan
| | - Jerry Chun-Wei Lin
- Department of Computer Science, Electrical Engineering and Mathematical Sciences, Western Norway University of Applied Sciences, Bergen, Norway
| |
Collapse
|
10
|
Song PC, Chu SC, Pan JS, Yang H. Simplified Phasmatodea population evolution algorithm for optimization. COMPLEX INTELL SYST 2021. [DOI: 10.1007/s40747-021-00402-0] [Citation(s) in RCA: 17] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
Abstract
AbstractThis work proposes a population evolution algorithm to deal with optimization problems based on the evolution characteristics of the Phasmatodea (stick insect) population, called the Phasmatodea population evolution algorithm (PPE). The PPE imitates the characteristics of convergent evolution, path dependence, population growth and competition in the evolution of the stick insect population in nature. The stick insect population tends to be the nearest dominant population in the evolution process, and the favorable evolution trend is more likely to be inherited by the next generation. This work combines population growth and competition models to achieve the above process. The implemented PPE has been tested and analyzed on 30 benchmark functions, and it has better performance than similar algorithms. This work uses several engineering optimization problems to test the algorithm and obtains good results.
Collapse
|
11
|
Fan F, Chu SC, Pan JS, Lin C, Zhao H. An optimized machine learning technology scheme and its application in fault detection in wireless sensor networks. J Appl Stat 2021; 50:592-609. [PMID: 36819085 PMCID: PMC9930809 DOI: 10.1080/02664763.2021.1929089] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
Abstract
Aiming at the problem of fault detection in data collection in wireless sensor networks, this paper combines evolutionary computing and machine learning to propose a productive technical solution. We choose the classical particle swarm optimization (PSO) and improve it, including the introduction of a biological population model to control the population size, and the addition of a parallel mechanism for further tuning. The proposed RS-PPSO algorithm was successfully used to optimize the initial weights and biases of back propagation neural network (BPNN), shortening the training time and raising the prediction accuracy. Wireless sensor networks (WSN) has become the key supporting platform of Internet of Things (IoT). The correctness of the data collected by the sensor nodes has a great influence on the reliability, real-time performance and energy saving of the entire network. The optimized machine learning technology scheme given in this paper can effectively identify the fault data, so as to ensure the effective operation of WSN.
Collapse
Affiliation(s)
- Fang Fan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, People’s Republic of China
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, People’s Republic of China
| | - Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, People’s Republic of China, Jeng-Shyang Pan
| | - Chuang Lin
- Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, People’s Republic of China
| | - Huiqi Zhao
- College of Intelligent Equipment, Shandong University of Science and Technology, Taian, People’s Republic of China
| |
Collapse
|
12
|
Fuzzy Hierarchical Surrogate Assists Probabilistic Particle Swarm Optimization for expensive high dimensional problem. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.106939] [Citation(s) in RCA: 13] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
|
13
|
|
14
|
Evolutionary Multi-Objective Energy Production Optimization: An Empirical Comparison. MATHEMATICAL AND COMPUTATIONAL APPLICATIONS 2020. [DOI: 10.3390/mca25020032] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
This work presents the assessment of the well-known Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and one of its variants to optimize a proposed electric power production system. Such variant implements a chaotic model to generate the initial population, aiming to get a better distributed Pareto front. The considered power system is composed of solar, wind and natural gas power sources, being the first two renewable energies. Three conflicting objectives are considered in the problem: (1) power production, (2) production costs and (3) CO2 emissions. The Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is also adopted in the comparison so as to enrich the empirical evidence by contrasting the NSGA-II versions against a non-Pareto-based approach. Spacing and Hypervolume are the chosen metrics to compare the performance of the algorithms under study. The obtained results suggest that there is no significant improvement by using the variant of the NSGA-II over the original version. Nonetheless, meaningful performance differences have been found between MOEA/D and the other two algorithms.
Collapse
|
15
|
Pan JS, Chai QW, Chu SC, Wu N. 3-D Terrain Node Coverage of Wireless Sensor Network Using Enhanced Black Hole Algorithm. SENSORS 2020; 20:s20082411. [PMID: 32340324 PMCID: PMC7219582 DOI: 10.3390/s20082411] [Citation(s) in RCA: 15] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 03/19/2020] [Revised: 04/19/2020] [Accepted: 04/21/2020] [Indexed: 11/16/2022]
Abstract
In this paper, a new intelligent computing algorithm named Enhanced Black Hole (EBH) is proposed to which the mutation operation and weight factor are applied. In EBH, several elites are taken as role models instead of only one in the original Black Hole (BH) algorithm. The performance of the EBH algorithm is verified by the CEC 2013 test suit, and shows better results than the original BH. In addition, the EBH and other celebrated algorithms can be used to solve node coverage problems of Wireless Sensor Network (WSN) in 3-D terrain with satisfactory performance.
Collapse
Affiliation(s)
- Jeng-Shyang Pan
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (J.-S.P.); (Q.-W.C.)
| | - Qing-Wei Chai
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (J.-S.P.); (Q.-W.C.)
| | - Shu-Chuan Chu
- College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China; (J.-S.P.); (Q.-W.C.)
- Correspondence:
| | - Ning Wu
- School of Electronic and Information Engineering, Beibu Gulf University, Qinzhou 535011, China;
| |
Collapse
|
16
|
Improved ‘Infotaxis’ Algorithm-Based Cooperative Multi-USV Pollution Source Search Approach in Lake Water Environment. Symmetry (Basel) 2020. [DOI: 10.3390/sym12040549] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022] Open
Abstract
This paper studies the cooperation method of multi-cooperative Unmanned Surface Vehicles (USVs) for chemical pollution source monitoring in a dynamic water environment. Multiple USVs formed a mobile sensor network in a symmetrical or asymmetrical formation. Based on ‘Infotaxis’ algorithms for multi-USV, an improved shared probability is proposed for solving the problems of low success rate and low efficiency resulting from the cognitive differences of multi-USV in cooperative exploration. By introducing the confidence factor, the cognitive differences between USVs are coordinated. The success rate and the efficiency of exploration are improved. To further optimize the exploration strategy, the particle swarm optimization (PSO) algorithm is introduced into the ‘Infotaxis’ algorithm to plan the USVs’ exploration path. This method is called the ‘PSO-Infotaxis’ algorithm. The effectiveness of the proposed method is verified by simulation and laboratory experiments. A comparison of the test results shows that the ‘PSO-Infotaxis’ algorithm is superior with respect to exploring efficiency. It can reduce the uncertainty of the estimation for source location faster and has lower exploration time, which is most important for the exploration of a large range of water areas.
Collapse
|
17
|
Abstract
The conventional maximum power point tracking (MPPT) method fails in partially shaded conditions, because multiple peaks may appear on the power–voltage characteristic curve. The Pigeon-Inspired Optimization (PIO) algorithm is a new type of meta-heuristic algorithm. Aiming at this situation, this paper proposes a new type of algorithm that combines a new pigeon population algorithm named Parallel and Compact Pigeon-Inspired Optimization (PCPIO) with MPPT, which can solve the problem that MPPT cannot reach the near global maximum power point. This hybrid algorithm is fast, stable, and capable of globally optimizing the maximum power point tracking algorithm. Therefore, the purpose of this article is to study the performance of two optimization techniques. The two algorithms are Particle Swarm Algorithm (PSO) and improved pigeon algorithm. This paper first studies the mechanism of multi-peak output characteristics of photovoltaic arrays in complex environments, and then proposes a multi-peak MPPT algorithm based on a combination of an improved pigeon population algorithm and an incremental conductivity method. The improved pigeon algorithm is used to quickly locate near the maximum power point, and then the variable step size incremental method INC (incremental conductance) is used to accurately locate the maximum power point. A simulation was performed on Matlab/Simulink platform. The results prove that the method can achieve fast and accurate optimization under complex environmental conditions, effectively reduce power oscillations, enhance system stability, and achieve better control results.
Collapse
|
18
|
Diversity Teams in Soccer League Competition Algorithm for Wireless Sensor Network Deployment Problem. Symmetry (Basel) 2020. [DOI: 10.3390/sym12030445] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
The drawback of several metaheuristic algorithms is the dropped local optimal trap in the solution to complicated problems. The diversity team is one of the promising ways to enhance the exploration of searching solutions in algorithm to avoid the local optimum trap. This paper proposes a diversity-team soccer league competition algorithm (DSLC) based on updating team member strategies for global optimization and its applied optimization of Wireless sensor network (WSN) deployment. The updating team consists of trading, drafting, and combining strategies. The trading strategy considers player transactions between groups after the ending season. The drafting strategy takes advantage of draft principles in real leagues to bring new players to the association. The combining strategy is a hybrid policy of trading and drafting one. Twenty-one benchmark functions of CEC2017 are used to test the performance of the proposed algorithm. The experimental results of the proposed algorithm compared with the other algorithms in the literature show that the proposed algorithm outperforms the competitors in terms of having an excellent ability to achieve global optimization. Moreover, the proposed DSLC algorithm is applied to solve the problem of WSN deployment and achieved excellent results.
Collapse
|
19
|
Improved Compact Cuckoo Search Algorithm Applied to Location of Drone Logistics Hub. MATHEMATICS 2020. [DOI: 10.3390/math8030333] [Citation(s) in RCA: 41] [Impact Index Per Article: 8.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Drone logistics can play an important role in logistics at the end of the supply chain and special environmental logistics. At present, drone logistics is in the initial development stage, and the location of drone logistics hubs is an important issue in the optimization of logistics systems. This paper implements a compact cuckoo search algorithm with mixed uniform sampling technology, and, for the problem of weak search ability of the algorithm, this paper combines the method of recording the key positions of the search process and increasing the number of generated solutions to achieve further improvements, as well as implements the improved compact cuckoo search algorithm. Then, this paper uses 28 test functions to verify the algorithm. Aiming at the problem of the location of drone logistics hubs in remote areas or rural areas, this paper establishes a simple model that considers the traffic around the village, the size of the village, and other factors. It is suitable for selecting the location of the logistics hub in advance, reducing the cost of drone logistics, and accelerating the large-scale application of drone logistics. This paper uses the proposed algorithm for testing, and the test results indicate that the proposed algorithm has strong competitiveness in the proposed model.
Collapse
|