• Journal of Power Electronics
• /
• 제12권1호
• /
• pp.104-112
• /
• 2012

In this paper a new method for the design of a simple PI controller is presented and it has been applied in the control of a Boost based PFC rectifier. The Strength Pareto evolutionary algorithm, which is based on the Pareto Optimality concept, used in Game theory literature is implemented as a multi-objective optimization approach to gain a good transient response and a high quality input current. In the proposed method, the input current harmonics and the dynamic response have been assumed as objective functions, while the PI controller's gains of the PFC rectifier (Kpi, Tpi) are design variables. The proposed algorithm generates a set of optimal gains called a Pareto Set corresponding to a Pareto Front, which is a set of optimal results for the objective functions. All of the Pareto Front points are optimum, but according to the design priority objective function, each one can be selected. Simulation and experimental results are presented to prove the superiority of the proposed design methodology over other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.971-989
• /
• 2015

With the development of cloud computing, more and more Web services are deployed on geo-distributed datacenters and are offered to cloud users all over the world. Through service composition technologies, these independent fine-grain services can be integrated to value-added coarse-grain services. During the composition, a number of Web services may provide the same function but differ in performance. In addition, the distribution of cloud datacenters presents a geographically dispersive manner, which elevates the impact of the network on the QoS of composite services. So it is important to select an optimal composition path in terms of QoS when many functionally equivalent services are available. To achieve this objective, we first present a graph model that takes both QoS of Web services and QoS of network into consideration. Then, a novel approach aiming at selecting the optimal composition path that fulfills the user's end-to-end QoS requirements is provided. We evaluate our approach through simulation and compare our method with existing solutions. Results show that our approach significantly outperforms existing solutions in terms of optimality and scalability.

• 전자공학회논문지
• /
• 제53권11호
• /
• pp.166-174
• /
• 2016

본 논문에서는 스포츠 이벤트에서 선수단 수송 계획을 위한 혼합 정수 선형 계획법 모델을 제안하였다. 선수단 수송 계획은 선수단을 다수의 숙소에서 경기장까지 최소의 비용과 빠른 시간 계획을 찾는 것이다. 운행 회수를 의사결정 변수로 하고, 전체 수송비용은 최소가 되어야 하는 목적함수가 된다. 제안한 방법은 혼합 정수 선형 계획법을 이용하여 전역 최적점을 찾을 수 있는 장점이 있다. 제안한 방식의 유용성을 확인하기 위해서 시뮬레이션을 수행하고 스포츠 이벤트 관리 서비스 플랫폼(SEMSP)에서 수송 계획을 구축하였다.

• 대한기계학회논문집
• /
• 제11권1호
• /
• pp.26-35
• /
• 1987

본 연구에서는 (1) 삭도설계에 더욱 정확한 값을 얻기 위하여 엄밀해를 가진 현수곡선이론을 바탕으로 하여 설계변수들과의 관계를 유도 및 체계화 시켰다. (2) 다목적 함수를 벡터최소화함에 따라, 얻어지는 Pareto 최적해를 구할 수 있었다. Pareto 최적해를 구하는 방법에는 중첨법, 제한법, 추정법이 있다. 여기서는 삭도의 최적화에 대한 특성과 평가값은 서로 복잡한 trad off관계를 가지고 있으므로 다목적 인 두개의 목적함수에 중첩시켜 단일목적 함수로 변환하는 가운데 Kunn-Tuck최적생의 필요조건을 적용하면 목적함수의 값 범위를 해석적으로 정하고 Pareto최적해 집합을 해석적으로 구한다. (3) 이들의 해석에 관한 수치예를 들어 설계에 기준이 되는 로 우프의 규격과 초기장력을 결정하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.1256-1261
• /
• 2004

Nonlinear Response Optimization using Equivalent Static Loads (NROESL) method/algorithm is proposed to perform optimization of non-linear response structures. It is more expensive to carry out nonlinear response optimization than linear response optimization. The conventional method spends most of the total design time on nonlinear analysis. Thus, the NROESL algorithm makes the equivalent static load cases for each response and repeatedly performs linear response optimization and uses them as multiple loading conditions. The equivalent static loads are defined as the loads in the linear analysis, which generates the same response field as those in non-linear analysis. The algorithm is validated for the convergence and the optimality. The function satisfies the descent condition at each cycle and the NROESL algorithm converges. It is mathematically validated that the solution of the algorithm satisfies the Karush-Kuhn-Tucker necessary condition of the original nonlinear response optimization problem. The NROESL algorithm is applied to two structural problems. Conventional optimization with sensitivity analysis using the finite difference method is also applied to the same examples. The results of the optimizations are compared. The proposed method is very efficient and derives good solutions.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.113-143
• /
• 1997

Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

• Steel and Composite Structures
• /
• 제7권1호
• /
• pp.53-70
• /
• 2007

This paper presents a analysis of the problem of optimal design of the beams with two I-type cross section shapes. These types of beams are simply supported and subject to pure bending. The strength and stability conditions were formulated and analytically solved in the form of mathematical equations. Both global and selected types of local stability forms were taken into account. The optimization problem was defined as bicriteria. The cross section area of the beam is the first objective function, while the deflection of the beam is the second. The geometric parameters of cross section were selected as the design variables. The set of constraints includes global and local stability conditions, the strength condition, and technological and constructional requirements in the form of geometric relations. The optimization problem was formulated and solved with the help of the Pareto concept of optimality. During the numerical calculations a set of optimal compromise solutions was generated. The numerical procedures include discrete and continuous sets of the design variables. Results of numerical analysis are presented in the form of tables, cross section outlines and diagrams. Results are discussed at the end of the work. These results may be useful for designers in optimal designing of thin-walled beams, increasing information required in the decision-making procedure.

• 대한화학회지
• /
• 제39권1호
• /
• pp.14-22
• /
• 1995

주어진 시간에 금속 고체 내부의 목표 부위에 탄성에너지를 집중시킬 수 있도록 표면에 가해주는 최적의 레이저 pulse의 형태를 디자인 하는 문제에 관하여 연구하였다. 금속고체 표면에 레이저를 쪼여주면 흡수된 광에너지가 열로 바뀌어 열팽창에 의하여 종파와 횡파가 고체 내부로 전파된다. 최소의 레이저의 세기를 사용하고 다른 부위에 영향을 최소화하면서 목표 부위에 원하는 에너지를 집중시킬 수 있는 최적의 레이저 펄스의 형태를 공액 변화 방법과 반 공간 Green 함수를 이용한 유한 요소법으로 조사하였다. 최적의 레이저 펄스로부터 원하는 시간에 목표 부위에 탄성에너지를 집중시키는 것을 보여주었고 또한 대부분의 에너지가 방향성이 큰 횡파로부터 온다는 것을 알았다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• 한국해양공학회지
• /
• 제18권4호
• /
• pp.65-70
• /
• 2004

Many port states, such as New Zealand, U.S.A., Australia, and Canada, have strict regulations to prevent arriving ships from discharging polluted ballast water that contains harmful aquatic organisms and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, ballast exchange in deep sea is perceived as the most effective method of emptying ballast water. The ballast management plan contains the effective exchange method, ballast system, and safety considerations. In this study, we pursued both nautical engineering analysis and optimization of the algorithm, in order to generate the sequence of stability and rapidity. A heuristic algorithm was chosen on the basis of optimality and applicability to a sequential exchange problem. We have built an optimized algorithm for the automatic exchange of ballast water, by redefining core elements of the A$\ast$ algorithm, such as node, operator, and evaluation function. The final version of the optimized algorithm has been applied to existing bulk carrier, and the performance of the algorithm has been successfully verified.