Large-scale molecular dynamics simulation is performed to study the nano-cutting process of single crystal copper realized by single-point diamond cutting tool in this paper. The centro-symmetry parameter is adopted to characterize the subsurface deformed layers and the distribution and evolution of the subsurface defect structures. Three-dimensional visualization and measurement technology are...

This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization....

We consider two-dimensional cutting stock problems where single rectangular stocks have to be cut into some smaller rectangular so that the number of stocks needed to satisfy the demands is minimum. In this paper we focus our study to the problem where the stocks have to be cut with guillotine cutting type and fixed orientation of finals. We formulate the problem as an integer programming, wher...

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of xed width and minimum height, a classical N P-hard cutting-stock problem. The algorithm nds a packing of n rectangles whose total height is within a factor of (1 +) of optimal (up to an additive term), and has running time polynomial both in n and in 1==. It is based on a ...

This work focuses on the K-staged two-dimensional cutting stock problem with variable sheet size. High-quality solutions are computed by an efficient beam-search algorithm that exploits the congruency of subpatterns and takes informed decisions on which of the available sheet types to use for the solutions. We extend this algorithm by embedding it in a sequential value-correction framework that...

This study focuses on developing fully functional cutting stock software by utilizing an improved multi-phase heuristic algorithm to find the optimal solution for the cutting material. Issues which commonly appear in real-world cutting stock applications are also discussed

Hard turning has become an attractive method of machining for most manufacturers in the last few years due to its low cost and superior surface quality compared grinding. In this experimental study, machinability hardened steel under dry on a CNC lathe is undertaken optimize cutting parameters minimum roughness energy consumption with speed (320, 450, 575), tool type (coated uncoated), feed rat...

A two-dimensional cutting stock problem can be defined as follows: A set of rectangular stock sheets of p different types is available. For each type of sheet Sp we know its length Lp and width Wp. From these sheets we have to cut smaller rectangular pieces of length li and width wi, i = 1, ...,m in order to satisfy a given demand for di pieces of each type. The objective is to minimize the tot...

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm —for staged pat...