Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training

Background  

Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influenced by several "strategy parameters". Choosing reasonable parameter values for the PSO is crucial for its convergence behavior, and depends on the optimization task. We present a method for parameter meta-optimization based on PSO and its application to neural network training. The concept of the Optimized Particle Swarm Optimization (OPSO) is to optimize the free parameters of the PSO by having swarms within a swarm. We assessed the performance of the OPSO method on a set of five artificial fitness functions and compared it to the performance of two popular PSO implementations.     

Density estimation using a new dimension adaptive particle swarm optimization algorithm

Current Particle Swarm Optimization (PSO) algorithms do not address problems with unknown dimensions, which arise in many applications that would benefit from the use of PSO. In this paper, we propose a new algorithm, called Dimension Adaptive Particle Swarm Optimization (DA-PSO) that can address problems with any number of dimensions. We also propose and compare three other PSO-based methods with DA-PSO. We apply our algorithms to solve the Weibull mixture model density estimation problem as an illustration. DA-PSO achieves better objective function values than other PSO-based algorithms on four simulated datasets and a real dataset. We also compare DA-PSO with the recursive Expectation-Maximization (EM) estimator, which is a non-PSO-based method, obtaining again very good results.     

Task scheduling on computational Grids using Gravitational Search Algorithm

Grid computing uses distributed interconnected computers and resources collectively to achieve higher performance computing and resource sharing. Task scheduling is one of the core steps to efficiently exploit the capabilities of Grid environment. Recently, heuristic algorithms have been successfully applied to solve task scheduling on computational Grids. In this paper, Gravitational Search Algorithm (GSA), as one of the latest population-based metaheuristic algorithms, is used for task scheduling on computational Grids. The proposed method employs GSA to find the best solution with the minimum makespan and flowtime. We evaluate this approach with Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) method. The results demonstrate that the benefit of the GSA is its speed of convergence and the capability to obtain feasible schedules.     

Optimal Formation Reconfiguration Control of Multiple UCAVs Using Improved Particle Swarm Optimization

Optimal formation reconfiguration control of multiple Uninhabited Combat Air Vehicles （UCAVs） is a complicated global optimum problem. Particle Swarm Optimization （PSO） is a population based stochastic optimization technique inspired by social behaviour of bird flocking or fish schooling. PSO can achieve better results in a faster, cheaper way compared with other bio-inspired computational methods, and there are few parameters to adjust in PSO. In this paper, we propose an improved PSO model for solving the optimal formation reconfiguration control problem for multiple UCAVs. Firstly, the Control Parameterization and Time Diseretization （CPTD） method is designed in detail. Then, the mutation strategy and a special mutation-escape operator are adopted in the improved PSO model to make particles explore the search space more efficiently. The proposed strategy can produce a large speed value dynamically according to the variation of the speed, which makes the algorithm explore the local and global minima thoroughly at the same time. Series experimental results demonstrate the feasibility and effectiveness of the proposed method in solving the optimal formation reconfiguration control problem for multiple UCAVs.     

Hybrid Symbiotic Organisms Search Optimization Algorithm for Scheduling of Tasks on Cloud Computing Environment

Cloud computing has attracted significant attention from research community because of rapid migration rate of Information Technology services to its domain. Advances in virtualization technology has made cloud computing very popular as a result of easier deployment of application services. Tasks are submitted to cloud datacenters to be processed on pay as you go fashion. Task scheduling is one the significant research challenges in cloud computing environment. The current formulation of task scheduling problems has been shown to be NP-complete, hence finding the exact solution especially for large problem sizes is intractable. The heterogeneous and dynamic feature of cloud resources makes optimum task scheduling non-trivial. Therefore, efficient task scheduling algorithms are required for optimum resource utilization. Symbiotic Organisms Search (SOS) has been shown to perform competitively with Particle Swarm Optimization (PSO). The aim of this study is to optimize task scheduling in cloud computing environment based on a proposed Simulated Annealing (SA) based SOS (SASOS) in order to improve the convergence rate and quality of solution of SOS. The SOS algorithm has a strong global exploration capability and uses fewer parameters. The systematic reasoning ability of SA is employed to find better solutions on local solution regions, hence, adding exploration ability to SOS. Also, a fitness function is proposed which takes into account the utilization level of virtual machines (VMs) which reduced makespan and degree of imbalance among VMs. CloudSim toolkit was used to evaluate the efficiency of the proposed method using both synthetic and standard workload. Results of simulation showed that hybrid SOS performs better than SOS in terms of convergence speed, response time, degree of imbalance, and makespan.     

A cooperative particle swarm optimizer with migration of heterogeneous probabilistic models

Particle Swarm Optimization (PSO) is a stochastic optimization approach that originated from simulations of bird flocking, and that has been successfully used in many applications as an optimization tool. Estimation of distribution algorithms (EDAs) are a class of evolutionary algorithms which perform a two-step process: building a probabilistic model from which good solutions may be generated and then using this model to generate new individuals. Two distinct research trends that emerged in the past few years are the hybridization of PSO and EDA algorithms and the parallelization of EDAs to exploit the idea of exchanging the probabilistic model information. In this work, we propose the use of a cooperative PSO/EDA algorithm based on the exchange of heterogeneous probabilistic models. The model is heterogeneous because the cooperating PSO/EDA algorithms use different methods to sample the search space. Three different exchange approaches are tested and compared in this work. In all these approaches, the amount of information exchanged is adapted based on the performance of the two cooperating swarms. The performance of the cooperative model is compared to the existing state-of-the-art PSO cooperative approaches using a suite of well-known benchmark optimization functions.     

基于粒子群优化算法的脑磁图源定位

脑磁图作为一种新型的脑探测技术,具有较高定位精度和毫秒级时间分辨率的特点。快速准确地利用脑磁图技术对三维空间中的脑神经活动源进行定位,对于脑功能研究和医学临床应用都具有重要的应用价值。可是,目前的脑磁图源定位广泛采用了多信号分类方法,它要求对三维大脑空间进行全局扫描,需要大量的计算,存在速度慢的缺点。针对这一问题,提出了一种基于粒子群优化算法的脑磁图源定位方法。先利用粒子群优化算法全局搜索能力强的特点寻找出目标函数的全局最优值,进行初步的脑磁图源定位;然后,再在小范围内进行小网格的搜索,进一步实现精确的定位。实验结果表明,基于粒子群优化算法的脑磁图源定位能够很好地解决上述问题,具有计算速度快、定位精度高的特点。     

A novel feature selection method for data mining tasks using hybrid Sine Cosine Algorithm and Genetic Algorithm

Feature selection (FS) is a real-world problem that can be solved using optimization techniques. These techniques proposed solutions to make a predictive model, which minimizes the classifier's prediction errors by selecting informative or important features by discarding redundant, noisy, and irrelevant attributes in the original dataset. A new hybrid feature selection method is proposed using the Sine Cosine Algorithm (SCA) and Genetic Algorithm (GA), called SCAGA. Typically, optimization methods have two main search strategies; exploration of the search space and exploitation to determine the optimal solution. The proposed SCAGA resulted in better performance when balancing between exploitation and exploration strategies of the search space. The proposed SCAGA has also been evaluated using the following evaluation criteria: classification accuracy, worst fitness, mean fitness, best fitness, the average number of features, and standard deviation. Moreover, the maximum accuracy of a classification and the minimal features were obtained in the results. The results were also compared with a basic Sine Cosine Algorithm (SCA) and other related approaches published in literature such as Ant Lion Optimization and Particle Swarm Optimization. The comparison showed that the obtained results from the SCAGA method were the best overall the tested datasets from the UCI machine learning repository.

     

A novel task scheduling approach based on dynamic queues and hybrid meta-heuristic algorithms for cloud computing environment

Task scheduling is one of the most challenging aspects to improve the overall performance of cloud computing and optimize cloud utilization and Quality of Service (QoS). This paper focuses on Task Scheduling optimization using a novel approach based on Dynamic dispatch Queues (TSDQ) and hybrid meta-heuristic algorithms. We propose two hybrid meta-heuristic algorithms, the first one using Fuzzy Logic with Particle Swarm Optimization algorithm (TSDQ-FLPSO), the second one using Simulated Annealing with Particle Swarm Optimization algorithm (TSDQ-SAPSO). Several experiments have been carried out based on an open source simulator (CloudSim) using synthetic and real data sets from real systems. The experimental results demonstrate the effectiveness of the proposed approach and the optimal results is provided using TSDQ-FLPSO compared to TSDQ-SAPSO and other existing scheduling algorithms especially in a high dimensional problem. The TSDQ-FLPSO algorithm shows a great advantage in terms of waiting time, queue length, makespan, cost, resource utilization, degree of imbalance, and load balancing.     

V - Channel magnification enabled by hybrid optimization algorithm: Enhancement of video super resolution

Although being a really active area of research, television super-resolution remains a difficult problem. Additionally, it is noted that the blur motion and computational crisis hinder the enhancement. As a result, the goal of this research is to present a brand-new smart SR framework for the camera shot. To create High Resolution (HR) videos, first frames in RGB format are converted to HSV and then the V-channel is enhanced. In order to create enriched video frames, a high - dimension grid with enhanced pixel intensity is then created. This paper introduces a particular progression to enable this: Motion estimation, Cubic Spline Interpolation, and Deblurring or Sharpening are the three methods. By carefully adjusting the parameters, the cubic spline interpolation is improved during operation. A brand-new hybrid technique dubbed Lion with Particle Swarm Velocity Update (LPSO-VU), which combines the principles of the Lion Algorithm (LA) and Particle Swarm Optimization (PSO) algorithms, is presented for this optimal tuning purpose. Finally, using the BRISQUE, SDME, and ESSIM metrics, the adequacy of the method is contrasted to other traditional models, and its superiority is demonstrated. Accordingly, the analysis shows that the suggested LPSO-VU model for video frame 1 is 16.6%, 25.56%, 26.2%, 26.2%, and 27.2% superior to the previous systems like PSO, GWO, WOA, ROA, MF-ROA, and LA, respectively, in terms of BRISQUE.     

A Comprehensive Review of Swarm Optimization Algorithms

Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches.     

Benchmarking the Clustering Performances of Evolutionary Algorithms: A Case Study on Varying Data Size

Background and objectiveClustering is a widely used popular method for data analysis within many clustering algorithms for years. Today it is used in many predictions, collaborative filtering and automatic segmentation systems on different domains. Also, to be broadly used in practice, such clustering algorithms need to give both better performance and robustness when compared to the ones currently used. In recent years, evolutionary algorithms are used in many domains since they are robust and easy to implement. And many clustering problems can be easily solved with such algorithms if the problem is modeled as an optimization problem. In this paper, we present an optimization approach for clustering by using four well-known evolutionary algorithms which are Biogeography-Based Optimization (BBO), Grey Wolf Optimization (GWO), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).Methodthe objective function has been specified to minimize the total distance from cluster centers to the data points. Euclidean distance is used for distance calculation. We have applied this objective function to the given algorithms both to find the most efficient clustering algorithm and to compare the clustering performances of algorithms against different data sizes. In order to benchmark the clustering performances of algorithms in the experiments, we have used a number of datasets with different data sizes such as some small scale, medium and big data. The clustering performances have been compared to K-means as it is a widely used clustering algorithm for years in literature. Rand Index, Adjusted Rand Index, Mirkin's Index and Hubert's Index have been considered as parameters for evaluating the clustering performances.ResultAs a result of the clustering experiments of algorithms over different datasets with varying data sizes according to the specified performance criteria, GA and GWO algorithms show better clustering performances among the others.ConclusionsThe results of the study showed that although the algorithms have shown satisfactory clustering results on small and medium scale datasets, the clustering performances on Big data need to be improved.     

Distributed scalable multi-robot learning using particle swarm optimization

Designing effective behavioral controllers for mobile robots can be difficult and tedious; this process can be circumvented by using online learning techniques which allow robots to generate their own controllers online in an automated fashion. In multi-robot systems, robots operating in parallel can potentially learn at a much faster rate by sharing information amongst themselves. In this work, we use an adapted version of the Particle Swarm Optimization algorithm in order to accomplish distributed online robotic learning in groups of robots with access to only local information. The effectiveness of the learning technique on a benchmark task (generating high-performance obstacle avoidance behavior) is evaluated for robot groups of various sizes, with the maximum group size allowing each robot to individually contain and manage a single PSO particle. To increase the realism of the technique, different PSO neighborhoods based on limitations of real robotic communication are tested and compared in this scenario. We explore the effect of varying communication power for one of these communication-based PSO neighborhoods. To validate the effectiveness of these learning techniques, fully distributed online learning experiments are run using a group of 10 real robots, generating results which support the findings from our simulations.     

A competitive clustering particle swarm optimizer for dynamic optimization problems

Optimization in dynamic optimization problems (DOPs) requires the optimization algorithms not only to locate, but also to continuously track the moving optima. Particle swarm optimization (PSO) is a population-based optimization algorithm, originally developed for static problems. Recently, several researchers have proposed variants of PSO for optimization in DOPs. This paper presents a novel multi-swarm PSO algorithm, namely competitive clustering PSO (CCPSO), designed specially for DOPs. Employing a multi-stage clustering procedure, CCPSO splits the particles of the main swarm over a number of sub-swarms based on the particles positions and on their objective function values. The algorithm automatically adjusts the number of sub-swarms and the corresponding region of each sub-swarm. In addition to the sub-swarms, there is also a group of free particles that explore the environment to locate new emerging optima or exploit the current optima which are not followed by any sub-swarm. The adaptive search strategy adopted by the sub-swarms improves both the exploitation and tracking characteristics of CCPSO. A set of experiments is conducted to study the behavior of the proposed algorithm in different DOPs and to provide guidelines for setting the algorithm’s parameters in different problems. The results of CCPSO on a variety of moving peaks benchmark (MPB) functions are compared with those of several state-of-the-art PSO algorithms, indicating the efficiency of the proposed model.     

Performance evaluation of TRIBES, an adaptive particle swarm optimization algorithm

This paper presents a study of the performance of TRIBES, an adaptive particle swarm optimization algorithm. Particle Swarm Optimization (PSO) is a biologically-inspired optimization method. Recently, researchers have used it effectively in solving various optimization problems. However, like most optimization heuristics, PSO suffers from the drawback of being greatly influenced by the selection of its parameter values. Thus, the common belief is that the performance of a PSO algorithm is directly related to the tuning of such parameters. Usually, such tuning is a lengthy, time consuming and delicate process. A new adaptive PSO algorithm called TRIBES avoids manual tuning by defining adaptation rules which aim at automatically changing the particles’ behaviors as well as the topology of the swarm. In TRIBES, the topology is changed according to the swarm behavior and the strategies of displacement are chosen according to the performances of the particles. A comparative study carried out on a large set of benchmark functions shows that the performance of TRIBES is quite competitive compared to most other similar PSO algorithms that need manual tuning of parameters. The performance evaluation of TRIBES follows the testing procedure introduced during the 2005 IEEE Conference on Evolutionary Computation. The main objective of the present paper is to perform a global study of the behavior of TRIBES under several conditions, in order to determine strengths and drawbacks of this adaptive algorithm.     

基于PSO-LSSVR模型的土壤肥力评价

通过引入粒子群算法(PSO)和最小二乘支持向量机(LSSVR),提出基于PSO-LSSVR的土壤肥力评价模型。选取有机质、全氮速效磷、速效钾、阳离子交换量、酸碱度、容重、黏粒、水稳性团聚体和分散率等10种评价指标,以吉林省黑地为例,建立土壤肥力评价模型。同时与物元可拓法、普通SVM模型的评价结果进行比较;3种方法的多数样本评价结果基本一致,对于样本2、样本13,PSO-LSSVR模型分别定为Ⅳ级、Ⅲ级,符合实际情况;表明PSO-LSSVR是一种适用且能准确反映土壤特性的土壤肥力评价模型。     

Determining the optimum model parameters for oligosaccharide production efficiency using response surface integrated particle swarm optimization method: an experimental validation study

Abstract

Glucansucrases (GTFs) catalyzes the synthesis of α-glucans from sucrose and oligosaccharides in the presence of an acceptor sugar by transferring glucosyl units to the acceptor molecule with different linkages. The acceptor reactions can be affected by several parameters and this study aimed to determine the optimal reaction parameters for the production of glucansucrase-based oligosaccharides using sucrose and maltose as the donor and acceptor sugars, respectively via a hybrid technique of Response Surface Method (RSM) and Particle Swarm Optimization (PSO). The experimental design was performed using Central Composite Design and the tested parameters were enzyme concentration, acceptor:donor ratio and the reaction period. The optimization studies showed that enzyme concentration was the most effective parameter for the final oligosaccharides yields. The optimal values of the significant parameters determined for enzyme concentration and acceptor:donor ratio were 3.45?U and 0.62, respectively. Even the response surface plots for input parameters verified the PSO results, an experimental validation study was performed for the reverification. The experimental verification results obtained were also consistent with the PSO results. These findings will help our understanding in the role of different parameters for the production of oligosaccharides in the acceptor reactions of GTFs.     

Small and Dim Target Detection via Lateral Inhibition Filtering and Artificial Bee Colony Based Selective Visual Attention

This paper proposed a novel bionic selective visual attention mechanism to quickly select regions that contain salient objects to reduce calculations. Firstly, lateral inhibition filtering, inspired by the limulus’ ommateum, is applied to filter low-frequency noises. After the filtering operation, we use Artificial Bee Colony (ABC) algorithm based selective visual attention mechanism to obtain the interested object to carry through the following recognition operation. In order to eliminate the camera motion influence, this paper adopted ABC algorithm, a new optimization method inspired by swarm intelligence, to calculate the motion salience map to integrate with conventional visual attention. To prove the feasibility and effectiveness of our method, several experiments were conducted. First the filtering results of lateral inhibition filter were shown to illustrate its noise reducing effect, then we applied the ABC algorithm to obtain the motion features of the image sequence. The ABC algorithm is proved to be more robust and effective through the comparison between ABC algorithm and popular Particle Swarm Optimization (PSO) algorithm. Except for the above results, we also compared the classic visual attention mechanism and our ABC algorithm based visual attention mechanism, and the experimental results of which further verified the effectiveness of our method.     

Application of CT images in the diagnosis of lung cancer based on finite mixed model

ObjectiveInvestigating the application of CT images when diagnosing lung cancer based on finite mixture model is the objective. Method: 120 clean healthy rats were taken as the research objects to establish lung cancer rat model and carry out lung CT image examination. After the successful CT image data preprocessing, the image is segmented by different methods, which include lung nodule segmentation on the basis of Adaptive Particle Swarm Optimization – Gaussian mixture model (APSO-GMM), lung nodule segmentation on the basis of Adaptive Particle Swarm Optimization – gamma mixture model (APSO-GaMM), lung nodule segmentation based on statistical information and self-selected mixed distribution model, and lung nodule segmentation based on neighborhood information and self-selected mixed distribution model. The segmentation effect is evaluated. Results: Compared with the results of lung nodule segmentation based on statistical information and self-selected mixed distribution model, the Dice coefficient of lung nodule segmentation based on neighborhood information and self-selected mixed distribution model is higher, the relative final measurement accuracy is smaller, the segmentation is more accurate, but the running time is longer. Compared with APSO-GMM and APSO-GaMM, the dice value of self-selected mixed distribution model segmentation method is larger, and the final measurement accuracy is smaller. Conclusion: Among the five methods, the dice value of the self-selected mixed distribution model based on neighborhood information is the largest, and the relative accuracy of the final measurement is the smallest, indicating that the segmentation effect of the self-selected mixed distribution model based on neighborhood information is the best.