• Title/Summary/Keyword: polynomial optimization

Search Result 354, Processing Time 0.023 seconds

Studies on Computer Optimization Techniques for Hydrophilic Vehicle Compositions

  • Lee, Chi-Ho;Shin, Young-Hee
    • Archives of Pharmacal Research
    • /
    • v.11 no.3
    • /
    • pp.185-196
    • /
    • 1988
  • The inflence of hydrophilic vehicles on percutaneous absorption rate of griseofulvin was studied using intact skin of full thickness of hairless rat. The in vitro absorption rates were used as the characteristics for deciding the optimum formula of ointment vehicles. The optimum formula of vehicle compositions for maximum absorption rate was obtained from the polynomial regression equation and the two graphical techniques, contour graph and partial derivative graph. It was composed of sodium lauryl sulfate (1.65 W /W%), white petrolatum (16.5 W /W%), propylene glycol (12.0 W /W%), and stearyl alcohol (19.6W /W%). The experimental value obtained from the optimum formula and the prediction value were 33.99 and 33.87 ${\mu}g/\sqrt{min}$, respectively. From these results, it was believed that optimum formula for semisolid dosage forms could be obtained from the application of the optimization technique used in this study.

  • PDF

Energy Optimization of a Biped Robot for Walking a Staircase Using Genetic Algorithms

  • Jeon, Kweon-Soo;Park, Jong-Hyeon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.215-219
    • /
    • 2003
  • In this paper, we generate a trajectory minimized the energy gait of a biped robot for walking a staircase using genetic algorithms and apply to the computed torque controller for the stable dynamic biped locomotion. In the saggital plane, a 6 degree of freedom biped robot that model consists of seven links is used. In order to minimize the total energy efficiency, the Real-Coded Genetic Algorithm (RCGA) is used. Operators of genetic algorithms are composed of a reproduction, crossover and mutation. In order to approximate the walking gait, the each joint angle is defined as a 4-th order polynomial of which coefficients are chromosomes. Constraints are divided into equality and inequality. Firstly, equality constraints consist of position conditions at the end of stride period and each joint angle and angular velocity condition for periodic walking. On the other hand, inequality constraints include the knee joint conditions, the zero moment point conditions for the x-direction and the tip conditions of swing leg during the period of a stride for walking a staircase.

  • PDF

Optimization of Process Variables for the Soda Pulping of Carpolobia Lutea (Polygalaceae) G. Don

  • Ogunsile, B.O.;Uba, F.I.
    • Journal of the Korean Chemical Society
    • /
    • v.56 no.2
    • /
    • pp.257-263
    • /
    • 2012
  • The selection of suitable delignification conditions and optimization of process variables is crucial to the successful operation of chemical pulping processes. Soda pulping of Carpolobia lutea was investigated, as an alternative raw material for pulp and paper production. The process was optimized under the influence of three operational variables, namely, temperature, time and concentration of cooking liquor. Equations derived using a second - order polynomial design predicted the pulp yield and lignin dissolution with errors less than 8% and 11% respectively. The maximum variations in the pulp yield using a second order factorial design was caused by changes in both time and alkali concentration. Optimum pulp yield of 43.87% was obtained at low values of the process variables. The selectivity of lignin dissolution was independent of the working conditions, allowing quantitative estimations to be established between the pulp yield and residual lignin content within the range studied.

Finding Optimal Small Networks by Mathematical Programming Models (수리계획 모형을 이용한 최적의 작은 네트워크 찾기)

  • Choi, Byung-Joo;Lee, Hee-Sang
    • IE interfaces
    • /
    • v.21 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

Optimization of Process Parameters Using a Genetic Algorithm for Process Automation in Aluminum Laser Welding with Filler Wire (용가 와이어를 적용한 알루미늄 레이저 용접에서 공정 자동화를 위한 유전 알고리즘을 이용한 공정변수 최적화)

  • Park, Young-Whan
    • Journal of Welding and Joining
    • /
    • v.24 no.5
    • /
    • pp.67-73
    • /
    • 2006
  • Laser welding is suitable for welding to the aluminum alloy sheet. In order to apply the aluminum laser welding to production line, parameters should be optimized. In this study, the optimal welding condition was searched through the genetic algorithm in laser welding of AA5182 sheet with AA5356 filler wire. Second-order polynomial regression model to estimate the tensile strength model was developed using the laser power, welding speed and wire feed rate. Fitness function for showing the performance index was defined using the tensile strength, wire feed rate and welding speed which represent the weldability, product cost and productivity, respectively. The genetic algorithm searched the optimal welding condition that the wire feed rate was 2.7 m/min, the laser power was 4 kW and the welding speed was 7.95 m/min. At this welding condition, fitness function value was 137.1 and the estimated tensile strength was 282.2 $N/mm^2$.

Generating Mechanisms of Initial and Candidate Solutions in Simulated Annealing for Packet Communication Network Design Problems (패킷 통신 네트워크 설계를 위한 시뮬레이티드 애닐링 방법에서 초기해와 후보해 생성방법)

  • Yim Dong-Soon;Woo Hoon-Shik
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.3
    • /
    • pp.145-155
    • /
    • 2004
  • The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

Resolutions of NP-complete Optimization Problem (최적화 문제 해결 기법 연구)

  • Kim Dong-Yun;Kim Sang-Hui;Go Bo-Yeon
    • Journal of the military operations research society of Korea
    • /
    • v.17 no.1
    • /
    • pp.146-158
    • /
    • 1991
  • In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

  • PDF

Estimation of Qualities and Inference of Operating Conditions for Optimization of Wafer Fabrication Using Artificial Intelligent Methods

  • Bae, Hyeon;Kim, Sung-Shin;Woo, Kwang-Bang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1101-1106
    • /
    • 2005
  • The purpose of this study was to develop a process management system to manage ingot fabrication and the quality of the ingot. The ingot is the first manufactured material of wafers. Operating data (trace parameters) were collected on-line but quality data (measurement parameters) were measured by sampling inspection. The quality parameters were applied to evaluate the quality. Thus, preprocessing was necessary to extract useful information from the quality data. First, statistical methods were employed for data generation, and then modeling was accomplished, using the generated data, to improve the performance of the models. The function of the models is to predict the quality corresponding to the control parameters. The dynamic polynomial neural network (DPNN) was used for data modeling that used the ingot fabrication data.

  • PDF

A Study on Simultaneous Optimization of Multiple Response Surfaces (다중 반응표면분석에서의 최적화 문제에 관한 연구)

  • Yoo, Jeong-Bin
    • Journal of Korean Society for Quality Management
    • /
    • v.23 no.3
    • /
    • pp.84-92
    • /
    • 1995
  • A method is proposed for the simultaneous optimization of several response functions that depend on the same set of controllable variables and are adequately represented by a response surface model (polynomial regression model) with the same degree and with constraint that the individual responses have the target values. First, the multiple responses data are checked for linear dependencies among the responses by eigenvalue analysis. Thus a set of responses with no linear functional relationships is used in developing a function that measures the distance estimated responses from the target values. We choose the optimal condition that minimizes this measure. Also, under the different degree of importance two step procedures are proposed.

  • PDF

A Study on the Optimum Design of Independent Suspension Final Reduction Gear (특수차량 독립현가형 종감속기의 최적설계에 대한 연구)

  • Jo, Young-Jik;Jeon, Eeon-chan;Kang, Jung-ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.7 no.4
    • /
    • pp.135-141
    • /
    • 2008
  • Independent suspension axle and final reduction gear for special-purpose vehicles such as a armored vehicles are almost imported in Germany etc. so, developing them is necessary to save cost. In severe condition (open fields, water surface driving, obstacle pass), special-purpose vehicles must work well. Drop box, axle and final reduction gear performed static analysis. We know that is possible weight reduction. The purpose of this paper is to find out the optimal shape of final reduction gear's case by means of response surface methodology. The response surface method is the statistical method which can be applied to the non-sensitivity based optimization. The response surface which is constructed by the least square method contains only the polynomial terms so that the global maximum and minimum points are easily obtained.

  • PDF