Genetically designed heuristics for the bin packing problem

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@InProceedings{1274088,

• author = "Oana Muntean",
• title = "Genetically designed heuristics for the bin packing problem",
• booktitle = "Genetic and Evolutionary Computation Conference {(GECCO2007)} workshop program",
• year = "2007",
• month = "7-11 " # jul,
• editor = "Tina Yu",
• isbn13 = "978-1-59593-698-1",
• pages = "2869--2870",
• address = "London, United Kingdom",
• keywords = "genetic algorithms, genetic programming, bin packing, heuristics",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2007/docs/p2869.pdf",
• DOI = "doi:10.1145/1274000.1274088",
• publisher = "ACM Press",
• publisher_address = "New York, NY, USA",
• abstract = "The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimisation 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 emphasise that evolved GP heuristics can perform equally and sometimes even better than BFD for the considered test problems.",
• notes = "Distributed on CD-ROM at GECCO-2007 ACM Order No. 910071",

}

Genetic Programming entries for Oana Muntean

Citations