• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.9-17
• /
• 2014

This paper proposes a binary particle swarm optimization (BPSO) algorithm for distributed node localization in wireless sensor networks (WSNs). Each unknown node performs localization using the value of the measured distances from three or more neighboring anchors, i.e., nodes that know their location information. The node that is localized during the localization process is then used as another anchor for remaining nodes. The performances of particle swarm optimization (PSO) and BPSO in terms of localization error and computation time are compared by using simulations in Matlab. The simulation results indicate that PSO-based localization is more accurate. In contrast, BPSO algorithm performs faster for finding the location of unknown nodes for distributed localization. In addition, the effects of transmission range and number of anchor nodes on the localization error and computation time are investigated.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.191-196
• /
• 2009

In this paper, we proposed a feature selection method using Binary Particle Swarm Optimization(BPSO) and Mutual information. This proposed method consists of the feature selection part for selecting candidate feature subset by mutual information and the optimal feature selection part for choosing optimal feature subset by BPSO in the candidate feature subsets. In the candidate feature selection part, we computed the mutual information of all features, respectively and selected a candidate feature subset by the ranking of mutual information. In the optimal feature selection part, optimal feature subset can be found by BPSO in the candidate feature subset. In the BPSO process, we used multi-object function to optimize both accuracy of classifier and selected feature subset size. DNA expression dataset are used for estimating the performance of the proposed method. Experimental results show that this method can achieve better performance for pattern recognition problems than conventional ones.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1382-1389
• /
• 2007

This paper presents a new approach for solving the problem of maintenance scheduling of generating units using a binary particle swarm optimization (BPSO). In this paper, we find the optimal solution of the maintenance scheduling of generating units within a specific time horizon using a binary particle swarm optimization algorithm, which is the discrete version of a conventional particle swarm optimization. It is shown that the BPSO method proposed in this paper is effective in obtaining feasible solutions in the maintenance scheduling of generating unit. IEEE reliability test systems(1996) including 32-generators are selected as a sample system for the application of the proposed algorithm. From the result, we can conclude that the BPSO can find the optimal solution of the maintenance scheduling of the generating unit with the desirable degree of accuracy and computation time, compared to other heuristic search algorithm such as genetic algorithms. It is also envisaged that BPSO can be easily implemented for similar optimizations and scheduling problems in power system problems to obtain better solutions and improve convergence performance.

• Korean Management Science Review
• /
• v.28 no.2
• /
• pp.53-62
• /
• 2011

The objective of this paper is to propose a Binary Particle Swarm Optimization(BPSO) for design of reporting cell management system. The assignment of cells to reporting or non-reporting cells is an NP-complete problem having an exponential complexity in the Reporting Cell Location Management(RCLM) system. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration(location update) and search(paging) operations to minimize the cost of RCLM system. Experimental results demonstrate that BPSO is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.30 no.4
• /
• pp.261-269
• /
• 2019

This study investigates a method of designing pixel-type frequency selective surfaces(FSS) with flexibility while considering factors, such as polarization and incident angle. Among the various methods used to solve the discrete space problem when designing a pixel-type FSS, the binary particle swarm optimization(BPSO) algorithm is one of the most applicable techniques to determine the periodic structure pattern of an FSS. Therefore, a method of efficiently designing FSS with roll-off band pass characteristics using an improved BPSO algorithm is proposed. To solve the convergence problem in the fitness function design to induce particles in the desired solution, FSS with desired roll-off wave characteristics can be easily obtained by applying a fitness function using "slope" as an input parameter.

• Journal of Information Processing Systems
• /
• v.18 no.5
• /
• pp.665-676
• /
• 2022

In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

• Journal of the Optical Society of Korea
• /
• v.18 no.1
• /
• pp.82-88
• /
• 2014

A binary-coupled dipole approximation (BCDA) is described for designing metal nanoparticles with nonperiodic structures in one, two, and three dimensions. This method can be used to simulate the variation of near- and far-field properties through the interactions of metal nanoparticles. An advantage of this method is in its combination with the binary particle swarm optimization (BPSO) algorithm to find the best array of nanoparticles from all possible arrays. The BPSO algorithm has been used to design an array of plasmonic nanospheres to achieve maximum absorption, scattering, and extinction coefficient spectra. In BPSO, a swarm consists of a matrix with binary entries controlling the presence ('1') or the absence ('0') of nanospheres in the array. This approach is useful in optical applications such as solar cells, biosensors, and plasmonic nanoantennae, and optical cloaking.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.6
• /
• pp.527-533
• /
• 2013

BCI (Brain-Computer Interface) is a system that transforms a subject's brain signal related to their intention into a control signal by classifying EEG (electroencephalograph) signals obtained during the imagination of movement of a subject's limbs. The BCI system allows us to control machines such as robot arms or wheelchairs only by imaging limbs. With the exact same experiment environment, activated brain regions of each subjects are totally different. In that case, a simple approach is to use as many channels as possible when measuring brain signals. However the problem is that using many channels also causes other problems. When applying a CSP (Common Spatial Pattern), which is an EEG extraction method, many channels cause an overfitting problem, and in addition there is difficulty using this technique for medical analysis. To overcome these problems, we suggest an optimal channel selection method using a BPSO (Binary Particle Swarm Optimization), BPSO with channel impact factor, and GA. This paper examined optimal selected channels among all channels using three optimization methods and compared the classification accuracy and the number of selected channels between BPSO, BPSO with channel impact factor, and GA by SVM (Support Vector Machine). The result showed that BPSO with channel impact factor selected 2 fewer channels and even improved accuracy by 10.17~11.34% compared with BPSO and GA.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.774-779
• /
• 2012

Brain-computer interface based on motor imagery is a system that transforms a subject's intention into a control signal by classifying EEG signals obtained from the imagination of movement of a subject's limbs. For the new paradigm, we do not know which positions are activated or not. A simple approach is to use as many channels as possible. The problem is that using many channels causes other problems. When applying a common spatial pattern (CSP), which is an EEG extraction method, many channels cause an overfit problem, in addition there is difficulty using this technique for medical analysis. To overcome these problems, we suggest a binary particle swarm optimization with channel impact factor in order to select channels close to the most important channels as channel selection method. This paper examines whether or not channel impact factor can improve accuracy by Support Vector Machine(SVM).

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.146-158
• /
• 2022

With the success of the digital economy and the rapid development of its technology, network security has received increasing attention. Intrusion detection technology has always been a focus and hotspot of research. A hybrid model that combines particle swarm optimization (PSO) and kernel extreme learning machine (KELM) is presented in this work. Continuous-valued PSO and binary PSO (BPSO) are adopted together to determine the parameter combination and the feature subset. A fitness function based on the detection rate and the number of selected features is proposed. The results show that the method can simultaneously determine the parameter values and select features. Furthermore, competitive or better accuracy can be obtained using approximately one quarter of the raw input features. Experiments proved that our method is slightly better than the genetic algorithm-based KELM model.