Download:
by E. K. Burke, M. R. Hyde, G. Kendall
Parallel Problem Solving from Nature - PPSN IX Springer Lecture Notes in Computer Science. Volume 4193 of LNCS., Reykjavik, Iceland, Springer-Verlag (2006) 860–869
http://www.asap.cs.nott.ac.uk/publications/pdf/ppsn2006.pdf
Add To MetaCart
Abstract:
Abstract. The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heuristics have been developed to generate good quality solutions. This paper outlines a genetic programming system which evolves a heuristic that decides whether to put a piece in a bin when presented with the sum of the pieces already in the bin and the size of the piece that is about to be packed. This heuristic operates in a fixed framework that iterates through the open bins, applying the heuristic to each one, before deciding which bin to use. The best evolved programs emulate the functionality of the human designed ‘first-fit ’ heuristic. Thus, the contribution of this paper is to demonstrate that genetic programming can be employed to automatically evolve bin packing heuristics which are the same as high quality heuristics which have been designed by humans. 1
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1833
|
Genetic Programming: on the Programming of Computers by Means of Natural Selection
– Koza
- 1992
|
|
714
|
Genetic Programming
– Koza
- 1991
|
|
502
|
Genetic Programming II: Automatic Discovery of Reusable Programs
– Koza
- 1994
|
|
357
|
No Free Lunch Theorems for Optimization
– Wolpert, Macready
- 1998
|
|
345
|
Knapsack Problems: Algorithms and Computer Implementations
– Martello, Toth
- 1990
|
|
80
|
WorstCase Performance Bounds for Simple One-dimensional Packing Algorithms
– Johnson, Bemers, et al.
- 1974
|
|
57
|
A hybrid grouping genetic algorithm for bin packing
– Falkenauer
- 1996
|
|
51
|
A tabu-search hyperheuristic for timetabling and rostering
– Burke, Kendall, et al.
- 2003
|
|
43
|
A hyperheuristic approach to scheduling a sales summit
– Cowling, Kendall, et al.
- 2001
|
|
38
|
A Genetic Algorithm for Bin Packing and Line Balancing
– Falkenauer, Delchambre
|
|
21
|
Optimal bin packing with items of random sizes
– Rhee, Talagrand
- 1993
|
|
20
|
Hyper-heuristics: An emerging direction in modern search technology
– Burke, Hart, et al.
- 2003
|
|
18
|
Bin packing approximation algorithms: Combinatorial Analysis
– Coffman, Galambos, et al.
- 1998
|
|
17
|
Case Based Heuristic Selection for Timetabling Problems. Accepted for publication
– Burke, Petrovic, et al.
- 2006
|
|
16
|
Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems
– Ross, Schulenburg, et al.
- 2002
|
|
11
|
Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics
– Ross, Blázquez, et al.
- 2003
|
|
10
|
Development and Application of Hyperheuristics to Personnel Scheduling
– Soubeiga
- 2003
|
|
8
|
A graph-based hyper-heuristic for educational timetabling problems
– Burke, McCollum, et al.
- 2007
|
|
6
|
Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling
– Burke, D, et al.
- 2005
|
|
5
|
A Simulated Annealing Hyperheuristic for Determining Shipper Sizes”. Accepted by EJOR
– Dowsland, Soubeiga, et al.
- 2005
|
|
4
|
An ant algorithm hyperheuristic for the project presentation scheduling problem
– Burke, Kendall, et al.
- 2005
|
|
3
|
Complexity theory and the no free lunch theorem
– Whitley, Watson
- 2005
|
|
2
|
Multiobjective parsimony enforcement for superior generalisation performance
– Bernstein, Li, et al.
- 2004
|
|
1
|
Binpacking benchmark data, at the brunell university or-library. Available at: http://people.brunel.ac.uk/∼mastjjb/jeb/orlib/binpackinfo.html (Last modified: 07-09-2004) [Accessed 1st
– Beasley
- 2006
|
