基于蝗群攻击行为算法模型的组合优化问题求解

Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing Pub Date : 2017-03-22 DOI:10.1145/3018896.3025136

Tiago M. Ribeiro, V. L. Paucar

{"title":"基于蝗群攻击行为算法模型的组合优化问题求解","authors":"Tiago M. Ribeiro, V. L. Paucar","doi":"10.1145/3018896.3025136","DOIUrl":null,"url":null,"abstract":"The attack behavior of locust swarm has inspired the recently developed computer algorithmic model of locust swarm optimizer (LS) within the swarm artificial intelligence methods. Some NP-hard problems of combinatorial optimization that LS may solve are the following: the traveling salesman problem, the knapsack problem, routing in telecommunication networks, and cellular robotic systems. General models of these combinatorial optimization problems which can be solved with locust swarm optimizer technique are proposed in the present work.","PeriodicalId":131464,"journal":{"name":"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Problem solving in combinatorial optimization based on the algorithmic model of attack behavior of locust swarm\",\"authors\":\"Tiago M. Ribeiro, V. L. Paucar\",\"doi\":\"10.1145/3018896.3025136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The attack behavior of locust swarm has inspired the recently developed computer algorithmic model of locust swarm optimizer (LS) within the swarm artificial intelligence methods. Some NP-hard problems of combinatorial optimization that LS may solve are the following: the traveling salesman problem, the knapsack problem, routing in telecommunication networks, and cellular robotic systems. General models of these combinatorial optimization problems which can be solved with locust swarm optimizer technique are proposed in the present work.\",\"PeriodicalId\":131464,\"journal\":{\"name\":\"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3018896.3025136\",\"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 the Second International Conference on Internet of things, Data and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3018896.3025136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

蝗群的攻击行为启发了近年来在群体人工智能方法中发展起来的蝗群优化器(LS)计算机算法模型。组合优化的一些np困难问题，LS可以解决如下:旅行推销员问题，背包问题，电信网络中的路由和蜂窝机器人系统。本文提出了这些组合优化问题的一般模型，并用蝗群优化技术求解。

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

查看原文本刊更多论文

Problem solving in combinatorial optimization based on the algorithmic model of attack behavior of locust swarm

The attack behavior of locust swarm has inspired the recently developed computer algorithmic model of locust swarm optimizer (LS) within the swarm artificial intelligence methods. Some NP-hard problems of combinatorial optimization that LS may solve are the following: the traveling salesman problem, the knapsack problem, routing in telecommunication networks, and cellular robotic systems. General models of these combinatorial optimization problems which can be solved with locust swarm optimizer technique are proposed in the present work.

求助全文

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

来源期刊

Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing

自引率

0.00%

发文量