{"title":"随机进化的线性排序","authors":"Y. Saab, V. Rao","doi":"10.1109/ISVD.1991.185105","DOIUrl":null,"url":null,"abstract":"Linear ordering has applications in standard cells and gate array placement. This paper presents a new approach to linear ordering based on the new stochastic evolution (SE) methodology for solving intractable combinatorial optimization problems. The SE heuristic performs better than Kang's heuristic and simulated annealing. In many cases, the SE heuristic was significantly better than Kang's heuristic, and an order of magnitude better than simulated annealing.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Linear ordering by stochastic evolution\",\"authors\":\"Y. Saab, V. Rao\",\"doi\":\"10.1109/ISVD.1991.185105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Linear ordering has applications in standard cells and gate array placement. This paper presents a new approach to linear ordering based on the new stochastic evolution (SE) methodology for solving intractable combinatorial optimization problems. The SE heuristic performs better than Kang's heuristic and simulated annealing. In many cases, the SE heuristic was significantly better than Kang's heuristic, and an order of magnitude better than simulated annealing.<<ETX>>\",\"PeriodicalId\":183602,\"journal\":{\"name\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.1991.185105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linear ordering has applications in standard cells and gate array placement. This paper presents a new approach to linear ordering based on the new stochastic evolution (SE) methodology for solving intractable combinatorial optimization problems. The SE heuristic performs better than Kang's heuristic and simulated annealing. In many cases, the SE heuristic was significantly better than Kang's heuristic, and an order of magnitude better than simulated annealing.<>