CoDE Publications CoDE Publications
IRIDIA Publications IRIDIA Publications
SMG Publications
WIT Publications
WIT Publications
SMG Publications
Home People Research Activities Publications Teaching Resources
By Class By Topic By Year Technical Reports
By Class By Topic By Year Technical Reports
login
Y. Borenstein and C. Philemotte. Preprocessing Fitness Functions. Technical Report TR/IRIDIA/2008-003, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium, January 2008.

Abstract

Genetic algorithms, Evolutionary strategies and many variants of local search algorithms are being applied directly on a fitness function. Such direct search algorithms require minimal knowledge of a problem and can be applied to a wide variety of different domains. This paper suggests to apply a simple mapping on the fitness function – which we refer to as a “preprocessing” step. Any direct search algorithm is then applied on the modified function. We demonstrate empirically that our method, when applied to the Maximum Satisfiability Problem (MAXSAT) and Travelling Salesman Problem (TSP), improves the performance of a (1+1) EA.


Updated: 2017-03-27