A histogram-matching approach to the evolution of bin-packing strategies

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 3500-3507

  Poli, Riccardo ^a   Woodward, John ^b   Burke, Edmund K ^b  

^a UNIVERSITY OF ESSEX   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIN-PACKING; HISTOGRAM-MATCHING; HUMAN-DESIGNED HEURISTICS;

GENETIC PROGRAMMING; OPTIMIZATION;

HEURISTIC METHODS;

EID: 55749091283     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424926     Document Type: Conference Paper

References (11)

1. E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. Hyper-heuristics: an emerging direction in modern search technology. In F. W. Glover and G. A. Kochenberger, editors, Handbook of metaheuristics, chapter 16, pages 457-474. Kluwer Academic Publishers, Boston, USA, 2003.
2. E. K. Burke, M. R. Hyde, and G. Kendall. Evolving bin packing heuristics with genetic programming. In T. P. Runarsson, H.-G. Beyer, E. K. Burke, J. J. M. Guervós, L. D. Whitley, and X. Yao, editors, PPSN, volume 4193 of Lecture Notes in Computer Science, pages 860-869. Springer, 2006.
3. E. Coffman Jr, M. Garey, and D. Johnson. Approximation algorithms for bin packing: a survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2, pages 46-93. PWS Publishing Company, Boston, MA, 1996.
4. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2(1):5-30, 1996.
5. K. Fleszar and K. S. Hindi. New heuristics for one-dimensional binpacking. Computers and Operations Research, 29(7):821-839, 2002.
6. H. J. Gupta JND. A new heuristic algorithm for the one-dimensional bin-packing problem. Production Planning and Control, 10(6):598-603, 1999.
7. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
8. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
9. S. Martello and P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28(1):59-70, 1990.
10. J. F. Miller, D. Job, and V. K. Vassilev. Principles in the evolutionary design of digital circuits - part I. Genetic Programming and Evolvable Machines, 1(1/2):7-35, 2000.
11. P. Ross, J. G. Marín-Blázquez, S. Schulenburg, and E. Hart. Learning a procedure that can solve hard bin-packing problems: A new GAbased approach to hyper-heuristics. In E. Cantú-Paz, J. A. Foster, K. Deb, D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M. A. Potter, A. C. Schultz, K. Dowsland, N. Jonoska, and J. Miller, editors, Genetic and Evolutionary Computation - GECCO-2003, pages 1295-1306, Berlin, 2003. Springer-Verlag.