Rebirthing particle swarm optimization algorithm: application to storm water network design

2008 ◽  
Vol 35 (10) ◽  
pp. 1120-1127 ◽  
Author(s):  
M. H. Afshar

Stochastic search methods, such as the particle swarm optimization (PSO) algorithm, are primarily directed by two main features — exploration and exploitation. Exploration is the ability of the algorithm to broadly search through the solution space for new quality solutions, whereas exploitation is responsible for refining the search in the neighborhood of the good solutions found previously. Proper balance between these features is sought, to obtain good performance of these algorithms. An explorative mechanism is introduced in this paper to improve the performance of the PSO algorithm. The method is based on introducing artificial exploration into the algorithm by randomly repositioning the particles approaching stationary status. A velocity measure is used to distinguish between flying and stationary particles. This can be sought as a sudden death followed by a rebirth of these particles. Two options are tested for the rebirthing mechanism, which are (i) clearing and (ii) keeping the memory of rebirthing particles. The global best particle is exempted from rebirthing process so that the most useful of the swarm’s past experiences is not lost. The method is applied to a benchmark storm water network design problem and the results are presented and compared with those of the original algorithm and other methods. The proposed method, though simple, is shown to be very effective in avoiding local optima, leading to an improved version of the algorithm at no extra computational effort.

Author(s):  
Ying Tan

Compared to conventional PSO algorithm, particle swarm optimization algorithms inspired by immunity-clonal strategies are presented for their rapid convergence, easy implementation and ability of optimization. A novel PSO algorithm, clonal particle swarm optimization (CPSO) algorithm, is proposed based on clonal principle in natural immune system. By cloning the best individual of successive generations, the CPSO enlarges the area near the promising candidate solution and accelerates the evolution of the swarm, leading to better optimization capability and faster convergence performance than conventional PSO. As a variant, an advance-and-retreat strategy is incorporated to find the nearby minima in an enlarged solution space for greatly accelerating the CPSO before the next clonal operation. A black hole model is also established for easy implementation and good performance. Detailed descriptions of the CPSO algorithm and its variants are elaborated. Extensive experiments on 15 benchmark test functions demonstrate that the proposed CPSO algorithms speedup the evolution procedure and improve the global optimization performance. Finally, an application of the proposed PSO algorithms to spam detection is provided in comparison with the other three methods.


2012 ◽  
Vol 424-425 ◽  
pp. 535-539
Author(s):  
Liang Ming Hu ◽  
Yi Zhi Li

Particle Swarm Optimization (PSO) algorithm is a technique for optimization based on iteration, which initializes system to product a series of random solutions, in this solution space, particles commit themselves to search for a better solution and in the final the optimal one is found. Applying this algorithm to the design of gravity dam section then we find: PSO, as shown by the example given in this paper, is an available algorithm which is not only tally with the actual situation, but safe and economical. So, PSO provides a new idea and method for optimization design of gravity dam section.


2017 ◽  
Vol 50 (1) ◽  
pp. 221-230 ◽  
Author(s):  
Małgorzata Rabiej

The analysis of wide-angle X-ray diffraction curves of semicrystalline polymers is connected with a thorough decomposition of these curves into crystalline peaks and amorphous components. A reliable and unambiguous decomposition is the most important step in calculation of the crystallinity of polymers. This work presents a new algorithm dedicated to this aim, which is based on the particle swarm optimization (PSO) method. The PSO method is one of the most effective optimization techniques that employs a random choice as a tool for going through the solution space and searching for the global solution. The action of the PSO algorithm imitates the behaviour of a bird flock or a fish school. In the system elaborated in this work the original PSO algorithm has been equipped with several heuristics. The role of heuristics is performed by procedures which orient the search of the solution space using additional information. In this paper it is shown that this algorithm is faster to converge and more efficiently performs a multi-criterial optimization compared with other algorithms used for this purpose to date.


2020 ◽  
Vol 11 (S1) ◽  
pp. 343-358 ◽  
Author(s):  
Umut Okkan ◽  
Umut Kirdemir

Abstract In the literature about the parameter estimation of the nonlinear Muskingum (NL-MUSK) model, benchmark hydrographs have been subjected to various metaheuristics, and in these studies the minor improvements of the algorithms on objective functions are imposed as ‘state-of-the-art’. With the metaheuristics involving more control variables, the attempt to search global results in a restricted solution space is not actually practical. Although metaheuristics provide reasonable results compared with many derivative methods, they cannot guarantee the same global solution when they run under different initial conditions. In this study, one of the most practical of metaheuristics, the particle swarm optimization (PSO) algorithm, was chosen, and the aim was to develop its local search capability. In this context, the hybrid use of the PSO with the Levenberg–Marquardt (LM) algorithm was considered. It was detected that the hybrid PSO–LM gave stable global solutions as a result of each random experiment in the application for four different flood data. The PSO–LM, which stands out with its stable aspect, also achieved rapid convergence compared with the PSO and another hybrid variant called mutated PSO.


Smart Cities ◽  
2020 ◽  
Vol 3 (2) ◽  
pp. 541-555
Author(s):  
Ernesto Cipriani ◽  
Gaetano Fusco ◽  
Sergio Maria Patella ◽  
Marco Petrelli

The research presented in this paper proposes a Particle Swarm Optimization (PSO) approach for solving the transit network design problem in large urban areas. The solving procedure is divided in two main phases: in the first step, a heuristic route generation algorithm provides a preliminary set of feasible and comparable routes, according to three different design criteria; in the second step, the optimal network configuration is found by applying a PSO-based procedure. This study presents a comparison between the results of the PSO approach and the results of a procedure based on Genetic Algorithms (GAs). Both methods were tested on a real-size network in Rome, in order to compare their efficiency and effectiveness in optimal transit network calculation. The results show that the PSO approach promises more efficiency and effectiveness than GAs in producing optimal solutions.


2011 ◽  
Vol 361-363 ◽  
pp. 1426-1431
Author(s):  
Wen Hua Han

The particle swarm optimization (PSO) is a population-based stochastic evolutionary algorithm, noted for its capability of searching for the global optimum of complex problems. Particles flying out of the solution space will lead to invalid solutions. So often in engineering applications, boundary condition is used to confine the particles within the solution space. In this paper, a new boundary is proposed, which is called as escape boundary. The solution space is divided into three sections, that is, the inside,escape boundary and the outside of the boundary. The location of the global solution in the solution space, accordingly has two types, that is, the global optimum around the center of the solution space, and the global optimum close to the escape boundary. The proposed boundary is introduced into the PSO algorithm, and is compared to the damping boundary. The experimental results show that the PSO based on escape boundary has better search ability and faster convergence rate.


2010 ◽  
Vol 1 (1) ◽  
pp. 64-86 ◽  
Author(s):  
Ying Tan

Compared to conventional PSO algorithm, particle swarm optimization algorithms inspired by immunity-clonal strategies are presented for their rapid convergence, easy implementation and ability of optimization. A novel PSO algorithm, clonal particle swarm optimization (CPSO) algorithm, is proposed based on clonal principle in natural immune system. By cloning the best individual of successive generations, the CPSO enlarges the area near the promising candidate solution and accelerates the evolution of the swarm, leading to better optimization capability and faster convergence performance than conventional PSO. As a variant, an advance-and-retreat strategy is incorporated to find the nearby minima in an enlarged solution space for greatly accelerating the CPSO before the next clonal operation. A black hole model is also established for easy implementation and good performance. Detailed descriptions of the CPSO algorithm and its variants are elaborated. Extensive experiments on 15 benchmark test functions demonstrate that the proposed CPSO algorithms speedup the evolution procedure and improve the global optimization performance. Finally, an application of the proposed PSO algorithms to spam detection is provided in comparison with the other three methods.


Sign in / Sign up

Export Citation Format

Share Document