Incremental evolution strategy for function optimization

This paper presents a novel evolutionary approach for function optimization Incremental Evolution Strategy (IES). Two strategies are proposed. One is to evolve the input variables incrementally. The whole evolution consists of several phases and one more variable is focused in each phase. The number of phases is equal to the number of variables in maximum. Each phase is composed of two stages: in the single-variable evolution (SVE) stage, evolution is taken on one independent variable in a series of cutting planes; in the multi-variable evolving (MVE) stage, the initial population is formed by integrating the populations obtained by the SVE and the MVE in the last phase. And the evolution is taken on the incremented variable set. The other strategy is a hybrid of particle swarm optimization (PSO) and evolution strategy (ES). PSO is applied to adjust the cutting planes/hyper-planes (in SVEs/MVEs) while (1+1)-ES is applied to searching optima in the cutting planes/hyper-planes. The results of experiments show that the performance of IES is generally better than that of three other evolutionary algorithms, improved normal GA, PSO and SADE_CERAF, in the sense that IES finds solutions closer to the true optima and with more optimal objective values

Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

Which Surrogate Works for Empirical Performance Modelling? A Case Study with Differential Evolution

It is not uncommon that meta-heuristic algorithms contain some intrinsic parameters, the optimal configuration of which is crucial for achieving their peak performance. However, evaluating the effectiveness of a configuration is expensive, as it involves many costly runs of the target algorithm. Perhaps surprisingly, it is possible to build a cheap-to-evaluate surrogate that models the algorithm's empirical performance as a function of its parameters. Such surrogates constitute an important building block for understanding algorithm performance, algorithm portfolio/selection, and the automatic algorithm configuration. In principle, many off-the-shelf machine learning techniques can be used to build surrogates. In this paper, we take the differential evolution (DE) as the baseline algorithm for proof-of-concept study. Regression models are trained to model the DE's empirical performance given a parameter configuration. In particular, we evaluate and compare four popular regression algorithms both in terms of how well they predict the empirical performance with respect to a particular parameter configuration, and also how well they approximate the parameter versus the empirical performance landscapes

An efficient ant colony system based on receding horizon control for the aircraft arrival sequencing and scheduling problem

The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in air traffic control (ATC), which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS problem in the form of a permutation problem and proposes a new solution framework that makes the first attempt at using an ant colony system (ACS) algorithm based on the receding horizon control (RHC) to solve it. The resultant RHC-improved ACS algorithm for the ASS problem (termed the RHC-ACS-ASS algorithm) is robust, effective, and efficient, not only due to that the ACS algorithm has a strong global search ability and has been proven to be suitable for these kinds of NP-hard problems but also due to that the RHC technique can divide the problem with receding time windows to reduce the computational burden and enhance the solution's quality. The RHC-ACS-ASS algorithm is extensively tested on the cases from the literatures and the cases randomly generated. Comprehensive investigations are also made for the evaluation of the influences of ACS and RHC parameters on the performance of the algorithm. Moreover, the proposed algorithm is further enhanced by using a two-opt exchange heuristic local search. Experimental results verify that the proposed RHC-ACS-ASS algorithm generally outperforms ordinary ACS without using the RHC technique and genetic algorithms (GAs) in solving the ASS problems and offers high robustness, effectiveness, and efficienc