• Journal of the Korea Society for Simulation
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2005

In a metal grating manufacturing process, the cutting operation allocates the gratings and cut them out from given panels or a plate sheets. Before the cutting operation an operator generates a cutting plan. The cutting plan should decide how pieces of metal rectangles i.e., gratings, are allocated and cut from the panel. This plan generation is a deal of weight on the production cost. the generation of cutting plan is similar to the general two-dimensional cutting problem. In this paper, we first define cutting problem and Af algorithm of Artificial Intelligence to solve the problem. Also, through a simulation, we compare the proposed cutting algorithm to an existing method in terms of material loss

• 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.

• Journal of Sensor Science and Technology
• /
• v.26 no.4
• /
• pp.274-279
• /
• 2017

LCD(Liquid Crystal Display) panel cutting problem is a sort of two dimensional cutting stock problem. A cutting stock problem is problem that it minimizes the loss of the stock when a stock is cut into various parts. In the most research of the two dimensional cutting stock problem, it is supposed that the relative angle of a stock and parts is not important. Usually the angle is regarded as horizontal or perpendicular. In the manufacturing of polarizing film of LCD, the relative angle should be maintained at some specific angle because of the physical and/or chemical characteristics of raw material. We propose a mathematical model for solving this problem, a two-dimensional non-Guillotine cutting stock problem that is restricted by an arranged angle. Some example problems are solved by the C++ program using ILOG CPLEX classes. We could get the verification and validation of the suggested model based on the solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.276-279
• /
• 1996

This paper deals with the method providing an exact solution to the 3-dimensional guillotine cutting stock problem. We suggest a 3-stage sutting method using the property that cubic material has to be cut into 2-dimensional planes firstly. This method requires more stocks that the general guillotine cutting methods but can save work force. By using the 1-dimensional dynamic programming, we reduce the computational time and the memory requirement in the 3-stage guillotine cutting method.

• Structural Engineering and Mechanics
• /
• v.65 no.2
• /
• pp.203-211
• /
• 2018

This paper introduces the development process of NCC(New Concrete Cutting) system and analyzes first verification test. Based on the first verification test results, some problems of NCC system have been newly modified. We carry out the second verification test. We tried to verify cutting performance and dust control efficiency of NCC system through the cutting test of concrete bridge piers. In particular, this verification test strives to solve the problem of concrete dust, which is the biggest problem of dry cutting method. The remaining dust problems in cutting section tried to solve through this verification test. This verification test of the NCC system shows that the dust problem of dry cutting method is closely controlled and solved. In conclusion, the proposed NCC method is superior to the dry cutting method in all aspects, including cutting performance, dust vacuum efficiency and cooling effect. The proposed NCC system is believed to be able to provide eco-friendly cutting technology to various industries, such as the removal of the SOC structures and the dismantling of nuclear plants, which have recently become a hot issue in the field of concrete cutting.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.377-382
• /
• 2004

An unconstrained three-dimensional cutting problem describes the process of finding the cutting pattern that yields the maximum total profit-sum for the small parallelepipeds pieces cut from a large parallelepiped box and there is no limit to the number of pieces to be cut. The problem is a classic NP-hard. The bottom-up approach, which generates all of the feasible cutting patterns by combining two other cutting patterns, can be applied to the three-dimensional problem. We introduce a build and new branching strategies for the unconstrained three-dimensional cutting problem. The strategies are all generalized from the branching strategies proposed by G et at. to solve unconstrained two-dimensional cutting problems.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2009

In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.40 no.3
• /
• pp.23-38
• /
• 2015

In this paper, we evaluate the strength of three families of cutting planes for a lot-sizing problem. Lot-sizing problem is very basic MIP model for production planning and many strong valid inequalities have been developed for a variety of relaxations in the literature. To use three families of cutting planes in Branch-and-Cut framework, we develop separation algorithms for each cut and implement them in CPLEX. Then, we perform computational study to compare the effectiveness of three cuts for randomly generated instances of the lot-sizing problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.18 no.1
• /
• pp.1-12
• /
• 2009

Presently, the semiconductor industry has the chronic problem. In the semiconductor industry, it has the semiconductor wafer, a package, the optical filter cut by using the saw blade, the mold, a laser etc. The cutting technique has the difficulty due to the rising of the production cost by the wearing of mold, the poor quality problem due to generated heat at the moment of cutting procedure and curve cutting etc. The goal of this time of national research and development project is develop the apparatus for solving the problem that the existing cutting technique has. The technology is so called waterjet abrasive method. This technology will be mainly applied to cut a semiconductor package and a wafer. Two important things to be considered are ripple effect(in other words, the scale of a market) and simplicity of an application.