首页    期刊浏览 2025年06月06日 星期五
登录注册

文章基本信息

  • 标题:Firefly Algorithm to Solve Two Dimensional Bin Packing Problem
  • 本地全文:下载
  • 作者:Kratika Chandra ; Sudhir Singh
  • 期刊名称:International Journal of Computer Science and Information Technologies
  • 电子版ISSN:0975-9646
  • 出版年度:2014
  • 卷号:5
  • 期号:4
  • 页码:5368-5373
  • 出版社:TechScience Publications
  • 摘要:The Firefly algorithm is one of the several nature inspired algorithms that have been developed in the recent past and is inspired from the flashing behaviour of the fireflies. The field of nature inspired computing and optimization techniques have evolved to solve the difficult optimization problems in diverse fields of engineering, science and technology. Several nature inspired algorithms have been proposed to solve NP hard optimization problems. Bin packing Problem is NP hard optimization problem. Firefly algorithm inspired by the flashing behaviour of fireflies The flashing behaviour of the fireflies is to attract other fireflies in the group for mating. The less bright firefly will be attracted by the brighter one. As all the fireflies are assumed to be unisexual, each firefly is attracted to the other. In this paper, Firefly Algorithm (FFA) is used to solve Two Dimensional Bin packing problem. And further compare it with First-Fit and Best-Fit algorithms. 2-BPP is to pack a set of items with different weights orthogonally into a minimum number of bins, minimizing bin space wastage and execution time. The performance of these algorithms was evaluated by testing on three classes of benchmark Data sets which was taken from OR Library. The results have shown that the firefly and best fit is approximately same and well rather than first fit for most of the problem cases.
  • 关键词:Firefly Algorithm; Bin packing problem; first fit;algorithm; Best fit algorithm
国家哲学社会科学文献中心版权所有