Importance

Loading Importance Indicators...

Abstract

Candidate locations in which each of the components is to be placed are assumed. Initially, all the cells on a printed circuit board are the candidates. The range of candidates for the location of each component is narrowed down in some way (for example, the farthest cell from a fixed component is excluded from candidates for the location in which a component that directly relates to the fixed component is to be placed). An approximation problem is created from an original placement problem and a solution that optimizes the approximation problem is find. This solution is a feasible solution of the original placement problem as well. The process of narrowing down the candidates and solving the approximation problem is repeated until one candidate (or more than one candidate having an equal evaluation value) is found ultimately to determine the placement of the component.

Loading the Abstract Image...

First Claim