• 정보기술과데이타베이스저널
• /
• 제7권2호
• /
• pp.47-59
• /
• 2000

In this paper, we analyze the applicability of a general optimization algorithm to a database optimization problem. The index selection problem Is the problem to choose a set of indexes for a database in a way that the cost to process queries in the given workload is minimized subject to a given storage space restriction for storing indexes. The problem is well known in database research fields, and many optimization and/or heuristic algorithms have been proposed. Our work differs from previous research in that we formalize the problem in the form of non-linear Integer Programming model, and investigate the feasibility and applicability of a general purpose optimization algorithm, called OPBDP, through experiments. We implemented algorithms to generate workload data sets and problem instances for the experiment. The OPBDP algorithm, which is a non-linear 0-1 Integer Programming problem solver based on Davis-Putnam method, worked generally well for our problem formulation. The experiment result showed various performance characteristics depending on the types of decision variables, variable navigation methods and ocher algorithm parameters, and indicates the need of further study on the exploitation of the general purpose optimization techniques for the optimization problems in database area.

• Steel and Composite Structures
• /
• 제22권5호
• /
• pp.1163-1192
• /
• 2016

This paper presents the cost optimization of a composite I beam floor system, designed to be made from a reinforced concrete slab and steel I sections. The optimization was performed by the mixed-integer non-linear programming (MINLP) approach. For this purpose, a number of different optimization models were developed that enable different design possibilities such as welded or standard steel I sections, plastic or elastic cross-section resistances, and different positions of the neutral axes. An accurate economic objective function of the self-manufacturing costs was developed and subjected to design, resistance and deflection (in)equality constraints. Dimensioning constraints were defined in accordance with Eurocode 4. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm was applied together with a two-phase MINLP strategy. A numerical example of the optimization of a composite I beam floor system, as presented at the end of this paper, demonstrates the applicability of the proposed approach. The optimal result includes the minimal produced costs of the structure, the optimal concrete and steel strengths, and dimensions.

• 실천공학교육논문지
• /
• 제12권2호
• /
• pp.265-273
• /
• 2020

본 논문에서는 비전공자들을 위한 교양과목으로 적용할 수 있는 기초 데이터과학 실습 커리큘럼을 제안하고, 엑셀(스프레드시트) 데이터 분석 도구를 활용한 교육 방법을 제안하였다. 데이터 수집, 데이터 가공 및 데이터 분석을 위한 도구에는 엑셀, R, 파이썬, SQL(Structured Query Language) 등이 있다. R, 파이썬 및 SQL은 데이터 과학을 실습하는 데 있어, 프로그래밍 언어와 자료구조를 이해해야 한다. 반면에, 엑셀 도구는 비전공자들에게도 친숙한 데이터 분석도구로서, 프로그래밍 언어에 대한 학습 부담이 없다. 그리고 기초적인 데이터과학 실습을 엑셀로 진행하면, 데이터과학 이론을 습득하는 데 집중할 수 있는 장점이 있다. 본 논문에서는 한 학기 분량의 기초 데이터과학 실습 커리큘럼과 주별 엑셀 실습 내용을 제안하였다. 그리고, 교육 내용 실체를 실증하기위해, 엑셀 데이터분석 도구를 활용하여, 선형 회귀 분석(Linear Regression Analysis) 예제들을 제시하였다.

• 한국항해항만학회지
• /
• 제29권7호
• /
• pp.603-609
• /
• 2005

This paper presents the method for developing an optimum hull form with minimum wave resistance using SQP( sequential quadratic programming) as an optimization technique. The wave resistance is evaluated by a Rankine source panel method with non-linear free surface conditions and the ITTC 1957 friction line is used to predict the frictional resistance coefficient. The geometry of the hull surface is represented and modified using NURBS(Non-Uniform Rational B-Spline) surface patches. To verify the validity of the developed program the numerical calculations for Wigley hull and Series 60 Cb=0.6 hull are performed and the results obtained after the numerical calculations are compared with the initial hulls.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.541-553
• /
• 1995

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

• 경영과학
• /
• 제32권4호
• /
• pp.109-133
• /
• 2015

This paper considers the allocation and engagement scheduling of air defense missiles by using MIP (mixed integer programming). Specifically, it focuses on developing a realistic MIP model for a real battle situation where multiple enemy missiles are headed toward valuable defended assets and there exist multiple air defense missiles to counteract the threats. In addition to the conventional objective such as the minimization of surviving target value, the maximization of total intercept altitude is introduced as a new objective. The intercept altitude of incoming missiles is important in order to minimize damages from debris of the intercepted missiles and moreover it can be critical if the enemy warhead contains an atomic or chemical bomb. The concept of so called the time window is used to model the engagement situation and a continuous time is assumed for flying times of the both missiles. Lastly, the model is extended to simulate the situation where the guidance radar, which guides a defense missile to its target, has the maximum guidance capacity. The initial mathematical model developed contains several non-linear constraints and a non-linear objective function. Hence, the linearization of those terms is performed before it is solved by a commercially available software. Then to thoroughly examine the MIP model, the model is empirically evaluated with several test problems. Specifically, the models with different objective functions are compared and several battle scenarios are generated to evaluate performance of the models including the extended one. The results indicate that the new model consistently presents better and more realistic results than the compared models.

• 한국지능시스템학회논문지
• /
• 제25권5호
• /
• pp.477-482
• /
• 2015

단기풍속 예측을 위한 진화적 선형 및 비선형 회귀분석 기반의 보정 기법을 비교한다. 모델의 체계적 오류를 교정하기 위한 효율적인 MOS(Model Output Statistics)의 개발이 필요하나, 기존의 선형회귀분석 기반의 보정기법은 다양한 기상요소의 복잡한 비선형 특성을 반영하기 힘들다. 이를 개선하기 위해서 유전 프로그래밍을 사용하여 풍속 예측에 대한 비선형 보정 수식을 생성하는 기법을 제안하고 기본 다중선형회귀분석법 및 Ridge, Lasso 회귀분석법과 비교한다. 더불어, 선형회귀분석법과 진화적 비선형회귀분석 기법의 인자 선택의 차이와 유사성을 비교하고 분석한다. 2007년~2013년의 KLAPS(Korea Local Analysis and Prediction System) 재분석자료를 사용하여 제주도와 부산지역의 격자점에 대한 실험을 수행한다.

• 한국산림과학회지
• /
• 제89권3호
• /
• pp.335-341
• /
• 2000

이 연구에서는 탄소저장 및 목재생산효과를 동시에 고려하여 최적 산림경영계획을 수립하기 위한 다목적 선형계획수식모형을 개발하고, 사례연구를 통해 탄소저장과 목재생산효과의 선호도에 따른 최적 산림수확계획의 변화 경향을 분석하였다. 연구대상지로는 홍천의 가리산 지역을 선정하였으며, 선형계획수식모형에는 비감소수확, 수확벌채량 및 수확면적의 최대, 최소범위, 계획기간말의 임상구조 등을 제약하는 다수의 조건들을 포함시켰다. 또한 탄소저장 및 목재생산효과와 같이 상충적인 요소를 경영계획에 반영하기 위한 합리적 절충방안의 하나로 경영목적의 선호도에 따른 결합생산가능곡선을 제시하였다.

• 대한조선학회논문집
• /
• 제42권6호
• /
• pp.654-665
• /
• 2005

In this paper, we present a non-linear integer programming by genetic algorithm (GA) for available sizes of stiffener or thickness of plate in a job site. GA can rapidly search for the approximate global optimum under complicated design environment such as ship. Meanwhile it can handle the optimization problem involving discrete design variable. However, there are many parameters have to be set for GA, which greatly affect the accuracy and calculation time of optimum solution. The setting process is hard for users, and there are no rules to decide these parameters. In order to overcome these demerits, the optimization for these parameters has been also conducted using GA itself. Also it is proved that the parameters are optimal values by the trial function. Finally, we applied this method to compass deck of ship where the vibration problem is frequently occurred to verify the validity and usefulness of nonlinear integer programming.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1472-1474
• /
• 1999

This paper proposes the estimation method about how much reactive power can be increased or decreased under prescribed bus voltage limits in non-linear reactive power and power flow equations. The static nonlinear reactive power voltage problem can be formulated using a linear resistive(I-V) network with voltage dependent current sources. Linear programming model is derived for finding bounds on reactive power. This method was applied to future Korean power system and proved its effectiveness.