• Computers and Concrete
• /
• v.21 no.5
• /
• pp.505-511
• /
• 2018

This paper investigates the potential of a hybrid model which combines the least squares support vector machine (LSSVM) and an improved particle swarm optimization (IMPSO) techniques for prediction of concrete compressive strength. A modified PSO algorithm is employed in determining the optimal values of LSSVM parameters to improve the forecasting accuracy. Experimental data on concrete compressive strength in the literature were used to validate and evaluate the performance of the proposed IMPSO-LSSVM model. Further, predictions from five models (the IMPSO-LSSVM, PSO-LSSVM, genetic algorithm (GA) based LSSVM, back propagation (BP) neural network, and a statistical model) were compared with the experimental data. The results show that the proposed IMPSO-LSSVM model is a feasible and efficient tool for predicting the concrete compressive strength with high accuracy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.64-67
• /
• 2008

DNA Chip을 이용한 실험은 그 결과에 대하여 대용량의 정보를 쏟아내고 있다. 이러한 데이터를 분석하는 다양한 기법 중, 미리 정해진 클래스에 데이터를 해당하는 클래스로 분류하는 기법인 분류화를 수행하여 의도한 목표를 위한 규칙을 찾아내고자 한다. 본 논문에서는 이를 위해 DNA Chip과 같은 방대한 양의 정보 분석에 대하여 적합한 생태계 모방 알고리즘인 PSO Algorithm을 사용하여 분류 규칙을 발견하여 이를 데이터에 적용, 분류하는 연구를 기술하고 있다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1023-1030
• /
• 2007

This paper presents a new and efficient approach for solving the economic dispatch (ED) problems with nonconvex cost functions using particle swarm optimization (PSO). Although the PSO is easy to implement and has been empirically shown to perform well on many optimization problems, it may easily get trapped in a local optimum when solving problems with multiple local optima and heavily constrained. This paper proposes an improved PSO, which combines the conventional PSO with chaotic sequences (CPSO). The chaotic sequences combined with the linearly decreasing inertia weights in PSO are devised to improve the global searching capability and escaping from local minimum. To verify the feasibility of the proposed method, numerical studies have been performed for two different nonconvex ED test systems and its results are compared with those of previous works. The proposed CPSO algorithm outperforms other state-of-the-art algorithms in solving ED problems, which consider valve-point and multi-fuels with valve-point effects.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.135-142
• /
• 2012

In this paper, we proposed a new architecture called radial basis function-based polynomial neural networks classifier that consists of heterogeneous neural networks such as radial basis function neural networks and polynomial neural networks. The underlying architecture of the proposed model equals to polynomial neural networks(PNNs) while polynomial neurons in PNNs are composed of Fuzzy-c means-based radial basis function neural networks(FCM-based RBFNNs) instead of the conventional polynomial function. We consider PNNs to find the optimal local models and use RBFNNs to cover the high dimensionality problems. Also, in the hidden layer of RBFNNs, FCM algorithm is used to produce some clusters based on the similarity of given dataset. The proposed model depends on some parameters such as the number of input variables in PNNs, the number of clusters and fuzzification coefficient in FCM and polynomial type in RBFNNs. A multiobjective particle swarm optimization using crowding distance (MoPSO-CD) is exploited in order to carry out both structural and parametric optimization of the proposed networks. MoPSO is introduced for not only the performance of model but also complexity and interpretability. The usefulness of the proposed model as a classifier is evaluated with the aid of some benchmark datasets such as iris and liver.

• Nuclear Engineering and Technology
• /
• v.51 no.1
• /
• pp.284-292
• /
• 2019

For the continuous operation of a nuclear reactor, burnt fuel needs to be replaced with fresh fuel, where appropriate (ex-vessel) fuel handling is required. Particularly for the Sodium-cooled Fast Reactor (SFR) refueling, its process has unique challenges due to liquid sodium coolant. The ex-vessel spent fuel transportation should concern several design features such as the radiation shielding, decay-heat removal, and inert space separated from air. This paper proposes a new design optimization methodology of cask shielding to transport the spent fuel assembly in a prototype SFR for the first time. The Particle Swarm Optimization (PSO) algorithm had been applied to design trade-offs between shielding and cask weight. The cask is designed as a double-cylinder structure to block an inert sodium region from the air-cooling space. The PSO process yielded the optimum shielding thickness of 26 cm, considering the weight as well. To confirm the shielding performance, the radiation dose of spent fuel removed at its peak burnup and after 1-year cooling was calculated. Two different fuel positions located during transportation were also investigated to consider a functional disorder in a cask drive system. This study concludes the current cask design in normal operations is satisfactory in accordance with regulatory rules.

• IE interfaces
• /
• v.25 no.2
• /
• pp.153-162
• /
• 2012

The reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure and it has been considered as one of the major design parameters in the field of industries. Reliability-Redundancy Optimization Problem(RROP) involves selec tion of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. However, in practice both active and cold standby redundancies may be used within a particular system design. Therefore, a redundancy strategy(active, cold standby) for each subsystem in order to maximize system reliability is considered in this study. Due to the nature of RROP, i.e. NP-hard problem, A Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve the mathematical programming model and it gives consistently better quality solutions than existing studies for benchmark problems.

• Advances in robotics research
• /
• v.2 no.2
• /
• pp.161-182
• /
• 2018

This paper proposes a novel receding horizon control (RHC) algorithm for formation control of a swarm of unmanned surface vehicles (USVs) using particle swarm optimization (PSO). The proposed control algorithm provides the coordinated path tracking of multi-agent USVs while preventing collisions and considering external disturbances such as ocean currents. A three degrees-of-freedom kinematic model of the USV is used for the RHC with guaranteed stability and convergence by incorporating a sequential Monte Carlo (SMC)-based particle initialization. An ocean current model-based estimator is designed to compensate for the effect of ocean currents on the USVs. This method is compared with the PSO-based RHC algorithms to demonstrate the performance of the formation control and the collision avoidance in the presence of ocean currents through numerical simulations.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.21-28
• /
• 2020

Fireworks Algorithm (FWA) is a relatively novel swarm-based metaheuristic algorithm for global optimization. To solve the low-efficient local searching problem and convergence of the FWA, this paper presents a Variable Amplitude Coefficient Fireworks Algorithm with Uniform Local Search Operator (namely VACUFWA). Firstly, the explosive amplitude is used to adjust improving the convergence speed dynamically. Secondly, Uniform Local Search (ULS) enhances exploitation capability of the FWA. Finally, the ULS and Variable Amplitude Coefficient operator are used in the VACUFWA. The comprehensive experiment carried out on 13 benchmark functions. Its results indicate that the performance of VACUFWA is significantly improved compared with the FWA, Differential Evolution, and Particle Swarm Optimization.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1658-1666
• /
• 2009

This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.