基于回溯算法的计算机机箱线路板排列问题的分析研究

Analysis based on backtracking algorithm of wiring board arrangement problems in computer cabinet

针对计算机微型化的发展需求,为了有效节约计算机机箱的空间和大小,利用回溯算法的搜索问题解空间的排列树,深度优化策略,采用优先队列式分支限界法找出所给电路板的最小密度布局,研究计算机机箱线路板中的线路排列问题,找出有效解决计算机机箱中线路板及其插线在机箱中的合理排列方法。经过程序验证,提出的回溯算法解决了计算机机箱线路板排列问题,对于给定线路板连接条件(连接块),确定线路板的最佳排列,使其具有最小的密度的方法是可行的。

in order to meet the development demand of computer miniaturization and effectively save computer cabinet space, the priority queue branch and bound method is used to get the minimum density layout of the circuit board by the depth optimization strategy of the search solution space arrangement trees of the backtracking algorithm. The circuit board arrangement problem existing in the computer case circuit is researched to find out the reasonable arrangement method of the circuit board and plug wire in the computer case. After verification, the backtracking algorithm to solve the issue of the circuit board arrange- ment in computer case was determined, the minimum density method with the given circuit board connection conditions and the determined optimal arrangement of circuit board is feasible.