• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1782-1791
• /
• 2017

In this paper, an optimal design of hybrid magnetic levitation(Maglev) system using intelligent optimization algorithms is proposed. The proposed maglev system adopts hybrid suspension system with permanent-magnet(PM) and electro magnet(EM) to reduce the suspension power loss and the teaching-learning based optimization(TLBO) that can overcome the drawbacks of conventional intelligent optimization algorithm is used. To obtain the mathematical model of hybrid suspension system, the magnetic equivalent circuit including leakage fluxes are used. Also, design restrictions such as cross section areas of PM and EM, the maximum length of PM, magnetic force are considered to choose the optimal parameters by intelligent optimization algorithm. To meet desired suspension power and lower power loss, the multi object function is proposed. To verify the proposed object function and intelligent optimization algorithms, we analyze the performance using the mean value and standard error of 10 simulation results. The simulation results show that the proposed method is more effective than conventional optimization methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.392-400
• /
• 2008

This paper proposes a novel optimization algorithm inspired by bacteria behavior patterns for foraging. Most bacteria can trace attractant chemical molecules for foraging. This tracing capability of bacteria called chemotaxis might be optimized for foraging because it has been evolved for few millenniums. From this observation, we developed a new optimization algorithm based on the chemotaxis of bacteria in this paper. We first define behavior and decision rules based on the behavior patterns of bacteria and then devise an optimization algorithm with these behavior and decision rules. Generally bacteria have a quorum sensing mechanism that makes it possible to effectively forage, but we leave its implementation as a further work for simplicity. Thereby, we call our algorithm a simple bacteria cooperative optimization (BCO) algorithm. Our simple BCO is tested with four function optimization problems on various' parameters of the algorithm. It was found from experiments that the simple BCO can be a good framework for optimization.

• Journal of Computing Science and Engineering
• /
• v.8 no.1
• /
• pp.1-10
• /
• 2014

The Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization algorithm. This paper first analyzes the chemotaxis, as well as elimination and dispersal operation, based on the basic Bacterial Foraging Optimization Algorithm. The elimination and dispersal operation makes a bacterium which has found or nearly found an optimal position escape away from that position, which greatly affects the convergence speed of the algorithm. In order to avoid this escape, the sphere of action of the elimination and dispersal operation can be altered in accordance with the generations of evolution. Secondly, we put forward an algorithm of an adaptive adjustment of step length we called improved bacterial foraging optimization (IBFO) after making a detailed analysis of the impacts of the step length on the efficiency and accuracy of the algorithm, based on chemotaxis operation. The classic test functions show that the convergence speed and accuracy of the IBFO algorithm is much better than the original algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.432-436
• /
• 2009

We have developed a new optimization algorithm termed simple bacteria cooperative optimization (sBCO) based on bacteria behavior patterns [1]. In [1], we have introduced the algorithm with basic operations and showed its feasibility with some function optimization problems. Since the sBCO was the first version with only basic operations, its performance was not so good. In this paper, we adopt a new operation, rank replacement, to the sBCO for improving its performance and compare its results to those of the simple genetic algorithm (sGA) which has been well known and widely used as an optimization algorithm. It was found from the experiments with four function optimization problems that the sBCO with rank replacement was superior to the sGA. This shows that our algorithm can be a good optimization algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.2
• /
• pp.173-180
• /
• 2012

This paper proposes a novel optimization algorithm inspired by water flowing and shaking behaviors in a vessel. Water drops in our algorithm flow to the gradient descent direction and are sometimes shaken for getting out of local optimum areas when most water drops fall in local optimum areas. These flowing and shaking operations allow our algorithm to quickly approach to the global optimum without staying in local optimum areas. We experimented our algorithm with four function optimization problems and compared its results with those of particle swarm optimization. Experimental results showed that our algorithm is superior to the particle swarm optimization algorithm in terms of the speed and success ratio of finding the global optimum.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1013-1016
• /
• 1999

Simple Genetic Algorithm(SGA) proposed by J. H. Holland is a population-based optimization method based on the principle of the Darwinian natural selection. The theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. Although GA does well in many applications as an optimization method, still it does not guarantee the convergence to a global optimum in GA-hard problems and deceptive problems. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve. In this paper we propose an extended schema theorem associated with a schema co-evolutionary algorithm(SCEA), which explains why the co-evolutionary algorithm works better than SGA. The experimental results show that the SCEA works well in optimization problems including deceptive functions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.694-700
• /
• 2010

This paper proposes the intelligent shift algorithm for automatic transmissions and develops the simulator for the its optimization and analysis. It provides the comfortable ride to drivers and improves the driving force efficiency without any loss of the performance. In addition, the developed simulator not only cuts the commercialization cost but provides diverse test conditions. The analysis and optimization of the proposed scheme are verified by the developed simulator. As a simple example, the developed simulator verifies the proposed algorithm and shows the comparative result with the existed automatic transmission shift algorithm.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.717-726
• /
• 2015

In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.175-178
• /
• 2002

The proposed immune algorithm has an uncomplicated structure and memory-cell mechanism as the optimization algorithm which imitates the principle of humoral immune response, and has been used as methods to solve parameter optimization problems. Up to now, the applications of immune algorithm have been optimization problems with non-varying system parameters. Therefore, the effect of memory-cell mechanism, which is a merit of immune algorithm, is without. this paper proposes the immune algorithm using a memory-cell mechanism which can be the application of system with nonlinear varying parameters. To verified performance of the proposed immune algorithm, the speed control of nonlinear DC motor are performed. Computer simulation studies show that the proposed immune algorithm has a fast convergence speed and a good control performances under the varying system parameters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.176-179
• /
• 2007

In this paper, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1].