The scalability of evolved on line bin packing heuristics

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 2530-2537

  Burke, E K ^a   Hyde, M R ^a   Kendall, G ^a   Woodward, J R ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING HEURISTICS; COMBINATORIAL EXPLOSION;

ALGORITHMS; GENETIC PROGRAMMING; ONLINE SYSTEMS; PROBLEM SOLVING;

HEURISTIC METHODS;

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

References (27)

1. Ross, P.: Hyper-heuristics. In Burke, E.K., Kendall, G., eds.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Boston (2005) 529-556
2. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In Glover, F., Kochenberger, G., eds.: Handbook of Meta-heuristics. Kluwer (2003) 457-474
3. Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling. PhD thesis, Univesity of Nottingham, School of Computer Science (2003)
4. Burke, E.K., Hyde, M.R., Kendall, G.: Evolving bin packing heuristics with genetic programming. In Runarsson, T.P., Beyer, H.G., Burke, E., Merelo-Guervos, J.J., Whitley, L.D., Yao, X., eds.: Parallel Problem Solving from Nature - PPSN IX Springer Lecture Notes in Computer Science. Volume 4193 of LNCS., Reykjavik, Iceland, Springer-Verlag (2006) 860-869
5. Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.R.: Automatic heuristic generation with genetic programming: Evolving a jack-of-alltrades or a master of one. In Lipson, H., Thierens, D., eds.: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, UK, July 7-11, 2007, ACM (2007)
6. Sastry, K., Kendall, G., Goldberg, D.: Genetic algorithms. In Burke, E.K., Kendall, G., eds.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Boston (2005) 97-125
7. Ross, P., Schulenburg, S., Marín-Blázquez, J., Hart, E.: Hyperheuristics: Learning to combine simple heuristics in bin-packing problems. In Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N., eds.: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, Morgan Kaufmann Publishers (2002) 942-948
8. Ross, P., Marin-Blazquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new gabased approach to hyperheurstics. In: Proceedings of the Genetic and Evolutionary Computation Conference 2003 (GECCO '03), Chicago, Illinois (2003) 1295-1306
9. Dowsland, K., Soubeiga, E., Burke, E.K.: A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research 179(3) (2007) 759-774
10. Burke, E.K., Petrovic, S., Qu, R.: Case-based heuristic selection for timetabling problems. Journal of Scheduling 9(2) (2006) 115-132
11. Ozcan, E., Bilgin, B., Korkmaz, E.E.: Hill climbers and mutational heuristics in hyperheuristics. In Runarsson, T., Beyer, H.G., Burke, E., J.Merelo-Guervos, J., Whitley, D., Yao, X., eds.: Lecture Notes in Computer Science, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006). Volume 4193., Reykjavik, Iceland (2006) 202-211
12. Burke, E.K., McCollum, B., Petrovic, A.M.S., Qu, R.: A graphbased hyper heuristic for timetabling problems. European Journal of Operational Research 176 (2007) 177-192
13. Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics 9(6) (2003) 451-470
14. Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In Burke, E.K., Erben, W., eds.: Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2000), Springer Lecture notes in Computer Science. Volume 2079., (Konstanz, Germany)
15. Rattadilok, P., Gaw, A., Kwan, R.: Distributed choice function hyperheuristics for timetabling and scheduling. In Burke, E., M.Trick, eds.: Practice and Theory of Automated Timetabling V, Springer Lecture notes in Computer Science. Volume 3616. (2005) 51-67
16. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990)
17. Coffman Jr, E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In Du, D.Z., Pardalos, P.M., eds.: Handbook of Combinatorial Optimization. Kluwer (1998)
18. Rhee, W.T., Talagrand, M.: On line bin packing with items of random size. Math. Oper. Res. 18 (1993) 438-445
19. Johnson, D., Demers, A., Ullman, J., Garey, M., Graham, R.: Worstcase performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing 3(4) (December 1974) 299-325
20. Koza, J.R.: Genetic programming II: automatic discovery of reusable programs. MIT Press, Cambridge, MA, USA (1994)
21. Koza, J.R.: Scalable learning in genetic programming using automatic function definition. In: Advances in genetic programming. MIT Press, Cambridge, MA, USA (1994) 99-117
22. Teller, A.: Turing completeness in the language of genetic programming with indexed memory. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence. Volume 1., Orlando, Florida, USA, IEEE Press (1994) 136-141
23. Miller, J.F., Job, D., Vassilev, V.K.: Principles in the evolutionary design of digital circuits - part i. Genetic Programming and Evolvable Machines 1(1/2) (2000) 7-35
24. Brave, S.: Evolving recursive programs for tree search. In Angeline, P.J., E., K., eds.: Advances in Genetic Programming 2. MIT Press (1996)
25. Yu, T.: Hierarchical processing for evolving recursive and modular programs using higher-order functions and lambda abstraction. Genetic Programming and Evolvable Machines 2(4) (2001) 345-380
26. Langdon, W.B.: Scaling of program tree fitness spaces. Evolutionary Computation 7(4) (1999) 399-428
27. Teller, A.: The evolution of mental models. In E., K., ed.: Advances in Genetic Programming. MIT Press (1994) 199-219