• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권12호
• /
• pp.5780-5802
• /
• 2017

Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

• Structural Engineering and Mechanics
• /
• 제42권3호
• /
• pp.335-352
• /
• 2012

Particle Swarm Optimization (PSO) is a stochastic population based optimization algorithm which has attracted attentions of many researchers. This method has great potentials to be applied to many optimization problems. Despite its robustness the standard version of PSO has some drawbacks that may reduce its performance in optimization of complex structures such as laminated composites. In this paper by suggesting a new variation scheme for acceleration parameters and inertial weight factors of PSO a novel optimization algorithm is developed to enhance the basic version's performance in optimization of laminated composite structures. To verify the performance of the new proposed method, it is applied in two multi-objective design optimization problems of laminated cylindrical. The numerical results from the proposed method are compared with those from two other conventional versions of PSO-based algorithms. The convergancy of the new algorithms is also compared with the other two versions. The results reveal that the new modifications inthe basic forms of particle swarm optimization method can increase its convergence speed and evade it from local optima traps. It is shown that the parameter variation scheme as presented in this paper is successful and can evenfind more preferable optimum results in design of laminated composite structures.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.463-467
• /
• 2008

Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

• 융합신호처리학회논문지
• /
• 제3권4호
• /
• pp.35-41
• /
• 2002

복잡한 문제들의 근사해를 구하기 위하여 최근 다양한 방법들이 소개되고 있다. 이러한 방법들은 주로 금속의 서랭(Annealing)에 의해 금속분자의 에너지가 최저점에 도달하는 과정을 모의실험한 최적화 기법(Simulated Annealing), 생물의 적자생존(Survival of Fittest)과정을 이용한 최적화 기법인 유전적 알고리즘(Genetic Algorithm)등 물리적 현상이나 생물 ?생명에 관련된 모의를 최적화 문제에 응용한 방법들이다. 최근에 소개된 Particle Swarm Optimization(PSO)는 주로 조류나 어류등의 생물의 무리가 각각의 개체가 가지고 있는 정보를 공유해가며 먹이를 찾아가는 과정을 모의한 기법이다. 하지만, 이 기법의 탐색과정이 명확하게 밝혀져 있지 않다. 본 논문에서는 PSO의 탐색과정을 가시화 하는 것을 목적으로 한다. 탐색과정을 가시화 하는 작업을 통해 그 탐색 능력을 시각적으로 파악하는 것이 가능하며 기법에 관한 이해를 돕고 교육적 효과도 기대 가능하다.

• Structural Engineering and Mechanics
• /
• 제70권5호
• /
• pp.513-524
• /
• 2019

This study proposed an improved particle swarm optimization (IPSO) method ensemble with kriging model for model updating. By introducing genetic algorithm (GA) and grouping strategy together with elite selection into standard particle optimization (PSO), the IPSO is obtained. Kriging metamodel serves for predicting the structural responses to avoid complex computation via finite element model. The combination of IPSO and kriging model shall provide more accurate searching results and obtain global optimal solution for model updating compared with the PSO, Simulate Annealing PSO (SimuAPSO), BreedPSO and PSOGA. A plane truss structure and ASCE Benchmark frame structure are adopted to verify the proposed approach. The results indicated that the hybrid of kriging model and IPSO could serve for model updating effectively and efficiently. The updating results further illustrated that IPSO can provide superior convergent solutions compared with PSO, SimuAPSO, BreedPSO and PSOGA.

• 제어로봇시스템학회논문지
• /
• 제12권4호
• /
• pp.328-338
• /
• 2006

A new evolutionary computation technique, called particle swarm optimization(PSO), has been proposed and introduced recently. PSO has been inspired by the social behavior of flocking organisms, such as swarms of birds and fish schools and 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. In this paper, characteristics of PSO such as mentioned are reviewed and compared with GA which is based on the evolutionary mechanism in natural selection. Also dimensionalities of PSO and GA are compared throughout numeric experimental studies. The comparative studies demonstrate that PSO is characterized as simple in concept, easy to implement, and computationally efficient and can generate a high-quality solution and stable convergence characteristic than GA.

• 한국지능시스템학회논문지
• /
• 제18권4호
• /
• pp.566-571
• /
• 2008

본 논문에서는 Particle Swarm Optimization(PSO) 기법을 이용한 이족보행로봇의 보행 계획 방법을 제안한다. 이족보행로봇의 보행 프리미티브를 기반으로 PSO의 학습 및 군집 특성을 이용하여 장애물이 있는 2차원 작업공간에서 보행 계획 방법을 설계하였다. 먼저 PSO의 탐색알고리즘을 사용하여 장애물을 회피하는 실행 가능한 보행 프리미티브들의 순서를 찾아서 보행 경로를 생성하고, 탐색된 경로를 바탕으로 보행 걸음수와 이동 거리를 최적화 하는 경로 최적화 알고리즘을 제안하였다. 제안된 보행 계획방법은 다양한 구성의 장애물을 포함한 작업환경에서 모의실험을 통하여 발걸음 탐색 시간이 줄고 최적화된 보행 경로를 생성하는 것을 검증하였다.

• 정보처리학회논문지D
• /
• 제17D권3호
• /
• pp.175-184
• /
• 2010

최근 DNA 칩의 등장으로 유전자 관련 실험과 연구가 매우 용이해졌으며 이를 활용한 다양한 실험 결과로 대량의 데이터가 제공되고 있다. DNA칩에 의해 제공된 데이터는 2차원 행렬로 표현되며 하나의 축은 유전자를 나타내고 다른 하나의 축은 샘플정보를 나타낸다. 이러한 데이터에 대하여 빠른 시간 안에 좋은 품질의 군집화를 수행함으로써 이후의 분석 단계인 분류화 작업의 정확도와 효율성을 높일 수 있다. 본 논문에서는 생태계 모방 알고리즘의 하나인 Particle Swarm Optimization 알고리즘을 사용하여 방대한 양의 DNA칩 데이터에 대한 효율적인 군집화 기법을 제안하였으며 실험을 통해서 PSO 기반의 군집화 알고리즘이 기존의 군집화 알고리즘들보다 수행속도 및 품질 면에서 우수한 성능을 가짐을 보였다.

• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.786-792
• /
• 2011

The present paper presents an optimal capacitor placement (OCP) algorithm for voltagestability enhancement. The OCP issue is represented using a mixed-integer problem and a highly nonlinear problem. The hybrid particle swarm optimization (HPSO) algorithm is proposed to solve the OCP problem. The HPSO algorithm combines the optimal power flow (OPF) with the primal-dual interior-point method (PDIPM) and ordinary PSO. It takes advantage of the global search ability of PSO and the very fast simulation running time of the OPF algorithm with PDIPM. In addition, OPF gives intelligence to PSO through the information provided by the dual variable of the OPF. Numerical results illustrate that the HPSO algorithm can improve the accuracy and reduce the simulation running time. Test results evaluated with the three-bus, New England 39-bus, and Korea Electric Power Corporation systems show the applicability of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제6권2호
• /
• pp.182-191
• /
• 2011

Genetic algorithms (GA) and particle swarm optimization (PSO) are the most famous optimization techniques among various modern heuristic optimization techniques. These two approaches identify the solution to a given objective function, but they employ different strategies and computational effort; therefore, a comparison of their performance is needed. This paper presents the application and performance comparison of the PSO and GA optimization techniques for a static synchronous series compensator-based controller design. The design objective is to enhance power system stability. The design problem of the FACTS-based controller is formulated as an optimization problem, and both PSO and GA optimization techniques are employed to search for the optimal controller parameters.