Showing papers on "Swarm intelligence published in 2018"

Particle swarm optimization algorithm: an overview

Abstract: Particle swarm optimization (PSO) is a population-based stochastic optimization algorithm motivated by intelligent collective behavior of some animals such as flocks of birds or schools of fish. Since presented in 1995, it has experienced a multitude of enhancements. As researchers have learned about the technique, they derived new versions aiming to different demands, developed new applications in a host of areas, published theoretical studies of the effects of the various parameters and proposed many variants of the algorithm. This paper introduces its origin and background and carries out the theory analysis of the PSO. Then, we analyze its present situation of research and application in algorithm structure, parameter selection, topology structure, discrete PSO algorithm and parallel PSO algorithm, multi-objective optimization PSO and its engineering applications. Finally, the existing problems are analyzed and future research directions are presented.

An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems

Abstract: Searching for the (near) optimal subset of features is a challenging problem in the process of feature selection (FS). In the literature, Swarm Intelligence (SI) algorithms show superior performance in solving this problem. This motivated our attempts to test the performance of the newly proposed Salp Swarm Algorithm (SSA) in this area. As such, two new wrapper FS approaches that use SSA as the search strategy are proposed. In the first approach, eight transfer functions are employed to convert the continuous version of SSA to binary. In the second approach, the crossover operator is used in addition to the transfer functions to replace the average operator and enhance the exploratory behavior of the algorithm. The proposed approaches are benchmarked on 22 well-known UCI datasets and the results are compared with 5 FS methods: Binary Grey Wolf Optimizer (BGWO), Binary Gravitational Search Algorithms (BGSA), Binary Bat Algorithm (BBA), Binary Particle Swarm Optimization (BPSO), and Genetic Algorithm (GA). The paper also considers an extensive study of the parameter setting for the proposed technique. From the results, it is observed that the proposed approach significantly outperforms others on around 90% of the datasets.

A tutorial on multiobjective optimization: fundamentals and evolutionary methods

Abstract: In almost no other field of computer science, the idea of using bio-inspired search paradigms has been so useful as in solving multiobjective optimization problems. The idea of using a population of search agents that collectively approximate the Pareto front resonates well with processes in natural evolution, immune systems, and swarm intelligence. Methods such as NSGA-II, SPEA2, SMS-EMOA, MOPSO, and MOEA/D became standard solvers when it comes to solving multiobjective optimization problems. This tutorial will review some of the most important fundamentals in multiobjective optimization and then introduce representative algorithms, illustrate their working principles, and discuss their application scope. In addition, the tutorial will discuss statistical performance assessment. Finally, it highlights recent important trends and closely related research fields. The tutorial is intended for readers, who want to acquire basic knowledge on the mathematical foundations of multiobjective optimization and state-of-the-art methods in evolutionary multiobjective optimization. The aim is to provide a starting point for researching in this active area, and it should also help the advanced reader to identify open research topics.

A novel Random Walk Grey Wolf Optimizer

Abstract: Grey Wolf Optimizer (GWO) algorithm is a relatively new algorithm in the field of swarm intelligence for solving continuous optimization problems as well as real world optimization problems. The Grey Wolf Optimizer is the only algorithm in the category of swam intelligence which is based on leadership hierarchy. This paper has three important aspects- Firstly, for improving the search ability by grey wolf a modified algorithm RW-GWO based on random walk has been proposed. Secondly, its performance is exhibited in comparison with GWO and state of art algorithms GSA, CS, BBO and SOS on IEEE CEC 2014 benchmark problems. A non-parametric test Wilcoxon and Performance Index Analysis has been performed to observe the impact of improving the leaders in the proposed algorithm. The results presented in this paper demonstrate that the proposed algorithm provide a better leadership to search a prey by grey wolves. The third aspect of the paper is to use the proposed algorithm and GWO on real life application problems. It is concluded from this article that RW-GWO algorithm is an efficient and reliable algorithm for solving not only continuous optimization problems but also for real life optimization problems.

Swarm Intelligence Algorithms for Feature Selection: A Review

Abstract: The increasingly rapid creation, sharing and exchange of information nowadays put researchers and data scientists ahead of a challenging task of data analysis and extracting relevant information out of data To be able to learn from data, the dimensionality of the data should be reduced first Feature selection (FS) can help to reduce the amount of data, but it is a very complex and computationally demanding task, especially in the case of high-dimensional datasets Swarm intelligence (SI) has been proved as a technique which can solve NP-hard (Non-deterministic Polynomial time) computational problems It is gaining popularity in solving different optimization problems and has been used successfully for FS in some applications With the lack of comprehensive surveys in this field, it was our objective to fill the gap in coverage of SI algorithms for FS We performed a comprehensive literature review of SI algorithms and provide a detailed overview of 64 different SI algorithms for FS, organized into eight major taxonomic categories We propose a unified SI framework and use it to explain different approaches to FS Different methods, techniques, and their settings are explained, which have been used for various FS aspects The datasets used most frequently for the evaluation of SI algorithms for FS are presented, as well as the most common application areas The guidelines on how to develop SI approaches for FS are provided to support researchers and analysts in their data mining tasks and endeavors while existing issues and open questions are being discussed In this manner, using the proposed framework and the provided explanations, one should be able to design an SI approach to be used for a specific FS problem

Nature Inspired Methods and Their Industry Applications—Swarm Intelligence Algorithms

Abstract: In this paper, we present the swarm intelligence (SI) concept and mention some metaheuristics belonging to the SI. We present the particle swarm optimization (PSO) algorithm and the ant colony optimization (ACO) method as the representatives of the SI approach. In recent years, researchers are eager to develop and apply a variety of these two methods, despite the development of many other newer methods as Bat or FireFly algorithms. Presenting the PSO and ACO we put their pseudocode, their properties, and intuition lying behind them. Next, we focus on their real-life applications, indicating many papers presented varieties of basic algorithms and the areas of their applications.

Particle Swarm Optimization: A survey of historical and recent developments with hybridization perspectives

Abstract: Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems that cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment, and improvements of its most basic as well as some of the very recent state-of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

Optimization using lion algorithm: a biological inspiration from lion’s social behavior

Abstract: Nature-inspired optimization algorithms, especially evolutionary computation-based and swarm intelligence-based algorithms are being used to solve a variety of optimization problems. Motivated by the obligation of having optimization algorithms, a novel optimization algorithm based on a lion’s unique social behavior had been presented in our previous work. Territorial defense and territorial takeover were the two most popular lion’s social behaviors. This paper takes the algorithm forward on rigorous and diverse performance tests to demonstrate the versatility of the algorithm. Four different test suites are presented in this paper. The first two test suites are benchmark optimization problems. The first suite had comparison with published results of evolutionary and few renowned optimization algorithms, while the second suite leads to a comparative study with state-of-the-art optimization algorithms. The test suite 3 takes the large-scale optimization problems, whereas test suite 4 considers benchmark engineering problems. The performance statistics demonstrate that the lion algorithm is equivalent to certain optimization algorithms, while outperforming majority of the optimization algorithms. The results also demonstrate the trade-off maintainability of the lion algorithm over the traditional algorithms.

A ga-LR Wrapper Approach for Feature Selection in Network Intrusion Detection

Abstract: Intrusions constitute one of the main issues in computer network security. Through malicious actions, hackers can have unauthorised access that compromises the integrity, the confidentiality, and the availability of resources or services. Intrusion detection systems (IDSs) have been developed to monitor and filter network activities by identifying attacks and alerting network administrators. Different IDS approaches have emerged using data mining, machine learning, statistical analysis, and artificial intelligence techniques such as genetic algorithms, artificial neural networks, fuzzy logic, swarm intelligence, etc. Due to the high dimensionality of the exchanged data, applying those techniques will be extremely time consuming. Feature selection is needed to select the optimal subset of features that represents the entire dataset to increase the accuracy and the classification performance of the IDS. In this work, we apply a wrapper approach based on a genetic algorithm as a search strategy and logistic regression as a learning algorithm for network intrusion detection systems to select the best subset of features. The experiment will be conducted on the KDD99 dataset and the UNSW-NB15 dataset. Three different decision tree classifiers are used to measure the performance of the selected subsets of features. The obtained results are compared with other feature selection approaches to verify the efficiency of our proposed approach.

Parallel bat algorithm for optimizing makespan in job shop scheduling problems

Abstract: Parallel processing plays an important role in efficient and effective computations of function optimization. In this paper, an optimization algorithm based on parallel versions of the bat algorithm (BA), random-key encoding scheme, communication strategy scheme and makespan scheme is proposed to solve the NP-hard job shop scheduling problem. The aim of the parallel BA with communication strategies is to correlate individuals in swarms and to share the computation load over few processors. Based on the original structure of the BA, the bat populations are split into several independent groups. In addition, the communication strategy provides the diversity-enhanced bats to speed up solutions. In the experiment, forty three instances of the benchmark in job shop scheduling data set with various sizes are used to test the behavior of the convergence, and accuracy of the proposed method. The results compared with the other methods in the literature show that the proposed scheme increases more the convergence and the accuracy than BA and particle swarm optimization.

A survey of swarm intelligence for portfolio optimization: Algorithms and applications

Abstract: In portfolio optimization (PO), often, a risk measure is an objective to be minimized or an efficient frontier representing the best tradeoff between return and risk is sought. In order to overcome computational difficulties of this NP-hard problem, a growing number of researchers have adopted swarm intelligence (SI) methodologies to deal with PO. The main PO models are summarized, and the suggested SI methodologies are analyzed in depth by conducting a survey from the recent published literature. Hence, this study provides a review of the SI contributions to PO literature and identifies areas of opportunity for future research.

Swarm intelligence: past, present and future

Abstract: Many optimization problems in science and engineering are challenging to solve, and the current trend is to use swarm intelligence (SI) and SI-based algorithms to tackle such challenging problems. Some significant developments have been made in recent years, though there are still many open problems in this area. This paper provides a short but timely analysis about SI-based algorithms and their links with self-organization. Different characteristics and properties are analyzed here from both mathematical and qualitative perspectives. Future research directions are outlined, and open questions are also highlighted.

Artificial Intelligence: With an Introduction to Machine Learning, Second Edition

Abstract: The first edition of this popular textbook, Contemporary Artificial Intelligence, provided an accessible and student friendly introduction to AI This fully revised and expanded update, Artificial Intelligence: With an Introduction to Machine Learning, Second Edition, retains the same accessibility and problem-solving approach, while providing new material and methods The book is divided into five sections that focus on the most useful techniques that have emerged from AI The first section of the book covers logic-based methods, while the second section focuses on probability-based methods Emergent intelligence is featured in the third section and explores evolutionary computation and methods based on swarm intelligence The newest section comes next and provides a detailed overview of neural networks and deep learning The final section of the book focuses on natural language understanding Suitable for undergraduate and beginning graduate students, this class-tested textbook provides students and other readers with key AI methods and algorithms for solving challenging problems involving systems that behave intelligently in specialized domains such as medical and software diagnostics, financial decision making, speech and text recognition, genetic analysis, and more

Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem

Abstract: Particle swarm optimization (PSO) algorithm, one of the most popular swarm intelligence algorithms, has been widely studied and applied to a large number of continuous and discrete optimization problems. In this paper, a discrete comprehensive learning PSO algorithm, which uses acceptance criterion of simulated annealing algorithm, is proposed for Traveling Salesman Problem (TSP). A new flight equation, which can learn both from personal best of each particle and features of problem at hand, is designed for TSP problem. Lazy velocity, which is calculated in each dimension only when needed, is proposed to enhance the effectiveness of velocity. Eager evaluation, which evaluates each intermediate solution after velocity component is applied to the solution, is proposed to search the solution space more finely. Aiming to enhance its ability to escape from premature convergence, particle uses Metropolis acceptance criterion to decide whether to accept newly produced solutions. Systematic experiments were carried to show the advantage of the new flight equation, to verify the necessity to use non-greedy acceptance strategy for keeping sufficient diversity, and to compare lazy velocity and eager velocity. The comparison, carried on a wide range of benchmark TSP problems, has shown that the proposed algorithm is better than or competitive with many other state-of-the-art algorithms.

A new bat algorithm based on iterative local search and stochastic inertia weight

Abstract: Bat algorithm (BA) is a heuristic optimization algorithm based on swarm intelligence and the inspiration from the nature behavior of bats. It has some advantages including fast solving speed, high precision and only few parameters need to be adjusted. However, BA is easy to fall into local optima and has unstable optimization results due to low global exploration ability. In order to overcome these weakness, a new bat algorithm based on iterative local search and stochastic inertia weight (ILSSIWBA) is proposed in this paper. A kind of local search algorithm, called iterative local search (ILS) is introduced into the proposed algorithm. The ILS algorithm disturbs the local optimum and do some local re-search, so that the ILSSIWBA has strong ability to jump out of the local optima. In addition, a weight updating method, called stochastic inertia weight (SIW) is also introduced into the proposed algorithm. Considering the SIW in the velocity updating equation can enhance the diversity and flexibility of bat population, so that the ILSSIWBA has stable optimization results. Meanwhile, the pulse rate and loudness are modified to enhance the balance performance between global and local search. Moreover, the global convergence of ILSSIWBA is proved by the convergence criteria of stochastic algorithm. In the end, the ILSSIWBA is compared with directional bat algorithm (DBA) and other algorithms on 10 classic benchmark functions, CEC 2005 benchmark suite, and two real-world problems. The results show that ILSSIWBA has remarkable advantages in optimization accuracy, solving speed and convergence stability. This algorithm lays a solid foundation for solving modeling, optimization and control problems of complex systems.