• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.265-275
• /
• 2004

In this paper, multi-objective models for designing 3D trajectory of horizontal wells are developed in a fuzzy environment. Here, the objectives of minimizing the length of the trajectory and the error of entry target point are fuzzy in nature. Some parameters, such as initial value, end value, lower bound and upper bound of the curvature radius, tool-face angle and the arc length of each curve section, are also assumed to be vague and imprecise. The impreciseness in the above objectives have been expressed by fuzzy linear membership functions and that in the above parameters by triangular fuzzy numbers. Models have been solved by the fuzzy non-linear programming method based on Zimmermann [1] and Lee and Li [2]. Models are applied to practical design of the horizontal wells. Numerical results illustrate the accuracy and efficiency of the fuzzy models.

• 한국정밀공학회지
• /
• 제5권4호
• /
• pp.24-31
• /
• 1988

The Upper Bound Solution has been used to investigate the effect of the various parameters on the floating-plug tube-drawing precess. A kinematically admissible velocity field considering the change of the tube thickness is proposed for the deformation process. Taking into account the position of the plug in the deforming region, shear energy at entrance and exit, friction energy on contact area, homogeneous energy are calculated. The theoretical values in proposed velocity field are good agreement with experimental values, It is investigated that the tube thickness in the deforming region is changed slightly toward minimization of deforming energy and then the drawing stress in lower than the crawing stress in the velocity field that the tube thickness is uniform.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1995년도 춘계학술대회논문집
• /
• pp.124-130
• /
• 1995

An upper-bound elemental stream function technique(UBST) is proposed for solivng forging and backward extrusion problems that are geometrically complex or need a forming simulation . And in the forging problems, this study investigates that layer of elements effects dissipation of total energy and load. The element system of UBSTuses the curve fitting property of FEM and the fluid incompressiblity of the stream function . The foumulated optimal design problems with constraints ae solved by the flixible toerance method. In the closed-die forging and backward extrusion, the result of layer of element by this study produces a lower upper-bound solution than that fo UBET and conventional layer of element . And the main advantage of UBST program is that a computer code, once written , can be used for a large variety problems by simply changing the input data.

• Journal of the Korean Wood Science and Technology
• /
• 제20권4호
• /
• pp.21-30
• /
• 1992

An activation energy equation for moisture diffusion in wood was developed with an assumption that activation energy is directly proportional to wood specific gravity. Theoretical activation energies obtained from the activation energy equation were revealed to be always lower than actual activation energies, which implies that activation energy isn't affected only by wood specific gravity. The other affecting factors are possibly anatomical structures of wood which determine a ratio of vapor diffusion to bound water diffusion in wood. For the convenience of estimating actual activation energy by using the activation energy equation, thirteen kinds of species were categorized into three groups according to their anatomical structures.

• 한국경영과학회지
• /
• 제14권2호
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.

• 경영과학
• /
• 제19권1호
• /
• pp.55-66
• /
• 2002

Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.145-149
• /
• 1991

In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

• Management Science and Financial Engineering
• /
• 제11권1호
• /
• pp.49-61
• /
• 2005

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

• 한국경영과학회지
• /
• 제20권3호
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2005년도 추계학술대회 발표 논문집
• /
• pp.326-333
• /
• 2005

The purpose of this paper is to provide a decision support method to a rational buyer, who wants to pay the least price for the product with the highest quality and service. We suggest a minimum efficiency game model and DEA game model to valuate many vendors whose qualifies of outputs are measured by percentage. Our results gave a decision maker (buyer) the upper bound and lower bound of the true efficiency score of a decision making unit (vendor) with respect to the benchmark (target) set by the buyer. As a result, a buyer can choose the best vendor in terms of his/her preference.