Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity

Abstract

A number of optimisation problems involve the optimal grouping of a finite set of items into a number of categories subject to one or more constraints. Such problems raise interesting issues in mapping solutions in genetic algorithms. These problems range from the knapsack problem to bin packing and cutting stock problems. This paper describes research… (More)
DOI: 10.1007/3-540-60154-6_54

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Hinterding1994GeneticAF, title={Genetic Algorithms for Cutting Stock Problems: With and Without Contiguity}, author={Robert Hinterding and Lutfar Khan}, booktitle={Evo Workshops}, year={1994} }