๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A robust genetic algorithm for rectangle packing problem

โœ Scribed by Chen, De-Sheng; Lin, Chang-Tzu; Wang, Yi-Wen

Book ID
120694091
Publisher
Springer US
Year
2006
Tongue
English
Weight
607 KB
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Approximation Algorithms for T
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
โœ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add

An improved BL-algorithm for genetic alg
An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
โœ Dequan Liu; Hongfei Teng ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

This paper proposes an improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Some improvements on the ยฎtness function of genetic algorithm for the orthogonal packing of rectangles are also suggested. Solutions of two numerical examples show the eectiveness of these imp