• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.210-223
• /
• 2020

Since constrained optimization algorithms are easy to fall into local optimum and their ability of searching are weak, an improved symbiotic organisms search algorithm with mixed strategy based on adaptive ε constrained (ε_SOSMS) is proposed in this paper. Firstly, an adaptive ε constrained method is presented to balance the relationship between the constrained violation degrees and fitness. Secondly, the evolutionary strategies of symbiotic organisms search algorithm are improved as follows. Selecting different best individuals according to the proportion of feasible individuals and infeasible individuals to make evolutionary strategy more suitable for solving constrained optimization problems, and the individual comparison criteria is replaced with population selection strategy, which can better enhance the diversity of population. Finally, numerical experiments on 13 benchmark functions show that not only is ε_SOSMS able to converge to the global optimal solution, but also it has better robustness.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.23-30
• /
• 2002

본 연구는 추가제약이 있는 최소 신장나무 문제(Constrained Minimum Spanning Tree : CMST문제)에 대한 유사다항시간 알고리듬 및 근사 해법 개발에 관한 것이다. CMST문제는 NP-hard문제임이 이미 증명되었으며, 이후 이 문제에 대해서는 근사해법 개발이 주된 관심이 되어왔다 [Ravi and Goemans 96]는 다항시간 근사 해법(PTAS)을 이미 개발하였고, [Marathe et at 98]은 가능해(feasible solution)는 아니지만, 앞으로 서술할 $(1+1/\varepsilon,\;+\epsilon)$사해를 구하는 완전다항시간 근사해법 (FPTAS)을 제시하였다. 이와는 달리 [Papa. and Yan, 00]는 파레토 근사 최적해를 구하는 FPTAS를 제시하였는데, 본 연구는 이들의 연구에서 주로 의존하고 있는 행렬-나무 정리(Tree-Matrix Theorem)를 보다 일반화하여, CMST문제에 대한 유사다항시간 알고리듬과 $(1+\varepsilon,\;1+\epsilon)$근사해를 구하는 FPTAS를 제시할 것이다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.275-277
• /
• 1998

최근 Ravi와 Goemanns는 즉 전체 길이의 합이 일정한 값을 넘지 않는 최소비용신장나무(minimum spanning tree problem)를 구하는 문제의 (1+$\varepsilon$,1)-근사해를 구할 수 있는 알고리듬을 제시하였다. 즉 비용은 최적을 보장하지만 전체길이 제약조건은 근사적으로 만족하는 해를 생성한다. 그러나 이러한 알고리듬은 문제의 비가능해를 생성 할 수 있으며 1/$\varepsilon$에 대하여 지수함수의 수행시간을 갖는다. 본 논문에서는 Ravi와 Geomanns의 알고리듬을 실용적으로 변형하여 전체 길이 제약조건을 정확히 만족하며, 그 비용은 최적비용과의 차이가 호의 비용 중 최대값을 넘지 않도록 보장하는 강성다항식 알고리듬을 제사한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4999-5008
• /
• 2015

The application of efficient constraint handling technique is fundamental method to find better solutions in engineering optimization problems with constraints. In this research four of constraint handling techniques are used with a meta-heuristic optimization method, harmony search algorithm, and the efficiency of algorithm is evaluated. The sample problem for evaluation of effectiveness is one of the typical discrete problems, optimal pipe size design problem of water distribution system. The result shows the suggested constraint handling technique derives better solutions than classical constraint handling technique with penalty function. Especially, the case of ${\varepsilon}$-constrained method derives solutions with efficiency and stability. This technique is meaningful method for improvement of harmony search algorithm without the need for development of new algorithm. In addition, the applicability of suggested method for large scale engineering optimization problems is verified with application of constraint handling technique to big size problem has over 400 of decision variables.

• Journal of the Korean GEO-environmental Society
• /
• v.8 no.4
• /
• pp.47-55
• /
• 2007

Using the results of the Piezocone Penetration Test (PCPT) which were executed at the Yangsan-Mulgum site, the applicability of the interpretation methods for estimating the coefficient of consolidation ($C_v$) of soft clay was evaluated. At the same time, laboratory soil tests using the total of 172 undisturbed soft clay samples from the 44 regions of the Yangsan-Mulgum site were performed to study the differency in the coefficient of consolidation ($C_v$) compared to the results of PCPT. The calculated constrained modulus ($M_{\varepsilon}$) and coefficient of consolidation ($C_v$) using the results of consolidation laboratory tests which are based upon the consolidation theory of Terzaghi were compared with the predicted constrained modulus ($M_p$) and coefficient of consolidation ($C_{v-{M_p}}$) from the PCPT. The relationship between the predicted constrained modulus ($M_p$) and the calculated constrained modulus($M_c$) were showed good correlation. The $M_p$ by the Jones & Rust method were showed mostly similar to the calculated constrained modulus ($M_c$). The relationship between the coefficient of consolidation ($C_v$) obtained from the consolidation tests and the calculated coefficient of consolidation ($C_{v-{M_p}}$) were showed a linear relationship. The results of the calculated coefficient of consolidation ($C_{v-{M_p}}$) were about 54% of the value of the coefficient of consolidation ($C_v$) obtained from the consolidation tests.

• Journal of The Korean Astronomical Society
• /
• v.24 no.1
• /
• pp.95-105
• /
• 1991

In the presence of synchrotron losses, diffusion of an ensembel of relativistic particles in an intraculster medium is investigated. The diffusion coefficient in the medium is found to be constrained by $28.8\;{\pm}\;0.4\;{\leq}\;Log\;D\;{\leq}\;30.5\;{\pm}\;0.4\;cm^2s^{-1}$ with the energy dependency of $D_0{\varepsilon}^{\mu}$ of ${\mu}=0.4{\pm}0.2$ as the previous observations suggested. As an important implication of the result, the brightest head-tail radio source NGC 4869, whose radio tail structure is indicative for its orbit within the cluster core, is considered to be the major contributor of particles for the formation of the Coma radio halo.