• 한국멀티미디어학회논문지
• /
• 제6권2호
• /
• pp.332-339
• /
• 2003

경험적 탐색(Modem Heuristics) 방법을 이용하여 복잡한 문제들의 근사해를 구하는 것이 가능하여졌다. 최근 제시된 Particle Swarm Optimization은 경험적 탐색 방법중의 하나로써 조류나 어류 등의 생물의 무리가 각각의 개체가 가지고 있는 정보를 공유해가며 먹이를 찾아가는 과정을 모의한 것이다. 그러나, 다양한 문제들의 근사해를 구하기 위해 Particle Swarm Optimization 방법을 이용하여 왔지만 해를 탐색하는 과정을 보여주기 위한 시도는 이루어지지 않았다. 본 논문에서는 Particle Swarm Optimization의 탐색과정을 가시화 하는 것을 목적으로 한다. 가시화 하는 작업을 통해 그 탐색 능력을 시각적으로 파악하는 것이 가능하며 해결방법에 관한 이해를 돕고 교육적 효과도 기대 가능하다.

• Journal of Computational Design and Engineering
• /
• 제3권4호
• /
• pp.295-311
• /
• 2016

This paper addresses to the flowshop scheduling problem with blocking constraints. The objective is to minimize the makespan criterion. We propose a hybrid combinatorial particle swarm optimization algorithm (HCPSO) as a resolution technique for solving this problem. At the initialization, different priority rules are exploited. Experimental study and statistical analysis were performed to select the most adapted one for this problem. Then, the swarm behavior is tested for solving a combinatorial optimization problem such as a sequencing problem under constraints. Finally, an iterated local search algorithm based on probabilistic perturbation is sequentially introduced to the particle swarm optimization algorithm for improving the quality of solution. The computational results show that our approach is able to improve several best known solutions of the literature. In fact, 76 solutions among 120 were improved. Moreover, HCPSO outperforms the compared methods in terms of quality of solutions in short time requirements. Also, the performance of the proposed approach is evaluated according to a real-world industrial problem.

• 조명전기설비학회논문지
• /
• 제23권9호
• /
• pp.55-61
• /
• 2009

본 논문에서는 구역전기사업자를 구성하는데 적용하기 위해, 기존의 최적화 기법인 Discrete Particle Swarm Optimization (DPSO) 알고리즘을 개량한 Phasor DPSO (PDPSO) 알고리즘을 새롭게 제시한다. 구역전기사업자는 전력구입 뿐만 아니라 전력판매도 가능하고, 미리 계약한 수용가의 전력부하에게 전력을 공급할 의무가 있다. 하나의 배전계통에 다수의 구역전기사업자가 존재할 경우, 해당 배전계통 내의 모든 수용가에게 최소의 운영비용으로 전력을 공급하기 위해서는 다수 구역전기사업자 간에 구성형태를 조정할 필요가 있다. 이에 적용할 최적화 기법으로 본 논문은 PDPSO 알고리즘을 제안하며, 제안된 알고리즘의 각 개체는 기존의 다변수 벡터 대신 크기와 위상각으로 이루어진 다변수 페이저 값을 갖는다.

• Structural Engineering and Mechanics
• /
• 제47권4호
• /
• pp.513-530
• /
• 2013

In this paper, an improved version of particle swarm optimization based optimum design algorithm (IPSO) is presented for the steel grillage systems. The optimum design problem is formulated considering the provisions of American Institute of Steel Construction concerning Load and Resistance Factor Design. The optimum design algorithm selects the appropriate W-sections for the beams of the grillage system such that the design constraints are satisfied and the grillage weight is the minimum. When an improved version of the technique is extended to be implemented, the related results and convergence performance prove to be better than the simple particle swarm optimization algorithm and some other metaheuristic optimization techniques. The efficiency of different inertia weight parameters of the proposed algorithm is also numerically investigated considering a number of numerical grillage system examples.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4987-5005
• /
• 2017

This paper introduces a new method to solve Similarity Recognition for Cloth Products, which is based on Fuzzy logic and Particle swarm optimization algorithm. For convenience, it is called the SRCPFP method hereafter. In this paper, the SRCPFP method combines Fuzzy Logic (FL) and Particle Swarm Optimization (PSO) algorithm to solve similarity recognition for cloth products. First, it establishes three features, length, thickness, and temperature resistance, respectively, for each cloth product. Subsequently, these three features are engaged to construct a Fuzzy Inference System (FIS) which can find out the similarity between a query cloth and each sampling cloth in the cloth database D. At the same time, the FIS integrated with the PSO algorithm can effectively search for near optimal parameters of membership functions in eight fuzzy rules of the FIS for the above similarities. Finally, experimental results represent that the SRCPFP method can realize a satisfying recognition performance and outperform other well-known methods for similarity recognition under considerations here.

• 산업경영시스템학회지
• /
• 제33권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.

• 산업경영시스템학회지
• /
• 제36권3호
• /
• pp.63-70
• /
• 2013

Many real world optimization problems are discrete and multi-valued. Meta heuristics including Genetic Algorithm and Particle Swarm Optimization have been effectively used to solve these multi-valued optimization problems. However, extensive comparative study on the performance of these algorithms is still required. In this study, performance of these algorithms is evaluated with multi-modal and multi-dimensional test functions. From the experimental results, it is shown that Discrete Particle Swarm Optimization (DPSO) provides better and more reliable solutions among the considered algorithms. Also, additional experiments shows that solution quality of DPSO is not lowered significantly when bit size representing a solution increases. It means that bit representation of multi-valued discrete numbers provides reliable solutions instead of becoming barrier to performance of DPSO.

• Structural Engineering and Mechanics
• /
• 제54권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5955-5977
• /
• 2018

Performance of the interpolation algorithm used in the technique of bi-dimensional empirical mode decomposition directly affects its popularization and application, so that the researchers pay more attention to the algorithm reasonable, accurate and fast. However, it has been a lack of an adaptive interpolation algorithm that is relatively satisfactory for the bi-dimensional empirical mode decomposition (BEMD) and is derived from the image characteristics. In view of this, this paper proposes an image interpolation algorithm based on the particle swarm and fractal. Its procedure includes: to analyze the given image by using the fractal brown function, to pick up the feature quantity from the image, and then to operate the adaptive image interpolation in terms of the obtained feature quantity. All parameters involved in the interpolation process are determined by using the particle swarm optimization algorithm. The presented interpolation algorithm can solve those problems of low efficiency and poor precision in the interpolation operation of bi-dimensional empirical mode decomposition and can also result in accurate and reliable bi-dimensional intrinsic modal functions with higher speed in the decomposition of the image. It lays the foundation for the further popularization and application of the bi-dimensional empirical mode decomposition algorithm.

• Journal of the Optical Society of Korea
• /
• 제18권4호
• /
• pp.341-344
• /
• 2014

This study proposes a modified sub-aperture stitching algorithm, which uses an image sharpening algorithm and particle swarm optimization to improve the stitching accuracy. In sub-aperture stitching interferometers with high positional accuracy, the high-frequency components of measurements are more important than the low-frequency components when compensating for position errors using a sub-aperture stitching algorithm. Thus we use image sharpening algorithms to strengthen the high-frequency components of measurements. When using image sharpening algorithms, sub-aperture stitching algorithms based on the least-squares method easily become trapped at locally optimal solutions. However, particle swarm optimization is less likely to become trapped at a locally optimal solution, thus we utilized this method to develop a more robust algorithm. The results of simulations showed that our algorithm compensated for position errors more effectively than the existing algorithm. An experimental comparison with full aperture-testing results demonstrated the validity of the new algorithm.