• Steel and Composite Structures
• /
• 제12권6호
• /
• pp.505-522
• /
• 2012

An artificial bee colony (ABC) algorithm is developed for the optimum design of geometrically non-linear steel frames. The ABC is a new swarm intelligence method which simulates the intelligent foraging behaviour of honeybee swarm for solving the optimization problems. Minimum weight design of steel frames is aimed under the strength, displacement and size constraints. The geometric non-linearity of the frame members is taken into account in the optimum design algorithm. The performance of the ABC algorithm is tested on three steel frames taken from literature. The results obtained from the design examples demonstrate that the ABC algorithm could find better designs than other meta-heuristic optimization algorithms in shorter time.

• Journal of Electrical Engineering and Technology
• /
• 제7권2호
• /
• pp.245-254
• /
• 2012

In this study, we introduce a prototype-based classifier with feature selection that dwells upon the usage of a biologically inspired optimization technique of Particle Swarm Optimization (PSO). The design comprises two main phases. In the first phase, PSO selects P % of patterns to be treated as prototypes of c classes. During the second phase, the PSO is instrumental in the formation of a core set of features that constitute a collection of the most meaningful and highly discriminative coordinates of the original feature space. The proposed scheme of feature selection is developed in the wrapper mode with the performance evaluated with the aid of the nearest prototype classifier. The study offers a complete algorithmic framework and demonstrates the effectiveness (quality of solution) and efficiency (computing cost) of the approach when applied to a collection of selected data sets. We also include a comparative study which involves the usage of genetic algorithms (GAs). Numerical experiments show that a suitable selection of prototypes and a substantial reduction of the feature space could be accomplished and the classifier formed in this manner becomes characterized by low classification error. In addition, the advantage of the PSO is quantified in detail by running a number of experiments using Machine Learning datasets.

• 한국차세대컴퓨팅학회논문지
• /
• 제14권6호
• /
• pp.15-29
• /
• 2018

본 논문에서는 기존 파티클 스웜 최적화를 기반으로 추적 대상 객체의 이동 궤적을 이용하는 객체 추적기에서 시간 정보 활용의 문제점을 개선한 강인한 객체 추적 알고리즘을 제안한다. 제안하는 알고리즘은 추적 대상 객체와 유사한 특징을 가지는 변위들의 집합에 대한 위치들의 온라인 업데이트와 추적을 가능하게 한다. 객체들의 중첩을 검출하고 추적 대상의 위치를 결정하기 위해 궤적 정보와 변위들의 집합을 기반으로 적응적 파라미터를 사용하는 규칙기반 접근을 사용한다. 기존 알고리즘들과 비교해보면 제안하는 접근법은 가용한 정보를 복합적으로 사용함으로써 각종 임계값에 대한 적응적 조정을 가능하게 한다. 또한, 파티클 스웜 최적화에서 발산에 의한 손실과 불완전한 수렴의 문제를 해결하기 위해 효율적인 가중치 조절 함수를 제안하고 있다. 제안하는 가중치 조절 함수는 파티클들이 최적의 해에 수렴하기 이전에 전체 프레임 영역에서 탐색할 수 있도록 한다. 유사한 특징 조합을 가지는 다중 객체가 존재하는 환경에서 제안 알고리즘을 테스트한 결과, 기존 스웜 최적화 기반의 객체 추적기들에 비해 기존 유사 변위들에 대한 잘못된 추적을 현저히 줄이는 것을 확인할 수 있었다.

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

The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

• 한국항공우주학회지
• /
• 제50권8호
• /
• pp.523-530
• /
• 2022

다양한 임무에서 활용 가능한 무인기 다개체 시스템은 단일 무인기보다 복잡하므로 효율적인 대형 제어방식이 요구된다. 특히 광역 탐색임무에 있어 통신량 및 연산량 부담이 적으며, 무인기간 자율적인 대형 형성이 가능한 분산 제어형의 유동적인 대형 형성이 필요하다. 본 연구는 스캔 면적의 확장 및 탐색 성능향상을 위해 Swarm 대형과 뱅크 정렬 대형, 대형 전체 운동을 고려한 대형 형성 알고리즘을 제안한다. 본 알고리즘은 상대거리에 대해서 2차 진동 특성을 가지며 parameter tuning을 통해 알고리즘을 설계할 수 있다. 또한 통상적인 무인기 시스템에 적합하도록 제어명령을 변환하였고, 시뮬레이션을 통해 알고리즘의 대형 형성 및 운동에 대한 성능을 입증하였다.

• 한국항공우주학회지
• /
• 제50권6호
• /
• pp.385-391
• /
• 2022

본 논문에서는 경사 하강법 기반의 경로 생성(GBPP)과 입자 군집 최적화(PSO)를 결합하여 3차원 공간에서 금지구역, 지형정보, 고정익 특성 등을 고려한 경로 생성 알고리즘을 제안한다. 기존의 GBPP 방법의 경우 빠르게 경로 생성이 가능하지만 초기 경로에 따라 지역적 최적 값에 빠져 안전하지 않은 경로가 생성될 수 있다. 유전 알고리즘(GA)과 PSO 등 생물학에서 영감을 받은 군집 지능 알고리즘들의 경우 다양한 경로들을 샘플링하여 지역적 최적 값 문제를 해결할 수 있다. 다만 무인기와 경로점 개수가 증가하여 최적 변수가 증가할 경우 군집 개수를 늘려야 하고 계산 시간이 크게 증가한다. 두 알고리즘 단점을 보완하고자 본 연구에서는 GBPP 입력 값인 초기경로를 수평, 수직 방향에 대한 변위 두 가지 변수로 정의하고 이를 PSO 변수로 정의하여 계층적 경로 최적화 알고리즘 HPSO를 제안한다. 제안한 알고리즘은 통용되는 비행 제어 컴퓨터(FCC)의 software-in-the-loop simulation(SILS)을 사용하여 고정익 무인기에 대한 사용 가능성을 검증하였다.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.39-50
• /
• 2015

Genetic algorithm (GA) and particle swarm optimization (PSO) are two excellent approaches to multimodal optimization problems. However, slow convergence or premature convergence readily occurs because of inappropriate and inflexible evolution. In this paper, a novel optimization algorithm with a flexible grid optimization (FGO) is suggested to provide adaptive trade-off between exploration and exploitation according to the specific objective function. Meanwhile, a uniform agents array with adaptive scale is distributed on the gird to speed up the calculation. In addition, a dominance centroid and a fitness center are proposed to efficiently determine the potential guides when the population size varies dynamically. Two types of subregion division strategies are designed to enhance evolutionary diversity and convergence, respectively. By examining the performance on four benchmark functions, FGO is found to be competitive with or even superior to several other popular algorithms in terms of both effectiveness and efficiency, tending to reach the global optimum earlier. Moreover, FGO is evaluated by applying it to a parameter decision in a least squares support vector machine (LS-SVM) to verify its practical competence.

• Advances in aircraft and spacecraft science
• /
• 제3권2호
• /
• pp.149-170
• /
• 2016

Multi-Disciplinary Optimization (MDO) is widely used to handle the advanced design in several engineering applications. Such applications are commonly simulation-based, in order to capture the physics of the phenomena under study. This framework demands fast optimization algorithms as well as trustworthy numerical analyses, and a synergic integration between the two is required to obtain an efficient design process. In order to meet these needs, an adaptive Computational Fluid Dynamics (CFD) solver and a fast optimization algorithm have been developed and combined by the authors. The CFD solver is based on a high-order discontinuous Galerkin discretization while the optimization algorithm is a high-performance version of the Artificial Bee Colony method. In this work, they are used to address a typical aero-mechanical problem encountered in turbomachinery design. Interesting achievements in the considered test case are illustrated, highlighting the potential applicability of the proposed approach to other engineering problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2037-2051
• /
• 2012

Cognitive radio (CR) is envisioned as a promising paradigm of exploiting intelligence for enhancing efficiency of underutilized spectrum bands. In CR, the main concern is to reliably sense the presence of primary users (PUs) to attain protection against harmful interference caused by potential spectrum access of secondary users (SUs). In this paper, evolutionary algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize the total sensing decision error at the common soft data fusion (SDF) centre of a structurally-centralized cognitive radio network (CRN). Using these techniques, evolutionary operations are invoked to optimize the weighting coefficients applied on the sensing measurement components received from multiple cooperative SUs. The proposed methods are compared with each other as well as with other conventional deterministic algorithms such as maximal ratio combining (MRC) and equal gain combining (EGC). Computer simulations confirm the superiority of the PSO-based scheme over the GA-based and other conventional MRC and EGC schemes in terms of detection performance. In addition, the PSO-based scheme also shows promising convergence performance as compared to the GA-based scheme. This makes PSO an adequate solution to meet real-time requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권2호
• /
• pp.520-541
• /
• 2023

In CRNs, SS is of utmost significance. Every CR user generates a sensing report during the training phase beneath various circumstances, and depending on a collective process, either communicates or remains silent. In the training stage, the fusion centre combines the local judgments made by CR users by a majority vote, and then returns a final conclusion to every CR user. Enough data regarding the environment, including the activity of PU and every CR's response to that activity, is acquired and sensing classes are created during the training stage. Every CR user compares their most recent sensing report to the previous sensing classes during the classification stage, and distance vectors are generated. The posterior probability of every sensing class is derived on the basis of quantitative data, and the sensing report is then classified as either signifying the presence or absence of PU. The ISVM technique is utilized to compute the quantitative variables necessary to compute the posterior probability. Here, the iterations of SVM are tuned by novel GO-PSA by combining GOA and PSO. Novel GO-PSA is developed since it overcomes the problem of computational complexity, returns minimum error, and also saves time when compared with various state-of-the-art algorithms. The dependability of every CR user is taken into consideration as these local choices are then integrated at the fusion centre utilizing an innovative decision combination technique. Depending on the collective choice, the CR users will then communicate or remain silent.