• Steel and Composite Structures
• /
• 제26권2호
• /
• pp.163-170
• /
• 2018

The purpose of this paper is to present a new and efficient optimization algorithm called Jaya for optimum design of steel grillage structure. Constrained size optimization of this type of structure based on the LRFD-AISC is carried out with integer design variables by using cross-sectional area of W-shapes. The objective function of the problem is to find minimum weight of the grillage structure. The maximum stress ratio and the maximum displacement in the inner point of steel grillage structure are taken as the constraint for this optimization problem. To calculate the moment and shear force of the each member and calculate the joint displacement, the finite elements analysis is used. The developed computer program for the analysis and design of grillage structure and the optimization algorithm for Jaya are coded in MATLAB. The results obtained from this study are compared with the previous works for grillage structure. The results show that the Jaya algorithm presented in this study can be effectively used in the optimal design of grillage structures.

• 한국항공우주학회지
• /
• 제33권6호
• /
• pp.45-50
• /
• 2005

GPS 반송파 측정값을 이용하게 되면 수 cm 이하의 정밀도로 위치 결정을 수행 할 수 있으며, 두 개 이상의 안테나를 움직이는 물체에 장착할 경우 정밀한 자세 결정을 수행할 수 있다. GPS 반송파 측정값을 사용하는 경우 항상 미지정수 결정의 어려움이 발생하게 되며, 미지정수 결정 과정에서 올바른 결정을 할 수 있는 척도로 성공확률을 확인할 필요가 있다. 본 논문에서 저궤도 위성의 자세 결정을 위하여 이중차분된 측정값을 사용하게 되며, 이때 만들어진 측정행렬과 측정값의 공분산을 이용하여 성공확률을 계산하게 된다. 성공확률을 향상시키기 위하여 저궤도 위성의 위치벡터와 자세벡터가 수직이라는 제한 조건을 사용하여 측정값을 증가시키는 방법을 제안하였다. 적용된 저궤도 위성의 궤도는 우리별 3호의 궤도 정보를 이용하여 만들었으며 시뮬레이션을 통하여 그 결과를 확인 하였다.

• 전자공학회논문지
• /
• 제53권9호
• /
• pp.38-45
• /
• 2016

본 논문은 다관절 철도 차량의 효율성 및 안정성 향상을 위해 분산형 제어 시스템 구축 시 이더넷 기반의 Train Communication Network(TCN) 적용안을 제시하고, 해당 망의 최적 네트워크 토폴로지 구성을 위한 방법론을 제안한다. 적용된 TCN은 백본 망과 하위 망의 계층 구성을 갖고, 하위 망이 관장하는 차량의 수에 따른 전송 딜레이와 안정성을 경유 노드 수와 차량 간 케이블 수로 모델링한다. 이를 기반으로 목적 함수를 정의하고 최적해를 도출하기 위한 방법론을 제시한다. 차량 수의 정수 제약 조건을 완화하여 목적함수의 최적 실수해를 먼저 도출하고, 이로부터 최적 정수해를 탐색하는 방법을 이용한다. 수치 결과를 통해, 도출된 해의 특성을 다양한 관점에서 분석한다.

• 산업경영시스템학회지
• /
• 제39권1호
• /
• pp.98-104
• /
• 2016

With the development of modern science and technology, weapon systems such as tanks, submarines, combat planes, radar are also dramatically advanced. Among these weapon systems, the ballistic missile, one of the asymmetric forces, could be considered as a very economical means to attack the core facilities of the other country in order to achieve the strategic goals of the country during the war. Because of the current ballistic missile threat from the North Korea, establishing a missile defense (MD) system becomes one of the major national defense issues. This study focused on the optimization of air defense artillery units' deployment for effective ballistic missile defense. To optimize the deployment of the units, firstly this study examined the possibility of defense, according to the presence of orbital coordinates of ballistic missiles in the limited defense range of air defense artillery units. This constraint on the defense range is originated from the characteristics of anti-ballistic missiles (ABMs) such as PATRIOT. Secondly, this study proposed the optimized mathematical model considering the total covering problem of binary integer programming, as an optimal deployment of air defense artillery units for defending every core defense facility with the least number of such units. Finally, numerical experiments were conducted to show how the suggested approach works. Assuming the current state of the Korean peninsula, the study arbitrarily set ballistic missile bases of the North Korea and core defense facilities of the South Korea. Under these conditions, numerical experiments were executed by utilizing MATLAB R2010a of the MathWorks, Inc.

• 정보보호학회논문지
• /
• 제27권3호
• /
• pp.427-437
• /
• 2017

불능 차분 특성은 해당 블록 암호를 랜덤 치환과 구별을 해주며, 키 복구 공격에도 사용될 수 있다. 최근 Cui 등이 ARX 기반 블록 암호에 대해 Mixed-Integer Linear Programming(MILP)를 이용해서 자동화된 불능 차분 특성 탐색 방법을 제안하였다. Cui 등이 제안한 방법을 개선하면 기존에 방법에 비해 더 적은 선형 제약식을 이용하여 기존 방식으로 찾지 못하는 불능 차분 특성까지 추가 되어 더 많은 불능 차분 특성을 찾아 낼 수 있다. 수정한 방법을 이용하여 SPECK family와 LEA에 적용하였다. SPECK32, SPECK48, SPECK64, SPECK96에 대해 7-라운드, SPECK128에 대해 8-라운드 불능 차분 특성을 찾아내었다. 이 불능 차분 특성은 모두 새롭게 발견된 것이다. LEA에 대해서는 기존의 10-라운드인 불능 차분 특성을 포함한 새로운 10-라운드 불능 차분 특성을 찾아내었다.

• 대한조선학회논문집
• /
• 제57권1호
• /
• pp.45-51
• /
• 2020

In this study, we developed an allocation optimization system for supply chain management in the shipbuilding and offshore construction industry. Supply chain operation is a way of operating manufacturing company responsible for the procurement of outfitting parts. The method about how to allocate the manufacturing volume to each partner company includes important decisions. According to the allocation method, the stability of the material supplied to the final installation process is guaranteed. We improved the allocation method that was previously decided by the person in charge. Based on the optimization engine, a system is developed that can automatically allocate the production volume. For optimization model configuration, factors affecting the volume allocation were analyzed and modeled as constraint factors. A target function is defined to minimize the difference in the load variance of each partner company. In order to use the same type of volume allocation engine for various outfitting products, the amount of work done by the partner company was standardized. We developed an engine that can allocate the same production load of each production partner. Using this engine, the operating system was developed and applied to the actual offshore project. It has been confirmed that the work load variance of suppliers can be maintained uniformly using the optimization engine rather than manual method. By this system, we stabilize the manufacturing process of partner suppliers.

• 한국수자원학회논문집
• /
• 제36권1호
• /
• pp.45-59
• /
• 2003

본 연구에서는 상수관의 개량사업을 보다 효율적으로 실시 할 수 있는 방법으로 국내 실정에 적합한 상수관로의 노후도 조사방법을 이용하여 매설된 관의 노후도를 예측 근거한 최적 개량 모형을 제시하였다. 노후도 예측 모형은 확률론적 신경망 이론을 바탕으로 관별 노후도 정도를 5개 등급으로 구분하며 산정된 관별 노후도 등급 및 관경을 바탕으로 최대 잔존수명을 산정하였다. 최적 개량 모형은 관의 유지보수, 갱생, 교체의 시기 및 비용을 산정하는 것으로 최단경로흐름을 응용한 정수계획법을 이용하여 제시하였다. 또한 개발된 최적 개량 모형은 보다 현실적인 모형을 구축하기 위해 예산제약 유무에 따라 2가지 구분하여 모형을 제시하였다. 따라서, 본 연구에서 제안된 모형은 상수관로의 관리를 위해 보다 정량적인 방법으로 활용할 수 있을 것이다.

• 전기학회논문지
• /
• 제58권6호
• /
• pp.1057-1064
• /
• 2009

This paper introduces a new approach based on a quantum-inspired evolutionary algorithm (QEA) to solve unit commitment (UC) problems. The UC problem is a complicated nonlinear and mixed-integer combinatorial optimization problem with heavy constraints. This paper proposes a bounded quantum evolutionary algorithm (BQEA) to effectively solve the UC problems. The proposed BQEA adopts both the bounded rotation gate, which is simplified and improved to prevent premature convergence and increase the global search ability, and the increasing rotation angle approach to improve the search performance of the conventional QEA. Furthermore, it includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in the UC problems. Since the excessive spinning reserve can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BQEA, it is applied to the large-scale power systems of up to 100-unit with 24-hour demand.

• 한국경영과학회지
• /
• 제33권4호
• /
• pp.63-82
• /
• 2008

The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.485-498
• /
• 1996

For a tree T rooted at a concentrator location in a telecommunication system, we assume that the capacity H for the concentrator is given and a profit $c_v$, and a demand $d_v$, on each node $\upsilon$ of T are also given. Then, the capacitated subtree of a tree problem (CSTP) is to find a subtree of T rooted at the concentrator location so as to maximize the total profit, the sum of profits over the subtree, under the constraint satisfying that the sum of demands over the subtree does not exceed H. In this paper, we develop a pseudopolynomial-time algorithm for CSTP, the depth-first dynamic programming algorithm. We show that a CSTP can be solved by our algorithm in $\theta$ (nH) time, where n is the number of nodes in T. Our algorithm has its own advantage and outstanding computational performance incomparable with other approaches such as CPLEX, a general integer programming solver, when it is incorporated to solve a Local Access Telecommunication Network design problem. We report the computational results for the depth-first dynamic programming algorithm and also compare them with those for CPLEX. The comparison shows that our algorithm is competitive with CPLEX for most cases.