A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing

Authors:
Özgür Ülker;Emin Erkan Korkmaz;Ender Özcan
Affiliations:
Department of Computer Engineering, Yeditepe University, Kadikoy/Istanbul, Turkey;Department of Computer Engineering, Yeditepe University, Kadikoy/Istanbul, Turkey;Department of Computer Engineering, Yeditepe University, Kadikoy/Istanbul, Turkey
Venue:
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Year:
2008

Citing 12
Cited 1

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Excluding Symmetries in Constraint-Based Search

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Combining advantages of new chromosome representation scheme and multi-objective genetic algorithms for better clustering

Intelligent Data Analysis
Memetic algorithms for parallel code optimization

International Journal of Parallel Programming
A comprehensive analysis of hyper-heuristics

Intelligent Data Analysis
Memes, self-generation and nurse rostering

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Linear linkage encoding in grouping problems: applications on graph coloring and timetabling

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Policy matrix evolution for generation of heuristics

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear Linkage Encoding (LLE) is a representation method proposed for grouping problems. It has already been used in solving data clustering, graph coloring and timetabling problems based on multi-objective genetic algorithms. In this study, this novel encoding scheme is investigated on bin packing again using a genetic algorithm. Bin packing benchmark problem instances are used to compare the performance of traditional recombination operators and custom made LLE crossover operators which are hybridized with parametrized placement heuristics. The results denote that LLE is a viable candidate for bin packing problem whenever appropriate genetic operators are chosen.