Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
Authors: V. M. Kotov, Dayong Cao
– 0.16 Mb
Abstract
In this paper, we construct best fit based on concave corner strategy (BFBCC) for the two-dimensional rectangular strip packing problem (2D-RSPP), and compare it with some heuristic and metaheuristic algorithms from the literature. The experimental results show that BFBCC could produce satisfied packing layouts, especially for the large problem of 50 pieces or more, BFBCC could get better results in shorter time.E-mail: ,
Fulltext
– 0.16 Mb
Contents
- Academician P. S. Soltan founder of the moldavian scientific school in applied mathematics
- On some operations in the lattice of submodules determined by preradicals
- Estimation of the number of one-point expansions of a topology which is given on a finite set
- Convex Solids with Hyperplanar Midsurfaces for Restricted Families of Chords
- On the Abstract Čech Cohomology
- Some addition theorems for rectifiable spaces
- Saddle points with respect to a set
- A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
- The Variational Approach to Nonlinear Evolution Equations
- On Wallman compactifications of T0-spaces and related questions
