大圆内不等圆盘的一种新算法

2012 International Conference on Computer Science and Information Processing (CSIP) Pub Date : 2012-09-24 DOI:10.1109/CSIP.2012.6308788

Huang Wenqi, Zeng Zhizhong, Fu Zhanghua, Ruchu Xu

{"title":"大圆内不等圆盘的一种新算法","authors":"Huang Wenqi, Zeng Zhizhong, Fu Zhanghua, Ruchu Xu","doi":"10.1109/CSIP.2012.6308788","DOIUrl":null,"url":null,"abstract":"To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new algorithm for packing unequal disks in a larger circle\",\"authors\":\"Huang Wenqi, Zeng Zhizhong, Fu Zhanghua, Ruchu Xu\",\"doi\":\"10.1109/CSIP.2012.6308788\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.\",\"PeriodicalId\":193335,\"journal\":{\"name\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSIP.2012.6308788\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computer Science and Information Processing (CSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIP.2012.6308788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在容器中尽可能小地设置不相等的磁盘而不重叠是一项具有广泛应用的相当有趣的NP-hard任务。本文介绍了一种以禁忌搜索、准人类跳盆策略和BFGS方法为基本元素的新方法，并通过将其与其他一些新的高效算法的基准问题求解结果进行比较，说明了该方法的有效性。

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

查看原文本刊更多论文

A new algorithm for packing unequal disks in a larger circle

To set unequal disks in a container as small as possible without overlap is a fairly fascinating NP-hard task with wide applications. In this paper, we introduced a new method using the techniques of Tabu search, quasi-human basin-hopping strategy, and BFGS method as its basic elements, and illustrated its efficiency by comparing its outcomes of solving some benchmark problems with those of some other new and efficient algorithms.

求助全文

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

来源期刊

2012 International Conference on Computer Science and Information Processing (CSIP)

自引率

0.00%

发文量