• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.4
• /
• pp.424-431
• /
• 2001

This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.129-138
• /
• 1997

In this paper, the problem for choosing design points in the two dimensional case is condidered. In the one dimensional case, given the design density function, we can choose design points using the quantile function. However, in the two dimensional case, there is no clear definition of the percentile. Therefore, the idea of choosing design points in the univariate case can not be applied directly to the two dimensional case. We convert this problem into an optimization problem using the Voronoi diagram.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.25-29
• /
• 2001

We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• East Asian mathematical journal
• /
• v.35 no.1
• /
• pp.41-50
• /
• 2019

This paper is dealt with one-dimensional elliptic jumping problem with nonlinearities crossing n eigenvalues. We get one theorem which shows multiplicity results for solutions of one-dimensional elliptic boundary value problem with jumping nonlinearities. This theorem is that there exist at least two solutions when nonlinearities crossing odd eigenvalues, at least three solutions when nonlinearities crossing even eigenvalues, exactly one solutions and no solution depending on the source term. We obtain these results by the eigenvalues and the corresponding normalized eigenfunctions of the elliptic eigenvalue problem and Leray-Schauder degree theory.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.105-114
• /
• 1997

The phase retrieval problem is concerned with the reconstruction of a signal or its fourier transform phase form the fourier transform magnitude of the signal. This problem does not have a unique solution, in general. If, however, the desired signal is minimum-phase, then it can be decided uniquely. This paper shows that we can make a minimum-phase signal by adding a delta function having a large value at the origin of an arbitrary one-dimensional signal, and a two-dimensional signal can be uniquely specified from its fourier transform magnitude if it is added by a delta function having a large value at the origin, and finally we can solve a two-dimensional phase retrieval problem by decomposing it into several ine-dimensional phase retrieval problems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.5
• /
• pp.376-382
• /
• 2000

A problem of relevant interest to some industries is that of the optimum two-dimensional layout. In this problem, one is given a number of rectangular sheets and an order for a specified number of each of certain types of two-dimensional regular and irregular shapes. The aim is to cut the shapes out of the sheets in such a way as to minimize the amount of waste produced. In this paper, we propose a genetic algorithms using rotation parameters by which the best pattern of layout is found.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.270-277
• /
• 2004

In this paper, path-independent values of the J-integral in the fininte element context for arbitrary two-dimensional and three-dimensional crack configurations in welds are presented. For the fracture mechanics analysis of cracks in welds, residual stress analysis and fracture analysis must be performed simultaneously. In the analysis of cracked bodies containing residual stress, the usual domain integral formulation results in path-dependent values of the J-integral. This paper discusses modifications of the conventional J-integral that yield path independence in the presence of residual stress generated by welding. The residual stress problem is treated as an initial strain problem and the J-integral modified for this class of problem is used. And a finite element program which can evaluate the J-integral for cracks in two-dimensional and three-dimensional residual stress bearing bodies is developed using the modified J-integral definition. The situation when residual stress only is present is examed as is the case when mechanical stresses are applied in conjunction with a residual stress field.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.21-32
• /
• 2001

The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.1
• /
• pp.1-6
• /
• 2012

We consider a two-dimensional vector packing problem in which each item has size in x- and y-coordinates. The purpose of this paper is to provide a ground work on how hard two-dimensional vector packing problems are for large items. We prove that the problem with each item greater than 1/2-${\varepsilon}$ either in x- or y-coordinates for 0 < ${\varepsilon}$ ${\leq}$ 1/6 has no APTAS unless P = NP.