Risk minimization in biometric sensor networks: an evolutionary multi-objective optimization approach

Biometric systems aim at identifying humans by their characteristics or traits. This article addresses the problem of designing a biometric sensor management unit by optimizing the risk, which is modeled as a multi-objective optimization (MO) problem with global false acceptance rate and global false rejection rate as the two objectives. In practice, when multiple biometric sensors are used, the decision is taken locally at each sensor and the data are passed to the sensor manager. At the sensor manager, the data are fused using a fusion rule and the final decision is taken. The optimization process involves designing the data fusion rule and setting of the sensor thresholds. In this work, we employ a fuzzy dominance and decomposition-based multi-objective evolutionary algorithm (MOEA) called MOEA/DFD and compare its performance with two state-of-the-art MO algorithms: MOEA/D and NSGA-II in context to the risk minimization task. The algorithm introduces a fuzzy Pareto dominance concept to compare two solutions and uses the scalar decomposition method only when one of the solutions fails to dominate the other in terms of a fuzzy dominance level. The MO algorithms are simulated on different number of sensor setups consisting of three, six, and eight sensors. The a priori probability of imposter is also varied from 0.1 to 0.9 to verify the performance of the system with varying degrees of threat. One of the most significant advantages of using the MO framework is that with a single run, just by changing the decision-making logic applied to the obtained Pareto front, one can find the required threshold and decision strategies for varying threats of imposter. However, with single-objective optimization, one needs to run the algorithms each time with change in the threat of imposter. Thus, multi-objective formulation of the problem appears to be more useful and better than the single-objective one. In all the test instances, MOEA/DFD performs better than all the other algorithms.     

NPV-based decision support in multi-objective design using evolutionary algorithms

Optimum design problems are frequently formulated using a single excellence criterion (minimum mass or similar) with evolutionary algorithms engaged as decision-support tools. Alternatively, multi-objective formulations are used with a posteriori decision-making amongst the Pareto candidate solutions. The former typically introduces excessive simplification in the decision space and subjectivity, the latter leads to extensive numerical effort and postpones the compromise decision-making. In both cases, engineering excellence metrics such as minimum mass can be misleading in terms of performance of the respective design in the given operational environment. This paper presents an alternative approach to conceptual design where a compound objective function based on the Net Present Value (NPV) and Internal Rate of Return (IRR) aggregate performance metrics is developed. This formulation models the integral value delivered by the candidate designs over their respective life-cycles by applying value-based NPV discounting to all objectives. It can be incorporated as an a priori compromise and consequently viewed as a weighted sum of individual objectives corresponding to their economically faithful representation over the entire operational life-time of the designs. The multi-objective design optimization is consequently expanded from purely engineering terms to coupled engineering–financial decision support.     

Structure optimization of neural networks for evolutionary design optimization

We study the use of neural networks as approximate models for the fitness evaluation in evolutionary design optimization. To improve the quality of the neural network models, structure optimization of these networks is performed with respect to two different criteria: One is the commonly used approximation error with respect to all available data, and the other is the ability of the networks to learn different problems of a common class of problems fast and with high accuracy. Simulation results from turbine blade optimizations using the structurally optimized neural network models are presented to show that the performance of the models can be improved significantly through structure optimization.We would like to thank the BMBF, grant LOKI, number 01 IB 001 C, for their financial support of our research.     

Genetic diversity as an objective in multi-objective evolutionary algorithms

A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity Evaluation Method (GeDEM), which considers a distance-based measure of genetic diversity as a real objective in fitness assignment. This provides a dual selection pressure towards the exploitation of current non-dominated solutions and the exploration of the search space. We also introduce a new multi-objective evolutionary algorithm, the Genetic Diversity Evolutionary Algorithm (GDEA), strictly designed around GeDEM and then we compare it with other state-of-the-art algorithms on a well-established suite of test problems. Experimental results clearly indicate that the performance of GDEA is top-level.     

Optimal residual design for fault diagnosis using multi-objective optimization and genetic algorithms

This paper develops a new approach to the design of optimal residuals in order to diagnose incipient faults based on multi-objective optimization and genetic algorithms. In this approach the residual is generated via an observer. To reduce false and missed alarm rates in fault diagnosis, a number of performance indices are introduced into the observer design. Some performance indices are expressed in the frequency domain to take account of the frequency distributions of faults, noise and modelling uncertainties. All objectives then are reformulated into a set of inequality constraints on performance indices. A genetic algorithm is thus used to search for an optimal solution to satisfy these inequality constraints on performance indices. The approach developed is applied to a flight control system example, and simulation results show that incipient sensor faults can be detected reliably in the presence of modelling uncertainty.     

Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse

The paper presents strategies optimization for an existing automated warehouse located in a steelmaking industry. Genetic algorithms are applied to this purpose and three different popular algorithms capable to deal with multi-objective optimization are compared. The three algorithms, namely the Niched Pareto Genetic Algorithm, the Non-dominated Sorting Genetic Algorithm 2 and the Strength Pareto Genetic Algorithm 2, are described in details and the achieved results are widely discussed; moreover several statistical tests have been applied in order to evaluate the statistical significance of the obtained results.     

Runtime analysis of an evolutionary algorithm for stochastic multi-objective combinatorial optimization

For stochastic multi-objective combinatorial optimization (SMOCO) problems, the adaptive Pareto sampling (APS) framework has been proposed, which is based on sampling and on the solution of deterministic multi-objective subproblems. We show that when plugging in the well-known simple evolutionary multi-objective optimizer (SEMO) as a subprocedure into APS, ε-dominance has to be used to achieve fast convergence to the Pareto front. Two general theorems are presented indicating how runtime complexity results for APS can be derived from corresponding results for SEMO. This may be a starting point for the runtime analysis of evolutionary SMOCO algorithms.     

Design of particle-reinforced polyurethane mould materials for soft tooling process using evolutionary multi-objective optimization algorithms

Polyurethane is used for making mould in soft tooling (ST) process for producing wax/plastic components. These wax components are later used as pattern in investment casting process. Due to low thermal conductivity of polyurethane, cooling time in ST process is long. To reduce the cooling time, thermal conductive fillers are incorporated into polyurethane to make composite mould material. However, addition of fillers affects various properties of the ST process, such as stiffness of the mould box, rendering flow-ability of melt mould material, etc. In the present work, multi-objective optimization of various conflicting objectives (namely maximization of equivalent thermal conductivity, minimization of effective modulus of elasticity, and minimization of equivalent viscosity) of composite material are conducted using evolutionary algorithms (EAs) in order to design particle-reinforced polyurethane composites by finding the optimal values of design parameters. The design parameters include volume fraction of filler content, size and shape factor of filler particle, etc. The Pareto-optimal front is targeted by solving the corresponding multi-objective problem using the NSGA-II procedure. Then, suitable multi-criterion decision-making techniques are employed to select one or a small set of the optimal solution(s) of design parameter(s) based on the higher level information of the ST process for industrial applications. Finally, the experimental study with a typical real industrial application demonstrates that the obtained optimal design parameters significantly reduce the cooling time in soft tooling process keeping other processing advantages.     

Illustration of fairness in evolutionary multi-objective optimization

It is widely assumed that evolutionary algorithms for multi-objective optimization problems should use certain mechanisms to achieve a good spread over the Pareto front. In this paper, we examine such mechanisms from a theoretical point of view and analyze simple algorithms incorporating the concept of fairness. This mechanism tries to balance the number of offspring of all individuals in the current population. We rigorously analyze the runtime behavior of different fairness mechanisms and present illustrative examples to point out situations, where the right mechanism can speed up the optimization process significantly. We also indicate drawbacks for the use of fairness by presenting instances, where the optimization process is slowed down drastically.     

Enabling energy-efficient and lossy-aware data compression in wireless sensor networks by multi-objective evolutionary optimization

Nodes of wireless sensor networks (WSNs) are typically powered by batteries with a limited capacity. Thus, energy is a primary constraint in the design and deployment of WSNs. Since radio communication is in general the main cause of power consumption, the different techniques proposed in the literature to improve energy efficiency have mainly focused on limiting transmission/reception of data, for instance, by adopting data compression and/or aggregation. The limited resources available in a sensor node demand, however, the development of specifically designed algorithms. To this aim, we propose an approach to perform lossy compression on single node based on a differential pulse code modulation scheme with quantization of the differences between consecutive samples. Since different combinations of the quantization process parameters determine different trade-offs between compression performance and information loss, we exploit a multi-objective evolutionary algorithm to generate a set of combinations of these parameters corresponding to different optimal trade-offs. The user can therefore choose the combination with the most suitable trade-off for the specific application. We tested our lossy compression approach on three datasets collected by real WSNs. We show that our approach can achieve significant compression ratios despite negligible reconstruction errors. Further, we discuss how our approach outperforms LTC, a lossy compression algorithm purposely designed to be embedded in sensor nodes, in terms of compression rate and complexity.     

Performance evaluation of efficient multi-objective evolutionary algorithms for design space exploration of embedded computer systems

Multi-objective evolutionary algorithms (MOEAs) have received increasing interest in industry because they have proved to be powerful optimizers. Despite the great success achieved, however, MOEAs have also encountered many challenges in real-world applications. One of the main difficulties in applying MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before an acceptable solution can be found. There are, in fact, several industrial situations in which fitness evaluations are computationally expensive and the time available is very short. In these applications efficient strategies to approximate the fitness function have to be adopted, looking for a trade-off between optimization performance and efficiency. This is the case in designing a complex embedded system, where it is necessary to define an optimal architecture in relation to certain performance indexes while respecting strict time-to-market constraints. This activity, known as design space exploration (DSE), is still a great challenge for the EDA (electronic design automation) community. One of the most important bottlenecks in the overall design flow of an embedded system is due to simulation. Simulation occurs at every phase of the design flow and is used to evaluate a system which is a candidate for implementation. In this paper we focus on system level design, proposing an extensive comparison of the state-of-the-art of MOEA approaches with an approach based on fuzzy approximation to speed up the evaluation of a candidate system configuration. The comparison is performed in a real case study: optimization of the performance and power dissipation of embedded architectures based on a Very Long Instruction Word (VLIW) microprocessor in a mobile multimedia application domain. The results of the comparison demonstrate that the fuzzy approach outperforms in terms of both performance and efficiency the state of the art in MOEA strategies applied to DSE of a parameterized embedded system.     

Multiobjective optimization and evolutionary algorithms for the application mapping problem in multiprocessor system-on-chip design

Sesame is a software framework that aims at developing a modeling and simulation environment for the efficient design space exploration of heterogeneous embedded systems. Since Sesame recognizes separate application and architecture models within a single system simulation, it needs an explicit mapping step to relate these models for cosimulation. The design tradeoffs during the mapping stage, namely, the processing time, power consumption, and architecture cost, are captured by a multiobjective nonlinear mixed integer program. This paper aims at investigating the performance of multiobjective evolutionary algorithms (MOEAs) on solving large instances of the mapping problem. With two comparative case studies, it is shown that MOEAs provide the designer with a highly accurate set of solutions in a reasonable amount of time. Additionally, analyses for different crossover types, mutation usage, and repair strategies for the purpose of constraints handling are carried out. Finally, a number of multiobjective optimization results are simulated for verification.     

Hybrid-Game Strategies for multi-objective design optimization in engineering

A number of Game Strategies (GS) have been developed in past decades. They have been used in the fields of economics, engineering, computer science and biology due to their efficiency in solving design optimization problems. In addition, research in multi-objective (MO) and multidisciplinary design optimization (MDO) has focused on developing robust and efficient optimization methods to produce a set of high quality solutions with low computational cost. In this paper, two optimization techniques are considered; the first optimization method uses multi-fidelity hierarchical Pareto optimality. The second optimization method uses the combination of two Game Strategies; Nash-equilibrium and Pareto optimality. The paper shows how Game Strategies can be hybridised and coupled to Multi-Objective Evolutionary Algorithms (MOEA) to accelerate convergence speed and to produce a set of high quality solutions. Numerical results obtained from both optimization methods are compared in terms of computational expense and model quality. The benefits of using Hybrid-Game Strategies are clearly demonstrated.     

A dominance tree and its application in evolutionary multi-objective optimization

Most contemporary multi-objective evolutionary algorithms (MOEAs) store and handle a population with a linear list, and this may impose high computational complexities on the comparisons of solutions and the fitness assignment processes. This paper presents a data structure for storing the whole population and their dominating information in MOEAs. This structure, called a Dominance Tree (DT), is a binary tree that can effectively and efficiently store three-valued relations (namely dominating, dominated or non-dominated) among vector values. This paper further demonstrates DT’s potential applications in evolutionary multi-objective optimization with two cases. The first case utilizes the DT to improve NSGA-II as a fitness assignment strategy. The second case demonstrates a DT-based MOEA (called a DTEA), which is designed by leveraging the favorable properties of the DT. The simulation results show that the DT-improved NSGA-II is significantly faster than NSGA-II. Meanwhile, DTEA is much faster than SPEA2, NSGA-II and an improved version of NSGA-II. On the other hand, in regard to converging to the Pareto optimal front and maintaining the diversity of solutions, DT-improved NSGA-II and DTEA are found to be competitive with NSGA-II and SPEA2.     

Immunity-based hybrid evolutionary algorithm for multi-objective optimization in global container repositioning

The development of evolutionary algorithms for optimization has always been a stimulating and growing research area with an increasing demand in using them to solve complex industrial optimization problems. A novel immunity-based hybrid evolutionary algorithm known as Hybrid Artificial Immune Systems (HAIS) for solving both unconstrained and constrained multi-objective optimization problems is developed in this research. The algorithm adopts the clonal selection and immune suppression theories, with a sorting scheme featuring uniform crossover, multi-point mutation, non-dominance and crowding distance sorting to attain the Pareto optimal front in an efficient manner. The proposed algorithm was verified with nine benchmarking functions on its global optimal search ability as well as compared with four optimization algorithms to assess its diversity and spread. Sensitivity analysis was also carried out to investigate the selection of key parameters of the algorithm. It is found that the developed immunity-based hybrid evolutionary algorithm provides a useful means for solving optimization problems and has successfully applied to the problem of global repositioning of containers, which is one of a constrained multi-objective optimization problem. The developed HAIS will assist shipping liners on timely decision making and planning of container repositioning operations in global container transportation business in an optimized and cost effective manner.     

An integrated method of multi-objective optimization for complex mechanical structure

An integrated method of multi-objective optimization for complex mechanical structures is presented, which integrates prototype modeling, FEM analysis and optimization. To explore its advantages over traditional methods, optimization of a manipulator in hybrid mode aerial working vehicle (HMAWV) is adopted. The objective is to increase its working domain and decrease the cost under the constraint of enough strength, and the design variables are geometric dimensions. NLPQL and NSGA-II are synthesized to achieve optimal solutions. The results indicated that this integrated method was more efficient than enumerative search algorithm. NSGA-II could approximate the global Pareto front precisely, and the relative error between NLPQL and NSGA-II is trivial. Therefore, this integrated method is effective and shows a potential in engineering applications.     

A decision support system for optimal deployment of sonobuoy networks based on sea current forecasts and multi-objective evolutionary optimization

A decision support system for the optimal deployment of drifting acoustic sensor networks for cooperative track detection in underwater surveillance applications is proposed and tested on a simulated scenario. The system integrates sea water current forecasts, sensor range models and simple drifting buoy kinematic models to predict sensor positions and temporal network performance. A multi-objective genetic optimization algorithm is used for searching a set of Pareto optimal deployment solutions (i.e. the initial position of drifting sonobuoys of the network) by simultaneously optimizing two quality of service metrics: the temporal mean of the network area coverage and the tracking coverage. The solutions found after optimization, which represent different efficient tradeoffs between the two metrics, can be conveniently evaluated by the mission planner in order to choose the solution with the desired compromise between the two conflicting objectives. Sensitivity analysis through the Unscented Transform is also performed in order to test the robustness of the solutions with respect to network parameters and environmental uncertainty. Results on a simulated scenario making use of real probabilistic sea water current forecasts are provided showing the effectiveness of the proposed approach. Future work is envisioned to make the tool fully operational and ready to use in real scenarios.     

A comparative study of multi-objective optimization algorithms for sparse signal reconstruction

The development of the efficient sparse signal recovery algorithm is one of the important problems of the compressive sensing theory. There exist many types of sparse signal recovery methods in compressive sensing theory. These algorithms are classified into several categories like convex optimization, non-convex optimization, and greedy methods. Lately, intelligent optimization techniques like multi-objective approaches have been used in compressed sensing. Firstly, in this paper, the basic principles of the compressive sensing theory are summarized. And then, brief information about multi-objective algorithms, local search methods, and knee point selection methods are given. Afterward, multi-objective sparse recovery methods in the literature are reviewed and investigated in accordance with their multi-objective optimization algorithm, the local search method, and the knee point selection method. Also in this study, examples of multi-objective sparse reconstruction methods are designed according to the existing studies. Finally, the designed algorithms are tested and compared by using various types of sparse reconstruction test problems.