An evolutionary algorithm for finding optimisation sequences: proposal and experiments

Abstract

Evolutionary algorithms are metaheuristics for solving combinatorial and optimisation problems. A combinatorial problem, important in the context of software development, consists of selecting code transformations that must be utilised by the compiler while generating the target code. The objective of this paper is to propose and evaluate an evolutionary algorithm that is capable of finding an efficient sequence of optimising transformations, which will be used while generating the target code. The results indicate that it is efficient to find good transformation sequences, and a good option to generate databases for machine learning systems.