• 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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.1
• /
• pp.90-98
• /
• 2015

In this paper, an advanced teaching-learning based optimization(TLBO) method for the magnetic levitation controller of Maglev transportation system is proposed to optimize the control performances. An attraction-type levitation system is intrinsically unstable and requires a delicate control. It is difficult to completely satisfy the desired performance through the methods using conventional methods and intelligent optimizations. In the paper, we use TLBO and clonal selection algorithm to choose the optimal control parameters for the magnetic levitation controller. To verify the proposed algorithm, we compare control performances of the proposed method with the genetic algorithm and the particle swarm optimization. The simulation results show that the proposed method is more effective than conventional methods.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.2
• /
• pp.73-83
• /
• 2014

Many recent theoretical developments in the field of machine learning and control have rapidly expanded its relevance to a wide variety of applications. In particular, a variety of portfolio optimization problems have recently been considered as a promising application domain for machine learning and control methods. In highly uncertain and stochastic environments, portfolio optimization can be formulated as optimal decision-making problems, and for these types of problems, approaches based on probabilistic machine learning and control methods are particularly pertinent. In this paper, we consider probabilistic machine learning and control based solutions to a couple of portfolio optimization problems. Simulation results show that these solutions work well when applied to real financial market data.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.171-177
• /
• 2013

This paper presents a fuzzy set method to enforce complementarity constraints (CCs) in a nonlinear interior point method (NIPM)-based optimization. NIPM is a Newton-type approach to nonlinear programming problems, but it adopts log-barrier functions to deal with the obstacle of managing inequality constraints. The fuzzy-enforcement method has been implemented for CCs, which can be incorporated in optimization problems for real-world applications. In this paper, numerical simulations that apply this method to power system optimal power flow problems are included.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.241-244
• /
• 2000

The optimization method based on an enhanced genetic algorithms is proposed for multimodal function optimization in this paper This method is consisted of two main steps. The first step is global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide resemblance between individuals and research optimum solutions by single point method in reconstructive research space. Two numerical examples are also presented in this paper to comparing with conventional methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.629-633
• /
• 1998

Proposed here is a parallel genetic algorithm accompanied with intermittent migration among subpopulations. It is intended to maintain diversity in the population for a long period . This method was applied to finding out the global maximum of some multimodal functions for which no other methods seem to be useful . Preferable results and their detailed analysis are also presented.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.69-72
• /
• 2001

In this paper, we propose a new design method for bidirectional associative memories model with high error correction ratio. We extend the conventional GBAM model using bias terms and formulate a design procedure in the form of a constrained optimization problem. The constrained optimization problem is then transformed into a GEVP(generalized eigenvalue problem), which can be efficiently solved by recently developed interior point methods. The effectiveness of the proposed approach is illustrated by a example.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.1-6
• /
• 2002

Hopfield introduced the neural network for linear program with linear constraints. In this paper, Hopfield neural network has been generalized to solve the optimization problems including nonlinear constraints. Also, it has been discussed the methods hew to reconcile optimization problem with neural networks and how to implement the circuits.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.2
• /
• pp.81-86
• /
• 2016

Term weighting is a popular technique that effectively weighs the term features to improve accuracy in document classification. While several successful term weighting algorithms have been suggested, none of them appears to perform well consistently across different data domains. In this paper we propose several reasonable methods to combine different term weight vectors to yield a robust document classifier that performs consistently well on diverse datasets. Specifically we suggest two approaches: i) learning a single weight vector that lies in a convex hull of the base vectors while minimizing the class prediction loss, and ii) a mini-max classifier that aims for robustness of the individual weight vectors by minimizing the loss of the worst-performing strategy among the base vectors. We provide efficient solution methods for these optimization problems. The effectiveness and robustness of the proposed approaches are demonstrated on several benchmark document datasets, significantly outperforming the existing term weighting methods.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.171-178
• /
• 2004

This study suggests a general paradigm enhancing genetic mutability. Mutability among heterogeneous members in a genetic population has been a major problem in application of genetic programming to diverse business problems. This suggested paradigm is implemented to developing new methods from existing methods. Within the evolutionary approach taken to designing new methods, a general representation scheme of the genetic programming framework, called a kernel, is introduced. The kernel is derived from the literature of algorithms and heuristics for combinatorial optimization problems. The commonality and differences among these methods have been identified and again combined by following the genetic inheritance merging them. The kernel was tested for selected methods in combinatorial optimization. It not only duplicates the methods in the literature, it also confirms that each of the possible solutions from the genetic mutation is in a valid form, a running program. This evolutionary method suggests diverse hybrid methods in the form of complete programs through evolutionary processes. It finally summarizes its findings from genetic simulation with insight.