Ant Algorithms Solve Difficult Optimization Problems.pdfVIP

Ant Algorithms Solve Difficult Optimization Problems.pdf

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Ant Algorithms Solve Difficult Optimization Problems

Ant Algorithms Solve Difficult Optimization Problems Marco Dorigo IRIDIA Universite? Libre de Bruxelles 50 Avenue F. Roosevelt B-1050 Brussels, Belgium mdorigo@ulb.ac.be Abstract. The ant algorithms research field builds on the idea that the study of the behavior of ant colonies or other social insects is interesting for computer scientists, because it provides models of distributed orga- nization that can be used as a source of inspiration for the design of op- timization and distributed control algorithms. In this paper we overview this growing research field, giving particular attention to ant colony op- timization, the currently most successful example of ant algorithms, as well as to some other promising directions such as ant algorithms inspired by labor division and brood sorting. 1 Introduction Models based on self-organization have recently been introduced by ethologists to study collective behavior in social insects [2, 3, 5, 14]. While the main mo- tivation for the development of these models was to understand how complex behavior at the colony level emerges out of interactions among individual insects, computer scientists have recently started to exploit these models as an inspira- tion for the design of useful optimization and distributed control algorithms. For example, a model of cooperative foraging in ants has been transformed into a set of optimization algorithms, now known as ant colony optimization (ACO) [22, 24], capable of tackling very hard computational problems, such as the trav- eling salesman [28, 20, 29, 26, 60], the quadratic assignment problem [47, 46, 35, 61], the sequential ordering problem [33], the shortest common supersequence problem [49], various scheduling problems [57, 12, 48], and many others (see Ta- ble 1). More recently, ACO has also been successfully applied to distributed control problems such as adaptive routing in communications networks [54, 17]. Another model, initially introduced to explain brood sorting in ants, was

文档评论(0)

l215322 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档