Journal ArticleDOI
An algorithm for polygon placement using a bottom-left strategy
Reads0
Chats0
TLDR
A fast and efficient implementation of a bottom-left (BL) placement algorithm for polygon packing that produces an optimal BL layout in the sense that the positions considered are guaranteed to contain the bottom- left position of the infinite set of possibilities.About:
This article is published in European Journal of Operational Research.The article was published on 2002-09-01. It has received 125 citations till now. The article focuses on the topics: Polygon.read more
Citations
More filters
Journal ArticleDOI
A 2-exchange heuristic for nesting problems
TL;DR: A new heuristic for the nesting problem based on a 2-exchange neighbourhood generation strategy that 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.
Journal ArticleDOI
Fast neighborhood search for two- and three-dimensional nesting problems
TL;DR: A new heuristic solution method for two-dimensional nesting problems based on a simple local search scheme in which the neighborhood is any horizontal or vertical translation of a given polygon from its current position is presented.
Journal ArticleDOI
Complete and robust no-fit polygon generation for the irregular stock cutting problem
TL;DR: This paper introduces a robust orbital method for the creation of no-fit polygons which does not suffer from the typical problem cases found in the other approaches from the literature.
Journal ArticleDOI
A tutorial in irregular shape packing problems
TL;DR: The aim is not to give a chronological account or an exhaustive review, but to draw on the literature to describe and evaluate the core approaches to irregular shape packing.
Discrete Optimization Complete and robust no-fit polygon generation for the irregular stock cutting problem
TL;DR: In this article, a robust orbital method for the creation of no-fit polygons is proposed, which does not suffer from the typical problem cases found in the other approaches from the literature.
References
More filters
Proceedings Article
Applying adaptive algorithms to epistatic domains
TL;DR: New techniques for applying adaptive algorithms to epistatic domains, while retaining some of the strength of Holland's convergence proof are described, for two-dimensional bin-packing problems and graph coloring problems.
Journal ArticleDOI
Orthogonal Packings in Two Dimensions
TL;DR: Efficient approximation algorithms are devised, their limitations are studied, and worst-case bounds on the performance of the packings they produce are derived.
Book ChapterDOI
Approximation Algorithms for Bin-Packing — An Updated Survey
TL;DR: This paper updates a survey written about 3 years ago with many new results, some of which represent important advances, and more than doubles the list in [53].
Journal ArticleDOI
On genetic algorithms for the packing of polygons
TL;DR: A genetic algorithm for placing polygons on a rectangular board is proposed and it is shown that the algorithm is improved by combination with deterministic methods.
Journal ArticleDOI
An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
Dequan Liu,Hongfei Teng +1 more
TL;DR: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles with improvements on the fitness function and solutions of two numerical examples show the effectiveness of these improvements.