• Title/Summary/Keyword: Adaptive Optimization

Search Result 585, Processing Time 0.029 seconds

Improvement of Search Efficiency in Optimization Algorithm using Self-adaptive Harmony Search Algorithms (매개변수 자가적응 화음탐색 알고리즘의 성능 비교를 통한 최적해 탐색 효율 향상)

  • Choi, Young Hwan;Lee, Ho Min;Yoo, Do Guen;Kim, Joong Hoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.1
    • /
    • pp.1-11
    • /
    • 2018
  • In various engineering fields, determining the appropriate parameter set is a cumbersome and difficult task when solving optimization problems. Despite the appropriate parameter setting through parameter sensitivity analysis, there are limits to evaluating whether the parameters are appropriate for all optimization problems. For this reason, kinds of a Self-adaptive Harmony searches have been developed to solve various engineering problems by the appropriate setting of algorithm's own parameters according to the problem. In this study, various types of Self-adaptive Harmony searches were investigated and the characteristics of optimization were categorized. Six algorithms with a differentiation of optimization process were applied and compared with not only the mathematical optimization problem, but also the engineering problem, which has been applied widely in the algorithm performance comparisons. The performance of each algorithm was compared, and the statistical performance indicators were used to evaluate the application results quantitatively.

Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.226-249
    • /
    • 2016
  • The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

An adaptive X-FEM and its application to shape optimization (적응 확장 유한요소기법과 형상최적설계로의 응용)

  • Yu, Yong-Gyun;Huh, Jae-Sung;Tezuka, Akira;Kwak, Byung-Man
    • Proceedings of the KSME Conference
    • /
    • 2007.05a
    • /
    • pp.538-543
    • /
    • 2007
  • A procedure is proposed to generate optimal grid with minimal user intervention while keeping a prescribed level of accuracy, using an adaptive X-FEM and applied to shape optimization. In spite of various advantages of X-FEM, however, there are several obstacles for practical applications. Because of using a uniform background mesh and additional degree of freedoms for enrichment, an X-FEM is usually computationally more expensive than traditional finite element method. Furthermore, there are often accuracy problems. For an automatic procedure of optimal mesh generation, an h-adaptive scheme and a posteriori error estimation obtained by a post-processing process are utilized. The procedure is shown by 2-D shape optimization examples.

  • PDF

A Study on feedrate Optimization System for Cutting Force Regulation (절삭력 추종을 위한 이송속도 최적화 시스템에 관한 연구)

  • 김성진;정영훈;조동우
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.4
    • /
    • pp.214-222
    • /
    • 2003
  • Studies on the optimization of machining process can be divided into two different approaches: off-line feedrate scheduling and adaptive control. Each approach possesses its respective strong and weak points compared to each other. That is, each system can be complementary to the other. In this regard, a combined system, which is a feedrate control system fur cutting force optimization, was proposed in this paper to make the best of each approach. Experimental results show that the proposed system could overcome the weak points of the off-line feedrate scheduling system and the adaptive control system. In addition, from the figure, it can be confirmed that the off-line feedrate scheduling technique can improve the machining quality and can fulfill its function in the machine tool which has a adaptive controller.

A Study on the Fast Converging Algorithm for LMS Adaptive Filter Design (LMS 적응 필터 설계를 위한 고속 수렴 알고리즘에 관한 연구)

  • 신연기;이종각
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.19 no.5
    • /
    • pp.12-19
    • /
    • 1982
  • In general the design methods of adaptive filter are divided into two categories, one is based upon the local parameter optimization theory and the other is based upon stability theory. Among the various design techniques, the LMS algorithm by steepest-descent method which is based upon local parameter optimization theory is used widely. In designing the adaptive filter, the most important factor is the convergence rate of the algorithm. In this paper a new algorithm is proposed to improve the convergence rate of adaptive firter compared with the commonly used LMS algorithm. The faster convergence rate is obtained by adjusting the adaptation gain of LMS algorithm. And various aspects of improvement of the adaptive filter characteristics are discussed in detail.

  • PDF

Optimal Adaptive Multiband Spectrum Sensing in Cognitive Radio Networks

  • Yu, Long;Wu, Qihui;Wang, Jinlong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.3
    • /
    • pp.984-996
    • /
    • 2014
  • In this paper, optimal sensing time allocation for adaptive multiband spectrum sensing-transmission procedure is investigated. The sensing procedure consists of an exploration phase and a detection phase. We first formulate an optimization problem to maximize the throughput by designing not only the overall sensing time, but also the sensing time for every stage in the exploration and detection phases, while keeping the miss detection probability for each channel under a pre-defined threshold. Then, we transform the initial non-convex optimization problem into a convex bilevel optimization problem to make it mathematically tractable. Simulation results show that the optimized sensing time setting in this paper can provide a significant performance gain over the previous studies.

Adaptive Parallel Decomposition for Multidisciplinary Design

  • Park, Hyung-Wook;Lee, Se J.;Lee, Hyun-Seop;Park, Dong-Hoon
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.5
    • /
    • pp.814-819
    • /
    • 2004
  • The conceptual design of a rotorcraft system involves many different analysis disciplines. The decomposition of such a system into several subsystems can make analysis and design more efficient in terms of the total computation time. Adaptive parallel decomposition makes the structure of the overall design problem suitable to apply the multidisciplinary design optimization methodologies and it can exploit parallel computing. This study proposes a decomposition method which adaptively determines the number and sequence of analyses in each sub-problem corresponding to the available number of processors in parallel. A rotorcraft design problem is solved and as a result, the adaptive parallel decomposition method shows better performance than other previous methods for the selected design problem.

Application of Multivariate Adaptive Regression Spline-Assisted Objective Function on Optimization of Heat Transfer Rate Around a Cylinder

  • Dey, Prasenjit;Das, Ajoy K.
    • Nuclear Engineering and Technology
    • /
    • v.48 no.6
    • /
    • pp.1315-1320
    • /
    • 2016
  • The present study aims to predict the heat transfer characteristics around a square cylinder with different corner radii using multivariate adaptive regression splines (MARS). Further, the MARS-generated objective function is optimized by particle swarm optimization. The data for the prediction are taken from the recently published article by the present authors [P. Dey, A. Sarkar, A.K. Das, Development of GEP and ANN model to predict the unsteady forced convection over a cylinder, Neural Comput. Appl. (2015) 1-13]. Further, the MARS model is compared with artificial neural network and gene expression programming. It has been found that the MARS model is very efficient in predicting the heat transfer characteristics. It has also been found that MARS is more efficient than artificial neural network and gene expression programming in predicting the forced convection data, and also particle swarm optimization can efficiently optimize the heat transfer rate.

An Algorithm for Bit Error Rate Monitoring and Adaptive Decision Threshold Optimization Based on Pseudo-error Counting Scheme

  • Kim, Sung-Man
    • Journal of the Optical Society of Korea
    • /
    • v.14 no.1
    • /
    • pp.22-27
    • /
    • 2010
  • Bit error rate (BER) monitoring is the ultimate goal of performance monitoring in all digital transmission systems as well as optical fiber transmission systems. To achieve this goal, optimization of the decision threshold must also be considered because BER is dependent on the level of decision threshold. In this paper, we analyze a pseudo-error counting scheme and propose an algorithm to achieve both BER monitoring and adaptive decision threshold optimization in optical fiber transmission systems. To verify the effectiveness of the proposed algorithm, we conduct computer simulations in both Gaussian and non-Gaussian distribution cases. According to the simulation results, BER and the optimum decision threshold can be estimated with the errors of < 20% and < 10 mV, respectively, within 0.1-s processing time in > 40-Gb/s transmission systems.

A Design Of Control System Satisfying Multi-Performance Specifications Using Adaptive Genetic Algorithms (적응 유전자 알고리즘을 이용한 다수의 성능 사양을 만족하는 제어계의 설계)

  • 윤영진;원태현;이영진;이만형
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2002.04a
    • /
    • pp.621-624
    • /
    • 2002
  • The purpose of this paper is a study on getting proper gain set of PID controller which satisfies multi-performance specifications of the control system. The multi-objective optimization method is introduced to evaluate specifications, and the genetic algorithm is used as an optimal problem solver. To enhance the performance of genetic algorithm itself, adaptive technique is included. According to the proposed method in this paper, finding suitable gain set can be more easily accomplishable than manual gain seeking and tuning.

  • PDF