• 품질경영학회지
• /
• 제36권2호
• /
• pp.28-35
• /
• 2008

This study deals with an Excel-based scheduling system for a small and medium sized manufacturing factory without sufficient capability for managing full-scale information systems. The factory has the bottleneck with identical machines and unique batching characteristics. The scheduling problem is formulated as a variation of the parallel-machine scheduling system. It can be solved by a two-phase method: the first phase with an ant colony optimization (ACO) heuristic for order grouping and the second phase with a mixed integer programming (MIP) algorithm for scheduling groups on machines.

• 한국정밀공학회지
• /
• 제20권11호
• /
• pp.180-187
• /
• 2003

A CAD-based seamless design system for MEMS named DS/MEMS was developed which performs coupled-field analysis, optimal and robust design. DS/MEMS has been developed by means of integrating commercial codes and inhouse code-SolidWorks, FEMAP, ANSYS and CA/MEMS. This strategy results in versatility that means to include various analysis model, corresponding analyses and approximated design sensitivity analysis and user friendliness that design variables are taken to be selectable directly from a CAD model, that the problem is formulated under a window environment and that the manual job during optimization process is almost eliminated. DS/MEMS works on a parametric CAD platform, integrating CAD modeling, analysis, and optimization. Nonlinear programming algorithms, the Taguchi method, and response surface method are made available for optimization. One application problem is taken to illustrate the proposed methodology and show the feasibility of DS/MEMS as a practical tool.

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

In this paper, we discuss the schedule problems for Korean Professional Baseball League (KPBL) and propose approaches to solve these problems by applying Integer Programming. A schedule in a sport league must satisfy lots of constraints on timing such as organizational, attractiveness, and fairness requirements. Organizational requirements cover a set of rules which have to guarantee that all the games can be scheduled according to the regulations imposed by Korean Baseball Organization (KBO). Attractiveness requirements focus on what stadium visitors, television spectators, and the clubs expect, that is, a varied, eventful, and exciting season. Fairness requirements have to guarantee that no team is handicapped or favored in comparison with the others. In addition to finding a feasible schedule that meets all the constraints, the problem addressed in this paper has the additional complexity of having the objective of minimizing the travel costs and every team has the balancing number of the games in home. We formalize the KPBL problem into an optimization problem and adopt the concept of evolution strategy to solve it. Using the method proposed, it is efficient to find better results than approaches developed before.

• 인지과학
• /
• 제2권1호
• /
• pp.15-32
• /
• 1990

자연언어 처리에 있어서 속성구조 간의 단일화를 핵심으로 하는 여러 단일화중심 문법론들이 근래속출하여, 각광을 받고 있다. 그러나, 속성구조간의 단일화 그 자체에 관해서는 뚜렷한 방법론이 제시되지 못하고, 구현하는 사람마다 나름대로 ad hoc 하게 단일화 모듈을 설계해 오고 있는 실정이다. 본 논문에서는 단일화를 지원하는 프로그래밍 언어 FUL 을 이용하여 효율적인 단일화 방법론을 제시하고, 대표적인 단일화중심 문법론들인 LFG,HPSG 에 있어서의 단일화 과정을 예시하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.557-559
• /
• 2005

This paper proposes a method for choosing the best composite power system expansion plan considering a contingency security criterion. The proposed method minimizes the investment budget fer constructing new transmission lines subject to contingency criterion. it models the power system expansion problem as an integer programming one. The method solves for the optimal strategy using a branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Although the proposed method is applied to a simple sample study, the test results demonstrate that the proposed method is suitable for solving the power system expansion-planning problem subject to practical future uncertainties.

• 한국국방경영분석학회지
• /
• 제31권1호
• /
• pp.107-121
• /
• 2005

In this study, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP converges to an optimal solution, and it may be the only realistic approach to solve large games. The algorithm uses dynamic programming (DP) to solve FP subproblems. Efficiency is obtained by limiting the growth of the DP state space. Blotto games are frequently used to solve simple missile defense problems. While it may be unlikely that the models presented in this paper can be used directly to solve realistic offense and defense problems, it is hoped that they will provide insight into the basic structure of optimal and near-optimal solutions to these important, large games, and provide a foundation for solution of more realistic, and more complex, problem

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 하계종합학술대회 논문집
• /
• pp.173-178
• /
• 1989

Optimal Power Flow (OPF) solution by the Newton's method provides a reliable and robust method to classical OPF problems. The major challenge in algorithm development is to identify the binding inequalities efficiently. This paper propose a simple strategy to identify the binding set. From the mechanism of penalty shifting with soft penalty in trial iteration, a active binding sit is identified automatically. This paper also suggests a technique to solve the linear system whore coefficients are presented by the matrix. This implementation is highly efficient for sparsity programming. Case study for 3,5,14,118,190 bus and practrical KEPCO 305 bus system are performed as well.

• 대한기계학회논문집B
• /
• 제25권6호
• /
• pp.829-836
• /
• 2001

A dependable boundary reconstruction technique is proposed. The finite element method is used for the analysis of the direct heat conduction problem to realize the deformable grid system. An appropriate strategy for grid update is suggested. A complete sensitivity analysis is performed to obtain the derivatives required for restoration of the optimal boundary. With the result of the sensitivity analysis, the unknown boundary is sought using the sequential quadratic programming. The method is applied to reconstruction of boundaries with sinusoidal, step, and cavity form. The overall performance of the proposed method is examined by comparison between the estimated the exact boundaries.

• 수산해양교육연구
• /
• 제26권4호
• /
• pp.760-768
• /
• 2014

Yet logistics base in China has a refrigerated storage facilities installed areas, the number of those is very limited and is generally insufficient. According to these especial points, a new construction cold chain logistics network design strategy is required from how to use the existing refrigerated warehouses to new issue. For example, however refrigerated storage facility is supplied, can it satisfy all demand of this area? Then does it have optimized location of this area? If future demand expansion, adding that already other refrigerated storage facilities matter? Or, add another refrigerated facilities, optimum cold chain established a network matter? So on. Above problems can be occurred. In order to solve facing many of these issues of distribution network, northeast area in China has been selected as a subject, and we designed a new cold chain distribution network.

• 한국정보교육학회:학술대회논문집
• /
• 한국정보교육학회 2006년도 하계학술대회
• /
• pp.117-122
• /
• 2006

고도의 지식기반사회에서는 사고력과 문제해결력을 길러주는 프로그래밍 교육이 필요하며 이를 초등학교 교육과정부터 도입해야 한다는 여러 연구들이 있었다. 본 연구에서는 그러한 프로그래밍의 기초능력을 배양하기 위하여 프로그래밍 변수 개념 형성을 위한 효과적인 학습 모형을 구안하고자 하였다. 구체적 조작활동을 통해 인지를 형성하는 초등학교 아동들에게 LOGO 프로그래밍 활동이 적합하다는 선행연구를 토대로, 영어에 미숙한 아동들을 고려하여 MAL-LOGO 환경을 선택하였으며, 프로그래밍 학습요소 중 변수 개념 형성을 위한 학습요소를 추출하고, 교수-학습 프로그램을 계획하였다. 인지적 모니터링 전략(cognitive monitoring strategy)을 발달시킬 수 있는 안내된 발견식 교수법(guided instruction teaching method)을 기반으로 교수-학습 모형을 구안 적용한 후, 사전 사후 평가를 통해 그 효과를 검증하였다.