An analysis of the interface between evolutionary algorithm operators and problem features for water resources problems. A case study in water distribution network design

Open Access articleEvolutionary Algorithms (EAs) have been widely employed to solve water resources problems for nearly two decades with much success. However, recent research in hyperheuristics has raised the possibility of developing optimisers that adapt to the characteristics of the problem being solved. In order to select appropriate operators for such optimisers it is necessary to first understand the interaction between operator and problem. This paper explores the concept of EA operator behaviour in real world applications through the empirical study of performance using water distribution networks (WDN) as a case study. Artificial networks are created to embody specific WDN features which are then used to evaluate the impact of network features on operator performance. The method extracts key attributes of the problem which are encapsulated in the natural features of a WDN, such as topologies and assets, on which different EA operators can be tested. The method is demonstrated using small exemplar networks designed specifically so that they isolate individual features. A set of operators are tested on these artificial networks and their behaviour characterised. This process provides a systematic and quantitative approach to establishing detailed information about an algorithm's suitability to optimise certain types of problem. The experiment is then repeated on real-world inspired networks and the results are shown to fit with the expected results.Engineering and Physical Sciences Research Council (EPSRC

On the role of metaheuristic optimization in bioinformatics

Metaheuristic algorithms are employed to solve complex and large-scale optimization problems in many different fields, from transportation and smart cities to finance. This paper discusses how metaheuristic algorithms are being applied to solve different optimization problems in the area of bioinformatics. While the text provides references to many optimization problems in the area, it focuses on those that have attracted more interest from the optimization community. Among the problems analyzed, the paper discusses in more detail the molecular docking problem, the protein structure prediction, phylogenetic inference, and different string problems. In addition, references to other relevant optimization problems are also given, including those related to medical imaging or gene selection for classification. From the previous analysis, the paper generates insights on research opportunities for the Operations Research and Computer Science communities in the field of bioinformatics

Two-Objective Design of Benchmark Problems of a Water Distribution System via MOEAs: Towards the Best-Known Approximation of the True Pareto Front

Copyright © 2015 American Society of Civil EngineersVarious multiobjective evolutionary algorithms (MOEAs) have been applied to solve the optimal design problems of a water distribution system (WDS). Such methods are able to find the near-optimal trade-off between cost and performance benefit in a single run. Previously published work used a number of small benchmark networks and/or a few large, real-world networks to test MOEAs on design problems of WDS. A few studies also focused on the comparison of different MOEAs given a limited computational budget. However, no consistent attempt has been made before to investigate and report the best-known approximation of the true Pareto front (PF) for a set of benchmark problems, and thus there is not a single point of reference. This paper applied 5 state-of-the-art MOEAs, with minimum time invested in parameterization (i.e., using the recommended settings), to 12 design problems collected from the literature. Three different population sizes were implemented for each MOEA with respect to the scale of each problem. The true PFs for small problems and the best-known PFs for the other problems were obtained. Five MOEAs were complementary to each other on various problems, which implies that no one method was completely superior to the others. The nondominated sorting genetic algorithm-II (NSGA-II), with minimum parameters tuning, remains a good choice as it showed generally the best achievements across all the problems. In addition, a small population size can be used for small and medium problems (in terms of the number of decision variables). However, for intermediate and large problems, different sizes and random seeds are recommended to ensure a wider PF. The publicly available best-known PFs obtained from this work are a good starting point for researchers to test new algorithms and methodologies for WDS analysis

Augmented Evolutionary Intelligence: Combining Human and Evolutionary Design for Water Distribution Network Optimisation

This is the author accepted manuscript. The final version is available from ACM via the DOI in this recordEvolutionary Algorithms (EAs) have been employed for the optimisation of both theoretical and real-world problems for decades. These methods although capable of producing near-optimal solutions, often fail to meet real-world application requirements due to considerations which are hard to define in an objective function. One solution is to employ an Interactive Evolutionary Algorithm (IEA), involving an expert human practitioner in the optimisation process to help guide the algorithm to a solution more suited to real-world implementation. This approach requires the practitioner to make thousands of decisions during an optimisation, potentially leading to user fatigue and diminishing the algorithm’s search ability. This work proposes a method for capturing engineering expertise through machine learning techniques and integrating the resultant heuristic into an EA through its mutation operator. The human-derived heuristic based mutation is assessed on a range of water distribution network design problems from the literature and shown to often outperform traditional EA approaches. These developments open up the potential for more effective interaction between human expert and evolutionary techniques and with potential application to a much larger and diverse set of problems beyond the field of water systems engineering.Engineering and Physical Sciences Research Council (EPSRC

Multiple-objective sensor management and optimisation

One of the key challenges associated with exploiting modern Autonomous Vehicle technology for military surveillance tasks is the development of Sensor Management strategies which maximise the performance of the on-board Data-Fusion systems. The focus of this thesis is the development of Sensor Management algorithms which aim to optimise target tracking processes. Three principal theoretical and analytical contributions are presented which are related to the manner in which such problems are formulated and subsequently solved.Firstly, the trade-offs between optimising target tracking and other system-level objectives relating to expected operating lifetime are explored in an autonomous ground sensor scenario. This is achieved by modelling the observer trajectory control design as a probabilistic, information-theoretic, multiple-objective optimisation problem. This novel approach explores the relationships between the changes in sensor-target geometry that are induced by tracking performance measures and those relating to power consumption. This culminates in a novel observer trajectory control algorithm based onthe minimax approach.The second contribution is an analysis of the propagation of error through a limited-lookahead sensor control feedback loop. In the last decade, it has been shown that the use of such non-myopic (multiple-step) planning strategies can lead to superior performance in many Sensor Management scenarios. However, relatively little is known about the performance of strategies which use different horizon lengths. It is shown that, in the general case, planning performance is a function of the length of the horizon over which the optimisation is performed. While increasing the horizon maximises the chances of achieving global optimality, by revealing information about the substructureof the decision space, it also increases the impact of any prediction error, approximations, or unforeseen risk present within the scenario. These competing mechanisms aredemonstrated using an example tracking problem. This provides the motivation for a novel sensor control methodology that employs an adaptive length optimisation horizon. A route to selecting the optimal horizon size is proposed, based on a new non-myopic risk equilibrium which identifies the point where the two competing mechanisms are balanced.The third area of contribution concerns the development of a number of novel optimisation algorithms aimed at solving the resulting sequential decision making problems. These problems are typically solved using stochastic search methods such as Genetic Algorithms or Simulated Annealing. The techniques presented in this thesis are extensions of the recently proposed Repeated Weighted Boosting Search algorithm. In its originalform, it is only applicable to continuous, single-objective, ptimisation problems. The extensions facilitate application to mixed search spaces and Pareto multiple-objective problems. The resulting algorithms have performance comparable with Genetic Algorithm variants, and offer a number of advantages such as ease of implementation and limited tuning requirements

Efficient Learning Machines

Computer scienc

Multiobjective optimisation of heat exchangers using evolutionary algorithms

This study is about optimal design of shell and tube heat exchangers using state of the art evolutionary algorithms. The research introduces a novel hybrid objective function which its optimisation leads to new design solutions not previously found by traditional techniques.<br /

A deterministic method for the multiobjective optimization of electromagnetic devices and its application to pose detection for magnetic-assisted medical applications

In this work we present a Pattern Search optimizer, which being a deterministic method enjoys provable convergence properties. Furthermore, we develop alternatives and extensions of the standard deterministic method, and innovative hybrid algorithms merging the the Pattern Search with some stochastic approaches. Finally, we apply this method to a real case problem for the pose detection for magnetic-assisted medical applications in order to optimize the performance of the devic