Interactive One-Max Problem Allows to Compare the Performance of Interactive and Human-Based Genetic Algorithms

Abstract. Human-based genetic algorithms (HBGA) use both human evaluation and innovation to optimize a population of solutions (Ko-sorukoff, 2001). The novel contribution of HBGAs is an introduction of human-based innovation operators. However, there was no attempt to measure the effect of human-based innovation operators on the overall performance of GAs quantitatively, in particular, by comparing the per-formance of HBGAs and interactive genetic algorithms (IGA) that do not use human innovation. This paper shows that the mentioned effect is measurable and further focuses on quantitative comparison of the effi-ciency of these two classes of algorithms. In order to achieve this purpose, this paper proposes an interactive analog of the one-max problem, sug-gests human-based innovation operators appropriate for this problem, and compares convergence results of HBGA and IGA for the same pro-blem.