The present paper reports an intelligent computer-aided nesting (CAN) system for optimal nesting of two-dimensional parts, especially parts with complicated shapes, with the objective of effectively improving the utilization ratio of sheet materials. This paper also systemically reviews the nesting algorithms that were developed to perform various nesting tasks, and attacks the irregular part n...

For short data sequences, Winograd's convolution algorithms attaining the minimum number of multiplications also attain a low number of additions, making them very eecient. However, for longer lengths they require a larger number of additions. Winograd's approach is usually extended to longer lengths by using a nesting approach such as the Agarwal-Cooley 1] or Split-Nesting 7] algorithms. Altho...

This paper describes a new heuristic for the nesting problem based on a 2-exchange neighbourhood generation strategy. This mechanism guides the search through the solution space consisting of the sequences of pieces and relies on a low-level placement heuristic to actually convert one sequence in a feasible layout. The placement heuristic is based on a bottom-left greedy procedure with the abil...

The Persian Gulf islands are the nesting regions for the severely endangered hawksbill turtle (Eretmochelys imbricata) species. Therefore, the selection of the nesting habitat of this species in the two islands of Qeshm and Hengam was studied by a five-member working group in the spring of 2013 - 2015. Ultimately, 23 and 17 nests were identified in the south of Qeshm Island and in the south and...

Unlike mice, adult laboratory rats do not spontaneously build nests when nesting material is offered. As a result, nesting material is often regarded as unsuitable environmental enrichment for laboratory rats. Wild rats and pet rats, however, have been observed to build complex nests from nesting material at hand. It was hypothesized that nest building in rats is an acquired behaviour, rather t...

This paper describes models that estimate the cost and time of sheet metal punching when nesting (batching) orders. These models help decision{makers plan production and evaluate the impact of changing the nesting policy. In addition, we use them to formulate a nesting optimization problem. Finally, we use the models to evaluate the sensitivity of the nesting policy to manufacturing parameters....

This paper considers the communication for omniscience (CO) problem: A set of users observe a discrete memoryless multiple source and want to recover the entire multiple source via noise-free broadcast communications. We study the problem of how to determine an optimal rate vector that attains omniscience with the minimum sum-rate, the total number of communications. The results cover both asym...

This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a metaheuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in ...

Nesting algorithms deal with the optimal placement of shapes in specified regions subject to specified constraints. In this paper, a complex algorithm for solving two-dimensional nesting problem is proposed. Arbitrary geometric shapes are first quantized into a binary form. These binary representations are subsequently processed by operators which nest the shapes in a rectangle of minimum area....

This paper generalizes the self-similar nesting of Matryoshka dolls (“Russian nesting dolls”) to arbitrary solid objects. We introduce the problem of finding the largest scale replica of an object that nests inside itself. Not only should the nesting object fit inside the larger copy without interpenetration, but also it should be possible to cut the larger copy in two and remove the smaller ob...