• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.748-753
• /
• 2005

Among processes to manufacture parts from footwear materials like upper leathers, one of the most essential processes is the cutting one optimally arranging lots of parts on raw footwear materials and cutting. A new nesting strategy was proposed for the 2-dimensional part layout by using a two-stage approach, where which can be effectively used for water jet cutting. In the initial layout stage, a SOAL(Self-Organization Assisted Layout) based on the combination of FCM(Fuzzy C-Means) and SOM was adopted. In the layout improvement stage, SA(Simulated Annealing) based approach was adopted for a finer layout. The proposed approach saves much CPU time through a two-stage approach scheme, while other annealing-based algorithm so far reported fur a nesting problem are computationally expensive. The proposed nesting approach uses the stochastic process, and has a much higher possibility to obtain a global solution than the deterministic searching technique. We developed the automatic nesting software of NST(ver.1.1) software for footwear industry by implementing of these proposed algorithms. The NST software was applied by the optimized automatic arrangement algorithm to cut without the loss of leathers. if possible, after detecting damage areas. Also, NST software can consider about several features in not only natural loathers but artificial ones. Lastly, the NST software can reduce a required time to implement generation of NC code. cutting time, and waste of raw materials because the NST software automatically performs parts arrangement, cutting paths generation and finally NC code generation, which are needed much effect and time to generate them manually.

• IE interfaces
• /
• v.9 no.3
• /
• pp.283-297
• /
• 1996

The 'flat-bar' is a stiffener which is a component of ships. It is basically a long rectangle and has 'end-cut' shapes at both sides. The paper describes a fast nesting algorithm of the flat-bar, and a procedure to generate cutting path of gas/plasma torch, which is operated by a NC (numerically controlled) gas/plasma cutting machine. Proposed procedures are written in C-language and executable on VAX machine with Open VMS operating system.

• Proceedings of the KWS Conference
• /
• 1994.10a
• /
• pp.142-145
• /
• 1994

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.195-210
• /
• 1997

In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.2
• /
• pp.102-111
• /
• 2004

In this paper, the efficient layout method for generating common and continuous cutting path of flat-bar profile. The ‘flat -bar’ is a stiffener and has long rectangular shape. This paper describes a fast nesting algorithm of the flat-bar, and a procedure to generate cutting path of gas/plasma torch, which is operated by a NC (numerically controlled) gas/plasma cutting machine. By using this common and continuous path, the machining-time for cutting and the maintenance-cost of plasma-torch could be reduced. Proposed procedures are written in C-language and applied to the Interactive Flat-Bar-Nesting System executable on Open VMS with X-Window system.

• Journal of the Society of Naval Architects of Korea
• /
• v.37 no.3
• /
• pp.90-98
• /
• 2000

Nesting and cutting path optimization have a great effect on price competitions and improvement of productivity in various industries such as the shipbuilding, the auto, the clothing, and so on. But the theoretical approach on the development of cutting path optimization algorithm, which can be applied effectively in the shipbuilding, has not been performed enough because parts are so complex and various. In this study, a new solution has been presented to solve the cutting path problem in 2-D cutting by using improved genetic algorithm. The presented optimization algorithm can search not only the cutting sequence of parts but also the position of piercing point by applying the effective neighborhood solution generating method

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.554-558
• /
• 2001

In this study, a hybrid method is used to search the pseudo-optimal solution for the I-dimentional nesting problem. This method is composed of the genetic algorithm for the global search and a simple heuristic one for the local search near the pseudo optimal solution. Several simulation results show that the hybrid method gives very satisfactory results.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.6
• /
• pp.67-70
• /
• 2009

Nesting and cutting path optimization have a great effect on the improvement of productivity in many industries such as shipbuilding, automotive, clothing, and so on. However, few researches have been carried out for the optimization of a cutting path algorithm. This study proposed a new method for cutting optimization using gravity center of cutting pieces and a genetic algorithm. The proposed method was tested for a sample plate including many different shapes of cutting pieces and compared to 2 other conventional methods. The test results showed that the new method had the shortest cutting path and the best effectiveness among the 3 methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

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