Login / Signup

A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem.

Hugo Terashima-MarínCláudia J. Farías ZáratePeter RossManuel Valenzuela-Rendón
Published in: GECCO (2006)
Keyphrases
  • detection method
  • similarity measure
  • objective function
  • genetic algorithm
  • significant improvement
  • cutting stock problems
  • computational complexity
  • scheduling problem
  • clustering method
  • combinatorial optimization