• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2004년도 추계학술대회
• /
• pp.37-41
• /
• 2004

The existing network can be expanded with addition of new nodes and multiple choices of link type for each nossible link. In this paper, the design problem of network expansion is defined as finding the network topology minimizing cost subject to reliability constraint. To efficiently solve the problem, an genetic algorithm approach is suggested.

• East Asian mathematical journal
• /
• 제14권2호
• /
• pp.399-410
• /
• 1998

In [3], Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated-linear systems. In this work, we present computational experiments of W-cycle multigrid method. Computational experiments show that the convergence is uniform as the parameter, $\nu$, goes to 1/2.

• 산업경영시스템학회지
• /
• 제16권28호
• /
• pp.195-202
• /
• 1993

This paper considers the vehicle routing problem taking account of not only delivery but pick-up at the same time. A mathematical formulation is presented for finding the route which satisfies all the demands of customers and enables picking up most containers without exceeding the capacity of the vehicle. A table comparing traveling distance and the pick-up amount is provided by using heuristic method, which will be of help to the decision makers.

• 산업경영시스템학회지
• /
• 제17권30호
• /
• pp.51-57
• /
• 1994

This paper considers the problem of equipment replacement A equipment replacement problem is treated in a thchnological development environment. Our model assumes that the costs associated with the presently available thchnology and future technology is known, but the appearance times of future technology is uncertain. A cost model is presented, and method is suggested for finding the optimal operating time for replacement A numerical example is shown.

• 산업경영시스템학회지
• /
• 제33권1호
• /
• pp.51-58
• /
• 2010

In QCC improve activities QC story is useful for solving problems. Among those the planning and establishment of countermeasure step is most important in finding new alternatives and methods for problem solving. But that step is dealt with indifferent to problem solving occasionally, so it makes difficult to find those. In this paper we suggest an effective construction model of planning and establishment of countermeasure in QCC improve activities.

• 산업경영시스템학회지
• /
• 제18권36호
• /
• pp.153-158
• /
• 1995

Finding shortest paths in networks is the fundamental problem in network theory and has numerous in Operations Research and related fields. The purpose of this study is to present a algorithm for solving the length of the shortest paths from a fixed node in a general network in which the arc distance can be arbitrary value. This algorithm has a worst computational bound of $n^3/4$ additions and $n^3/4$ comparisons, which is lower the worst computational bounds of other available algorithms.

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

By finding some new properties, we develop an O($r_{max}n^2$) algorithm for the generalized multiple choice linear knapsack problem where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm can easily be embedded in a branch-and-bound procedure due to its convenient structure for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• Communications for Statistical Applications and Methods
• /
• 제3권2호
• /
• pp.77-83
• /
• 1996

This paper is concerned with an estimation problem for the AR(1) process $Y_t, t=0, {\pm}1, {\cdots}$with time carying autoregressive coefficient, where coefficient itself is also stochastic process. Attention is directed to the problem of finding a consistent estimator of ${\Phi}$, the mean level of autoregressive coefficient. The asymptotic distribution of the resulting consistent estimator of ${\Phi}$, is them discussed. We do not assume any time series model for the time varying autoregressive coefficient.

• 대한수학회논문집
• /
• 제31권4호
• /
• pp.765-777
• /
• 2016

In this paper, we propose a new modied Ishikawa iteration for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of 2-generalized hybrid mappings in a Hilbert space. Our results generalize and improve some existing results in the literature. A numerical example is given to illustrate the usability of our results.

• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.75-80
• /
• 1996

Fuzzy approaches used to solve MONLP(Multiobjective Nonlinear Programming Problem) are based on the max-min method of fuzzy sets theory However, since the min operator noncompensatory, these approaches can not guarentee an efficient solution to the problem. In this paper, we presents an algorithm for finding the aggregation operator to find efficient solution. In particular, our presented algorithm is guarentee an efficient solution. On the basis of proposed algorithm, an illustrative numerical example is presented.