A Histogram-Matching Approach to the Evolution of Bin-Packing Strategies

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

  author =       "Riccardo Poli and John Woodward and Edmund K. Burke",
  title =        "A Histogram-Matching Approach to the Evolution of
                 Bin-Packing Strategies",
  booktitle =    "2007 IEEE Congress on Evolutionary Computation",
  year =         "2007",
  editor =       "Dipti Srinivasan and Lipo Wang",
  pages =        "3500--3507",
  address =      "Singapore",
  month =        "25-28 " # sep,
  organization = "IEEE Computational Intelligence Society",
  publisher =    "IEEE Press",
  ISBN =         "1-4244-1340-0",
  file =         "1597.pdf",
  keywords =     "genetic algorithms, genetic programming",
  DOI =          "doi:10.1109/CEC.2007.4424926",
  abstract =     "We present a novel algorithm for the one-dimension
                 offline bin packing problem with discrete item sizes
                 based on the notion of matching the item-size histogram
                 with the bin-gap histogram. The approach is controlled
                 by a constructive heuristic function which decides how
                 to prioritise items in order to minimise the difference
                 between histograms. We evolve such a function using a
                 form of linear register-based genetic programming
                 system. We test our evolved heuristics and compare them
                 with hand-designed ones, including the well known best
                 fit decreasing heuristic. The evolved heuristics are
                 human-competitive, generally being able to outperform
                 high performance human-designed heuristics.",
  notes =        "CEC 2007 - A joint meeting of the IEEE, the EPS, and
                 the IET.

                 IEEE Catalog Number: 07TH8963C",

Genetic Programming entries for Riccardo Poli John R Woodward Edmund Burke