Particles In Particle Swarm Optimization Research Articles

Computational Properties of Hybrid Methods with PSO and DE

SUMMARYIn this paper, we present a new type of hybrid methods for global optimization with particle swarm optimization (PSO) and differential evolution (DE), which have been attracting interest as heuristic and global optimization methods. Concretely, “p‐best solutions” as the targets of PSO's particles are actuated by DE's evolutional mechanism in order to promote PSO's global searching ability. The presented hybrid method works effectively because PSO acts as a local optimizer and DE plays a role as a global optimizer. To evaluate performance of the hybridization, our method is applied to some benchmarks and is compared with the separated PSO and DE. Through computer simulations, it is demonstrated that the proposed hybrid method performs rather better than the component algorithms separately.

A particle swarm optimization based simultaneous learning framework for clustering and classification

A particle swarm optimization based simultaneous learning framework for clustering and classification (PSOSLCC) is proposed in this paper. Firstly, an improved particle swarm optimization (PSO) is used to partition the training samples, the number of clusters must be given in advance, an automatic clustering algorithm rather than the trial and error is adopted to find the proper number of clusters, and a set of clustering centers is obtained to form classification mechanism. Secondly, in order to exploit more useful local information and get a better optimizing result, a global factor is introduced to the update strategy update strategy of particle in PSO. PSOSLCC has been extensively compared with fuzzy relational classifier (FRC), vector quantization and learning vector quantization (VQ+LVQ3), and radial basis function neural network (RBFNN), a simultaneous learning framework for clustering and classification (SCC) over several real-life datasets, the experimental results indicate that the proposed algorithm not only greatly reduces the time complexity, but also obtains better classification accuracy for most datasets used in this paper. Moreover, PSOSLCC is applied to a real world application, namely texture image segmentation with a good performance obtained, which shows that the proposed algorithm has a potential of classifying the problems with large scale.

Towards the novel reasoning among particles in PSO by the use of RDF and SPARQL.

The significant development of the Internet has posed some new challenges and many new programming tools have been developed to address such challenges. Today, semantic web is a modern paradigm for representing and accessing knowledge data on the Internet. This paper tries to use the semantic tools such as resource definition framework (RDF) and RDF query language (SPARQL) for the optimization purpose. These tools are combined with particle swarm optimization (PSO) and the selection of the best solutions depends on its fitness. Instead of the local best solution, a neighborhood of solutions for each particle can be defined and used for the calculation of the new position, based on the key ideas from semantic web domain. The preliminary results by optimizing ten benchmark functions showed the promising results and thus this method should be investigated further.

Feature selection and classifier parameters estimation for EEG signals peak detection using particle swarm optimization.

Electroencephalogram (EEG) signal peak detection is widely used in clinical applications. The peak point can be detected using several approaches, including time, frequency, time-frequency, and nonlinear domains depending on various peak features from several models. However, there is no study that provides the importance of every peak feature in contributing to a good and generalized model. In this study, feature selection and classifier parameters estimation based on particle swarm optimization (PSO) are proposed as a framework for peak detection on EEG signals in time domain analysis. Two versions of PSO are used in the study: (1) standard PSO and (2) random asynchronous particle swarm optimization (RA-PSO). The proposed framework tries to find the best combination of all the available features that offers good peak detection and a high classification rate from the results in the conducted experiments. The evaluation results indicate that the accuracy of the peak detection can be improved up to 99.90% and 98.59% for training and testing, respectively, as compared to the framework without feature selection adaptation. Additionally, the proposed framework based on RA-PSO offers a better and reliable classification rate as compared to standard PSO as it produces low variance model.

ALTERNATİF ROTALI HÜCRE OLUŞTURMA PROBLEMLERİNİN ÇÖZÜMÜ İÇİN YENİ BİR MELEZ YAKLAŞIM

Normal 0 false false false TR JA X-NONE Normal 0 false false false EN-US JA X-NONE In this study a hybrid approach based on Particle Swarm Optimization (PSO) and Competitive Neural Network (CNN) is proposed to solve cell formation problems with alternative routings. Particles in PSO are decoded as representation of routings which will be followed by each part. By using the route information of the particles a cell formation problem without alternative routings corresponding to each particle is obtained. This reduced problem is solved by a Competitive Neural Network approach and its grouping efficacy result is assigned to particle as a fitness value. Furthermore, in order to demonstrate efficiency of the PSO-CNN hybrid approach, proposed method is compared with purely PSO and Simulated Annealing – CNN hybrid as other two methods developed for solving same problem. Performance of the PSO-CNN approach is shown on the test problems with comparisons. Normal 0 21 false false false TR X-NONE X-NONE

Meta-heuristic algorithms for optimized network flow wavelet-based image coding

Optimal multipath selection to maximize the received multiple description coding (MDCs) in a lossy network model is proposed. Multiple description scalar quantization (MDSQ) has been applied to the wavelet coefficients of a color image to generate the MDCs which are combating transmission loss over lossy networks. In the networks, each received description raises the reconstruction quality of an MDC-coded signal (image, audio or video). In terms of maximizing the received descriptions, a greater number of optimal routings between source and destination must be obtained. The rainbow network flow (RNF) collaborated with effective meta-heuristic algorithms is a good approach to resolve it. Two meta-heuristic algorithms which are genetic algorithm (GA) and particle swarm optimization (PSO) have been utilized to solve the multi-objective optimization routing problem for finding optimal routings each of which is assigned as a distinct color by RNF to maximize the coded descriptions in a network model. By employing a local search based priority encoding method, each individual in GA and particle in PSO is represented as a potential solution. The proposed algorithms are compared with the multipath Dijkstra algorithm (MDA) for both finding optimal paths and providing reliable multimedia communication. The simulations run over various random network topologies and the results show that the PSO algorithm finds optimal routings effectively and maximizes the received MDCs with assistance of RNF, leading to reduce packet loss and increase throughput.

Particle swarm optimization-based neural network control for an electro-hydraulic servo system

This paper focuses on an electro-hydraulic servo system, which is derived from a shaking table. It proposes a control scheme based on a back propagation (BP) neural network, whose weights are trained by the particle swarm optimization (PSO) according to the fitness, which is determined by the input and the feedback signals. Each particle of PSO includes weights and thresholds of BP. The movement of each particle is adjusted by its local best-known position and the global best-known position in the searching space. With the update, a satisfactory solution can be achieved. In order to show the performance of the proposed control scheme, the designed network is also trained and tested by BP only. The comparisons between the PSO-BP and BP networks demonstrate that the PSO-BP one has better performance than that of BP, both in convergence speed and in convergence accuracy.

A novel reactive power optimization solution using improved chaos PSO based on multi-agent architecture

SUMMARY Reactive power optimization plays an important role in safe and economic operation of power systems. However, with multiple mixed variables, this issue is well known as complex, nonlinear and multi-constrained. In this paper, combined particle swarm optimization (PSO) algorithm with chaos and multi-agent system, a novel algorithm (MACPSO) is developed and applied to reactive power optimization of power system. It synthesizes advantages of the swarm search of PSO and the intelligent search of agents. Seen as a particle of PSO during the search process, each agent competes and cooperates with the neighboring agents so as to obtain solutions of high quality swiftly. To strike a balance between intensification and diversification strategy and to reduce the probability of falling into local optimum, chaos optimization algorithm is adopted in the proposed algorithm. In order to verify the effectiveness of the proposed algorithm, the performance of MACPSO is evaluated on four classical testing functions and reactive power optimization. Experiment results show that MACPSO has excellent search ability and highly accurate convergence. Copyright © 2013 John Wiley & Sons, Ltd.

Robust trifocal tensor constraints for structure from motion estimation

It is important to estimate accurate camera parameters in multi-view stereo. In this paper, we use three-view relations, the trifocal tensor, to improve the Bundler, a popular structure from motion (SfM) system, for estimating accurate camera parameters. We propose a novel method: the Robust Orthogonal Particle Swarm Optimization (ROPSO) to estimate a robust and accurate trifocal tensor. In ROPSO, we formulate the trifocal tensor estimation as a global optimization problem and use the particle swarm optimization (PSO) for parameter searching. The orthogonal array is used to select the representative initial particles in PSO for more stable results. In the experiments, we use simulated and real ground truth data for statistical analysis. The experimental results show that the proposed ROPSO can achieve more accurate estimation of the trifocal tensor than the traditional methods and has higher probability to find the optimization solution than the traditional methods. Based on the trifocal tensor estimated by the proposed method, the SfM estimation errors can effectively be reduced. The average reprojection errors are reduced from 21.5 pixels to less than 1 pixel.

Parallel Swarms Oriented Particle Swarm Optimization

The particle swarm optimization (PSO) is a recently invented evolutionary computation technique which is gaining popularity owing to its simplicity in implementation and rapid convergence. In the case of single-peak functions, PSO rapidly converges to the peak; however, in the case of multimodal functions, the PSO particles are known to get trapped in the local optima. In this paper, we propose a variation of the algorithm called parallel swarms oriented particle swarm optimization (PSO-PSO) which consists of a multistage and a single stage of evolution. In the multi-stage of evolution, individual subswarms evolve independently in parallel, and in the single stage of evolution, the sub-swarms exchange information to search for the global-best. The two interweaved stages of evolution demonstrate better performance on test functions, especially of higher dimensions. The attractive feature of the PSO-PSO version of the algorithm is that it does not introduce any new parameters to improve its convergence performance. The strategy maintains the simple and intuitive structure as well as the implemental and computational advantages of the basic PSO.

Analysis of Population Based Metaheuristic Used for Gene Clustering

Gene Clustering is one of the most popular application in the field of Bioinformatics. It is a method of grouping gene into clusters, such that each cluster must have similar gene expression levels. The two most popular population based globalized search algorithms Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for clustering gene expression data but the main drawback of these two algorithm's is that they got trapped in local optima while exploring across the problem space. So the PSO and GA has been hybridized with several other methods, to overcome the local optima problem. This paper presents a literature survey of both GA and PSO's application in Gene Clustering. PSO and GA variants and their hybridization with other metaheuristics are also described in this paper. An attempt is made to provide a guide for the researchers who are working in the area of population based gene clustering. Bioinformatics field deals with the analysis of the biological data, which stored information in the form of DNA, protein sequence in various biological databases. The Bioinformatics field involves various problem such as Gene Clustering Problem, Molecular Docking Problem, Multiple Sequence Alignment Problems, Phylogenetic tree construction , RNA Secondary Structure Prediction, Protein Secondary Structure Prediction, Fragment Assembly Problem. In Gene Clustering the gene is defined as a sequence of nucleotide bases, which carry the required information for the purpose of protein formation, which helps in the construction of the structural components. Clustering is a process of combining input patterns into groups based on the similar functionality. So, Gene clustering is a process of grouping genes in the same clusters based on similar gene expression levels. Gene expression refers to a process through which the coded information from a gene is converted into structures operating in the cell. In order to cluster the Gene expression data , various population based algorithms were used by a number of researchers. The two most popular algorithms among these are PSO (Particle Swarm Optimization) and

Quantum behaved Particle Swarm Optimization with Differential Mutation operator applied to WWER-1000 in-core fuel management optimization

This paper presents a new method using Quantum Particle Swarm Optimization with Differential Mutation operator (QPSO-DM) for optimizing WWER-1000 core fuel management. Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) have shown good performance on in-core fuel management optimization (ICFMO). The objective of this paper is to show that QPSO-DM performs very well and is comparable to PSO and Quantum Particle Swarm Optimization (QPSO). Most of the strategies for ICFMO are based on maximizing multiplication factor (keff) to increase cycle length and minimizing power peaking factor (Pq) in order to improve fuel integrity. PSO, QPSO and QPSO-DM have been implemented to fulfill these requirements for the first operating cycle of WWER-1000 Bushehr Nuclear Power Plant (BNPP). The results show that QPSO-DM performs better than the others. A program has been written in MATLAB to map PSO, QPSO and QPSO-DM for loading pattern optimization. WIMS and CITATION have been used to simulate reactor core for neutronic calculations.

A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

The vehicle routing problem (VRP) is a well‐known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI) approaches, ant colony optimization (ACO) and particle swarm optimization (PSO), for solving capacitated vehicle routing problems (CVRPs). In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best‐so‐far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

Particle swarm algorithm with hybrid mutation strategy

A new particle swarm optimization (PSO) that incorporates a hybrid mutation strategy is proposed. In this paper we first use the Monte Carlo method to investigate the behavior of the particle in PSO. The results reveal the essence of the particle's trajectory during executions and the reasons why PSO has relative poor global searching ability especially in the last stage of evolution. Then we present a new hybrid particle swarm optimization which incorporates Henon map mutation operation (HPSO) so as to enhance the achievement of PSO. The new mutation strategy divides the mutation operator into global and local mutation operators, then it enables the particles to have stronger exploration ability and fast convergence rate. Sixteen benchmark functions are used to test the performance of HPSO. The results show that the new PSO algorithm performs better than the other hybrid PSO algorithms for each of the test functions. Meanwhile, HPSO is applied to a practical problem (i.e., the economic dispatch problem in a power system) with a satisfying result.

A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem

A Particle Swarm Optimization (PSO) algorithm for a Flow Shop Sequence Dependent Group Scheduling (FSDGS) problem, with minimization of total flow time as the criterion (Fm|fmls,Splk,prmu|∑Cj), is proposed in this research. An encoding scheme based on Ranked Order Value (ROV) is developed, which converts the continuous position value of particles in PSO to job and group permutations. A neighborhood search strategy, called Individual Enhancement (IE), is fused to enhance the search and to balance the exploration and exploitation. The performance of the algorithm is compared with the best available meta-heuristic algorithm in literature, i.e. the Ant Colony Optimization (ACO) algorithm, based on available test problems. The results show that the proposed algorithm has a superior performance to the ACO algorithm.

New sunshine-based models for predicting global solar radiation using PSO (particle swarm optimization) technique

PSO (particle swarm optimization) technique is applied to estimate monthly average daily GSR (global solar radiation) on horizontal surface for different regions of Iran. To achieve this, five new models were developed as well as six models were chosen from the literature. First, for each city, the empirical coefficients for all models were separately determined using PSO technique. The results indicate that new models which are presented in this study have better performance than existing models in the literature for 10 cities from 17 considered cities in this study. It is also shown that the empirical coefficients found for a given latitude can be generalized to estimate solar radiation in cities at similar latitude. Some case studies are presented to demonstrate this generalization with the result showing good agreement with the measurements. More importantly, these case studies further validate the models developed, and demonstrate the general applicability of the models developed. Finally, the obtained results of PSO technique were compared with the obtained results of SRTs (statistical regression techniques) on Angstrom model for all 17 cities. The results showed that obtained empirical coefficients for Angstrom model based on PSO have more accuracy than SRTs for all 17 cities.

Fuzzy Particle Swarm Optimization with Simulated Annealing and Neighborhood Information Communication for Solving TSP

In this paper, an effective hybrid algorithm based on Particle Swarm Optimization (PSO) is proposed for solving the Traveling Salesman Problem (TSP), which is a well-known NP-complete problem. The hybrid algorithm combines the high global search efficiency of fuzzy PSO with the powerful ability to avoid being trapped in local minimum. In the fuzzy PSO system, fuzzy matrices were used to represent the position and velocity of the particles in PSO and the operators in the original PSO position and velocity formulas were redefined. Two strategies were employed in the hybrid algorithm to strengthen the diversity of the particles and to speed up the convergence process. The first strategy is based on Neighborhood Information Communication (NIC) among the particles where a particle absorbs better historical experience of the neighboring particles. This strategy does not depend on the individual experience of the particles only, but also the neighbor sharing information of the current state. The second strategy is the use of Simulated Annealing (SA) which randomizes the search algorithm in a way that allows occasional alterations that worsen the solution in an attempt to increase the probability of escaping local optima. SA is used to slow down the degeneration of the PSO swarm and increase the swarm’s diversity. In SA, a new solution in the neighborhood of the original one is generated by using a designed ? search method. A new solution with fitness worse than the original solution is accepted with a probability that gradually decreases at the late stages of the search process. The hybrid algorithm is examined using a set of benchmark problems from the TSPLIB with various sizes and levels of hardness. Comparative experiments were made between the proposed algorithm and regular fuzzy PSO, SA, and basic ACO. The computational results demonstrate the effectiveness of the proposed algorithm for TSP in terms of the obtained solution quality and convergence speed.

Modeling resonant frequency of microstrip antenna based on neural network ensemble

AbstractResonant frequency is an important parameter in designing microstrip antenna (MSA). Selective neural network ensemble (NNE) methods based on decimal particle swarm optimization (PSO) algorithm and binary PSO algorithm are proposed in this study. The basic idea of the methods is to optimally select neural networks (NNs) to construct NNE with the aid of PSO algorithm. This may maintain the diversity of NNs and decrease the effects of collinearity and noise of sample. Simultaneously, chaos mutation is adopted to increase the diversity of particles of PSO. Experimental results show that the chaos PSO algorithm can improve the generalization ability of NNE. Moreover, by using this algorithm, model of resonant frequency of MSA is established. Computing results indicate that the model is better than the available ones. Copyright © 2010 John Wiley & Sons, Ltd.

Force-imitated particle swarm optimization using the near-neighbor effect for locating multiple optima

Multimodal optimization problems pose a great challenge of locating multiple optima simultaneously in the search space to the particle swarm optimization (PSO) community. In this paper, the motion principle of particles in PSO is extended by using the near-neighbor effect in mechanical theory, which is a universal phenomenon in nature and society. In the proposed near-neighbor effect based force-imitated PSO (NN-FPSO) algorithm, each particle explores the promising regions where it resides under the composite forces produced by the “near-neighbor attractor” and “near-neighbor repeller”, which are selected from the set of memorized personal best positions and the current swarm based on the principles of “superior-and-nearer” and “inferior-and-nearer”, respectively. These two forces pull and push a particle to search for the nearby optimum. Hence, particles can simultaneously locate multiple optima quickly and precisely. Experiments are carried out to investigate the performance of NN-FPSO in comparison with a number of state-of-the-art PSO algorithms for locating multiple optima over a series of multimodal benchmark test functions. The experimental results indicate that the proposed NN-FPSO algorithm can efficiently locate multiple optima in multimodal fitness landscapes.

Mono- and multi-objective planning of electrical distribution networks using particle swarm optimization

This paper presents a comprehensive study on mono- and multi-objective approaches for electrical distribution network design using particle swarm optimization (PSO). Specifically, two distribution network design problems, i.e., static and expansion planning, are solved using PSO. The network planning involves optimization of both network topology and branch conductor sizes. Both the planning problems are used to illustrate mono- and multi-objective optimization of distribution networks. Firstly, three PSO variants, i.e., PSO with inertia weight (PSO-IW), PSO with constriction factor (PSO-CF), and comprehensive learning PSO, are evaluated on a mono-objective (minimization of total cost of installation and energy loss) static planning problem. A novel encoding/decoding technique is devised to represent the network as a particle in PSO. Also, a heuristics based branch conductor size selection algorithm has been developed and used. Statistical tests performed to compare the performances of the three PSO variants reveal that the PSO-CF exhibits relatively better performance. Subsequently, the PSO-CF is applied for mono-objective expansion planning and multi-objective static and expansion planning problems. In the multi-objective planning with two conflicting objectives (total cost of installation and energy loss, and total non-delivered energy), the Pareto-optimality principle based tradeoff is done using the strength Pareto evolutionary algorithm-2. The efficiency of PSO for distribution system planning problem, in general, is demonstrated through different examples.