Transgenética computacional: uma aplicação ao problema quadrático de alocação

This paper introduces the Computational Transgenetic approach. The metaphor is based on the use of memetic pieces of information and on the extra and intracellular flows to design and accomplish genetic manipulation in the chromosomes of a given population of an evolutionary algorithm. The research develops two algorithmic approaches. The first algorithmic approach uses both the intra and extra-cellular flows to guide an evolutionary search process. The second one uses, uniquely, intracellular manipulation. Computational Transgenetic agents are presented. Properties resulting from chromosome x agent interactions, similar to the natural immunologic process, are examined. Finally, the paper reports the results of computational experiments of applying both techniques to the Quadratic Assignment Problem.

[1]  James A. Shapiro,et al.  BACTERIA AS MULTICELLULAR ORGANISMS , 1988 .

[2]  Toshio Fukuda,et al.  The role of virus infection in virus-evolutionary genetic algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[3]  Edmund Chattoe,et al.  Just How (Un)realistic are Evolutionary Algorithms as Representations of Social Processes? , 1998, J. Artif. Soc. Soc. Simul..

[4]  William F. Punch,et al.  Global search in combinatorial optimization using reinforcement learning algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[6]  R. Lewontin.  ‘The Selfish Gene’ , 1977, Nature.

[7]  J Watson,et al.  Genetic engineering. , 1985, The Lamp.

[8]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  H. Gintis,et al.  The Evolution of Strong Reciprocity , 2000 .

[10]  James R. Wilson,et al.  Empirical Investigation of the Benefits of Partial Lamarckianism , 1997, Evolutionary Computation.

[11]  N. Eldredge,et al.  Punctuated equilibrium comes of age , 1993, Nature.

[12]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[13]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[14]  Peter H. Raven,et al.  Butterflies and Plants , 1967 .

[15]  Panos M. Pardalos,et al.  Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP , 1996, TOMS.

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

[17]  Edward O. Wilson,et al.  GENES, MIND AND CULTURE , 1984 .

[18]  Elan Moritz.  Memetic Science: I-General Introduction , 1990 .

[19]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[20]  H. C. Plotkin,et al.  Non-genetic transmission of information: Candidate cognitive processes and the evolution of culture , 1995, Behavioural Processes.

[21]  Toshio Fukuda,et al.  Virus-Evolutionary Genetic Algorithm and Its Application to Traveling Salesman Problem , 1999 .

[22]  P. Raven,et al.  BUTTERFLIES AND PLANTS: A STUDY IN COEVOLUTION , 1964 .

[23]  Elizabeth Ferreira Gouvea Goldbarg,et al.  Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach , 2002, Discret. Appl. Math..

[24]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[25]  W. Punch,et al.  An approach to solving combinatorial optimization problems using a population of reinforcement learning agents , 1999 .

[26]  Patrick D. Surry,et al.  Formal Memetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.