期刊
COMPUTERS & OPERATIONS RESEARCH
卷 55, 期 -, 页码 52-64出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2014.10.010
关键词
One-dimensional bin packing; Genetic algorithms; Grouping problems; Heuristics; Gene transmission
类别
资金
- CONACYT [58554]
- Calculo de Covering Arrays
- Fondo Mixto CONACyT-Gobierno del Estado de Tamaulipas [51623]
- COTACYT
- DGEST
- TECNM
- ITCM
In this study, the one-dimensional Bin Packing Problem (BPP) is approached. The BPP is a classical optimization problem that is known for its applicability and complexity. We propose a method that is referred to as the Grouping Genetic Algorithm with Controlled Gene Transmission (GGA-CGT) for Bin Packing. The proposed algorithm promotes the transmission of the best genes in the chromosomes without losing the balance between the selective pressure and population diversity. The transmission of the best genes is accomplished by means of a new set of grouping genetic operators, while the evolution is balanced with a new reproduction technique that controls the exploration of the search space and prevents premature convergence of the algorithm. The results obtained from an extensive computational study confirm that (1) promoting the transmission of the best genes improves the performance of each grouping genetic operator; (2) adding intelligence to the packing and rearrangement heuristics enhances the performance of a GGA; (3) controlling selective pressure and population diversity tends to lead to higher effectiveness; and (4) GGA-CGT is comparable to the best state-of-the-art algorithms, outperforming the published results for the class of instances Hard28, which appears to have the greatest degree of difficulty for BPP algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据