首页> 外文期刊>Journal of Software Engineering and Applications >No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms
【24h】

No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms

机译:混合蚁群算法用于嵌套问题求解的不适合多边形

获取原文
           

摘要

In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.
机译:在设计科学中,这两种问题是相互嵌套的,但是,嵌套不能使我们看不见它们的问题解决方法和解决方案辩护方法不同的事实。蚂蚁算法研究领域的基础是,研究蚁群或其他社会昆虫的行为很有趣,因为它提供了分布式组织的模型,可以用作优化和分布式控制设计的灵感来源。算法。本文开发了一种相对较新的杂交蚂蚁搜索算法,并将其结果与其他算法进行了比较。这种启发式方法的智慧不是由单个蚂蚁描绘的,而是由分工和育雏分类启发的整个殖民地表达的。通过这种方法获得的解决方案将相对于其他传统启发式方法获得的解决方案进行评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号