Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

A coupling cutting stock-lot sizing problem in the paper industry

An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.

PLANT LEAF IDENTIFICATION BASED ON VOLUMETRIC FRACTAL DIMENSION

Texture is an important visual attribute used to describe the pixel organization in an image. As well as it being easily identified by humans, its analysis process demands a high level of sophistication and computer complexity. This paper presents a novel approach for texture analysis, based on analyzing the complexity of the surface generated from a texture, in order to describe and characterize it. The proposed method produces a texture signature which is able to efficiently characterize different texture classes. The paper also illustrates a novel method performance on an experiment using texture images of leaves. Leaf identification is a difficult and complex task due to the nature of plants, which presents a huge pattern variation. The high classification rate yielded shows the potential of the method, improving on traditional texture techniques, such as Gabor filters and Fourier analysis.

Plant Leaf Identification Using Gabor Wavelets

This article presents a novel method of plant classification using Gabor wavelet filters to extract texture filters in a foliar surface. The aim of this promising method is to add to the results obtained by other leaf attributes (such as shape, contour, color, among others), increasing, therefore, the percentage of classification of plant species. To corroborate the efficiency of the technique, an experiment using 20 species from Brazilian flora was done and discussed. The results are also compared with texture Fourier descriptors and cooccurrence matrices. (C) 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 236-243, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.20201

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

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 patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

ON CLOSED GEODESICS IN THE LEAF SPACE OF SINGULAR RIEMANNIAN FOLIATIONS

In this paper we prove the existence of closed geodesics in the leaf space of some classes of singular Riemannian foliations (s.r.f.), namely s.r.fs. that admit sections or have no horizontal conjugate points. We also investigate the shortening process with respect to Riemannian foliations.

Pineapple Leaf Fibers for Composites and Cellulose

Pineapple leaf fiber (PALF) which is rich in cellulose, abundantly available, relatively inexpensive, low density, nonabrasive nature, high filling level possible, low energy consumption, high specific properties, biodegradability and has the potential for polymer reinforcement. The utilization of pineapple leaf fiber (PALF) as reinforcements in thermoplastic and thermosetting resins in micro and nano form for developing low cost and lightweight composites is an emerging field of research in polymer science and technology. In this paper we examines the industrial applicabiliy of PALF, mainly for production of composite materials and special papers, chemical feedstocks (bromelin enzyme) and fabrics.