Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
Classifier fitness based on accuracy
Evolutionary Computation
A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Multi-step environment learning classifier systems applied to hyper-heuristics
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computers and Operations Research
Using Hyper-heuristics for the Dynamic Variable Ordering in Binary Constraint Satisfaction Problems
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Stable solving of CVRPs using hyperheuristics
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Examination timetabling using late acceptance hyper-heuristics
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An energy efficient routing algorithm based on genetic algorithm for ad hoc networks
Annales UMCS, Informatica
IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
A hyper-heuristic approach to strip packing problems
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
IEEE Transactions on Evolutionary Computation
Integrating neural networks and logistic regression to underpin hyper-heuristic search
Knowledge-Based Systems
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
A genetic programming based hyper-heuristic approach for combinatorial optimisation
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A hyper-heuristic for solving one and two-dimensional bin packing problems
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Frequency distribution based hyper-heuristic for the bin-packing problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Evolving bin packing heuristics with genetic programming
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Two-Phase GA-Based model to learn generalized hyper-heuristics for the 2d-cutting stock problem
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
Distributed choice function hyper-heuristics for timetabling and scheduling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems
Fundamenta Informaticae - Emergent Computing
A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem
Journal of Information Technology Research
Generalizing hyper-heuristics via apprenticeship learning
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
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 heuristics. In this paper we describe a novel messy-GA-based approach that learns such a heuristic combination for solving one-dimensional bin-packing problems. When applied to a large set of benchmark problems, the learned procedure finds an optimal solution for nearly 80% of them, and for the rest produces an answer very close to optimal. When compared with its own constituent heuristics, it ranks first in 98% of the problems.