We undertake an empirical study in which the performance of a good genetic algorithm is tested against some well-known bin packing heuristics on a range of two-dimensional bin packing problems. Weâ€¦ (More)

We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement and area optimization of soft modules in very large scale integration floorplan design. We haveâ€¦ (More)

1 I n t r o d u c t i o n The frequency assignment problem is a difficult, NP-hard, problem of considerable importance. The radio spectrum is a limited natural resource that is used in a variety ofâ€¦ (More)

This report describes a recursive process for generating data sets of rigid rectangles that can be placed into rectangular regions with zero waste. The generation procedure can be modified toâ€¦ (More)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From theâ€¦ (More)

The Held-Karp lower bound (HK) provides a very good problem-specific estimate of optimal tour length for the travelling salesman problem (TSP). This measure, which is relatively quick and easy toâ€¦ (More)

The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs aâ€¦ (More)

Experiments with genetic algorithms using permutation operators applied to the Travelling Salesman Problem (TSP) tend to suggest that these algorithms fail in two respects when applied to very largeâ€¦ (More)