一种新的克隆选择算法及其在Web模式三维装箱问题中的应用

Jian-hua Li, Hui Chen, Lina Ren
{"title":"一种新的克隆选择算法及其在Web模式三维装箱问题中的应用","authors":"Jian-hua Li, Hui Chen, Lina Ren","doi":"10.1109/CSO.2010.169","DOIUrl":null,"url":null,"abstract":"In this paper, we attempted to improve convergent speed and efficiency of Immune Clonal Selection Algorithm (ICSA) from a new viewpoint. We concentrated on the antibody population size and search space. And a novel Reconfigurable Space Clone Selection Algorithm (RSCSA) was put forward. Micro space was constructed through reducing the search space and search dimension. Search power was strengthened greatly when search was just done in this space. The best antibody, which was found in this micro space, would be exchanged with the basic antibody population at the same time. This exchange is a direction for the antibody population evolution. Finally, RSCSA was applied to Three Dimension Bin Packing Problem of web mode Through several experiments, the following became clear. The RSCSA can improved the convergent speed of Web mode loading. At the same time, the algorithm is more efficient. Thus, the RSCSA possessed high performance.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Clone Selection Algorithm and its Application for Three Dimension Bin Packing Problem of Web Mode\",\"authors\":\"Jian-hua Li, Hui Chen, Lina Ren\",\"doi\":\"10.1109/CSO.2010.169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we attempted to improve convergent speed and efficiency of Immune Clonal Selection Algorithm (ICSA) from a new viewpoint. We concentrated on the antibody population size and search space. And a novel Reconfigurable Space Clone Selection Algorithm (RSCSA) was put forward. Micro space was constructed through reducing the search space and search dimension. Search power was strengthened greatly when search was just done in this space. The best antibody, which was found in this micro space, would be exchanged with the basic antibody population at the same time. This exchange is a direction for the antibody population evolution. Finally, RSCSA was applied to Three Dimension Bin Packing Problem of web mode Through several experiments, the following became clear. The RSCSA can improved the convergent speed of Web mode loading. At the same time, the algorithm is more efficient. Thus, the RSCSA possessed high performance.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文试图从新的角度提高免疫克隆选择算法(ICSA)的收敛速度和效率。我们主要关注抗体种群大小和搜索空间。提出了一种新的可重构空间克隆选择算法(RSCSA)。通过减少搜索空间和搜索维数来构建微空间。在这个空间刚刚进行搜索的时候,搜索能力大大增强了。在这个微空间中找到的最佳抗体将与基本抗体群体同时交换。这种交换是抗体种群进化的一个方向。最后,将RSCSA应用于web模式下的三维装箱问题。RSCSA可以提高Web模式加载的收敛速度。同时,该算法具有更高的效率。因此,RSCSA具有很高的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Clone Selection Algorithm and its Application for Three Dimension Bin Packing Problem of Web Mode
In this paper, we attempted to improve convergent speed and efficiency of Immune Clonal Selection Algorithm (ICSA) from a new viewpoint. We concentrated on the antibody population size and search space. And a novel Reconfigurable Space Clone Selection Algorithm (RSCSA) was put forward. Micro space was constructed through reducing the search space and search dimension. Search power was strengthened greatly when search was just done in this space. The best antibody, which was found in this micro space, would be exchanged with the basic antibody population at the same time. This exchange is a direction for the antibody population evolution. Finally, RSCSA was applied to Three Dimension Bin Packing Problem of web mode Through several experiments, the following became clear. The RSCSA can improved the convergent speed of Web mode loading. At the same time, the algorithm is more efficient. Thus, the RSCSA possessed high performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信