模拟退火:一类通用布局问题的快速启发式算法

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers Pub Date : 1988-11-07 DOI:10.1109/ICCAD.1988.122560

Jimmy Lam, J. Delosme

{"title":"模拟退火:一类通用布局问题的快速启发式算法","authors":"Jimmy Lam, J. Delosme","doi":"10.1109/ICCAD.1988.122560","DOIUrl":null,"url":null,"abstract":"It is shown that simulated annealing, with a properly designed annealing schedule and move-generation strategy, achieves significant speedups for high-quality solutions when compared with tailored heuristics on two well-studied problems: the traveling-salesman problem and the graph-partition problem. Efficient heuristics can be applied to power and ground routing for the traveling-salesman problem and to min-cut placement and logic partitioning for the graph-partition problem.<<ETX>>","PeriodicalId":285078,"journal":{"name":"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Simulated annealing: a fast heuristic for some generic layout problems\",\"authors\":\"Jimmy Lam, J. Delosme\",\"doi\":\"10.1109/ICCAD.1988.122560\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that simulated annealing, with a properly designed annealing schedule and move-generation strategy, achieves significant speedups for high-quality solutions when compared with tailored heuristics on two well-studied problems: the traveling-salesman problem and the graph-partition problem. Efficient heuristics can be applied to power and ground routing for the traveling-salesman problem and to min-cut placement and logic partitioning for the graph-partition problem.<<ETX>>\",\"PeriodicalId\":285078,\"journal\":{\"name\":\"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAD.1988.122560\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAD.1988.122560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

结果表明，对于旅行推销员问题和图划分问题，与定制启发式算法相比，采用合理设计的退火计划和移动生成策略的模拟退火算法可以显著提高高质量解的速度。有效的启发式方法可以应用于旅行推销员问题的电源和接地路由，以及图划分问题的最小切割放置和逻辑划分

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Simulated annealing: a fast heuristic for some generic layout problems

It is shown that simulated annealing, with a properly designed annealing schedule and move-generation strategy, achieves significant speedups for high-quality solutions when compared with tailored heuristics on two well-studied problems: the traveling-salesman problem and the graph-partition problem. Efficient heuristics can be applied to power and ground routing for the traveling-salesman problem and to min-cut placement and logic partitioning for the graph-partition problem.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers

自引率

0.00%

发文量