Search

'This book contains articles from the four issues of volume 2 of the International Journal of Applied Evolutionary Computation (IJAEC).'

Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.The book is self-contained and the only prerequisite is basic undergraduate mathematics. This third edition has been substantially revised and extended by three new chapters and by additional appendices containing working material to cover recent developments and a change in the perception of evolutionary computation.

The advent of powerful processing technologies and the advances in software development tools have drastically changed the approach and implementation of computational research in fundamental properties of living systems through simulating and synthesizing biological entities and processes in artificial media. Nowadays realistic physical and physiological simulation of natural and would-be creatures, worlds and societies becomes a low-cost task for ordinary home computers. The progress in technology has dramatically reshaped the structure of the software, the execution of a code, and visualization fundamentals. This has led to the emergence of novel breeds of artificial life software models, including three-dimensional programmable simulation environment, distributed discrete events platforms and multi-agent systems. This second edition reflects the technological and research advancements, and presents the best examples of artificial life software models developed in the World and available for users.

'This book provides the latest findings in nature-inspired algorithms and their applications for breakthroughs in a wide range of disciplinary fields'--Provided by publisher.

More and more, software systems involve autonomous and distributed software components that have to execute and interact in open and dynamic environments, such as in pervasive, autonomous, and mobile applications. The requirements with respect to dynamics, openness, scalability, and decentralization call for new approaches to software design and development, capable of supporting spontaneous configuration, tolerating partial failures, or arranging adaptive reorganization of the whole system. Inspired by the behaviour of complex natural systems, scientists and engineers have started to adjust their mechanisms and techniques for self-organization and adaption to changing environments. In line with these considerations, Mamei and Zambonelli propose an interaction model inspired by the way masses and particles in our universe move and self-organize according to contextual information represented by gravitational and electromagnetic fields. The key idea is to have the components'actions driven by computational force fields, generated by the components themselves or by some infrastructures, and propagated across the environment. Together with its supporting middleware infrastructure – available with additional information under http://www.agentgroup.unimore.it – this model can serve as the basis for a general purpose and widely applicable approach for the design and development of adaptive distributed applications.

Refactoring has proven its value in a wide range of development projects–helping software professionals improve system designs, maintainability, extensibility, and performance. Now, for the first time, leading agile methodologist Scott Ambler and renowned consultant Pramodkumar Sadalage introduce powerful refactoring techniques specifically designed for database systems. Ambler and Sadalage demonstrate how small changes to table structures, data, stored procedures, and triggers can significantly enhance virtually any database design–without changing semantics. You'll learn how to evolve database schemas in step with source code–and become far more effective in projects relying on iterative, agile methodologies. This comprehensive guide and reference helps you overcome the practical obstacles to refactoring real-world databases by covering every fundamental concept underlying database refactoring. Using start-to-finish examples, the authors walk you through refactoring simple standalone database applications as well as sophisticated multi-application scenarios. You'll master every task involved in refactoring database schemas, and discover best practices for deploying refactorings in even the most complex production environments. The second half of this book systematically covers five major categories of database refactorings. You'll learn how to use refactoring to enhance database structure, data quality, and referential integrity; and how to refactor both architectures and methods. This book provides an extensive set of examples built with Oracle and Java and easily adaptable for other languages, such as C#, C++, or VB.NET, and other databases, such as DB2, SQL Server, MySQL, and Sybase. Using this book's techniques and examples, you can reduce waste, rework, risk, and cost–and build database systems capable of evolving smoothly, far into the future.

Estimation of Distribution Algorithms (EDAs) are a set of algorithms in the Evolutionary Computation (EC) field characterized by the use of explicit probability distributions in optimization. Contrarily to other EC techniques such as the broadly known Genetic Algorithms (GAs) in EDAs, the crossover and mutation operators are substituted by the sampling of a distribution previously learnt from the selected individuals. EDAs have experienced a high development that has transformed them into an established discipline within the EC field. This book attracts the interest of new researchers in the EC field as well as in other optimization disciplines, and that it becomes a reference for all of us working on this topic. The twelve chapters of this book can be divided into those that endeavor to set a sound theoretical basis for EDAs, those that broaden the methodology of EDAs and finally those that have an applied objective.

Arti?cial life is an interdisciplinary?eld of science, hosting experts from c- puter science, biology, physics, chemistry, and mathematics, as well as phi- sophers and artists. It focuses on studying the phenomena of life on all levels of complexity and organization — molecular, cellular, organismic, and p- ulation. These studies not only employ conventional computers (using both software and hardware), but also take place in wetware, using techniques of biochemical laboratory. Arti?cial life research is not limited to life forms - isting on the Earth. It rather attempts to study the general principles of life which are common to all instances of life, both already recognized and yet unknown. This book is dedicated to the software medium, the most popular and widely employed in the arti?cial life research. The software medium o?ers almost unlimited abilities for experiments, which are cheap, easily arranged, and modi?ed. Additionally, such experiments canbe repeated under the same conditions, and large amounts of data (unavailable in biological studies) can be collectedfor analysis.To beginexperimentation,a modelof lifeis required. Such models are built in software for all organizational levels of life. Most of the models described in this book are very general and therefore allow for a wide range of experiments.

Memetic algorithms are evolutionary algorithms that apply a local search process to refine solutions to hard problems. Memetic algorithms are the subject of intense scientific research and have been successfully applied to a multitude of real-world problems ranging from the construction of optimal university exam timetables, to the prediction of protein structures and the optimal design of space-craft trajectories. This monograph presents a rich state-of-the-art gallery of works on memetic algorithms. Recent Advances in Memetic Algorithms is the first book that focuses on this technology as the central topical matter. This book gives a coherent, integrated view on both good practice examples and new trends including a concise and self-contained introduction to memetic algorithms. It is a necessary read for postgraduate students and researchers interested in recent advances in search and optimization technologies based on memetic algorithms, but can also be used as complement to undergraduate textbooks on artificial intelligence.

As information handling systems get more and more complex, it becomes increasingly difficult to manage them using traditional approaches based on centralized and pre-defined control mechanisms. Over recent years, there has been a significant increase in taking inspiration from biology, the physical world, chemistry, and social systems to more efficiently manage such systems - generally based on the concept of self-organisation; this gave rise to self-organising applications. This book constitutes a reference and starting point for establishing the field of engineering self-organising applications. It comprises revised and extended papers presented at the Engineering Self-Organising Applications Workshop, ESOA 2003, held at AAMAS 2003 in Melbourne, Australia, in July 2003 and selected invited papers from leading researchers in self-organisation. The book is organized in parts on applications, natural metaphors (multi-cells and genetic algorithms, stigmergy, and atoms and evolution), artificial interaction mechanisms, middleware, and methods and tools.