Application of Differential Evolution algorithms to multi-objective optimization problems in mixed-oxide fuel assembly design

Multi-objective optimization of nuclear engineering fuel assembly design problems is particularly difficult due to the highly non-linear interactions of a large number of possible variables. In addition, effective optimization algorithms are often highly problem-dependent and require extensive tuning, which reduces their applicability to the real world. To address this issue, Differential Evolution (DE) algorithms have been proposed as a new and effective method for heterogeneous fuel assembly optimization design problems. This paper presents the first complete study to investigate their applicability and performance. Firstly, two multi- objective DE algorithms have their performance compared against an Evolutionary Algorithm (EA) from the literature in optimizing a CORAIL mixed-oxide (MOX) fuel assembly for maximum plutonium content and minimum power peaking factor. Statistical analysis of the results shows the DE algorithms exhibit superior performance to the EA. The DE algorithms are then used to optimize a MOX fuel assembly with gadolinia poison, with results showing DE produces assembly designs comparable in performance to those in the literature. Finally, a sensitivity study is conducted on the control parameters of the better performing of the DE algorithms. Results indicate DE performance remains consistent for a wide range of values of both control parameters, suggesting the algorithm is able to perform effectively without requiring user expertise or effort to find the ‘optimal’ control parameter settings

Development of a Multi-Objective Optimization Capability for Heterogeneous Light Water Reactor Fuel Assemblies

As pressure grows on developed nations to move away from fossil fuel-based energy sources, so does the potential for nuclear energy to make its resurgence. However, the complex nature of the design process in nuclear engineering and a regulatory culture of ever-increasing safety standards create unique challenges to the nuclear industry. As in many engineering disciplines, the question is one of trade-offs between safety, performance, cost, and time required to develop the design from paper to real life operation. The possibilities facing a designer are virtually unlimited, with fuel choice, layout and operating conditions just three of the many categories which interact with one another in a highly non-linear manner, making it difficult to quantitatively define these trade-offs. Deciding upon an ‘optimal’ design is therefore traditionally done through expert judgement and an iterative design process. Mathematical optimization methods offer a more formal way to optimize designs by employing algorithms to explore the myriad of possibilities in a methodical manner which can yield increased performance over expert designs. In this thesis, an extensive review of the literature revealed gaps which present opportunities for novel research. Two new algorithms are created with the ability to solve optimization problems with multiple objectives simultaneously without requiring weighting or bias from the designer. They are then applied to a series of problems drawn from both the literature and real world designs. The results demonstrate the algorithms’ effectiveness and robustness as well as their ability to handle complex multi-physics problems with reasonably low computational requirements. This research offers an original and effective tool for performing optimization on nuclear fuel assembly design problems and has advanced the state of the art in both multi-objective optimization and its application to the nuclear engineering industry

Differential evolution with two-level parameter adaptation

The performance of differential evolution (DE) largely depends on its mutation strategy and control parameters. In this paper, we propose an adaptive DE (ADE) algorithm with a new mutation strategy DE/lbest/1 and a two-level adaptive parameter control scheme. The DE/lbest/1 strategy is a variant of the greedy DE/best/1 strategy. However, the population is mutated under the guide of multiple locally best individuals in DE/lbest/1 instead of one globally best individual in DE/best/1. This strategy is beneficial to the balance between fast convergence and population diversity. The two-level adaptive parameter control scheme is implemented mainly in two steps. In the first step, the population-level parameters F p and CR p for the whole population are adaptively controlled according to the optimization states, namely, the exploration state and the exploitation state in each generation. These optimization states are estimated by measuring the population distribution. Then, the individual-level parameters F i and CR i for each individual are generated by adjusting the population-level parameters. The adjustment is based on considering the individual's fitness value and its distance from the globally best individual. This way, the parameters can be adapted to not only the overall state of the population but also the characteristics of different individuals. The performance of the proposed ADE is evaluated on a suite of benchmark functions. Experimental results show that ADE generally outperforms four state-of-the-art DE variants on different kinds of optimization problems. The effects of ADE components, parameter properties of ADE, search behavior of ADE, and parameter sensitivity of ADE are also studied. Finally, we investigate the capability of ADE for solving three real-world optimization problems

Multi-objective trajectory optimization of Space Maneuver Vehicle using adaptive differential evolution and modified game theory

Highly constrained trajectory optimization for Space Manoeuvre Vehicles (SMV) is a challenging problem. In practice, this problem becomes more difficult when multiple mission requirements are taken into account. Because of the nonlinearity in the dynamic model and even the objectives, it is usually hard for designers to generate a compromised trajectory without violating strict path and box constraints. In this paper, a new multi-objective SMV optimal control model is formulated and parameterized using combined shooting-collocation technique. A modified game theory approach, coupled with an adaptive differential evolution algorithm, is designed in order to generate the pareto front of the multi-objective trajectory optimization problem. In addition, to improve the quality of obtained solutions, a control logic is embedded in the framework of the proposed approach. Several existing multi-objective evolutionary algorithms are studied and compared with the proposed method. Simulation results indicate that without driving the solution out of the feasible region, the proposed method can perform better in terms of convergence ability and convergence speed than its counterparts. Moreover, the quality of the pareto set generated using the proposed method is higher than other multi-objective evolutionary algorithms, which means the newly proposed algorithm is more attractive for solving multi-criteria SMV trajectory planning problem

Optimization. An attempt at describing the State of the Art

This paper is an attempt at describing the State of the Art of the vast field of continuous optimization. We will survey deterministic and stochastic methods as well as hybrid approaches in their application to single objective and multiobjective optimization. We study the parameters of optimization algorithms and possibilities for tuning them. Finally, we discuss several methods for using approximate models for computationally expensive problems

Quantifying the Impact of Parameter Tuning on Nature-Inspired Algorithms

The problem of parameterization is often central to the effective deployment of nature-inspired algorithms. However, finding the optimal set of parameter values for a combination of problem instance and solution method is highly challenging, and few concrete guidelines exist on how and when such tuning may be performed. Previous work tends to either focus on a specific algorithm or use benchmark problems, and both of these restrictions limit the applicability of any findings. Here, we examine a number of different algorithms, and study them in a "problem agnostic" fashion (i.e., one that is not tied to specific instances) by considering their performance on fitness landscapes with varying characteristics. Using this approach, we make a number of observations on which algorithms may (or may not) benefit from tuning, and in which specific circumstances.Comment: 8 pages, 7 figures. Accepted at the European Conference on Artificial Life (ECAL) 2013, Taormina, Ital

A memetic ant colony optimization algorithm for the dynamic travelling salesman problem

Copyright @ Springer-Verlag 2010.Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they converge, they cannot adapt efficiently to environmental changes. To improve the performance of ACO on the DTSP, we investigate a hybridized ACO with local search (LS), called Memetic ACO (M-ACO) algorithm, which is based on the population-based ACO (P-ACO) framework and an adaptive inver-over operator, to solve the DTSP. Moreover, to address premature convergence, we introduce random immigrants to the population of M-ACO when identical ants are stored. The simulation experiments on a series of dynamic environments generated from a set of benchmark TSP instances show that LS is beneficial for ACO algorithms when applied on the DTSP, since it achieves better performance than other traditional ACO and P-ACO algorithms.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and Grant EP/E060722/02

Optimization of fed-batch fermentation processes with bio-inspired algorithms

The optimization of the feeding trajectories in fed-batch fermentation processes is a complex problem that has gained attention given its significant economical impact. A number of bio-inspired algorithms have approached this task with considerable success, but systematic and statistically significant comparisons of the different alternatives are still lacking. In this paper, the performance of different metaheuristics, such as Evolutionary Algorithms (EAs), Differential Evolution (DE) and Particle Swarm Optimization (PSO) is compared, resorting to several case studies taken from literature and conducting a thorough statistical validation of the results. DE obtains the best overall performance, showing a consistent ability to find good solutions and presenting a good convergence speed, with the DE/rand variants being the ones with the best performance. A freely available computational application, OptFerm, is described that provides an interface allowing users to apply the proposed methods to their own models and data.The work is partially funded by ERDF - European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness) and by National Funds through the FCT (Portuguese Foundation for Science and Technology) within projects Ref. COMPETE FCOMP-01-0124-FEDER-015079 and PEst-OE/ES/UI0752/2011

Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem

The radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.Publicad