An Algorithm for Continuous Optimization Problems using Hybrid Particle Updating Method

2016 ◽  
Vol 3 (1) ◽  
pp. 164
Author(s):  
Peter Bamidele Shola ◽  
L B Asaju
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Population Based ◽  
Global Optimum ◽  
Swarm Optimization ◽  
Standard Particle Swarm Optimization ◽  
Continuous Optimization Problems ◽  
Number Of Iterations

<p>Optimization problem is one such problem commonly encountered in many area of endeavor, obviously due to the need to economize the use of the available resources in many problems. This paper presents a population-based meta-heuristic algorithm   for solving optimization problems in a continous space. The algorithm, combines a form of cross-over technique with a position updating formula based on the instantaneous global best position to update each particle position .The algorithm was tested and compared with the standard particle swarm optimization (PSO)  on many benchmark functions. The result suggests a better performance of the algorithm over the later in terms of reaching (attaining) the global optimum value (at least for those benchmark functions considered) and the rate of convergence in terms of the number of iterations required reaching the optimum values.</p>

scholarly journals Particle Swarm Optimization Algorithm with Multiple Phases for Solving Continuous Optimization Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jing Li ◽  
Yifei Sun ◽  
Sicheng Hou
Keyword(s):  
Experimental Study ◽  
Particle Swarm Optimization ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Continuous Optimization ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Fixed Phase ◽  
Continuous Optimization Problems

An algorithm with different parameter settings often performs differently on the same problem. The parameter settings are difficult to determine before the optimization process. The variants of particle swarm optimization (PSO) algorithms are studied as exemplars of swarm intelligence algorithms. Based on the concept of building block thesis, a PSO algorithm with multiple phases was proposed to analyze the relation between search strategies and the solved problems. Two variants of the PSO algorithm, which were termed as the PSO with fixed phase (PSOFP) algorithm and PSO with dynamic phase (PSODP) algorithm, were compared with six variants of the standard PSO algorithm in the experimental study. The benchmark functions for single-objective numerical optimization, which includes 12 functions in 50 and 100 dimensions, are used in the experimental study, respectively. The experimental results have verified the generalization ability of the proposed PSO variants.

The Cheapest Shop Seeker : A New Algorithm For Optimization Problem in a Continous Space

2016 ◽  
Vol 5 (3) ◽  
pp. 119
Author(s):  
Peter Bamidele Shola
Keyword(s):  
Success Rate ◽  
Rate Of Convergence ◽  
Heuristic Algorithm ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Population Based ◽  
Global Optimum ◽  
Optimum Point ◽  
Number Of Iterations

<div class="Section1"><p>In this paper a population-based meta-heuristic algorithm for optimization problems in a continous space is presented.The algorithm,here called cheapest shop seeker is modeled after a group of shoppers seeking to identify the cheapest shop (among many available) for shopping. The  algorithm was tested on many benchmark functions with the result  compared with those from some other methods. The algorithm appears to  have a better  success  rate of hitting the global optimum point  of a function  and of the rate of convergence (in terms of the number of iterations required to reach the optimum  value) for some functions  in spite  of its simplicity.</p></div>

Significant Factors Identification for Particle Swarm Optimization Algorithm to Solving the Design Optimization Problem of a Four-Bar Linkage for Path Generation

2012 ◽  
Vol 249-250 ◽  
pp. 1180-1187 ◽  
Author(s):  
Cheng Kang Lee ◽  
Yung Chang Cheng
Keyword(s):  
Particle Swarm Optimization ◽  
Design Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Based ◽  
Path Generation ◽  
Swarm Optimization ◽  
Control Factors ◽  
Four Bar Linkage

Particle swarm optimization (PSO) is a well-known population-based searching algorithm to solving optimization problems. This paper aims at identifying significant control factors for PSO to solving the design optimization problem of a four-bar linkage for path generation. Control factors considered herein are inertial weight, acceleration coefficients, breeding operation, and the number of population. A full factorial design of experiments is used to construct a set of experiments. Experimental results are analyzed with the analysis of variance method. According to the results obtained in this paper, breeding operation and the interaction between breeding operation and acceleration coefficients are significant. Inertial weight, acceleration coefficients, the number of population, and the other interactions are not significant. For the design optimization problem discussed herein, it is suggested to adopt breeding operation strategy and apply constant acceleration coefficients to increase significantly PSO’s performance and robustness. Type of inertial weight and the number of population do not affect PSO’s performance and robustness significantly.

Sign in / Sign up

Export Citation Format

Share Document