Abstract

The traveling salesman problem (TSP) can be mapped to the problem of optimal component placement for printed circuit boards (PCBs). An innovation that consists of adapting a neural network formulation of TSP to multiobjective component placement on the basis of wire-length criteria, as well as thermal reliability, is described. The author shows that the mathematical formulation of the Hopfield energy function for TSP is identical to the energy for the placement problem except for the cost (distance) function. The Hopfield cost function can be modified by introducing terms to model the wire-length and thermal reliability for alternative component placements. This approach was tested by coding a neural network simulator and comparing the quality of the resulting placement with standard methods. The positive results of that testing, the potential for a dramatic improvement in the time needed to calculate such optimal placements, and the natural way of extending the formulation to include more design criteria lead to a confidence that similar approaches will have a significant impact on multiobjective design.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.