无约束最优化蚁群算法（Unconstrained optimization ant colony algorithm）.docVIP

下载本文档

11
0
约4.99千字
约 12页
2017-07-24 发布于河南
举报
版权申诉

无约束最优化蚁群算法（Unconstrained optimization ant colony algorithm）.doc

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

无约束最优化蚁群算法（Unconstrained optimization ant colony algorithm）

无约束最优化蚁群算法（Unconstrained optimization ant colony algorithm） Unconstrained continuous function optimization artificial ant colony algorithm, general MATLAB source [copy link] Greensim greensim is currently offline QQ761222791 fortune 44 cereal online time 46 hours, and finally login 2011-7-31 essence 0 posts, 72 points 74, read permissions 20, registration time 2008-10-6UID57671 M School: a scholar M School: a scholar, points 74, distance from the next level needs 26 points, wealth 44 cereal, online time 46 hours post, 72 string of doors, plus friends greeting, send message, elevator to 1# Published in the 2010-3-6 15:29:41 | only see the author | reverse browse This source code is an implementation of artificial ant colony algorithm for solving unconstrained optimization, continuous function, with constraints for the situation, you can first use the penalty function method to deal with the problem into the unconstrained model, then use the source code for the original source code from the GreenSim team, please indicate. Function, [BESTX, BESTY, ALLX, ALLY]=ACOUCP (K, N, Rho, UB, Q, Lambda, LB) Ant Colony Optimization for Unconstrained Continuous, Problem %% ACOUCP.m No, the ant colony optimization algorithm for constrained continuous function % this function realization of ant colony algorithm, for solving unconstrained continuous function minimization problem %% for the maximization problem, please add it into a minimization problem % GreenSim team original works, reprint please specify % Email:greensim@163.com % GreenSim team home page: /greensim % welcome access to GreenSim - algorithm simulation team - /greensim % input parameter list % K iterations % N ant colony size % Rho pheromone evaporation coefficient is between 0~1 and 0.7 ~ 0.95 % Q pheromone increases intensity by more than 0, recommended values of around 1 % Lambda ants crawl speed, between 0~1, recommended value from 0.1 to 0.5 The lower bound of% LB decision variables, M * 1 vectors The upper bound