• 한국경영과학회지
• /
• 제15권2호
• /
• pp.1-15
• /
• 1990

A mathematical definition of the cluster is suggested. A nonlinear 0-1 integer programming formulation for the multi-dimensional entity clustering problem is developed. A heuristic method named MDEC (Multi-Dimensional Entity Clustering) using centroids and the binary partition is developed and the numerical examples are shown. This method has an advantage of providing bottle-neck entity informations.

• 한국정밀공학회지
• /
• 제15권12호
• /
• pp.72-80
• /
• 1998

In this study, a design approach based on genetic algorithm is proposed to solve the manufacturing cell design problem considering alternative process plans and alternative machines. The problem is formulated as a 0-1 integer programming model which considers several manufacturing parameters, such as demand and processing time of part, machine capacity, manufacturing cell size, and the number of machines in a machine cell. A genetic algorithm is used to determine process plan for each part, part family and machine cell simultaneously.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.217-229
• /
• 2007

In this paper, Genetic Algorithm (GA) is used to find the Maximum Weight Independent Set (MWIS) of a graph. First, MWIS problem is formulated as a 0-1 integer programming optimization problem with linear objective function and a single quadratic constraint. Then GA is implemented with the help of this formulation. Since GA is a heuristic search method, exact solution is not reached in every run. Though the suboptimal solution obtained is very near to the exact one. Computational result comprising an average performance is also presented here.

• 대한전자공학회논문지
• /
• 제26권2호
• /
• pp.124-131
• /
• 1989

본 논문은 각 서브시스템에 여러 종류의 고장모드를 갖는 시스템 신뢰성 최적화 문제를 본 논문에서 제안한 알고리듬으로 처리된 것을 나타내었다. 이 알고리듬은 시스템 신뢰성 최적화의 비선형 문제를 0-1정수계획 문제로 변환할 때 반드시 제약조건에 부가되는 GUB구조(generalized upper bounding structure)를 고려하여 개발되었으며 시스템 신뢰도 개선을 위한 용장 서브시스템 최적배분 문제를 제안한 알고리듬에 따라 계산할 결과 계산반복회수(컴퓨터 계산시간)과 사용된 변수(요구 메모리 용량) 등에서 종래의 알고리듬 보다 우수함을 알 수 있다.

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

The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.972-975
• /
• 2003

The purpose of this study is to integrate Decision Theory Approach(DTA) and OR Theory Approach(OTA) systemically. and to develop Combination Theory Approach to build an optimal R&D project portfolio by strategies. To Integrate two approaches. Utility theory is introduced. Evaluation Results aye converted into utility values by the utility functions and the values are optimized by 0-1 programming. Scoring method and Integer programming is used to evaluation a correspondence with a goal and to allocation the limiting resources. And utility function is used to reflect the preference of decision makers on the project evaluation.

• Communications for Statistical Applications and Methods
• /
• 제18권2호
• /
• pp.257-266
• /
• 2011

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.589-605
• /
• 1996

Recycling of used products and components has been considered as one of promising strategies for resolving environmental problems. In this respect, most manufacturing companies begin to consider possible recycling (e.q., reuse or re-production) of the components contained in their products. The primary objective of this research is to develop a multiple criteria decision making model for systematic management of recycle-oriented manufacturing components. The production planning problem of recycle-oriented manufacturing components is first formulated as a multiobjective mixed 0-1 integer programming model with three conflicting objectives. An interactive multiple criteria decision making method is then developed for solving the mathematical model. Also, an Input/Output analysis software is developed to help practitioners apply the model to real problems without much knowledge on computers and mathematical programming. A numerical example is used in examining the validity of the proposed model and to investigate the impact of the input variables on recycling production strategy.

• 한국군사과학기술학회지
• /
• 제13권5호
• /
• pp.748-758
• /
• 2010

Navy surface vessels require pier services such as emergency repair, oil supply, arm loading/unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services and the uncertainty of the arrival and departure for each vessel. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 6.0 and ILOG CPLEX 11.1., which shows a reasonable result.

• 충청수학회지
• /
• 제23권4호
• /
• pp.845-852
• /
• 2010

A nonlinear algebraic equation f(x) = 0 is considered to find a root with integer multiplicity $m{\geq}1$. A variant of Newton-secant method for a multiple root is proposed below: for n = 0, 1, $2{\cdots}$ $$x_{n+1}=x_n-\frac{f(x_n)^2}{f^{\prime}(x_n)\{f(x_n)-{\lambda}f(x_n-\frac{f(x_n)}{f^{\prime}(x_n)})\}$$, $$\lambda=\{_{1,\;if\;m=1.}^{(\frac{m}{m-1})^{m-1},\;if\;m{\geq}2$$ It is shown that the method has third-order convergence and its asymptotic error constant is expressed in terms of m. Numerical examples successfully verified the proposed scheme with high-precision Mathematica programming.