On the Benefits and Risks of Using Fitness Sharing for Multimodal Optimisation

Fitness sharing is a well-known diversity mechanism inspired by the idea that individuals in the population that are close to each other have to share their fitnesses in a similar way to how species in nature occupying the same ecological environment have to share resources. Thus, by derating the fitness of close individuals one hopes to encourage the population to spread out more. Previous runtime analyses of fitness sharing studied a variant where selection was based on populations instead of individuals. We study the conventional fitness sharing mechanism based on individuals and use runtime analysis to highlight its benefits and dangers on the well-known bimodal test problem TwoMax, where diversity is crucial for finding both optima. In contrast to population-based sharing, a (2+1) evolutionary algorithm (EA) with conventional fitness sharing does not guarantee to find both optima in polynomial time even when problem specific knowledge is used to estimate the distance between individuals; however, a () EA with always succeeds in expected polynomial time. We further show theoretically and empirically that large offspring populations in () EA s can be detrimental as creating too many offspring in one particular area of the search space can make all individuals in this area go extinct. We conclude the paper with an empirical study indicating that similar conclusions may be drawn when using the genotypic distance that has to be relied upon when no problem specific knowledge is available

When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not

Selection hyper-heuristics (HHs) are automated algorithm selection methodologies that choose between different heuristics during the optimisation process. Recently, selection HHs choosing between a collection of elitist randomised local search heuristics with different neighbourhood sizes have been shown to optimise standard unimodal benchmark functions from evolutionary computation in the optimal expected runtime achievable with the available low-level heuristics. In this paper, we extend our understanding of the performance of HHs to the domain of multimodal optimisation by considering a Move Acceptance HH (MAHH) from the literature that can switch between elitist and non-elitist heuristics during the run. In essence, MAHH is a non-elitist search heuristic that differs from other search heuristics in the source of non-elitism. We first identify the range of parameters that allow MAHH to hillclimb efficiently and prove that it can optimise the standard hillclimbing benchmark function OneMax in the best expected asymptotic time achievable by unbiased mutation-based randomised search heuristics. Afterwards, we use standard multimodal benchmark functions to highlight function characteristics where MAHH outperforms elitist evolutionary algorithms and the well-known Metropolis non-elitist algorithm by quickly escaping local optima, and ones where it does not. Since MAHH is essentially a non-elitist random local search heuristic, the paper is of independent interest to researchers in the fields of artificial intelligence and randomised search heuristics

Dynamic simulation driven design and management of production facilities in agricultural/food industry

An industrial plant in the agro-food sector can be considered a complex system as it is composed of numerous types of machines and it is characterized by a strong variation (seasonality) in the agricultural production. Whenever the dynamic behavior of the plants during operation is considered, system and design complexities increase. Reliable operation of food processing farms is primarily dependent on perfect balance between variable supply and product storage at each given time. To date, the classical modus operandi of food processing management systems is carried out under stationary and average conditions. Moreover, most of the systems installed for agricultural and food industries are sized using average production data. This often results in a mismatch between the actual operation and the expected operation. Consequently, the system is not optimized for the needs of a specific company. Also, the system is not flexible to the evolution that the production process could possibly have in the future. Promising techniques useful to solve the above-described problems could possibly be borrowed from demand side management (DSM) in smart grid systems. Such techniques allow customers to make dynamically informed decisions regarding their energy demand and help the energy providers in reducing the peak load demand and reshape the load profile. DSM is successfully used to improve the energy management system and we conjecture that DSM could be suitably adapted to food processing management. In this paper we describe how DSM could be exploited in the intelligent management of production facilities serving agricultural and food industry. The main objective is, indeed, to present how methods for modelling and implementing the dynamic simulation used for the optimization of the energy management in smart grid systems can be applied to a fruit and vegetables processing plant through a suitable adaptation

When is it Beneficial to Reject Improvements?

We investigate two popular trajectory-based algorithms from biology and physics to answer a question of general significance: when is it beneficial to reject improvements? A distinguishing factor of SSWM (Strong Selection Weak Mutation), a popular model from population genetics, compared to the Metropolis algorithm (MA), is that the former can reject improvements, while the latter always accepts them. We investigate when one strategy outperforms the other. Since we prove that both algorithms converge to the same stationary distribution, we concentrate on identifying a class of functions inducing large mixing times, where the algorithms will outperform each other over a long period of time. The outcome of the analysis is the definition of a function where SSWM is efficient, while Metropolis requires at least exponential time