A naive genetic approach for non-stationary constrained problems

An algorithm to be effective for solving non-stationary problems should be robust, adaptive to the changing environment and efficient. Genetic algorithms (GAs) are increasingly being used to solve non-stationary problems. We use GA with a new approach of gene induction (Bhatia and Basu in Soft Comput 8(1):1–9, 2003) to solve non-stationary constrained problems. The approach combines high value genes to form chromosomes from the initial population itself. The efficacy of the method is demonstrated on non-stationary versions of 0/1 knapsack and pure-integer programming problems. The results obtained with the approach are compared with those obtained with feedback thermodynamical genetic algorithm (FTDGA) (Mori et al. in 5th parallel problem solving from nature, number 1498 in LNCS, pp 149–157, 1998). It shows that gene-induction approach is more accurate and requires less time compared to the FTDGA.

[1]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

[2]  Hajime Kita,et al.  Adaptation to Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm , 1997, ICGA.

[3]  Katja Verbeeck,et al.  A “Futurist” approach to dynamic environments , 2000 .

[4]  Ronald L. Rardin,et al.  Development of a Parametric Generating Procedure for Integer Programming Test Problems , 1977, JACM.

[5]  Hajime Kita,et al.  Adaptation to a Changing Environment by Means of the Thermodynamical Genetic Algorithm , 1999 .

[6]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[7]  Edwin R. Hancock,et al.  Empirical Modelling of Genetic Algorithms , 2001, Evolutionary Computation.

[8]  A. K. Bhatia,et al.  Tackling 0/1 knapsack problem with gene induction , 2003, Soft Comput..

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[10]  Christopher R. Stephens,et al.  Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.

[11]  Ellis Horowitz,et al.  Computer Algorithms / C++ , 2007 .

[12]  Hajime Kita,et al.  Adaptation to a Changing Environment by Means of the Feedback Thermodynamical Genetic Algorithm , 1996, PPSN.

[13]  S. Tsutsui,et al.  Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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

[15]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[16]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[17]  Kenneth de Jong,et al.  The behavior of spatially distributed evolutionary algorithms in non-stationary environments , 1999 .

[18]  Anabela Simões,et al.  Using Genetic Algorithms to Deal with Dynamic Environments : A Comparative Study of Several Approaches Based on Promoting Diversity , 2002 .

[19]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[20]  M. Chowdhury,et al.  Benchmarks for testing evolutionary algorithms , 1998 .

[21]  Dipankar Dasgupta,et al.  Nonstationary Function Optimization using the Structured Genetic Algorithm , 1992, PPSN.

[22]  Jrgen Branke,et al.  Evolutionary approaches to dynamic optimization problems , 2001 .