首页 | 本学科首页   官方微博 | 高级检索  
     


A grouping genetic algorithm with controlled gene transmission for the bin packing problem
Affiliation:1. Universidad Autónoma de Coahuila, Blvd. Revolución Oriente 151, Ciudad Universitaria, C.P. 27000, Torreón, Mexico;2. Tecnológico Nacional de México / Instituto Tecnológico de Ciudad Madero, División de Estudios de Posgrado e Investigación, Juventino Rosas S/N, C.P. 89440, Cd. Madero, Mexico;3. CINVESTAV-IPN, Evolutionary Computation Group, 07300, CDMX, Mexico;4. Basque Center for Applied Mathematics (BCAM) & Ikerbasque, 48009 Bilbo, Bizkaia, Spain;5. Cátedras CONACyT - Tecnológico Nacional de México / Instituto Tecnológico de Ciudad Madero, División de Estudios de Posgrado e Investigación, Juventino Rosas S/N, C.P. 89440, Cd. Madero, Mexico;1. Southampton Business School, University of Southampton, Southampton SO17 1BJ, UK;2. School of Mathematics, Cardiff University, Senghennydd Road, Cardiff, CF24 4AG, UK
Abstract: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.
Keywords:One-dimensional bin packing  Genetic algorithms  Grouping problems  Heuristics  Gene transmission
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号