求解绝对值距离Steiner最小树的改进元胞蚂蚁算法.pdfVIP

20 and 2008．44(20) Engineering Computer Applications计算机工程与应用 张瑾h2，马 良1 ZHANGJinl,2MA Lian91 1．上海理工大学管理学院，上海200093 2．河南大学计算机与信息工程学院，河南开封475001 1．Schoolof of forScienceand 200093，China Shanghai Technology，Shanghai Management，University andInformation 475001，China 2．Computer College，HenanUniversity，Kaifeng，Henan Engineering E-mail：zhangjin@henu．edu．cn mlnilnulntree cellularant ZItANGJin，M_A rectilinearSteiner Liang．Solving problemby呻roVed and EngineeriI-gApplications。2008。44(20)：20-22． Abstract：TherectilinearSteinerminimumtree isaclassical ofeombinatorial which problem NP—completeproblem optimization been in circuitetc．This an cellularautomataant has used the of widely layoutintegrated paperdesignedimproved algorithm onthe thesimilarstructurebetweenthecellularautomataandthesearchareaoftherectilinearSteiner based discoveryof of minimumtree．The resultsshowedthatthis can thetotal aboutl5％thanthat the computational algorithmimprove length minimum theeffectivenessofthe hasbeenvalidated． spanningtree，SO algorithm words：RectilinearSteinerMinimum Tree(RSMT)；cellularautomata；ant Key algorithm 摘要：绝对值距离Steiner最小树问题是在集成电路布线等领域应用广泛的属于NP难的经典组合优化问题，由于该问题的搜索 空间与元胞自动机的结构相似，设计了求解绝对值距离Steiner最小树问题的改进的元胞蚂蚁算法。经大量数据实验表明，该算法 要比最小生成树平均改进15％，优于多数已有的基于最小生成树的近似算法，验证了算法的实用性。 关键词：绝对值距离Steiner最小树；元胞自动机；蚂蚁算法