Automated code generation by local search

There are many successful evolutionary computation techniques for automatic program generation, with the best known, perhaps, being genetic programming. Genetic programming has obtained human competitive results, even infringing on patented inventions. The majority of the scientific literature on automatic program generation employs such population-based search approaches, to allow a computer system to search a space of programs. In this paper, we present an alternative approach based on local search. There are many local search methodologies that allow successful search of a solution space, based on maintaining a single incumbent solution and searching its neighbourhood. However, use of these methodologies in searching a space of programs has not yet been systematically investigated. The contribution of this paper is to show that a local search of programs can be more successful at automatic program generation than current nature inspired evolutionary computation methodologies.

[1]  John R. Woodward,et al.  Hyper-Heuristics , 2015, GECCO.

[2]  Riccardo Poli,et al.  Extending Particle Swarm Optimisation via Genetic Programming , 2005, EuroGP.

[3]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[4]  Alex S. Fukunaga,et al.  Automated Discovery of Local Search Heuristics for Satisfiability Testing , 2008, Evolutionary Computation.

[5]  Peter A. Whigham,et al.  Grammar-based Genetic Programming: a survey , 2010, Genetic Programming and Evolvable Machines.

[6]  N. Given.  Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics , 2003 .

[7]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[8]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[9]  Arne Løkketangen,et al.  Generating meta-heuristic optimization code using ADATE , 2010, J. Heuristics.

[10]  Conor Ryan,et al.  Grammatical evolution , 2007, GECCO '07.

[11]  Riccardo Poli,et al.  A Field Guide to Genetic Programming , 2008 .

[12]  Graham Kendall,et al.  Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.

[13]  Martin Wattenberg,et al.  Stochastic Hillclimbing as a Baseline Mathod for Evaluating Genetic Algorithms , 1995, NIPS.

[14]  Riccardo Poli,et al.  Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework , 2007, Artificial Evolution.

[15]  Riccardo Poli,et al.  Exploring extended particle swarms: a genetic programming approach , 2005, GECCO '05.

[16]  Graham Kendall,et al.  Evolving reusable 3d packing heuristics with genetic programming , 2009, GECCO.

[17]  Mihai Oltean,et al.  Evolving Evolutionary Algorithms Using Linear Genetic Programming , 2005, Evolutionary Computation.

[18]  Graham Kendall,et al.  A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics , 2010, IEEE Transactions on Evolutionary Computation.

[19]  Michael O'Neill,et al.  Grammatical evolution - evolutionary automatic programming in an arbitrary language , 2003, Genetic programming.

[20]  Marko Privosnik.  The scalability of evolved on line bin packing heuristics , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Anthony Brabazon,et al.  Foundations in Grammatical Evolution for Dynamic Environments , 2009, Studies in Computational Intelligence.

[22]  Mihai Oltean,et al.  Evolutionary design of Evolutionary Algorithms , 2009, Genetic Programming and Evolvable Machines.

[23]  Reha Uzsoy,et al.  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach , 2006, J. Sched..

[24]  Hugo Terashima-Marín,et al.  A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem , 2006, GECCO.

[25]  Riccardo Poli,et al.  Why Ants are Hard , 1998 .

[26]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[27]  Peter Ross,et al.  Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics , 2003, GECCO.

[28]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[29]  Graham Kendall,et al.  Providing a memory mechanism to enhance the evolutionary design of heuristics , 2010, IEEE Congress on Evolutionary Computation.

[30]  Hugo Terashima-Marín,et al.  Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems , 2005, GECCO '05.

[31]  Peter Ross,et al.  Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems , 2002, GECCO.

[32]  Hugo Terashima-Marín,et al.  Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem , 2007, GECCO '07.

[33]  Graham Kendall,et al.  Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .

[34]  Peter Ross,et al.  Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems , 2010, Ann. Oper. Res..

[35]  C. Kenyon.  Best-fit bin-packing with random order , 1996, SODA '96.

[36]  Anthony Brabazon,et al.  Grammatical Swarm: The generation of programs by social programming , 2006, Natural Computing.

[37]  Graham Kendall,et al.  Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one , 2007, GECCO '07.

[38]  John Baxter,et al.  Local Optima Avoidance in Depot Location , 1981 .

[39]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[40]  Roland Olsson,et al.  Inductive Functional Programming Using Incremental Program Transformation , 1995, Artif. Intell..

[41]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[42]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[43]  Nhu Binh Ho,et al.  Evolving dispatching rules for solving the flexible job-shop problem , 2005, 2005 IEEE Congress on Evolutionary Computation.