Towards the design of heuristics by means of self-assembly

Terrazas, German; Landa-Silva, Dario; Krasnogor, Natalio

Abstract

The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. 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 strategy. 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 alternative based on self-assembly construction processes, in which structures emerge out of local interactions 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.

Citation

Terrazas, G., Landa-Silva, D., & Krasnogor, N. (2010). Towards the design of heuristics by means of self-assembly.

• Conference Name: Developments in Computational Models (DCM 2010)
• End Date: Jul 10, 2010
• Acceptance Date: Jun 15, 2010
• Publication Date: Jul 1, 2010
• Deposit Date: Aug 1, 2016
• Publicly Available Date: Aug 1, 2016
• Peer Reviewed: Peer Reviewed
• Keywords: hyperheuristics, cooperative heuristics, heuristics metaheuristics,
• Public URL: https://nottingham-repository.worktribe.com/output/1011932
• Publisher URL: http://arxiv.org/abs/1006.1681v1
• Related Public URLs: http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCM2010.13
• Additional Information: In: Vol. 26 of Electronic Proceedings in Theoretical Computer Science (EPTCS). doi: 10.4204/EPTCS.26.13
• Contract Date: Aug 1, 2016