Improving Genetic Algorithms with Solution Space Partitioning and Evolution Refinements

Irregular sum problem (ISP) is an issue resulted from mathematical problems and graph theories. It has the characteristic that when the problem size is getting bigger, the space of the solution is also become larger. Therefore, while searching for the feasible solution, the larger the question the harder the attempt to come up with an efficient search. We propose a new genetic algorithm, called the Incremental Improving Genetic Algorithm (IIGA), which is considered efficient and has the capability to incrementally improve itself from partial solutions. The initial solutions can be constructed by satisfying the constraints in stepwise fashion. The effectiveness of IIGA also comes from the allowing of suitable percentage of illegal solutions during the evolution for increasing the effectiveness of searching. The cut-point of the genetic coding for generating the descendants has carefully planned so that the algorithm can focus on the key factors for the contradiction and has the chances to fix it. After comparing the results of IIGA and usual genetic algorithm among different graphs, we found and shown that the performance of IIGA is truly better.

[1]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[2]  Felix Lazebnik,et al.  On the number of irregular assignments on a graph , 1991, Discret. Math..

[3]  Hitoshi Iima,et al.  Application of genetic algorithm to a large-scale scheduling problem for a metal mold assembly process , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[4]  L. Darrell Whitley,et al.  An overview of evolutionary algorithms: practical issues and common pitfalls , 2001, Inf. Softw. Technol..

[5]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[6]  Stephen F. Smith,et al.  Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling) , 1999, GECCO.

[7]  Paul Erdös,et al.  Highly irregular graphs , 1987, J. Graph Theory.

[8]  Eberhard Triesch,et al.  Irregular Assignments of Trees and Forests , 1990, SIAM J. Discret. Math..

[9]  Alan M. Frieze,et al.  On graph irregularity strength , 2002, J. Graph Theory.

[10]  Richard H. Schelp,et al.  Irregular networks, regular graphs and integer matrices with distinct row and column sums , 1989, Discret. Math..

[11]  András Gyárfás.  The irregularity strength of Km, m is 4 for odd m , 1988, Discret. Math..

[12]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[13]  Tom Bohman,et al.  On the irregularity strength of trees , 2004, J. Graph Theory.

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[16]  Denise Amar.  Irregularity strength of regular graphs of large degree , 1993, Discret. Math..

[17]  Anita C. Burris.  The irregular coloring number of a tree , 1995, Discret. Math..

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .