论文部分内容阅读
本文在布线的群图模型基础上，利用离散型Hopfield神经网络解决群图的最大割问题，并着重论述了如何跳出局部最优点的问题，从而较好地解决了双层布线通孔最小化问题。算法考虑了许多来自实际的约束，并进行大量的布线实例验证。
Based on the routing group graph model, this paper uses the discrete Hopfield neural network to solve the maximum cut of the group graph, and focuses on how to jump out of the local optimal point so as to solve the problem of minimizing the double-layer wiring through-hole . The algorithm takes into account many of the constraints from the real world and performs a large number of routing examples.