Fundamenta Informaticae - Volume 35, issue 1-4

Authors: Angeline, Peter J.

Article Type: Research Article

Abstract: Genetic programming (Koza 1992) is a method of inducing behaviors represented as executable programs. The generality of the approach has spawned a proliferation of work in the evolution of executable structures that is unmatched in the history of the subject. This paper describes the standard approach to genetic programming, as denned in Koza (1992), and then presents the significant studies that preceded its inception as well as the diversification of techniques evolving executable structures that is currently underway in the field.

DOI: 10.3233/FI-1998-35123410

Citation: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 179-195, 1998

Authors: Boryczka, Mariusz

Article Type: Research Article

Abstract: We describe the ant systems and the application of the generative policies improving the performance of the ant systems in the context of the Travelling Salesman Problem. The generative policies are derived from the studies carried out in Germany and USA in the sixties. We study the leader (superman) and élite strategies, which have been chosen because of their analogy to the world of real ants. First, we describe three ant algorithms and we introduce a formal description of the ant system. Then we discuss the reflection of the evolutionary computing in the ant systems.

Keywords: ant systems, Travelling Salesman Problem, NP-complete problems, generative policies

DOI: 10.3233/FI-1998-35123411

Citation: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 197-209, 1998

Authors: Seredyński, Franciszek

Article Type: Research Article

Abstract: The paper overviews existing models and new tendencies observed in the current literature concerning parallel and distributed evolutionary computation. Sources of parallelism, ways of exploring it and forms of a distributed control of execution of parallel evolutionary algorithms are discussed. Some taxonomy of parallel and distributed computation is proposed. The most known or promising computational schemes are overviewed.

Keywords: evolutionary computation models, distributed algorithms, parallel algorithms, sources of parallelism, taxonomy

DOI: 10.3233/FI-1998-35123412

Citation: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 211-230, 1998

Authors: Deaton, Russell | Garzon, Max | Rose, John | Franceschetti, D.R. | Stevens, S.E.

Article Type: Research Article

Abstract: DNA computing holds out the promise of important and significant connections between computers and living systems, as well as promising massively parallel computations. Before these promises are fulfilled, however, important challenges related to errors and practicality have to be addressed. On the other hand, new directions toward a synthesis of molecular evolution and DNA computing might circumvent the problems that have hindered development, so far.

DOI: 10.3233/FI-1998-35123413

Citation: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 231-245, 1998

Authors: De Jong, Kenneth

Article Type: Research Article

Abstract: Although more than 30 years old, the field of evolutionary computation has experienced a significant growth of interest and activity in the past few years. This has resulted in fresh perspectives and a flurry of new results in both theory and applications. This paper will attempt to summarize the current state of the field and suggest promising new directions.

Keywords: Evolutionary Computation, Evolutionary Algorithms, Genetic Algorithms

DOI: 10.3233/FI-1998-35123414

Citation: Fundamenta Informaticae, vol. 35, no. 1-4, pp. 247-259, 1998