A. J. U. Jamali, A. Grosso, M. Locatelli, F. Schoen
{"title":"Packing identical circles in a minimized circular container by Monotonic Basin Hopping heuristic approach","authors":"A. J. U. Jamali, A. Grosso, M. Locatelli, F. Schoen","doi":"10.1109/ICCIT.2009.5407178","DOIUrl":null,"url":null,"abstract":"Packing problems have mathematical as well as practical application point of interest. We present, here, Monotonic Basin Hopping heuristic approach to solve the problem of packing identical circles within a minimum size of circular container. Extensive computational experiments have been performed for analyzing the problem as well as for choosing an appropriate way the parameter values for the proposed methods. Several improvements with respect to the best results reported in the literature have been detected.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 12th International Conference on Computers and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2009.5407178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Packing problems have mathematical as well as practical application point of interest. We present, here, Monotonic Basin Hopping heuristic approach to solve the problem of packing identical circles within a minimum size of circular container. Extensive computational experiments have been performed for analyzing the problem as well as for choosing an appropriate way the parameter values for the proposed methods. Several improvements with respect to the best results reported in the literature have been detected.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
