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

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

โœ Scribed by Dequan Liu; Hongfei Teng

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
220 KB
Volume
112
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 improvements.

๐Ÿ“œ SIMILAR VOLUMES

An improved hybrid genetic algorithm: ne
An improved hybrid genetic algorithm: new results for the quadratic assignment problem
โœ Alfonsas Misevicius ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 229 KB

In this paper, we propose an improved hybrid genetic algorithm (IHGA). It uses a robust local improvement procedure as well as an effective restart mechanism that is based on so-called 'shift mutations'. IHGA has been applied to the well-known combinatorial optimization problem, the quadratic assign

An algorithm to improve the computationa
An algorithm to improve the computational efficiency of genetic linkage analysis
โœ Michael S. Braverman ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 910 KB

The computational complexity of genetic linkage analysis can increase exponentially with the square of the number of alleles at a marker locus. Many of the most informative marker loci have a large number of associated alleles. The precise identities of the alleles are irrelevant to the linkage anal