• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.163-170
• /
• 2011

This paper proposes a modified version of Particle Swarm Optimization (PSO) called Information Diffusion PSO (ID-PSO). In PSO algorithms, premature convergence of particles could be prevented by defining proper population topology. In this paper, we propose a variant of PSO algorithm using a new population topology. We draw inspiration from the theory of information diffusion which models the transmission of information or a rumor as one-to-one interactions between people. In ID-PSO, a particle interacts with only one particle at each iteration and they share their personal best solutions and recognized best solutions. Each particle recognizes the best solution that it has experienced or has learned from another particle as the recognized best. Computational experiments on the benchmark functions show the effectiveness of the proposed algorithm compared with the existing methods which use different population topologies.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.3
• /
• pp.423-430
• /
• 2010

Particle swarm optimization (PSO) algorithm is designed to find a single global optimal point. However, the PSO needs to be modified in order to find multiple optimal points of a multimodal function. These modifications usually divide a swarm of particles into multiple subswarms; in turn, these subswarms try to find their own optimal point, resulting in multiple optimal points. In this work, we present a new PSO algorithm, called coupling PSO to find multiple optimal points of a multimodal function based on coupling particles. In the coupling PSO, each main particle may generate a new particle to form a couple, after which the couple searches its own optimal point using non-stop-moving PSO algorithm. We tested the suggested algorithm and other ones, such as clustering PSO and niche PSO, over three analytic functions. The coupling PSO algorithm was also applied to solve a significant benchmark problem, the TEAM workshop problem 22.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.319-326
• /
• 2009

PSO(Particle Swarm Optimization) is an optimization algorithm in which simple particles search an optimal solution using shared information acquired through their own experiences. PSO applications are so numerous and diverse. Lots of researches have been made mainly on the parameter settings, topology, particle's movement in order to achieve fast convergence to proper regions of search space for optimization. In standard PSO, since each particle uses only information of its and best neighbor, swarm does not explore diverse regions and intended to premature to local optima. In this paper, we propose a new particle's movement strategy in order to explore diverse regions of search space. The strategy is that each particle moves according to relative weights of several better neighbors. The strategy of exploring diverse regions is effective and produces less local optimizations and accelerating of the optimization speed and higher success rates than standard PSO. Also, in order to raise success rates, we propose a strategy for checking whether swarm falls into local optimum. The new PSO algorithm with these two strategies shows the improvement in the search speed and success rate in the test of benchmark functions.

• Structural Engineering and Mechanics
• /
• v.54 no.3
• /
• pp.453-474
• /
• 2015

A hybrid approach of Particle Swarm Optimization (PSO) and Swallow Swarm Optimization algorithm (SSO) namely Hybrid Particle Swallow Swarm Optimization algorithm (HPSSO), is presented as a new variant of PSO algorithm for the highly nonlinear dynamic truss shape and size optimization with multiple natural frequency constraints. Experimentally validation of HPSSO on four benchmark trusses results in high performance in comparison to PSO variants and to those of different optimization techniques. The simulation results clearly show a good balance between global and local exploration abilities and consequently results in good optimum solution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1312-1320
• /
• 2009

This paper presents an efficient design method of 2-D infinite impulse response(IIR) digital filter based on a particle swarm optimization(PSO) algorithm. The design task is reformulated as a constrained minimization problem and is solved by our newly developed PSO algorithm. To ensure the stability of the designed 2-D IIR digital filters, a new stability strategy is embedded in the basic PSO algorithm. The superiority of the proposed method is demonstrated by several experiments. The results show that the approximation error of the resultant filters are better than those of the digital filters which designed by recently published filter design methods. The proposed design method can also obtain the stable2-D IIR digital filters.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

• Industrial Engineering and Management Systems
• /
• v.6 no.1
• /
• pp.64-71
• /
• 2007

J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.384-386
• /
• 2009

This paper introduces an effectively optimized Fuzzy model identification by means of complex and nonlinear system applying PSO algorithm. In other words, we use PSO(Particle Swarm Optimization) for identification of Fuzzy model structure and parameter. PSO is an algorithm that follows a collaborative population-based search model. Each particle of swarm flies around in a multidimensional search space looking for the optimal solution. Then, Particles adjust their position according to their own and their neighboring-particles experience. This paper identifies the premise part parameters and the consequence structures that have many effects on Fuzzy system based on PSO. In the premise parts of the rules, we use triangular. Finally we evaluate the Fuzzy model that is widely used in the standard model of gas data and sew data.

• Structural Engineering and Mechanics
• /
• v.52 no.3
• /
• pp.445-468
• /
• 2014

In this paper a new particle swarm ray optimization algorithm is proposed for truss shape and size optimization with natural frequency constraints. These problems are believed to represent nonlinear and non-convex search spaces with several local optima and therefore are suitable for examining the capabilities of new algorithms. The proposed algorithm can be viewed as a hybridization of Particle Swarm Optimization (PSO) and the recently proposed Ray Optimization (RO) algorithms. In fact the exploration capabilities of the PSO are tried to be promoted using some concepts of the RO. Five numerical examples are examined in order to inspect the viability of the proposed algorithm. The results are compared with those of the PSO and some other existing algorithms. It is shown that the proposed algorithm obtains lighter structures in comparison to other methods most of the time. As will be discussed, the algorithm's performance can be attributed to its appropriate exploration/exploitation balance.

• Journal of IKEEE
• /
• v.22 no.2
• /
• pp.455-459
• /
• 2018

In this paper, proposed a multi-channel charging control strategy for electric vehicle. This control strategy can adjust the charging power according to the calculated state-of-charge (SOC). Electric vehicle (EV) charging system using Particle Swarm Optimization (PSO) algorithm is proposed. A stochastic optimization algorithm technique such as PSO in the time-of-use (TOU) price used for the energy cost minimization. Simulation results show that the energy cost can be reduced using proposed method.