• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.786-792
• /
• 2011

The present paper presents an optimal capacitor placement (OCP) algorithm for voltagestability enhancement. The OCP issue is represented using a mixed-integer problem and a highly nonlinear problem. The hybrid particle swarm optimization (HPSO) algorithm is proposed to solve the OCP problem. The HPSO algorithm combines the optimal power flow (OPF) with the primal-dual interior-point method (PDIPM) and ordinary PSO. It takes advantage of the global search ability of PSO and the very fast simulation running time of the OPF algorithm with PDIPM. In addition, OPF gives intelligence to PSO through the information provided by the dual variable of the OPF. Numerical results illustrate that the HPSO algorithm can improve the accuracy and reduce the simulation running time. Test results evaluated with the three-bus, New England 39-bus, and Korea Electric Power Corporation systems show the applicability of the proposed algorithm.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권11호
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.

• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1636-1648
• /
• 2006

In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.233-243
• /
• 2009

This paper concerns an algorithm that combines line search and trust region step for nonlinear optimization problems. Unlike traditional trust region methods, we incorporate the Armijo line search technique into trust region method to solve the subproblem. In addition, the subproblem is solved accurately, but instead solved by inaccurate method. If a trial step is not accepted, our algorithm performs the Armijo line search from the failed point to find a suitable steplength. At each iteration, the subproblem is solved only one time. In contrast to interior methods, the optimal solution is derived by iterating from outside of the feasible region. In numerical experiment, we apply the algorithm to nonlinear portfolio optimization problems, primary numerical results are presented.

• 에너지공학
• /
• 제11권4호
• /
• pp.291-298
• /
• 2002

본 연구에서는 전력산업 구조개편 환경에서 최적조류계산에 의한 전력조류 및 한계계수를 해석할 수 있는 실용적인 방법론을 제시한다. 먼저, 유용한 한계계수의 산정을 위해 전압제약, 선로과부하 제약, 발전 출력 제약 등의 각종 계통제약이 고려된 연료비 및 송전손실 최소화의 비선형 최적화 문제가 정식화되고 비선형 주·쌍대 내점법에 의한 해법이 제시된다. 또한, 최적조류계산에 의해 계산된 감도에 기초하여 한계가격 및 한계송전손실의 산정방법이 제시된다. 특히, 경쟁적 전력시장에서 송전손실에 관한 가격을 반영하기 위해 한계손실계수의 해석법이 제안된다. 본 연구의 결과를 IEEE RTS 24모선에 적용하여 전력시장가격의 해석에 대한 그 유용성을 검증하였다.

• Structural Engineering and Mechanics
• /
• 제92권1호
• /
• pp.99-110
• /
• 2024

The crack propagation path can be considered as a boundary problem in which the crack advances towards the interior of the domain. Consequently, this poses an optimization problem wherein the local crack-growth direction angle can be treated as a design variable. The advantage of this approach is that the continuous minimization of strain energy naturally leads to the mode I propagation path. Furthermore, this procedure does not rely on the precise characterization of the stress field at the crack tip and is independent of stress intensity factors. This paper proposes an algorithm based on internal point exploration as well as shape sensitivity optimization and strain energy minimization to determine the crack propagation direction. To implement this methodology, the algorithm utilizes a modeling GUI associated with an academic analysis program based on the Dual Boundary Elements Method and determines the propagation path by exploiting the elastic strain energy at points in the domain that are candidates to be included in the boundary. The sensitivity of the optimal solution is also assessed in the vicinity of the optimum point, ensuring the stability and robustness of the solution. The results obtained demonstrate that the proposed methodology accurately predicts the crack propagation direction in Mode I opening for a single crack (lateral and central). Furthermore, robust optimal solutions were achieved in all cases, indicating that the optimal solution was not highly sensitive to changes in the design variable in the vicinity of the optimal point.

• 한국실내디자인학회논문집
• /
• 제24권3호
• /
• pp.30-37
• /
• 2015

The target of design is a harmony between Beauty and Usefulness. Design is a result from representation of visual language by designer's creative thinking system. also, As an ill-defined problem cannot be described completely. and subjectively interpret depend on the situation, it is very difficult to present a theoretical standard. There have been many Design Sciences researches in recent years. such as Rule Based Design, Parametric Design, Replacement Design, Analogy Design, Metaphor Design, Genetic Algorithm. but Objective research is still unsatisfactory condition to investigate true nature about Design. At this point, It is very important to formulating about meaning of Design Language and Thinking. This study will define about that, and based on this definition, Lay out a logical basis for Treatment design variable and materialization of process by "Elements", "Relationship", "Schema". ultimately it look forward to provide a framework and minimize the complexity about Design Thinking.

• 한국CDE학회논문집
• /
• 제22권1호
• /
• pp.59-69
• /
• 2017

Internal capacity of a refrigerator is an important indicator for design and purchasing criteria. The components facing the internal space may have holes or gaps between parts. In traditional way, design engineers manually remodeled the parts to fill the holes and the gaps for enclosed boundary of the internal space. Then they calculated internal volume by subtracting the assembly of parts from its enclosing volume. However, filling holes and gaps is not an automated process requiring a plenty of labor and time. In this research, we have developed a voxel-based method to estimate the internal volume of a refrigerator automatically. It starts transforming all components facing the interior space into voxels and fills all holes and gaps automatically by the developed hole-filling algorithm to form a completely closed boundary of the assembly. Then, it identifies the boundary voxels that are facing to the internal voxels with any part of the component. After getting the intersection points between the boundary voxels and the surfaces of components, it generates the boundary surface of triangular facets with the intersection points. Finally, it estimates the internal volume by adding volume of each tetrahedron composed of a triangle of boundary surface and an arbitrary point.

• 대한수학회보
• /
• 제42권4호
• /
• pp.837-849
• /
• 2005

In this paper, we obtain a successive quadratic programming algorithm for solving the semidefinite programming (SDP) relaxation of the binary quadratic programming. Combining with a randomized method of Goemans and Williamson, it provides an efficient approximation for the binary quadratic programming. Furthermore, its convergence result is given. At last, We report some numerical examples to compare our method with the interior-point method on Maxcut problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1-4
• /
• 1996

It is difficult that a non-translational motion in a block is estimated by the block matching algorithm (BMA). In this paper, a nodal-displacement-based deformation model is used for this reason. This model assumes that a selected number of control nodes move freely in a block and that displacement of any interior point can be interpolated from nodal displacements. As a special case with a single node this model is equivalent to a translational model. And this model can represent more complex deformation using more nodes. We used an iterative gradient based search algorithm to estimate nodal displacement. Each iteration involves the solution of a simple linear equation. This method is called the deformable block matching algorithm (DBMA).