ad hoc网络上的分布式并行遗传算法

Nima Afifi, H. Tavakoli
{"title":"ad hoc网络上的分布式并行遗传算法","authors":"Nima Afifi, H. Tavakoli","doi":"10.14419/JACST.V4I1.4162","DOIUrl":null,"url":null,"abstract":"Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.","PeriodicalId":445404,"journal":{"name":"Journal of Advanced Computer Science and Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The distributed parallel genetic algorithm on the ad hoc network\",\"authors\":\"Nima Afifi, H. Tavakoli\",\"doi\":\"10.14419/JACST.V4I1.4162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.\",\"PeriodicalId\":445404,\"journal\":{\"name\":\"Journal of Advanced Computer Science and Technology\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Advanced Computer Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14419/JACST.V4I1.4162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advanced Computer Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14419/JACST.V4I1.4162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

今天,移动计算是计算机和网络科学的重要问题之一。有目的地利用移动设备的处理能力来解决复杂问题是研究人员的研究领域之一。旅行商问题是优化问题中的一个重要问题,需要很高的处理能力才能找到最优的可能答案。本文通过在Ad Hoc网络的多个移动节点上提供一种基于分布式并行遗传算法的方法,试图提高旅行推销员算法寻找最佳答案的速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The distributed parallel genetic algorithm on the ad hoc network
Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信