Towards the Design of Heuristics by Means of Self-Assembly

The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate he uristics. In the latter, the goal is to develop a problem-domain independent strategy to automatically generate a good performing heuristic for the problem at hand. This can be done, for example, by automatically selecting and combining different low-level heuristics into a problem specific and effective s trategy. Hyper-heuristics raise the level of generality on automated problem solving by attempting to select and/or generate tailored heuristics for the problem at hand. Some approaches like genetic programming have been proposed for this. In this paper, we explore an elegant nature-inspired alternat ive based on self-assembly construction processes, in which structures emerge out of local interaction s between autonomous components. This idea arises from previous works in which computational models of self-assembly were subject to evolutionary design in order to perform the automatic construction of user-defined structures. Then, the aim of this paper is to present a novel methodology for the automated design of heuristics by means of self-assembly.

[1]  Janez Brest.  A Heuristic for the Asymmetric Traveling Salesman Problem , 2005 .

[2]  Yuriy Brun.  Reducing tileset size: 3-SAT and beyond , 2008 .

[3]  Ender Özcan,et al.  A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..

[4]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[5]  Dumitru Dumitrescu,et al.  Evolving TSP Heuristics Using Multi Expression Programming , 2004, International Conference on Computational Science.

[6]  Zbigniew Michalewicz,et al.  Inver-over Operator for the TSP , 1998, PPSN.

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

[8]  Peter I. Cowling,et al.  Hyperheuristics for managing a large collection of low level heuristics to schedule personnel , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

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

[13]  E. Winfree.  Simulations of Computing by Self-Assembly , 1998 .

[14]  Riccardo Poli,et al.  A GP-based hyper-heuristic framework for evolving 3-SAT heuristics , 2007, GECCO '07.

[15]  Wolfgang Banzhaf,et al.  A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem , 2009, Eur. J. Oper. Res..

[16]  Riccardo Poli,et al.  There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists , 2009, EuroGP.

[17]  Ender Özcan,et al.  Hill Climbers and Mutational Heuristics in Hyperheuristics , 2006, PPSN.

[18]  Jim Smith,et al.  Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective , 2008, J. Math. Model. Algorithms.

[19]  Peter I. Cowling,et al.  Hyperheuristics: Recent Developments , 2008, Adaptive and Multilevel Metaheuristics.

[20]  Yuriy Brun.  Solving NP-complete problems in the tile assembly model , 2008, Theor. Comput. Sci..

[21]  German Terrazas Angulo,et al.  Automated evolutionary design of self-assembly and self-organising systems , 2009 .

[22]  Yuriy Brun.  Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time , 2007, DNA.

[23]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[24]  Gilbert Laporte,et al.  Improvements to the Or-opt heuristic for the symmetric travelling salesman problem , 2007, J. Oper. Res. Soc..

[25]  L. Li,et al.  Automated Self-Assembly Programming Paradigm: Initial Investigations , 2006, Third IEEE International Workshop on Engineering of Autonomic & Autonomous Systems (EASE'06).

[26]  Graham Kendall,et al.  Evolving tiles for automated self-assembly design , 2007, 2007 IEEE Congress on Evolutionary Computation.

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