咨询与建议

限定检索结果

文献类型

  • 2 篇 会议
  • 1 篇 期刊文献

馆藏范围

  • 3 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 工学
    • 2 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 电气工程

主题

  • 3 篇 modified binary ...
  • 2 篇 set covering pro...
  • 1 篇 np-hard optimisa...
  • 1 篇 np-hard
  • 1 篇 metaheuristics
  • 1 篇 computational co...
  • 1 篇 egyptian vulture...
  • 1 篇 homogeneous inci...
  • 1 篇 discretization m...
  • 1 篇 egyptian vulture...
  • 1 篇 constraint handl...
  • 1 篇 transfer functio...
  • 1 篇 mcdp optimisatio...
  • 1 篇 binary domain
  • 1 篇 production cells
  • 1 篇 fa metaheuristic
  • 1 篇 cellular manufac...
  • 1 篇 design engineeri...
  • 1 篇 optimisation
  • 1 篇 matrix algebra

机构

  • 3 篇 pontificia univ ...
  • 2 篇 univ finis terra...
  • 2 篇 univ autonoma ch...
  • 2 篇 univ playa ancha...
  • 2 篇 univ cent chile ...
  • 1 篇 univ diego porta...
  • 1 篇 univ san sebasti...
  • 1 篇 univ san sebasti...
  • 1 篇 univ diego porta...

作者

  • 3 篇 crawford broderi...
  • 3 篇 soto ricardo
  • 2 篇 johnson franklin
  • 2 篇 riquelme-leiva m...
  • 2 篇 pena cristian
  • 2 篇 torres-rojas cla...
  • 2 篇 paredes fernando
  • 1 篇 lama jacqueline
  • 1 篇 aspee fabian
  • 1 篇 almonacid boris

语言

  • 2 篇 英文
  • 1 篇 西班牙文
检索条件"主题词=modified binary firefly algorithm"
3 条 记 录,以下是1-10 订阅
排序:
Solving the manufacturing cell design problem using the modified binary firefly algorithm and the egyptian vulture optimisation algorithm
收藏 引用
IET SOFTWARE 2017年 第3期11卷 105-115页
作者: Almonacid, Boris Aspee, Fabian Soto, Ricardo Crawford, Broderick Lama, Jacqueline Pontificia Univ Catolica Valparaiso Valparaiso Chile
The manufacturing cell design problem (MCDP) aims to minimise the movements of parts between the production cells. The MCDP is an NP-Hard optimisation problem with a binary domain. For the resolution of the MCDP, the ... 详细信息
来源: 评论
modified binary firefly algorithms with Different Transfer Functions for Solving Set Covering Problems  4th
Modified Binary FireFly Algorithms with Different Transfer F...
收藏 引用
4th Computer Science On-line Conference (CSOC)
作者: Crawford, Broderick Soto, Ricardo Riquelme-Leiva, Marco Pena, Cristian Torres-Rojas, Claudio Johnson, Franklin Paredes, Fernando Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Finis Terrae Santiago Chile Univ San Sebastian San Sebastian Spain Univ Autonoma Chile Santiago Chile Univ Cent Chile Santiago Chile Univ Playa Ancha Valparaiso Chile Univ Diego Portales Escuela Ingn Ind Santiago Chile
In this paper, we propose a set of modified binary firefly algorithms (MBFF) to solve different instances of the Set Covering Problem (SCP). The algorithms consider eight Transfer Functions and five Discretization Met... 详细信息
来源: 评论
Set Covering Problem solved by new binary firefly algorithm  10
Set Covering Problem solved by new Binary Firefly Algorithm
收藏 引用
10th Iberian Conference on Information Systems and Technologies (CISTI)
作者: Crawford, Broderick Soto, Ricardo Riquelme-Leiva, Marco Pena, Cristian Torres-Rojas, Claudio Johnson, Franklin Paredes, Fernando Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Finis Terrae Santiago Chile Univ San Sebastian Santiago Chile Univ Autonoma Chile Santiago Chile Univ Cent Chile Santiago Chile Univ Playa Ancha Valparaiso Chile Univ Diego Portales Santiago Chile
In this paper, we propose a modified binary firefly algorithm to solve different instances of the Set Covering Problem (SCP). The Set Covering Problem is considered a classic combinatorial optimization problem, belong... 详细信息
来源: 评论