By Topic

Multiobjective placement of electronic components using evolutionary algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Deb, K. ; Dept. of Mech. Eng., Indian Inst. of Technol. Kanpur, India ; Jain, P. ; Gupta, N.K. ; Maji, H.K.

The optimal placement of electronic components on a printed circuit board is a well-studied optimization task. However, despite the involvement of multiple conflicting objectives, researchers have mainly used a single objective of minimizing the overall wire length or minimizing the overall heat generation or minimizing the overall time delay in its functioning. In this paper, the problem is treated as a two-objective optimization problem of minimizing the overall wire length and minimizing the failure-rate of the board arising due to uneven local heat accumulation. The proposed strategy uses a novel representation procedure and a multiobjective evolutionary algorithm capable of finding multiple Pareto-optimal solutions simultaneously. Moreover, the flexibility and efficacy of the proposed strategy have been demonstrated by simultaneously optimizing the placement of components and the layout of the board. The convergence and the extent of spread obtained in the solutions reliably by repetitive applications of the proposed procedure should encourage further application of the approach to more complex placement design problems.

Published in:

Components and Packaging Technologies, IEEE Transactions on  (Volume:27 ,  Issue: 3 )