• Title/Summary/Keyword: partial optimization

Search Result 257, Processing Time 0.029 seconds

Optimization of a 3-Class-based Dedicated Linear Storage System (3지역/ 지정위치 일차선형 저장시스템의 최적화)

  • Yang, Moonhee;Kim, Sun-uk
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.3
    • /
    • pp.190-196
    • /
    • 2004
  • In this paper, we address a layout design problem, PTL[3], for determining an optimal 3-class-based dedicated linear storage layout in a class of unit load storage systems. Our objective is to minimize the expected single command travel time. We analyze PTL[3] to derive a fundamental property that an optimal solution to PTL[3] is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. Using the property and partial enumeration, we construct an efficient exact algorithm with O $(n\;{\lceil}\;log\;n\;{\rceil}\;)$ for solving PTL[3].

About fully Polynomial Approximability of the Generalized Knapsack Problem (일반배낭문제의 완전다항시간근사해법군의 존재조건)

  • 홍성필;박범환
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.4
    • /
    • pp.191-198
    • /
    • 2003
  • The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

Optimization of Cholesterol Removal Conditions from Homogenized Milk by Treatment with Saponin

  • Chang, E.J.;Oh, H.I.;Kwak, H.S.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.14 no.6
    • /
    • pp.844-849
    • /
    • 2001
  • This study was carried out to determine the optimum conditions for cholesterol removal from homogenized milk by treatment with saponin using a response surface methodology (RSM). The effects of temperature, reaction time, and amounts of celite or saponin added on cholesterol removal from milk were investigated. The level of cholesterol removal from milk increased with saponin concentration and varied from 57.4 to 73.3%. The optimum reaction time, amount of celite addition determined by a partial differentiation of the model equation, and amount of saponin addition were 30min, 0.95% and 1.5%, respectively. Under these conditions, the predicted cholesterol removal by RSM was estimated to be 73.4%. The experimental removal value was 73.7%. Thus, there was no appreciable difference between the experimental value and the predicted value based on RSM.

GENERATION OF RAY CLASS FIELDS MODULO 2, 3, 4 OR 6 BY USING THE WEBER FUNCTION

  • Jung, Ho Yun;Koo, Ja Kyung;Shin, Dong Hwa
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.343-372
    • /
    • 2018
  • Let K be an imaginary quadratic field with ring of integers ${\mathcal{O}}_K$. Let E be an elliptic curve with complex multiplication by ${\mathcal{O}}_K$, and let $h_E$ be the Weber function on E. Let $N{\in}\{2,3,4,6\}$. We show that $h_E$ alone when evaluated at a certain N-torsion point on E generates the ray class field of K modulo $N{\mathcal{O}}_K$. This would be a partial answer to the question raised by Hasse and Ramachandra.

Loss Minimization for Distribution Network using Partial Tree Search (부분 tree 탐색을 이용한 배전계통의 손실 최소화)

  • Choi, S.Y.;Shin, M.C.;Nam, G.Y.;Cho, P.H.;Park, J.S.
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.519-521
    • /
    • 2000
  • Network reconfiguration is an operation task, and consists in the determination of the switching operations such to reach the minimum loss conditions of the distribution network. In this paper, an effective heuristic based switch scheme for loss minimization is given for the optimization of distribution loss reduction and a solution approach is presented. The solution algorithm for loss minimization has been developed based on the two stage solution methodology. The first stage of this solution algorithm sets up a decision tree which represent the various switching operations available, the second stage applies a proposed technique called cyclic best first search. Therefore, the solution algorithm of proposed method can determine on-off switch statuses for loss reduction, with a minimum computational effort.

  • PDF

A NUMERICAL METHOD OF PREDRTERMINED OPTIMAL RESOLUTION FOR A REDUNDANT MANIPULATOR

  • Won, Jong-Hwa;Choi, Byoung-Wook;Chung, Myung-Jin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.1145-1149
    • /
    • 1990
  • This paper proposes a numerical method for redundant manipulators using predetermined optimal resolution. In order to obtain optimal joint trajectories, it is desirable to formulate redundancy resolution as an optimization problem having an integral cost criterion. We predetermine the trajectories of redundant joints in terms of the Nth partial sum of the Fourier series, which lead to the solution in the desirable homotopy class. Then optimal coefficients of the Fourier series, which yield the optimal solution within the predetermined class, are searched by the Powell's method. The proposed method is applied to a 3-link planar manipulator for cyclic tasks in Cartesian space. As the results, we can obtain the optimal solution in the desirable homotopy class without topological liftings of the solution. To show the validity of the proposed method, we analyze both optimal and extremal solutions by the Fast Fourier Transform (FFT) and discuss joint trajectories on the phase plane.

  • PDF

Inversion of Geophysical Data Using Genetic Algorithms (유전적 기법에 의한 지구물리자료의 역산)

  • Kim, Hee Joon
    • Economic and Environmental Geology
    • /
    • v.28 no.4
    • /
    • pp.425-431
    • /
    • 1995
  • Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

  • PDF

Estimating groundwater recharge from time series measurements of subsurface temperature

  • Koo, Min-Ho;Kim, Yongje
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2003.09a
    • /
    • pp.213-216
    • /
    • 2003
  • Efforts for better understanding of the interaction between groundwater recharge and thermal regime of the subsurface medium is gaining momentum for its diverse applications in water resources. A numerical model is developed to simulate temperature variations of the subsurface under time varying groundwater recharge. The model utilizes MacCormack scheme for finite difference approximation of the partial differential equation describing the conductive and advective heat transport. For the estimation of recharge rate, optimization of the model is realized by searching for the unknown parameters which minimize the root-mean-square error between simulated and measured temperatures. Simulation results for 22-year time series data of temperature measurements reveal that the proposed model can accurately simulate subsurface temperature variations resulting from the redistribution of the heat due to the movement of water and it can also estimate temporal variations of recharge. Seasonal variations of recharge and a linear relationship between precipitation and recharge are clearly reflected in the simulated results.

  • PDF

A Study on the Insulating Properties of Pressboard for High Voltage Transformer Applied the Mold of Eddy Current Loss (와전류 손실을 적용한 금형으로 제조된 초고압 변압기의 프레스보드의 절연 특성 연구)

  • Suh, Wang-Byuck
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.28 no.8
    • /
    • pp.508-512
    • /
    • 2015
  • Some insulating materials are tested and analyzed with variables to obtain the reliable pressboard which is located to core and coil of high voltage transformer. The high voltage transformer is used in electrical power system and operating reliability. Optimization possibility of pressboard shape including electrical insulation performance could be achieved by analysis simulation. Using insulating pressboard, which is made by mold applied eddy current loss, it could be measured the influences of moisture content for electrical properties. As a result, it is to contribute to improve the performance and ensure the reliability of the pressboard by investigating electrical strength according to the variation oil temperature. In addition pressboard thickness is important design factor to ensure electrical strength in high voltage transformer.

OPTIMAL PARTIAL HEDGING USING COHERENT MEASURE OF RISK

  • Kim, Ju-Hong
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.3_4
    • /
    • pp.987-1000
    • /
    • 2011
  • We show how the dynamic optimization problem with the capital constraint can be reduced to the problem to find an optimal modified claim $\tilde{\psi}H$ where $\tilde{\psi}$ is a randomized test in the static problem. Coherent risk measure is used as risk measure in the $L^{\infty}$ random variable spaces. The paper is written in expository style to some degree. We use an average risk of measure(AVaR), which is a special coherent risk measure, to see how to hedge the modified claim in a complete market model.