Grammatical evolution of local search heuristics

IEEE Transactions on Evolutionary Computation

Volumn 16, Issue 3, 2012, Pages 406-417

  Burke, Edmund K ^a   Hyde, Matthew R ^a   Kendall, Graham ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Bin packing; grammatical evolution; heuristics; local search; stock cutting

Indexed keywords

BIN PACKING; GRAMMATICAL EVOLUTION; HEURISTICS; LOCAL SEARCH; STOCK CUTTING;

GENETIC PROGRAMMING; HEURISTIC ALGORITHMS;

COMPUTATIONAL GRAMMARS;

EID: 84861819017     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2160401     Document Type: Article

References (69)

1. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, Hyper-heuristics: An emerging direction in modern search technology, in Handbook of Meta-Heuristics, F. Glover and G. Kochenberger, Eds. Boston, MA: Kluwer, 2003, pp. 457-474.
2. E. K. Burke, G. Kendall, and E. Soubeiga, A tabu-search hyper-heuristic for timetabling and rostering, J. Heuristics, vol. 9, no. 6, pp. 451-470, 2003.
3. P. Ross, Hyper-heuristics, in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and G. Kendall, Eds. New York: Springer, 2005, pp. 529-556.
4. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. Woodward, A classification of hyper-heuristics approaches, in Handbook of Meta-Heuristics, M. Gendreau and J. Potvin, Eds., 2nd ed. New York: Springer, 2010, pp. 449-468.
5. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ö zcan, and J. Woodward, Exploring hyper-heuristic methodologies with genetic programming, in Computational Intelligence: Collaboration, Fusion and Emergence, C. Mumford and L. Jain, Eds. New York: Springer, 2009, pp. 177-201.
6. M. B. Bader-El-Den and R. Poli, Generating SAT local-search heuristics using a GP hyper-heuristic framework, in Proc. 8th Int. Conf. Artif. Evol., LNCS 4926. Oct. 2007, pp. 37-49.
7. A. S. Fukunaga, Automated discovery of local search heuristics for satisfiability testing, Evol. Computat., vol. 16, no. 1, pp. 31-61, Apr. 2008.
8. C. D. Geiger, R. Uzsoy, and H. Aytug, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, J. Scheduling, vol. 9, no. 1, pp. 7-34, 2006. (Pubitemid 43063747)
9. N. B. Ho and J. C. Tay, Evolving dispatching rules for solving the flexible job-shop problem, in Proc. IEEE CEC, Sep. 2005, pp. 2848-2855. (Pubitemid 41496203)
10. J. C. Tay and N. B. Ho, Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems, Comput. Industr. Eng., vol. 54, no. 3, pp. 453-473, 2008. (Pubitemid 351199798)
11. E. K. Burke, M. R. Hyde, and G. Kendall, Evolving bin packing heuristics with genetic programming, in Proc. 9th Int. Conf. PPSN, LNCS 4193. Sep. 2006, pp. 860-869. (Pubitemid 44609462)
12. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward, Automatic heuristic generation with genetic programming: Evolving a jack-of-alltrades or a master of one, in Proc. 9th ACM GECCO, Jul. 2007, pp. 1559-1565. (Pubitemid 47291762)
13. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward, The scalability of evolved on line bin packing heuristics, in Proc. IEEE CEC, Sep. 2007, pp. 2530-2537.
14. C. Kenyon, Best-fit bin-packing with random order, in Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms, 1996, pp. 359-364.
15. R. Kumar, A. H. Joshi, K. K. Banka, and P. I. Rockett, Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming, in Proc. 10th ACM Conf. GECCO, 2008, pp. 1227-1234.
16. E. K. Burke, M. Hyde, and G. Kendall, Providing a memory mechanism to enhance the evolutionary design of heuristics, in Proc. IEEE WCCI, Jul. 2010, pp. 3883-3890.
17. S. Allen, E. K. Burke, M. R. Hyde, and G. Kendall, Evolving reusable 3D packing heuristics with genetic programming, in Proc. ACM GECCO, Jul. 2009, pp. 931-938.
18. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward, A genetic programming hyper-heuristic approach for evolving two dimensional strip packing heuristics, IEEE Trans. Evol. Computat., vol. 14, no. 6, pp. 942-958, Dec. 2010.
19. H. Terashima-Marin, E. J. Flores-Alvarez, and P. Ross, Hyper-heuristics and classifier systems for solving 2d-regular cutting stock problems, in Proc. ACM GECCO, Jun. 2005, pp. 637-643. (Pubitemid 43226353)
20. H. Terashima-Marin, C. J. Farias-Zarate, P. Ross, and M. Valenzuela-Rendon, A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem, in Proc. GECCO, Jul. 2006, pp. 591-598. (Pubitemid 44611375)
21. H. Terashima-Marin, C. J. Farias-Zarate, P. Ross, and M. Valenzuela-Rendon, Comparing two models to generate hyper-heuristics for the 2D-regular bin-packing problem, in Proc. GECCO, Jul. 2007, pp. 2182-2189. (Pubitemid 47291860)
22. H. Terashima-Marin, P. Ross, C. J. Farias-Zarate, E. Lopez-Camacho, and M. Valenzuela-Rendon, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, Ann. Oper. Res., vol. 179, no. 1, pp. 369-392, Nov. 2008.
23. P. Ross, S. Schulenburg, J. G. Marin-Blazquez, and E. Hart, Hyper heuristics: Learning to combine simple heuristics in bin packing problems, in Proc. GECCO, 2002, pp. 942-948.
24. P. Ross, J. G. Marin-Blazquez, S. Schulenburg, and E. Hart, Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheurstics, in Proc. GECCO, 2003, pp. 1295-1306.
25. M. Oltean, Evolving evolutionary algorithms using linear genetic programming, Evol. Computat., vol. 13, no. 3, pp. 387-410, 2005. (Pubitemid 41335763)
26. L. Diosan and M. Oltean, Evolutionary design of evolutionary algorithms, Genet. Program. Evolvable Mach., vol. 10, no. 3, pp. 263-306, 2009.
27. R. Poli, C. Di Chio, and W. B. Langdon, Exploring extended particle swarms: A genetic programming approach, in Proc. Genet. Evol. Computat. Conf., Jun. 2005, pp. 169-176. (Pubitemid 43226284)
28. R. Poli, W. B. Langdon, and O. Holland, Extending particle swarm optimisation via genetic programming, in Proc. 8th Eur. Conf. Genet. Program., Mar. 2005, pp. 291-300. (Pubitemid 41274034)
29. A. Hauptman, A. Elyasaf, M. Sipper, and A. Karmon, GP-rush: Using genetic programming to evolve solvers for the rush hour puzzle, in Proc. 9th ACM GECCO, Jul. 2007, pp. 955-962.
30. R. E. Keller and R. Poli, Linear genetic programming of parsimonious metaheuristics, in Proc. IEEE CEC, Sep. 2007, pp. 4508-4515.
31. R. E. Keller and R. Poli, Cost-benefit investigation of a geneticprogramming hyperheuristic, in Proc. 8th Int. Conf. Artif. Evol., Oct. 2007, pp. 13-24.
32. R. E. Keller and R. Poli, Subheuristic search and scalability in a hyperheuristic, in Proc. 10th Annu. GECCO, 2008, pp. 609-610.
33. R. E. Keller and R. Poli, Toward subheuristic search, in Proc. IEEE WCCI, Jun. 2008, pp. 3148-3155.
34. R. E. Keller and R. Poli, Self-adaptive hyperheuristic and greedy search, in Proc. IEEE WCCI, Jun. 2008, pp. 3801-3808.
35. N. Krasnogor, Self generating metaheuristics in bioinformatics: The proteins structure comparison case, Genet. Program. Evolvable Mach., vol. 5, no. 2, pp. 181-201, 2004. (Pubitemid 38497848)
36. N. Krasnogor and S. Gustafson, A study on the use of 'self-generation' in memetic algorithms, Nat. Comput., vol. 3, no. 1, pp. 53-76, 2004. (Pubitemid 39127659)
37. R. Meuth, M. Lim, Y. Ong, and D. Wunsch, A proposition on memes and meta-memes in computing for higher-order learning, Memet. Comput., vol. 1, no. 2, pp. 85-100, 2009.
38. R. Poli and M. Graff, There is a free lunch for hyper-heuristics, genetic programming and computer scientists, in Proc. 12th Eur. Conf. Genet. Program., LNCS vol. 5481. Apr. 2009, pp. 195-207.
39. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. Chichester, U.K.: Wiley, 1990.
40. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the theory of NP-Completeness. San Fransisco, CA: Freeman, 1979.
41. E. G. Coffman, Jr., G. Galambos, S. Martello, and D. Vigo, Bin packing approximation algorithms: Combinatorial analysis, in Handbook of Combinatorial Optimization, D. Z. Du and P. M. Pardalos, Eds. Norwell, MA: Kluwer, 1998, pp. 151-207.
42. D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham, Worstcase performance bounds for simple one-dimensional packaging algorithms, SIAM J. Comput., vol. 3, no. 4, pp. 299-325, Dec. 1974.
43. W. T. Rhee and M. Talagrand, On line bin packing with items of random size, Math. Oper. Res., vol. 18, no. 2, pp. 438-445, May 1993.
44. E. G. Coffman, Jr., C. Courcoubetis, M. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis, Bin packing with discrete item sizes, part I: Perfect packing theorems and the average case behavior of optimal packings, SIAM J. Discrete Math., vol. 13, no. 3, pp. 384-402, 2000.
45. M. B. Richey, Improved bounds for harmonic-based bin packing algorithms, Discrete Appl. Math., vol. 34, nos. 1-3, pp. 203-227, Nov. 1991.
46. S. Seiden, R. Van Stee, and L. Epstein, New bounds for variable-sized online bin packing, SIAM J. Comput., vol. 32, no. 2, pp. 455-469, 2003.
47. P. Gilmore and R. Gomory, A linear programming approach to the cutting-stock problem, Oper. Res., vol. 9, no. 6, pp. 849-859, 1961.
48. P. C. Gilmore and R. E. Gomory, A linear programming approach to the cutting-stock problem: Part II, Oper. Res., vol. 11, no. 6, pp. 863-888, 1963.
49. A. Afshar, H. Amiri, and E. Eshtehardian, An improved linear programming model for one-dimensional cutting stock problem, in Proc. 1st ICCIDC-I, Aug. 2008, pp. 51-56.
50. H. Dyckhoff, A new linear programming approach to the cutting stock problem, Oper. Res., vol. 29, no. 6, pp. 1092-1104, 1981. (Pubitemid 12468566)
51. R. W. Haessler and P. E. Sweeney, Cutting stock problems and solution procedures, Eur. J. Oper. Res., vol. 54, no. 2, pp. 141-150, 1991.
52. A. Scholl, R. Klein, and C. Jurgens, Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Comput. Oper. Res., vol. 24, no. 7, pp. 627-645, 1997.
53. P. H. Vance, Branch-and-price algorithms for the one-dimensional cutting stock problem, Computat. Optimiz. Applicat., vol. 9, no. 3, pp. 211-228, 1998.
54. J. M. Valerio de Carvalho, A note on branch-and-price algorithms for the one-dimensional cutting stock problems, Computat. Optimiz. Applicat., vol. 21, no. 3, pp. 339-340, 2002.
55. M. J. Brusco, G. M. Thompson, and L. W. Jacobs, A morph-based simulated annealing heuristic for a modified bin-packing problem, J. Oper. Res. Soc., vol. 48, no. 4, pp. 433-439, 1997. (Pubitemid 127623679)
56. T. Kampke, Simulated annealing: Use of new tool in bin packing, Ann. Oper. Res., vol. 16, nos. 1-4, pp. 327-332, 1988.
57. R. L. Rao and S. S. Iyengar, Bin-packing by simulated annealing, Comput. Math. Applicat., vol. 27, no. 5, pp. 71-82, 1994.
58. E. Falkenauer, A hybrid grouping genetic algorithm for bin packing, J. Heuristics, vol. 2, no. 1, pp. 5-30, 1996. (Pubitemid 126714024)
59. E. Falkenauer and A. Delchambre, A genetic algorithm for bin packing and line balancing, in Proc. IEEE Int. Conf. Robotics Automat., May 1992, pp. 1186-1192. (Pubitemid 23595076)
60. M. O'Neill, R. Cleary, and N. Nikolov, Solving knapsack problems with attribute grammars, in Proc. 3rd GEWS, 2004.
61. R. Cleary and M. O'Neill, An attribute grammar decode for the 0/1 multiconstrained knapsack problem, in Proc. EVOCOP, LNCS 3448. 2005, pp. 34-45. (Pubitemid 41273986)
62. M. O'Neill and A. Brabazon, Grammatical swarm: The generation of programs by social programming, Nat. Comput., vol. 5, no. 4, pp. 443-462, 2006. (Pubitemid 44688316)
63. M. O'Neill, A. Brabazon, M. Nicolau, S. McGarraghy, and P. Keenan, π|-grammatical evolution, in Proc. Genet. Evol. Computat. Conf., LNCS 3103. Jun. 2004, pp. 617-629.
64. M. O'Neill and C. Ryan, Grammatical evolution, IEEE Trans. Evol. Computat., vol. 5, no. 4, pp. 349-358, Aug. 2001. (Pubitemid 32949966)
65. M. O'Neill and C. Ryan, Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language. Norwell, MA: Kluwer, 2003.
66. I. Dempsey, M. O'Neill, and A. Brabazon, Foundations in Grammatical Evolution for Dynamic Environments. New York: Springer, 2009.
67. M. O'Neill and C. Ryan, Automatic generation of caching algorithms, in Proc. EUROGEN, Short Course Evol. Algorithms Eng. Comput. Sci., May 1999, pp. 127-134.
68. R. I. McKay, N. X. Hoai, P. A. Whigham, Y. Shan, and M. O'Neill, Grammar-based genetic programming: A survey, Genet. Program. Evolvable Mach., vol. 11, nos. 3-4, pp. 365-396, 2010.
69. S. Martello and P. Toth, Lower bounds and reduction procedures for the bin packing problem, Discrete Appl. Math., vol. 28, no. 1, pp. 59-70, 1990.