Article ID: | iaor2009612 |
Country: | Poland |
Volume: | 29 |
Issue: | 4 |
Start Page Number: | 1031 |
End Page Number: | 1042 |
Publication Date: | Jan 2000 |
Journal: | Control and Cybernetics |
Authors: | Kie P., Kosiski W. |
Keywords: | heuristics |
The general problem of an offline parameter tuning in the Binary Genetic Algorithm (BGA) is introduced. An example of such a tuning: a class of Correlational Tuning Methods (CTMs) is proposed. The main idea of a CTM is that it uses a mapping, called measurement function, as an assessment of the BGA's efficiency. An example of a measurement function is described and two examples of CTMs: a modified ‘trial and error’ method and a modified genetic meta-algoritm (metaBGA) are shown. Finally, experimental results with the metaBGA for four kinds of test fitness functions, where the code permutation is the tuned parameter, are presented.