Ga based on the UV-structure Hypothesis and its Application to JSP

Abstract

Genetic Algorithms(GAs) are effective approximation algorithms which focus on “hopeful area” in searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the “ UV-phenomenon”, and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. We propose Innately Split Model(ISM) as a new GA model which can avoid the UV-phenomenon. We apply ISM to Job-shop Scheduling Problem (JSP), which is considered as one of globally multimodal and UV-structural problems. It is shown that ISM surpasses all famous approximation algorithms applied to JSP. © Springer-Verlag Berlin Heidelberg 2000.