Skip to main content

Research Repository

Advanced Search

Outputs (3)

Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics. (2003)
Conference Proceeding
Ross, P., Marin-Blazquez, J. G., Schulenburg, S., & Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.

The idea underlying hyper-heuristics is to discover some combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be worthwhile, such a combination should outperform all of the constituent heur... Read More about Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics..

Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. (2002)
Conference Proceeding
Ross, P., Schulenburg, S., Marin-Blazquez, J. G., & Hart, E. (2002). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems.

Evolutionary algorithms (EAs) often appear to be a ‘black box’, neither offering worst-case bounds nor any guarantee of optimality when used to solve individual problems. They can also take much longer than non-evolutionary methods. We try to addres... Read More about Hyper-heuristics: learning to combine simple heuristics in bin-packing problems..