• Title/Summary/Keyword: local optimal solution

Search Result 215, Processing Time 0.034 seconds

Intelligent Control of Induction Motor Using Hybrid System GA-PSO

  • Kim, Dong-Hwa;Park, Jin-Il
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1086-1091
    • /
    • 2005
  • This paper focuses on intelligent control of induction motor by hybrid system consisting of GA-PSO. Induction motor has been using in industrial area. However, it is challengeable on how we control effectively. From this point, an optimal solution using GA (Genetic Algorithm) and PSO (Particle Swarm Optimization) is introduced to intelligent control. In this case, it is possible to obtain local solution because chromosomes or individuals which have only a close affinity can convergent. To improve an optimal learning solution of control, This paper deal with applying PSO and Euclidian data distance to mutation procedure on GA's differentiation. Through this approaches, we can have global and local optimal solution together, and the faster and the exact optimal solution without any local solution. Four test functions are used for proof of this suggested algorithm.

  • PDF

Localization and a Distributed Local Optimal Solution Algorithm for a Class of Multi-Agent Markov Decision Processes

  • Chang, Hyeong-Soo
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.3
    • /
    • pp.358-367
    • /
    • 2003
  • We consider discrete-time factorial Markov Decision Processes (MDPs) in multiple decision-makers environment for infinite horizon average reward criterion with a general joint reward structure but a factorial joint state transition structure. We introduce the "localization" concept that a global MDP is localized for each agent such that each agent needs to consider a local MDP defined only with its own state and action spaces. Based on that, we present a gradient-ascent like iterative distributed algorithm that converges to a local optimal solution of the global MDP. The solution is an autonomous joint policy in that each agent's decision is based on only its local state.cal state.

Performance based optimal seismic retrofitting of yielding plane frames using added viscous damping

  • Lavan, O.;Levy, R.
    • Earthquakes and Structures
    • /
    • v.1 no.3
    • /
    • pp.307-326
    • /
    • 2010
  • This paper is concerned with the optimal seismic design of added viscous dampers in yielding plane frames. The total added damping is minimized for allowable values of local performance indices under the excitation of an ensemble of ground motions in both regular and irregular structures. The local performance indices are taken as the maximal inter-story drift of each story and/or the normalized hysteretic energy dissipated at each of the plastic hinges. Gradients of the constraints with respect to the design variables (damping coefficients) are derived, via optimal control theory, to enable an efficient first order optimization scheme to be used for the solution of the problem. An example of a ten story three bay frame is presented. This example reveals the following 'fully stressed characteristics' of the optimal solution: damping is assigned only to stories for which the local performance index has reached the allowable value. This may enable the application of efficient and practical analysis/redesign type methods for the optimal design of viscous dampers in yielding plane frames.

Hyper Parameter Tuning Method based on Sampling for Optimal LSTM Model

  • Kim, Hyemee;Jeong, Ryeji;Bae, Hyerim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.1
    • /
    • pp.137-143
    • /
    • 2019
  • As the performance of computers increases, the use of deep learning, which has faced technical limitations in the past, is becoming more diverse. In many fields, deep learning has contributed to the creation of added value and used on the bases of more data as the application become more divers. The process for obtaining a better performance model will require a longer time than before, and therefore it will be necessary to find an optimal model that shows the best performance more quickly. In the artificial neural network modeling a tuning process that changes various elements of the neural network model is used to improve the model performance. Except Gride Search and Manual Search, which are widely used as tuning methods, most methodologies have been developed focusing on heuristic algorithms. The heuristic algorithm can get the results in a short time, but the results are likely to be the local optimal solution. Obtaining a global optimal solution eliminates the possibility of a local optimal solution. Although the Brute Force Method is commonly used to find the global optimal solution, it is not applicable because of an infinite number of hyper parameter combinations. In this paper, we use a statistical technique to reduce the number of possible cases, so that we can find the global optimal solution.

THE GLOBAL OPTIMAL SOLUTION TO THE THREE-DIMENSIONAL LAYOUT OPTIMIZATION MODEL WITH BEHAVIORAL CONSTRAINTS

  • Jun, Tie;Feng, Enmin
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.313-321
    • /
    • 2004
  • In this paper we study the problem of three-dimensional layout optimization on the simplified rotating vessel of satellite. The layout optimization model with behavioral constraints is established and some effective and convenient conditions of performance optimization are presented. Moreover, we prove that the performance objective function is locally Lipschitz continuous and the results on the relations between the local optimal solution and the global optimal solution are derived.

A study of Optimal Reconfiguration in Distribution Power System using Initial Operating Point (초기 운전점 선정을 통한 배전계통 최적 재구성에 관한 연구)

  • Seo, Gyu-Seok;Kim, Jung-Nyun;Baek, Young-Sik
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.3
    • /
    • pp.451-456
    • /
    • 2007
  • This paper presents a problem that reconfigure distribution power system using branch exchange method. Optimal reconfiguration problem calculates line loss, voltage condition about system states of all situations that become different according to line On/off status, and search for optimum composition of these. However, result is difficult to be calculated fast. Because radiated operation condition of system is satisfied using many connection and sectionalize switches in the distribution power system. Therefore, in this paper, optimization method for reducing system total loss and satisfying operating condition of radial and constraints condition of voltage is proposed using the fastest branch exchange. And optimal solution at branch exchange algorithm can be wrong estimated to local optimal solution according to initial operating state. Considering this particular, an initial operating point algorithm is added and this paper showed that optimal solution arrives at global optimal solution.

A Study on Determining the Optimal Configuration of the FMS with Limited Local Buffers (제한된 Local Buffer를 가진 FMS의 최적구조 결정에 관한 연구)

  • Jeong, Yang-Geun;Kim, Seong-Sik;Jang, Dong-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.1
    • /
    • pp.105-116
    • /
    • 1989
  • This study presents an algorithm that determines the optimal configuration of the FMSs with limited local buffers. The algorithm finds the lowest cost configuration, i.e. the number of tools, the number of pallets as well as the number of buffers to be installed in front of each machine in the system. Thus it assures a given production ratio with a minimum cost. In the algorithm, FMSs are considered as the closed queueing network with limited queue length. System performance evaluation is performed using the Block-&-Recirculation model developed by Yao and Buzacott. The algorithm is composed with three steps. The steps are namely i) determination of a lower configuration, ii) derivation of an heuristic solution, and iii) obtaining the optimal solution. The computational efforts required in the algorithm usually lies within the capability of personal computers.

  • PDF

Optimal Environmental and Economic Operation using Evolutionary Computation and Neural Networks (진화연산과 신경망이론을 이용한 전력계통의 최적환경 및 경제운용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;You, Seok-Ku
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.12
    • /
    • pp.1498-1506
    • /
    • 1999
  • In this paper, a hybridization of Evolutionary Strategy (ES) and a Two-Phase Neural Network(TPNN) is applied to the optimal environmental and economic operation. As the evolutionary computation, ES is to search for the global optimum based on natural selection and genetics but it shows a defect of reducing the convergence rate in the latter part of search, and often does not search the exact solution. Also, neural network theory as a local search technique can be used to search a more exact solution. But it also has the defect that a solution frequently sticks to the local region. So, new algorithm is presented as hybrid methods by combining merits of two methods. The hybrid algorithm has been tested on Emission Constrained Economic Dispatch (ECED) problem and Weighted Emission Economic Dispatch (WEED) problem for optimal environmental and economic operation. The result indicated that the hybrid approach can outperform the other computational efficiency and accuracy.

  • PDF

Optimal Design of Squeeze Film Damper Using an Enhanced Genetic Algorithm (향상된 유전알고리듬을 이용한 스퀴즈 필름 댐퍼의 최적설계)

  • 김영찬;안영공;양보석
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2001.11b
    • /
    • pp.805-809
    • /
    • 2001
  • This paper is presented to determine the optimal parameters of squeeze film damper using an enhanced genetic algorithm (EGA). The damper design parameters are the radius, length and radial clearance of the damper. The objective function is minimization of a transmitted load between bearing and foundation at the operating and critical speeds of a flexible rotor. The present algorithm was the synthesis of a genetic algorithm with simplex method for a local concentrate search. This hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution and can find both the global and local optimum solution. The numerical example is presented that illustrated the effectiveness of enhanced genetic algorithm for the optimal design of the squeeze film damper for reducing transmitted load.

  • PDF

A Vehicle Routing Problem with Double-Trip and Multiple Depots by using Modified Genetic Algorithm (수정 유전자 알고리듬을 이용한 중복방문, 다중차고 차량경로문제)

  • Jeon, Geon-Wook;Shim, Jae-Young
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.28-36
    • /
    • 2004
  • The main purpose of this study is to find out the optimal solution of the vehicle routing problem considering heterogeneous vehicle(s), double-trips, and multi depots. This study suggests a mathematical programming model with new numerical formula which considers the amount of delivery and sub-tour elimination and gives optimal solution by using OPL-STUDIO(ILOG). This study also suggests modified genetic algorithm which considers the improvement of the creation method for initial solution, application of demanding point, individual and last learning method in order to find excellent solution, survival probability of infeasible solution for allowance, and floating mutation rate for escaping from local solution. The suggested modified genetic algorithm is compared with optimal solution of the existing problems. We found the better solution rather than the existing genetic algorithm. The suggested modified genetic algorithm is tested by Eilon and Fisher data(Eilon 22, Eilon 23, Eilon 30, Eilon 33, and Fisher 10), respectively.