Genetic programming (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 high-fitness 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. This unique overview of this exciting technique is written by three of the most active scientists in GP. See www.gp-field-guide.org.uk for more information on the book.

/pdf/a-field-guide-to-genetic-programming-3wkkmsw81n.pdf

A Field Guide to Genetic Programming

Particle swarm optimization (PSO) is a population-based stochastic optimization algorithm motivated by intelligent collective behavior of some animals such as flocks of birds or schools of fish. Since presented in 1995, it has experienced a multitude of enhancements. As researchers have learned about the technique, they derived new versions aiming to different demands, developed new applications in a host of areas, published theoretical studies of the effects of the various parameters and proposed many variants of the algorithm. This paper introduces its origin and background and carries out the theory analysis of the PSO. Then, we analyze its present situation of research and application in algorithm structure, parameter selection, topology structure, discrete PSO algorithm and parallel PSO algorithm, multi-objective optimization PSO and its engineering applications. Finally, the existing problems are analyzed and future research directions are presented.

Particle swarm optimization algorithm: an overview

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies. The term hyper-heuristic is relatively new; it was first used in 2000 to describe heuristics to choose heuristics in the context of combinatorial optimisation. However, the idea of automating the design of heuristics is not new; it can be traced back to the 1960s. The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Two main hyper-heuristic categories can be considered: heuristic selection and heuristic generation. The distinguishing feature of hyper-heuristics is that they operate on a search space of heuristics (or heuristic components) rather than directly on the search space of solutions to the underlying problem that is being addressed. This paper presents a critical discussion of the scientific literature on hyper-heuristics including their origin and intellectual roots, a detailed account of the main types of approaches, and an overview of some related areas. Current research trends and directions for future research are also discussed.

/pdf/hyper-heuristics-a-survey-of-the-state-of-the-art-mwp7dhxfb3.pdf

Hyper-heuristics: a survey of the state of the art

Every organisation from the scale of whole countries down to small companies has a list of system developments which have ended in various forms of disaster. The nature of the failures varies but typical examples are: cost overruns; timescale overruns and sometimes, loss of life. The post-mortems to these systems reveal a wide range of reasons all the way from hardware failures, through software errors right to major system level mistakes. More importantly a large number of these systems share one attribute: complexity. This paper presents a fresh look at the nature of complexity in the building of computer based systems.

http://ieeexplore.ieee.org/iel3/4458/12639/00581896.pdf

Complex systems

ONAG, as the book is commonly known, is one of those rare publications that sprang to life in a moment of creative energy and has remained influential for over a quarter of a century. Originally written to define the relation between the theories of transfinite numbers and mathematical games, the resulting work is a mathematically sophisticated but eminently enjoyable guide to game theory. By defining numbers as the strengths of positions in certain games, the author arrives at a new class, the surreal numbers, that includes both real numbers and ordinal numbers. These surreal numbers are applied in the author's mathematical analysis of game strategies. The additions to the Second Edition present recent developments in the area of mathematical game theory, with a concentration on surreal numbers and the additive theory of partizan games.

On numbers and games, by J. H. Conway. Pp ix, 238. £6·50. 1976. SBN 0 12 186350 6 (Academic Press)

In this paper we introduce a new, high-quality, dataset of images containing fruits. We also present the results of some numerical experiment for training a neural network to detect fruits. We discuss the reason why we chose to use fruits in this project by proposing a few applications that could use this kind of neural network.

/pdf/fruit-recognition-from-images-using-deep-learning-979t369vwa.pdf

Fruit Recognition from Images Using Deep Learning

A comparison between four Genetic Programming techniques is presented in this paper. The compared methods are Multi-Expression Programming, Gene Expression Programming, Grammatical Evolution, and Linear Genetic Programming. The comparison includes all aspects of the considered evolutionary algorithms: individual representation, fitness assignment, genetic operators, and evolutionary scheme. Several numerical experiments using five benchmarking problems are carried out. Two test problems are taken from PROBEN1 and contain real-world data. The results reveal that Multi-Expression Programming has the best overall behavior for the considered test problems, closely followed by Linear Genetic Programming.

A Comparison of Several Linear Genetic Programming Techniques

A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

Evolving Evolutionary Algorithms Using Linear Genetic Programming

Finding the optimal parameter setting (i.e. the optimal population size, the optimal mutation probability, the optimal evolutionary model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead of evolving only the parameters of the algorithm we will evolve an entire EA capable of solving a particular problem. For this purpose the Multi Expression Programming (MEP) technique is used. Each MEP chromosome will encode multiple EAs. An nongenerational EA for function optimization is evolved in this paper. Numerical experiments show the effectiveness of this approach.

Mihai Oltean

Papers

Fruit Recognition from Images Using Deep Learning

A Comparison of Several Linear Genetic Programming Techniques

Evolving Evolutionary Algorithms Using Linear Genetic Programming

Evolving Evolutionary Algorithms Using Multi Expression Programming

Fruit Recognition from Images Using Deep Learning