{"title":"在蚁群算法的基础上设置覆盖","authors":"B. Lebedev, O. Lebedev, E. Lebedeva","doi":"10.1109/EWDTS.2014.7027073","DOIUrl":null,"url":null,"abstract":"The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.","PeriodicalId":272780,"journal":{"name":"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Set covering on the basis of the ant algorithm\",\"authors\":\"B. Lebedev, O. Lebedev, E. Lebedeva\",\"doi\":\"10.1109/EWDTS.2014.7027073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.\",\"PeriodicalId\":272780,\"journal\":{\"name\":\"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EWDTS.2014.7027073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EWDTS.2014.7027073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
