In order to further reduce the complexity of super large - scale integration design and enhance graphical readability , a hybrid genetic algorithm for solving circuit partitioning problem was presented 摘要為了進(jìn)一步降低超大型規(guī)模集成電路設(shè)計的復(fù)雜性、增強圖形可讀性,提出了一種求解電路劃分問題的混合式遺傳算法。
Two - dimensional packing problem arises from a variety of situations including apparel industry , parts nesting problems and super large - scale integration ( slsi ) . packing belongs to np - complete ( nondeterministic polynomial time complete ) problem , which is too difficult to be expressed accurately in simple information model . in addition , the part that can be expressed in mathematical model belongs to np - complete problem 布局問題來源于現(xiàn)代生產(chǎn)的許多領(lǐng)域并且表現(xiàn)為多種形式,如服裝行業(yè),部件拼裝和超大規(guī)模集成電路( slsi ) ,但是由于布局問題具有高度的復(fù)雜性,屬于組合優(yōu)化問題和np完全問題,它很難用單一的知識模型(如數(shù)學(xué)模型)來精確表達(dá),另外,可用數(shù)學(xué)模型表達(dá)的部分具有np完全計算復(fù)雜度。