A Field Guide to Genetic Programming

xiv, 233 p. : il. ; 23 cm.Libro ElectrónicoA Field Guide to Genetic Programming (ISBN 978-1-4092-0073-4) is an introduction to genetic programming (GP). GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. The authorsIntroduction -- Representation, initialisation and operators in Tree-based GP -- Getting ready to run genetic programming -- Example genetic programming run -- Alternative initialisations and operators in Tree-based GP -- Modular, grammatical and developmental Tree-based GP -- Linear and graph genetic programming -- Probalistic genetic programming -- Multi-objective genetic programming -- Fast and distributed genetic programming -- GP theory and its applications -- Applications -- Troubleshooting GP -- Conclusions.Contents xi 1 Introduction 1.1 Genetic Programming in a Nutshell 1.2 Getting Started 1.3 Prerequisites 1.4 Overview of this Field Guide I Basics 2 Representation, Initialisation and GP 2.1 Representation 2.2 Initialising the Population 2.3 Selection 2.4 Recombination and Mutation Operators in Tree-based 3 Getting Ready to Run Genetic Programming 19 3.1 Step 1: Terminal Set 19 3.2 Step 2: Function Set 20 3.2.1 Closure 21 3.2.2 Sufficiency 23 3.2.3 Evolving Structures other than Programs 23 3.3 Step 3: Fitness Function 24 3.4 Step 4: GP Parameters 26 3.5 Step 5: Termination and solution designation 27 4 Example Genetic Programming Run 4.1 Preparatory Steps 29 4.2 Step-by-Step Sample Run 31 4.2.1 Initialisation 31 4.2.2 Fitness Evaluation Selection, Crossover and Mutation Termination and Solution Designation Advanced Genetic Programming 5 Alternative Initialisations and Operators in 5.1 Constructing the Initial Population 5.1.1 Uniform Initialisation 5.1.2 Initialisation may Affect Bloat 5.1.3 Seeding 5.2 GP Mutation 5.2.1 Is Mutation Necessary? 5.2.2 Mutation Cookbook 5.3 GP Crossover 5.4 Other Techniques 32 5.5 Tree-based GP 39 6 Modular, Grammatical and Developmental Tree-based GP 47 6.1 Evolving Modular and Hierarchical Structures 47 6.1.1 Automatically Defined Functions 48 6.1.2 Program Architecture and Architecture-Altering 50 6.2 Constraining Structures 51 6.2.1 Enforcing Particular Structures 52 6.2.2 Strongly Typed GP 52 6.2.3 Grammar-based Constraints 53 6.2.4 Constraints and Bias 55 6.3 Developmental Genetic Programming 57 6.4 Strongly Typed Autoconstructive GP with PushGP 59 7 Linear and Graph Genetic Programming 61 7.1 Linear Genetic Programming 61 7.1.1 Motivations 61 7.1.2 Linear GP Representations 62 7.1.3 Linear GP Operators 64 7.2 Graph-Based Genetic Programming 65 7.2.1 Parallel Distributed GP (PDGP) 65 7.2.2 PADO 67 7.2.3 Cartesian GP 67 7.2.4 Evolving Parallel Programs using Indirect Encodings 68 8 Probabilistic Genetic Programming 8.1 Estimation of Distribution Algorithms 69 8.2 Pure EDA GP 71 8.3 Mixing Grammars and Probabilities 74 9 Multi-objective Genetic Programming 75 9.1 Combining Multiple Objectives into a Scalar Fitness Function 75 9.2 Keeping the Objectives Separate 76 9.2.1 Multi-objective Bloat and Complexity Control 77 9.2.2 Other Objectives 78 9.2.3 Non-Pareto Criteria 80 9.3 Multiple Objectives via Dynamic and Staged Fitness Functions 80 9.4 Multi-objective Optimisation via Operator Bias 81 10 Fast and Distributed Genetic Programming 83 10.1 Reducing Fitness Evaluations/Increasing their Effectiveness 83 10.2 Reducing Cost of Fitness with Caches 86 10.3 Parallel and Distributed GP are Not Equivalent 88 10.4 Running GP on Parallel Hardware 89 10.4.1 Master–slave GP 89 10.4.2 GP Running on GPUs 90 10.4.3 GP on FPGAs 92 10.4.4 Sub-machine-code GP 93 10.5 Geographically Distributed GP 93 11 GP Theory and its Applications 97 11.1 Mathematical Models 98 11.2 Search Spaces 99 11.3 Bloat 101 11.3.1 Bloat in Theory 101 11.3.2 Bloat Control in Practice 104 III Practical Genetic Programming 12 Applications 12.1 Where GP has Done Well 12.2 Curve Fitting, Data Modelling and Symbolic Regression 12.3 Human Competitive Results – the Humies 12.4 Image and Signal Processing 12.5 Financial Trading, Time Series, and Economic Modelling 12.6 Industrial Process Control 12.7 Medicine, Biology and Bioinformatics 12.8 GP to Create Searchers and Solvers – Hyper-heuristics xiii 12.9 Entertainment and Computer Games 127 12.10The Arts 127 12.11Compression 128 13 Troubleshooting GP 13.1 Is there a Bug in the Code? 13.2 Can you Trust your Results? 13.3 There are No Silver Bullets 13.4 Small Changes can have Big Effects 13.5 Big Changes can have No Effect 13.6 Study your Populations 13.7 Encourage Diversity 13.8 Embrace Approximation 13.9 Control Bloat 13.10 Checkpoint Results 13.11 Report Well 13.12 Convince your Customers 14 Conclusions Tricks of the Trade A Resources A.1 Key Books A.2 Key Journals A.3 Key International Meetings A.4 GP Implementations A.5 On-Line Resources 145 B TinyGP 151 B.1 Overview of TinyGP 151 B.2 Input Data Files for TinyGP 153 B.3 Source Code 154 B.4 Compiling and Running TinyGP 162 Bibliography 167 Inde

Cyber-Physical Systems for Micro-/Nano-assembly Operations: a Survey

Abstract Purpose of Review Latest requirements of the global market force manufacturing systems to a change for a new production paradigm (Industry 4.0). Cyber-Physical Systems (CPS) appear as a solution to be deployed in different manufacturing fields, especially those with high added value and technological complexity, high product variants, and short time to market. In this sense, this paper aims at reviewing the introduction level of CPS technologies in micro/nano-manufacturing and how these technologies could cope with these challenging manufacturing requirements. Recent Findings The introduction of CPS is still in its infancy on many industrial applications, but it actually demonstrates its potential to support future manufacturing paradigm. However, only few research works in micro/nano-manufacturing considered CPS frameworks, since the concept barely appeared a decade ago. Summary Some contributions have revealed the potential of CPS technologies to improve manufacturing performance which may be scaled to the micro/nano-manufacturing. IoT-based frameworks with VR/AR technologies allow distributed and collaborative systems, or agent-based architectures with advance algorithm implementations that improve the flexibility and performance of micro-/nano-assembly operations. Future research of CPS in micro-/nano-assembly operations should be followed by more studies of its technical deployment showing its implications under other perspectives, i.e. sustainable, economic, and social point of views, to take full advance of all its features

Special Session on Industry 4.0

No abstract available

Recent developments and future trends of industrial agents

The agent technology provides a new way to design and engineer control solutions based on the decentralization of control over distributed structures, addressing the current requirements for modern control systems in industrial domains. This paper presents the current situation of the development and deployment of agent technology, discussing the initiatives and the current trends faced for a wider dissemination and industrial adoption, based on the work that is being carried out by the IEEE IES Technical Committee on Industrial Agents

High-dimensional Objective-based Data Farming

In objective-based data farming, decision variables of the Red Team are evolved using evolutionary algorithms such that a series of rigorous Red Team strategies can be generated to assess the Blue Team\u27s operational tactics. Typically, less than 10 decision variables (out of 1000+) are selected by subject matter experts (SMEs) based on their past experience and intuition. While this approach can significantly improve the computing efficiency of the data farming process, it limits the chance of discovering “surprises” and moreover, data farming may be used only to verify SMEs\u27 assumptions. A straightforward solution is simply to evolve all Red Team parameters without any SME involvement. This modification significantly increases the search space and therefore we refer to it as high-dimensional objective-based data farming (HD-OBDF). The potential benefits of HD-OBDF include: possible better performance and information about more important decision variables. In this paper, several state-of-the-art multi-objective evolutionary algorithms are applied in HD-OBDF to assess their suitability in terms of convergence speed and Pareto efficiency. Following that, we propose two approaches to identify dominant/key evolvable parameters in HD-OBDF - decision variable coverage and diversity spread

Optimizing Associative Information Transfer within Content-addressable Memory

Original article can be found at: http://www.oldcitypublishing.com/IJUC/IJUC.htmlPeer reviewe

Collaborative environment to support a professional community

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de ComputadoresRecent manufacturing roadmaps stress current production systems limitations, emphasizing social, economic and ecologic consequences for Europe of a non-evolution to sustainable Production Systems. Hence, both academic institutions and enterprises are committed to develop solutions that would endow enterprises to survive in nowadays’ extremely competitive business environment. A research effort is being carried on by the Evolvable Production Systems consortium towards attaining Production Systems that can cope with current technological, economical, ecological and social demands fulfilling recent roadmaps. Nevertheless research success depends on attaining consensus in the scientific community and therefore an accurate critical mass support is required in the whole process. The main goal of this thesis is the development of a Collaborative Environment Tool to assist Evolvable Production Systems consortium in such research efforts and to enhance Evolvable Assembly Systems paradigm dissemination. This work resulted in EASET (Evolvable Assembly Systems Environment Tool), a collaborative environment tool which promotes EAS dissemination and brings forth improvements through the raise of critical mass and collaboration between entities