基于改进布谷鸟搜索算法的迁移规划

2013 13th International Symposium on Communications and Information Technologies (ISCIT) Pub Date : 2013-10-24 DOI:10.1109/ISCIT.2013.6645935

Akajit Saelim, Suwanna Rasmequan, P. Kulkasem, K. Chinnasarn, Annupan Rodtook

{"title":"基于改进布谷鸟搜索算法的迁移规划","authors":"Akajit Saelim, Suwanna Rasmequan, P. Kulkasem, K. Chinnasarn, Annupan Rodtook","doi":"10.1109/ISCIT.2013.6645935","DOIUrl":null,"url":null,"abstract":"Mobile agent is a distributed computing technology which allows the agents to carry their jobs on behalf of users from current processing server to the others. Hence, the migration planning is a significant issue for improving performance of mobile agent. In this paper, we propose an improving method for finding path of mobile agent migration planning based on Cuckoo Search Algorithm. Our proposed method modified the original Cuckoo Search Algorithm in two ways. That is, for the first one: in finding new nest, we propose random replacement instead of Lévy fight algorithm. Then, for the second one: in destroying egg, we propose a context sensitive parameter instead of a constant parameter. The experimental results, comparing with migration using the former proposed method, original Cuckoo Search Algorithm and Ant Colony System, confirm that the proposed migration algorithm improves the path finding within the limited time scale.","PeriodicalId":356009,"journal":{"name":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Migration planning using modified Cuckoo Search Algorithm\",\"authors\":\"Akajit Saelim, Suwanna Rasmequan, P. Kulkasem, K. Chinnasarn, Annupan Rodtook\",\"doi\":\"10.1109/ISCIT.2013.6645935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile agent is a distributed computing technology which allows the agents to carry their jobs on behalf of users from current processing server to the others. Hence, the migration planning is a significant issue for improving performance of mobile agent. In this paper, we propose an improving method for finding path of mobile agent migration planning based on Cuckoo Search Algorithm. Our proposed method modified the original Cuckoo Search Algorithm in two ways. That is, for the first one: in finding new nest, we propose random replacement instead of Lévy fight algorithm. Then, for the second one: in destroying egg, we propose a context sensitive parameter instead of a constant parameter. The experimental results, comparing with migration using the former proposed method, original Cuckoo Search Algorithm and Ant Colony System, confirm that the proposed migration algorithm improves the path finding within the limited time scale.\",\"PeriodicalId\":356009,\"journal\":{\"name\":\"2013 13th International Symposium on Communications and Information Technologies (ISCIT)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 13th International Symposium on Communications and Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2013.6645935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 13th International Symposium on Communications and Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2013.6645935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

移动代理是一种分布式计算技术，它允许代理代表用户从当前处理服务器向其他处理服务器执行任务。因此，迁移规划是提高移动代理性能的一个重要问题。本文提出了一种基于布谷鸟搜索算法的移动智能体迁移规划路径查找改进方法。本文提出的算法从两个方面改进了原有的布谷鸟搜索算法。即，对于第一个:在寻找新巢时，我们提出随机替换算法代替lsamvy战斗算法。然后，对于第二个问题:在销毁鸡蛋，我们提出了一个上下文敏感的参数，而不是一个常数参数。实验结果表明，本文提出的迁移算法在有限的时间尺度内提高了寻径能力，并与原有的布谷鸟搜索算法和蚁群算法进行了比较。

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

查看原文本刊更多论文

Migration planning using modified Cuckoo Search Algorithm

Mobile agent is a distributed computing technology which allows the agents to carry their jobs on behalf of users from current processing server to the others. Hence, the migration planning is a significant issue for improving performance of mobile agent. In this paper, we propose an improving method for finding path of mobile agent migration planning based on Cuckoo Search Algorithm. Our proposed method modified the original Cuckoo Search Algorithm in two ways. That is, for the first one: in finding new nest, we propose random replacement instead of Lévy fight algorithm. Then, for the second one: in destroying egg, we propose a context sensitive parameter instead of a constant parameter. The experimental results, comparing with migration using the former proposed method, original Cuckoo Search Algorithm and Ant Colony System, confirm that the proposed migration algorithm improves the path finding within the limited time scale.

求助全文

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

来源期刊

2013 13th International Symposium on Communications and Information Technologies (ISCIT)

自引率

0.00%

发文量