Genetically designed heuristics for the bin packing problem

Authors:
Oana Muntean
Affiliations:
Babe Bolyai University
Venue:
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Year:
2007

Citing 5
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolving bin packing heuristics with genetic programming

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to automatically design an algorithm that places a collection of objects into the minimum number of fixed-size bins. For generating this heuristic we use Genetic Programming (GP) with a special set of terminals. The evolved strategy is compared to Best Fit Descending (BFD), a well-known heuristic for the bin packing problem. The results emphasize that evolved GP heuristics can perform equally and sometimes even better than BFD for the considered test problems.