{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
