Set covering on the basis of the ant algorithm

机译：根据ant算法设置覆盖

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

The set coverings problem using mathematical methods in which principles of natural mechanisms of solution-making are proposed. For compact representation of the set covering solution the matrix of boundary requirements is used. This allowed forming the space of solutions in which frameworks the search process which is based on simulation of adaptive ant colony behavior is organized. In comparison with existing algorithms improvement of results is reached.

机译：该集合使用数学方法覆盖了问题，在数学方法中提出了解决问题的自然机制的原理。为了紧凑地表示集合覆盖解决方案，使用了边界要求矩阵。这允许形成解决方案的空间，在该解决方案的框架内组织了基于自适应蚁群行为模拟的搜索过程。与现有算法相比，可以改善结果。

著录项

来源
《IEEE East-West Design Test Symposium》|2014年|1-4|共4页
会议地点
作者
Lebedev B.K.; Lebedev O.B.; Lebedeva E.M.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词
VLSI; ant colony optimisation; integrated circuit layout; VLSI layout design; adaptive ant colony algorithm; boundary matrix; mathematical methods; search process; set covering problem; solution-making natural mechanism; solutions space; very large scale integration; Algorithm design and analysis; Automation; Computer science; Educational institutions; Layout; Search problems; Vectors;

机译：VLSI;蚁群优化;集成电路布局; VLSI布局设计;自适应蚁群算法;边界矩阵;数学方法;搜索过程;集合覆盖问题;求解自然机制;求解空间;超大规模集成;算法设计与分析自动化;计算机科学;教育机构;布局;搜索问题;向量;

相似文献

外文文献
中文文献
专利

1. Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem [J] . Journal of international management . 2020,第2期

机译：蚂蚁集：面向子集的蚁群优化算法，用于设定覆盖问题
2. Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem [J] . Murilo Falleiros Lemos Schmitt, Mauro Henrique Mulati, Ademir Aparecido Constantino, Journal of Universal Computer Science . 2020,第2期

机译：ant-set：一个面向子集蚁群优化算法，用于设定覆盖问题
3. A hybrid Ant algorithm for the set covering problem [J] . Broderick Crawford, Ricardo Soto, Eric Monfroy, International Journal of Physical Sciences . 2011,第19期

机译：集覆盖问题的混合蚂蚁算法
4. Set covering on the basis of the ant algorithm [C] . Lebedev B.K., Lebedev O.B., Lebedeva E.M. East-West Design Test Symposium . 2014

机译：在蚂蚁算法的基础上设置覆盖物
5. Combinatorial and algebraic algorithms in set covering and partitioning problems. [D] . Yu, Huiwen. 2014

机译：集覆盖和分区问题中的组合算法和代数算法。
6. Generation of dynamically configured check lists for intra-operative problems using a set of covering algorithms. [O] . T. Sawa, L. Ohno-Machado 2001

机译：使用一组覆盖算法生成用于术中问题的动态配置检查表。
7. Topological and algebraic characterization of coverings sets obtained in rough sets discretization and attribute reduction algorithms [O] . Restrepo López Mauricio 2015

机译：在粗糙集离散化和属性约简算法中获得的覆盖集的拓扑和代数表征
8. Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study. [R] . Balas, E., Ho, A. 1979

机译：使用切割平面，启发式和次梯度优化设置覆盖算法：计算研究。

Set covering on the basis of the ant algorithm

摘要

著录项

相似文献

相关主题

期刊订阅