Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics - Combinatorial Optimization
On line bin packing with items of random size
Mathematics of Operations Research
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Computers and Operations Research
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
On the online bin packing problem
Journal of the ACM (JACM)
Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Comparing parameter tuning methods for evolutionary algorithms
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A Field Guide to Genetic Programming
A Field Guide to Genetic Programming
Evolving bin packing heuristics with genetic programming
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Matrix analysis of genetic programming mutation
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
A hyper-heuristic with a round robin neighbourhood selection
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Generalizing hyper-heuristics via apprenticeship learning
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Dimension reduction in the search for online bin packing policies
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Online bin-packing is a well-known problem in which immediate decisions must be made about the placement of items with various sizes into fixed capacity bins. The associated decisions can be based on an index policy in which each decision option is independently given a value and the highest value choice is selected. In this paper, we represent such heuristics for online bin packing as a simple matrix of scores. We then use a genetic algorithm to search for matrices giving good performance. This might be regarded as parameter tuning of the packing heuristic but in which a fine-grained representation is used and so the number of parameters is much larger than in standard parameter tuning. The evolved matrices perform better than the standard heuristics. They also reveal interesting structures and so have impact on questions of how heuristic score functions should be represented and what structure they might be expected to exhibit.