• 경영과학
• /
• 제17권2호
• /
• pp.55-65
• /
• 2000

This paper addresses a problem of machining route selection in multi-stage process with machine group. This problem is considered the subcontracting and the production in-house such as regular and overtime work. the proposed model is formulated as a 0-1 integer programming constraining the avaliable time of each machine for planning period and total overtimes. The objective of the model is to minimize the sum of processing cost, overtime cost, and subcontracting cost. To solve this model, a genetic algorithm(GA) approach is developed. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound. In results, the same optimal solution is obtained from two methods at small size problem, and the consistent solution is provided by the GA approach at large size problem. The advantage of the GA approach is the flexibility into decision-making process because of providing multiple machining routes.

• Journal of information and communication convergence engineering
• /
• 제6권1호
• /
• pp.10-14
• /
• 2008

The robot localization problem is a key problem in making truly autonomous robots. In this work we provide thorough discussions of Ultrasonic Positioning System can be applied to the localization problem. First, we look at the use of Kalman filters and basic concept and the equation involved in Kalman filters. Secondly, we create understanding of how the Kalman filters can be implemented in robot localization. We show our discussion and experiments how Kalman filters applied to the localization problem. Lastly, we perform simulations using Usat Wheel Chair robot in our own general Kalman filters robot monitoring software.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.585-596
• /
• 1998

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene's theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The proper-ties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expression for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

• 경영과정보연구
• /
• 제13권
• /
• pp.127-140
• /
• 2003

Although there have been continual researches in the project scheduling problems since 1960s, the main interest has been how to improve the efficiency of a single project. The minimization problem of the project completion time given a preassigned budget might be an example. This kind of the problem is important, but estimating of the proper budget for a project may also be very important. This research deals with the budget allocation problem for the multiple project. This research is unique in that the project scheduling techniques are used for the budgeting problem. Therefore, this research may be used as a strategic decision model for the multiple large projects in public sector.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.449-460
• /
• 2007

Several fuzzy approaches can be considered for solving multi-objective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.

• 한국산업융합학회 논문집
• /
• 제16권2호
• /
• pp.53-59
• /
• 2013

The purpose of this study is recognized the problems of parking and parking demand, supply and operation of the control etc. It is to provide an alternative for the overall parking problem. Parking problem occurs because there is not enough parking spaces. In order to solve the parking problem of Chil-gok 1 residential development district, this study propose making use of a road parking lot establishment and the school playground and the public facilities construction parking lot. But it is the methods which are short-term. A fundamental solution method is Levying garage option on car buyers. It is system to apply a law for establishing garages to all of vehicles.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.47-53
• /
• 2009

We define product line (or mix) selection problem as selecting a subset of potential product variants that can simultaneously minimize product proliferation and maintain market coverage. Selecting the most efficient product mix is a complex problem, which requires analyses of multiple criteria. This paper proposes a method based on Data Envelopment Analysis (DEA) for product line selection. Data Envelopment Analysis (DEA) is a linear programming based technique commonly used for measuring the relative performance of a group of decision making units with multiple inputs and outputs. Although DEA has been proved to be an effective evaluation tool in many fields, it has not been applied to solve the product line selection problem. In this study, we construct a five-step method that systematically adopts DEA to solve a product line selection problem. We then apply the proposed method to an existing line of staplers to provide quantitative evidence for managers to generate desirable decisions to maximize the company profits while also fulfilling market demands.

• 한국컴퓨터정보학회논문지
• /
• 제21권12호
• /
• pp.1-10
• /
• 2016

In this paper, we attempt to prevent certain cases by tracing a history and making genogram about open source software and its modification using similarity of source code. There are many areas which use open source software actively and widely, and open source software contributes their development. However, there are many unconscious cases like ignoring license or intellectual properties infringe which can lead litigation. To prevent such situation, we analyze source code similarity using program dependence graph which resembles subgraph isomorphism problem, a typical NP-complete problem. To solve subgraph isomorphism problem, we utilized harmony search of metaheuristic algorithm and compared its result with a genetic algorithm. For the future works, we represent open source software as program dependence graph and analyze their similarity.

• 대한산업공학회지
• /
• 제18권1호
• /
• pp.169-176
• /
• 1992

In parts assignment problem for FMS, both the parts and the tools required to process the parts are assigned to the machine tools for a specified planning period. This is an important decision-making problem for a short-term production planning of FMS. In this paper, parts assignment problem for FMS was analyzed to determine the optimal plan which has the adaptability to production fluctuation. A mathematical model was developed for determing the parts and the tools required for the machine tools which compose FMS, and the model was analyzed to obtain optimal solution. In addition, the vality and feasibility of the computational algorithm was examined by solving a numerical example.

• Journal of Electrical Engineering and Technology
• /
• 제8권4호
• /
• pp.686-693
• /
• 2013

Generation Expansion Planning (GEP) is one of the most important decision-making activities in electric utilities. Least-cost GEP is to determine the minimum-cost capacity addition plan (i.e., the type and number of candidate plants) that meets forecasted demand within a pre specified reliability criterion over a planning horizon. In this paper, Differential Evolution (DE), and Opposition-based Differential Evolution (ODE) algorithms have been applied to the GEP problem. The original GEP problem has been modified by incorporating Virtual Mapping Procedure (VMP). The GEP problem of a synthetic test systems for 6-year, 14-year and 24-year planning horizons having five types of candidate units have been considered. The results have been compared with Dynamic Programming (DP) method. The ODE performs well and converges faster than DE.