• Title/Summary/Keyword: stochastic optimization methods

Search Result 81, Processing Time 0.025 seconds

Real-time implementation of the 2.4kbps EHSX Speech Coder Using a $TMS320C6701^TM$ DSPCore ($TMS320C6701^TM$을 이용한 2.4kbps EHSX 음성 부호화기의 실시간 구현)

  • 양용호;이인성;권오주
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.962-970
    • /
    • 2004
  • This paper presents an efficient implementation of the 2.4 kbps EHSX(Enhanced Harmonic Stochastic Excitation) speech coder on a TMS320C6701$^{TM}$ floating-point digital signal processor. The EHSX speech codec is based on a harmonic and CELP(Code Excited Linear Prediction) modeling of the excitation signal respectively according to the frame characteristic such as a voiced speech and an unvoiced speech. In this paper, we represent the optimization methods to reduce the complexity for real-time implementation. The complexity in the filtering of a CELP algorithm that is the main part for the EHSX algorithm complexity can be reduced by converting program using floating-point variable to program using fixed-point variable. We also present the efficient optimization methods including the code allocation considering a DSP architecture and the low complexity algorithm of harmonic/pitch search in encoder part. Finally, we obtained the subjective quality of MOS 3.28 from speech quality test using the PESQ(perceptual evaluation of speech quality), ITU-T Recommendation P.862 and could get a goal of realtime operation of the EHSX codec.c.

Study of Supporting Location Optimization for a Structure under Non-uniform Load Using Genetic Algorithm (유전알고리즘을 이용한 비균일 하중을 받는 구조물의 지지 위치 최적화 연구)

  • Kim, G.H.;Lee, Y.S.;Kim, H.K.;Her, N.I.;Sa, J.W.;Yang, H.L.;Kim, B.C.;Bak, J.S.
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1322-1327
    • /
    • 2003
  • It is important to determine supporting locations for structural stability of a structure under non-uniform load in space interfered by other parts. In this case, There are many local optima with discontinuous design space. Therefore, The traditional optimization methods based on derivative are not suitable. Whereas, Genetic algorithm(GA) based on stochastic search technique is a very robust and general method. This paper has been presented to determine supporting locations of the vertical supports for reducing stress of the KSTAR(Korea super Superconducting Tokamak Advanced Research) IVCC(In-vessel control coil) under non-uniform electromagnetic load and space interfered by other parts using genetic algorithm. For this study, we develop a program combining finite element analysis with a genetic algorithm to perform structural analysis of IVCC. In addition, this paper presents a technique to perform optimization with FEM when design variables are trapped in an incongruent design space.

  • PDF

The Optimal Design of gas oven assembly line with the Simulation and Evolution Strategy (시물레이션과 진화 전략을 이용한 가스 오븐 조립라인의 최적 설계)

  • Kim, Kyung-Rok;Lee, Hong-Chul
    • Proceedings of the KAIS Fall Conference
    • /
    • 2009.12a
    • /
    • pp.715-718
    • /
    • 2009
  • The assembly line is one of the typical process hard to analyze with mathematical methods including even stochastic approaches, because it includes many manual operations varying drastically depending on operators' skills. In this paper, we suggest the simulation optimization method to design the optimal assembly line of a gas oven. To achieve the optimal design, firstly, we modeled the real gas oven assembly line with actual data, such as assembly procedures, operation rules, and other input parameters and so on. Secondly, we build some alternatives to enhance the line performance based on business rules and other parameters. The DOE(Design Of Experiment) techniques were used for testing alternatives under various situations. Each alternatives performed optimization process with evolution strategy; one of the GA(Genetic Algorithm) techniques. As a result, we can make about 7% of throughputs up with the same time and cost. By this process, we expect the assembly line can obtain the solution compatible with their own problems.

  • PDF

An Investigation on Dynamic Portfolio Selection Problems Utilizing Stochastic Receding Horizon Approach (확률적 구간이동 기법을 활용한 동적 포트폴리오 선정 문제에 관한 고찰)

  • Park, Joo-Young;Jeong, Jin-Ho;Park, Kyung-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.3
    • /
    • pp.386-393
    • /
    • 2012
  • Portfolio selection methods based on stochastic receding horizon approach, which were recently reported in the field of financial engineering, can explicitly consider the dynamic characteristics of wealth evolution and various constraints in the process of performing optimal portfolio selection. In view of the theoretical value, versatility, and effectiveness that receding horizon approach has achieved in many engineering problems, dynamic portfolio selection methods based on stochastic receding horizon optimization technique have the possibility of becoming an important breakthrough. This paper observes through theoretical investigations that the SDP(semi-definite program)-based portfolio selection procedure can be simplified, and has obtained meaningful performance on returns from simulation studies applying the simplified version to Korean financial markets.

Genetic Algorithms for Optimal Augmentation of Water Distribution Networks (유전자 알고리즘을 이용한 배수관망의 최적 확장 설계)

  • Lee, Seung-Cheol;Lee, Sang-Il
    • Journal of Korea Water Resources Association
    • /
    • v.34 no.5
    • /
    • pp.567-575
    • /
    • 2001
  • A methodology is developed for designing the minimum-cost water distribution network. The method is based on network simulations and an optimization scheme using genetic algorithms. Being a stochastic optimization scheme, genetic algorithms have advantages over the conventional search algorithms in solving network problems known for their nonlinearities and herculean computational costs. While existing methods focus on the design of either entirely new or parallel augmentation of network systems, the proposed method can be applied to problems having both new branches of tree-type and paralle augmentation in loops. The applicability of the method was shown through a case study for Baekryeon water supply system. The optimized design resulted in the maximum 5.37% savings compared to the conventional design without optimization, while meeting the hydraulic constraints.

  • PDF

The Optimization of Sizing and Topology Design for Drilling Machine by Genetic Algorithms (유전자 알고리즘에 의한 드릴싱 머신의 설계 최적화 연구)

  • Baek, Woon-Tae;Seong, Hwal-Gyeong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.12
    • /
    • pp.24-29
    • /
    • 1997
  • Recently, Genetic Algorithm(GA), which is a stochastic direct search strategy that mimics the process of genetic evolution, is widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA is very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GA. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher porbability of convergence to global optimum compared to traditional techniques which take one-point search method. The methods consist of three genetics opera- tions named selection, crossover and mutation. In this study, a method of finding the omtimum size and topology of drilling machine is proposed by using the GA, For rapid converge to optimum, elitist survival model,roulette wheel selection with limited candidates, and multi-point shuffle cross-over method are adapted. And pseudo object function, which is the combined form of object function and penalty function, is used to include constraints into fitness function. GA shows good results of weight reducing effect and convergency in optimal design of drilling machine.

  • PDF

Multicriteria shape design of a sheet contour in stamping

  • Oujebbour, Fatima-Zahra;Habbal, Abderrahmane;Ellaia, Rachid;Zhao, Ziheng
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.187-193
    • /
    • 2014
  • One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

Shape Optimization and Reliability Analysis of the Dovetail of the Disk of a Gas Turbine Engine (가스터빈엔진 디스크의 도브테일 형상 최적화와 신뢰도 해석)

  • Huh, Jae-Sung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.38 no.4
    • /
    • pp.379-384
    • /
    • 2014
  • The most critical rotating parts of a gas turbine engine are turbine blades and disc, given that they must operate under severe conditions such as high turbine inlet temperature, high speeds, and high compression ratios. Owing to theses operating conditions and high rotational speed energy, some failures caused by turbine disks and blades are categorized into catastrophic and critical, respectively. To maximize the margin of structural integrity, we aim to optimize the vulnerable area of disc-blade interface region. Then, to check the robustness of the obtained optimized solution, we evaluated structural reliability under uncertainties such as dimensional tolerance and fatigue life variant. The results highlighted the necessity for and limitations of optimization which is one of deterministic methods, and pointed out the requirement for introducing reliability-based design optimization which is one of stochastic methods. Thermal-structural coupled-filed analysis and contact analysis are performed for them.

Ensemble variable selection using genetic algorithm

  • Seogyoung, Lee;Martin Seunghwan, Yang;Jongkyeong, Kang;Seung Jun, Shin
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.6
    • /
    • pp.629-640
    • /
    • 2022
  • Variable selection is one of the most crucial tasks in supervised learning, such as regression and classification. The best subset selection is straightforward and optimal but not practically applicable unless the number of predictors is small. In this article, we propose directly solving the best subset selection via the genetic algorithm (GA), a popular stochastic optimization algorithm based on the principle of Darwinian evolution. To further improve the variable selection performance, we propose to run multiple GA to solve the best subset selection and then synthesize the results, which we call ensemble GA (EGA). The EGA significantly improves variable selection performance. In addition, the proposed method is essentially the best subset selection and hence applicable to a variety of models with different selection criteria. We compare the proposed EGA to existing variable selection methods under various models, including linear regression, Poisson regression, and Cox regression for survival data. Both simulation and real data analysis demonstrate the promising performance of the proposed method.

Web-based Three-step Project Management Model and Its Software Development

  • Hwang Heung-Suk;Cho Gyu-Sung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.373-378
    • /
    • 2006
  • Recently the technical advances and complexities have generated much of the difficulties in managing the project resources, for both scheduling and costing to accomplish the project in the most efficient manner. The project manager is frequently required to render judgments concerning the schedule and resource adjustments. This research develops an analytical model for a schedule-cost and risk analysis based on visual PERT/CPM. We used a three-step approach: 1) in the first step, a deterministic PERT/CPM model for the critical path and estimating the project time schedule and related resource planning and we developed a heuristic model for crash and stretch out analysis based upon a time-cost trade-off associated with the crash and stretch out of the project. 2) In second step, we developed web-based risk evaluation model for project analysis. Major technologies used for this step are AHP (analytic hierarchy process, fuzzy-AHP, multi-attribute analysis, stochastic network simulation, and web based decision support system. Also we have developed computer programs and have shown the results of sample runs for an R&D project risk analysis. 3) We developed an optimization model for project resource allocation. We used AHP weighted values and optimization methods. Computer implementation for this model is provided based on GUI-Type objective-oriented programming for the users and provided displays of all the inputs and outputs in the form of GUI-Type. The results of this research will provide the project managers with efficient management tools.

  • PDF