A genetic algorithm for macro cell placement

H. Esbensen

ScienceGate Book Chapters

JOURNAL ARTICLE

A genetic algorithm for macro cell placement

H. Esbensen

Year: 1992 Journal: European Design Automation Conference Pages: 52-57

Get Full-Text PDF Get Analytical Report

Abstract

A new genetic algorithm for the macro cell placement problem is presented. The algorithm is based on a generalization of the two-dimensional bin packing problem. The genetic encoding of a macro cell placement and the corresponding genetic operators are described. The algorithm has been tested on MCNC benchmarks and the quality of the produced placements is comparable to the best published results. >

Keywords:

Encoding (memory) Genetic algorithm Macro Generalization Computer science Algorithm Bin packing problem Mathematical optimization Mathematics Artificial intelligence Bin Machine learning Programming language

Metrics

Cited By

2.22

FWCI (Field Weighted Citation Impact)

Refs

0.86

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Manufacturing Process and Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

A genetic algorithm for macro cell placement

Abstract

Metrics

Citation History

Topics

Related Documents

A genetic algorithm for macro cell placement

A genetic algorithm for mixed macro and standard cell placement

Optimization of Macro Placement Using Genetic Algorithm

An efficient macro-cell placement algorithm

A performance driven macro-cell placement algorithm