Search

Pattern mining (PM) refers to the process of discovering patterns of interest to users from data. However, most studies have considered only one pattern, such as frequent pattern or high-utility pattern. With the continuous requirement of businesses in various industries, the single-objective PM methods are difficult to meet the increasingly diverse needs of users. In this paper, a multi-objective problem model for high quality pattern mining (HQPM) is proposed, where the objectives are support, occupancy, and utility. In order to solve the proposed three-objective problem efficiently, an improved multi-objective evolutionary algorithm for HQPM (MOEA-PM) is proposed. Two kinds of population initialization strategies are designed, which is used to ensure the population is effectively distributed in the feasible solution space. By taking the properties of the model into consideration, an auxiliary tool is proposed to accelerate the convergence of the algorithm. Experimental results on real-world datasets show that the proposed three-objective problem model with the MOEA-PM algorithm can discover patterns that are both frequently occurring and has a high utility in the transaction datasets, while at the same time being relatively complete. Compared with the state-of-the-art MOEA-based HQPM algorithms, MOEA-PM has better performance in terms of efficiency, quality, and convergence speed. [ABSTRACT FROM AUTHOR]

Hybrid flow shop scheduling problems have gained an increasing attention in recent years because of its wide applications in real-world production systems. Most of the prior studies assume that the processing time of jobs is deterministic and constant. In practice, jobs’ processing time is usually difficult to be exactly known in advance and can be influenced by many factors, e.g., machines’ abrasion and jobs’ feature, thereby leading to their uncertain and variable processing time. In this paper, a dual-objective stochastic hybrid flow shop deteriorating scheduling problem is presented with the goal to minimize makespan and total tardiness. In the formulated problem, the normal processing time of jobs follows a known stochastic distribution, and their actual processing time is a linear function of their start time. In order to solve it effectively, this paper develops a hybrid multiobjective optimization algorithm that maintains two populations executing the global search in the whole solution space and the local search in promising regions, respectively. An information sharing mechanism and resource allocating method are designed to enhance its exploration and exploitation ability. The simulation experiments are carried out on a set of instances, and several classical algorithms are chosen as its peers for comparison. The results demonstrate that the proposed algorithm has a great advantage in dealing with the investigated problem. [ABSTRACT FROM AUTHOR]

Multiple solutions are often needed because of different kinds of uncertain failures in a plan execution process and scenarios for which precise mathematical models and constraints are difficult to obtain. This paper proposes an optimization strategy for multirobot task allocation (MRTA) problems and makes efforts on offering multiple solutions with same or similar quality for switching and selection. Since the mentioned problem can be regarded as a multimodal optimization one, this paper presents a niching immune-based optimization algorithm based on Softmax regression (sNIOA) to handle it. A prejudgment of population is done before entering an evaluation process to reduce the evaluation time and to avoid unnecessary computation. Furthermore, a guiding mutation (GM) operator inspired by the base pair in theory of gene mutation is introduced into sNIOA to strengthen its search ability. When a certain gene mutates, the others in the same gene group are more likely to mutate with a higher probability. Experimental results show the improvement of sNIOA on the aspect of accelerating computation speed with comparison to other heuristic algorithms. They also show the effectiveness of the proposed GM operator by comparing sNIOA with and without it. Two MRTA application cases are tested finally. [ABSTRACT FROM AUTHOR]

This paper presents fuzzy ${c}$ -means-based yield estimation (FUZYE), a methodology that reduces the time impact caused by Monte Carlo (MC) simulations in the context of analog integrated circuits (ICs) yield estimation, enabling it for yield optimization with population-based algorithms, e.g., the genetic algorithm (GA). MC analysis is the most general and reliable technique for yield estimation, yet the considerable amount of time it requires has discouraged its adoption in population-based optimization tools. The proposed methodology reduces the total number of MC simulations that are required, since, at each GA generation, the population is clustered using a fuzzy ${c}$ -means (FCMs) technique, and, only the representative individual (RI) from each cluster is subject to MC simulations. This paper shows that the yield for the rest of the population can be estimated based on the membership degree of FCM and RIs yield values alone. This new method was applied on two real circuit-sizing optimization problems and the obtained results were compared to the exhaustive approach, where all individuals of the population are subject to MC analysis. The FCM approach presents a reduction of 89% in the total number of MC simulations, when compared to the exhaustive MC analysis over the full population. Moreover, a ${k}$ -means-based clustering algorithm was also tested and compared with the proposed FUZYE, with the latest showing an improvement up to 13% in yield estimation accuracy. [ABSTRACT FROM AUTHOR]

In many diagnostic imaging settings, including positron emission tomography (PET), images are typically used for multiple tasks such as detecting disease and quantifying disease. Unlike conventional image reconstruction that optimizes a single objective, this work proposes a multi-objective optimization algorithm for PET image reconstruction to identify a set of images that are optimal for more than one task. This work is reliant on a genetic algorithm to evolve a set of solutions that satisfies two distinct objectives. In this paper, we defined the objectives as the commonly used Poisson log-likelihood function, typically reflective of quantitative accuracy, and a variant of the generalized scan-statistic model, to reflect detection performance. The genetic algorithm uses new mutation and crossover operations at each iteration. After each iteration, the child population is selected with non-dominated sorting to identify the set of solutions along the dominant front or fronts. After multiple iterations, these fronts approach a single non-dominated optimal front, defined as the set of PET images for which none the objective function values can be improved without reducing the opposing objective function. This method was applied to simulated 2D PET data of the heart and liver with hot features. We compared this approach to conventional, single-objective approaches for trading off performance: maximum likelihood estimation with increasing explicit regularization and maximum a posteriori estimation with varying penalty strength. Results demonstrate that the proposed method generates solutions with comparable to improved objective function values compared to the conventional approaches for trading off performance amongst different tasks. In addition, this approach identifies a diverse set of solutions in the multi-objective function space which can be challenging to estimate with single-objective formulations. [ABSTRACT FROM AUTHOR]

Core power control of a nuclear reactor during power maneuvering transients is an important issue in a nuclear power plant. This paper, for the first time, presents an optimized PID controller for a nuclear research reactor with a new model of the reactor core, which is based on the fractional neutron point kinetics (FNPK) equations. This model preserves the main dynamic properties of the neutron movement in which the relaxation time related to a quick change in the neutron flux includes a fractional order, acting as an exponent of the relaxation time, to show the dynamic characteristics of the nuclear reactor in the best way. The physical justification of the fractional exponent is associated with nonFickian impressions from the neutron diffusion equation point of view. In addition, in this paper, for the first time, feedback reactivity effects are considered for FNPK model. Genetic algorithm (GA) is used to optimize gains of the PID controller. The objective function is according to the minimization of the integral of time-weighted absolute error (ITAE). The simulation result demonstrates that this optimized control method has satisfactory performance and stability during output-tracking process for higher values of fractional order. [ABSTRACT FROM AUTHOR]

When solving constrained optimization problems (COPs) by evolutionary algorithms, the search algorithm plays a crucial role. In general, we expect that the search algorithm has the capability to balance not only diversity and convergence but also constraints and objective function during the evolution. For this purpose, this paper proposes a composite differential evolution (DE) for constrained optimization, which includes three different trial vector generation strategies with distinct advantages. In order to strike a balance between diversity and convergence, one of these three trial vector generation strategies is able to increase diversity, and the other two exhibit the property of convergence. In addition, to accomplish the tradeoff between constraints and objective function, one of the two trial vector generation strategies for convergence is guided by the individual with the least degree of constraint violation in the population, and the other is guided by the individual with the best objective function value in the population. After producing offspring by the proposed composite DE, the feasibility rule and the $\boldsymbol {\varepsilon }$ constrained method are combined elaborately for selection in this paper. Moreover, a restart scheme is proposed to help the population jump out of a local optimum in the infeasible region for some extremely complicated COPs. By assembling the above techniques together, a constrained composite DE is proposed. The experiments on two sets of benchmark test functions with various features, i.e., 24 test functions from IEEE CEC2006 and 18 test functions with 10 dimensions and 30 dimensions from IEEE CEC2010, have demonstrated that the proposed method shows better or at least competitive performance against other state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Operational indices optimization is crucial for the global optimization in beneficiation processes. This paper presents a multitasking multiobjective evolutionary method to solve operational indices optimization, which involves a formulated multiobjective multifactorial operational indices optimization (MO-MFO) problem and the proposed multiobjective MFO algorithm for solving the established MO-MFO problem. The MO-MFO problem includes multiple level of accurate models of operational indices optimization, which are generated on the basis of a data set collected from production. Among the formulated models, the most accurate one is considered to be the original functions of the solved problem, while the remained models are the helper tasks to accelerate the optimization of the most accurate model. For the MFO algorithm, the assistant models are alternatively in multitasking environment with the accurate model to transfer their knowledge to the accurate model during optimization in order to enhance the convergence of the accurate model. Meanwhile, the recently proposed two-stage assortative mating strategy for a multiobjective MFO algorithm is applied to transfer knowledge among multitasking tasks. The proposed multitasking framework for operational indices optimization has conducted on 10 different production conditions of beneficiation. Simulation results demonstrate its effectiveness in addressing the operational indices optimization of beneficiation problem. Note to Practitioners—Operational indices optimization is a typical approach to achieve global production optimization by efficiently coordinating all the indices to improve the production indices. In this paper, a multiobjective multitasking framework is developed to address the operational indices optimization, which includes a multitasking multiobjective operational indices optimization problem formulation and a multitasking multiobjective evolutionary optimization to solve the above-formulated optimization problem. The proposed approach can achieve a solution set for the decision-making. The simulation results on a real beneficiation process in China with 10 operational conditions show that the proposed approach is able to obtain a superior solution set, which is associated with a higher grade and yield of the product. [ABSTRACT FROM AUTHOR]

Dense stereo image matching in remotely sensed images is a challenging problem, though it has been studied for more than two decades, due to occlusions, discontinuities, geometric, and radiometric distortions. A novel multiobjective fitness function-based dense stereo matching approach using genetic algorithms (GAs) is proposed in this paper. The proposed method is useful for estimating dense disparity map with an improved number of inliers for a stereo image pair, despite the constraint of finding correct disparity at depth discontinuities. In this paper, the steps of GA, such as initialization of the population, fitness function, and crossover and mutation operation, are designed and implemented to effectively deal with the problem of dense stereo image matching. To initialize the population, a Scale Invariant Feature Transform (SIFT) descriptor is computed for each pixel and multiple-size window-based matching is performed, using the similarity measures: 1) Euclidean distance and 2) spectral angle mapper. The generated disparity maps are pruned to choose a suitable subset using the designed fitness functions, considering the constraints related to stereo image pair, such as epipolar constraint, which encodes the epipolar geometry and the similarity measure that is useful to decide accuracy of the correspondences. The two objective functions are the number of inliers computed using the fundamental matrix and an energy minimization function, considering discontinuities and occlusions. The usefulness of this approach for remotely sensed stereo image pairs is demonstrated by improving the number of inliers and favorably comparing with state-of-the-art dense stereo image matching methods. [ABSTRACT FROM AUTHOR]

This paper applied the finite-element method (FEM) with topological data structures to the optimization of electrical devices. A generic modifiable graph data structure is built according to the graph-theoretic foundation for these data structures. The employed topological FEM avoids rebuilding of the mesh in traditional FEM method while geometrical variations happen. It is an effective algorithm which can save computer storage and working time when applied to successive optimization. The effectiveness is verified by numerical example and comparison of the topological FEM with traditional FEM on storage load and working time is shown in this paper. [ABSTRACT FROM AUTHOR]

Differential evolution is one of the most powerful evolutionary algorithms for single objective optimization problems in the literature. Its application in the multiobjective optimization problems is also very successful, and many kinds of promising multiobjective differential evolution (MODE) algorithms have been proposed in the literature. This paper develops a new variant of MODE with two features. First, a set of personal archives are maintained to evolve the search process instead of a population with a fixed size, and a truncation procedure is used to enhance selection pressure. Second, multiple biased mutation operators incorporating the target solution quality are proposed, and an adaptive selection method is adopted to allocate the mutation operators to solutions. The proposed MODE is referred to as the MODE with personal archive and biased self-adaptive mutation selection (BiasMOSaDE). A set of 31 benchmark multiobjective problems selected from the literature are adopted to evaluate its performance. Computational results illustrate that the proposed BiasMOSaDE is competitive or even superior to several state-of-the-art MODEs in the literature. [ABSTRACT FROM AUTHOR]

Genetic programming (GP) is a powerful evolutionary algorithm that has been widely used for solving many real-world optimization problems. However, traditional GP can only solve a single task in one independent run, which is inefficient in cases where multiple tasks need to be solved at the same time. Recently, multifactorial optimization (MFO) has been proposed as a new evolutionary paradigm toward evolutionary multitasking. It intends to conduct evolutionary search on multiple tasks in one independent run. To enable multitasking GP, in this paper, we propose a novel multifactorial GP (MFGP) algorithm. To the best of our knowledge, this is the first attempt in the literature to conduct multitasking GP using a single population. The proposed MFGP consists of a novel scalable chromosome encoding scheme which is capable of representing multiple solutions simultaneously, and new evolutionary mechanisms for MFO based on self-learning gene expression programming. Further, comprehensive experimental studies are conducted on multitask scenarios consisting of commonly used GP benchmark problems and real world applications. The obtained empirical results confirmed the efficacy of the proposed MFGP. [ABSTRACT FROM AUTHOR]

In recent years, electric vehicle charging stations (EVCSs) have been deployed very fast, which offer a platform for the energy coordination between electric vehicles (EVs) and the electricity distribution system (DS). This paper presents an energy management method for the operation of EVCSs and DS while considering their interaction. In this method, we first use a quality-of-service constrained decision model for EVCSs, which is formulated based on the network calculus theory. Then, the DS aims to maximize its utility by scheduling charging plans for EVCSs. Afterwards, a game based on the supply function equilibrium (SFE) model is adopted to analyze the energy interaction, in which each EVCS is regarded as the leader, and the DS as the follower. In this way, an optimization problem with equilibrium constraints is established. Moreover, a hybrid optimization algorithm based on differential evolution and interior point method is used to obtain the equilibrium solution of the SFE game. Finally, simulation studies verify the effectiveness of proposed interactive energy management method. [ABSTRACT FROM AUTHOR]

The reliability function of a specific individual system can be dynamically updated by utilizing inspection data collected over time. However, due to limited inspection resources, such as time, budget, and manpower, it is oftentimes impossible to collect all the inspection data for all the components, subsystems, and the entire system simultaneously. There is an urgent need to optimally allot the limited inspection resources across multiple physical levels of a system, so as to identify the health status of a system and/or its subset of components of interest as accurately as possible to facilitate the ensuing system health management. To address the above research question, a metric is put forth in this paper to quantify the effectiveness of a particular multilevel inspection strategy for multistate systems (MSSs). Based on the proposed metric, an optimization problem is formulated to seek the optimal multilevel inspection strategy which possesses the maximum effectiveness of revealing the true state of a system and/or its subset of components of interest under limited inspection resources. The resulting optimization problem is resolved by a tailored ant colony optimization algorithm. The findings from our illustrative examples are 1) the proposed metric is capable of quantifying the effectiveness of various multilevel inspection strategies; 2) the analytical solution of the proposed metric is exactly the same with the simulation results, but much more computationally efficient; and 3) the optimal inspection strategy varies with respect to the operation time of a specific individual system. [ABSTRACT FROM AUTHOR]

Motivated by recent data analytics applications, we study the adversarial robustness of robust estimators. Instead of assuming that only a fraction of the data points are outliers as considered in the classic robust estimation setup, in this paper, we consider an adversarial setup in which an attacker can observe the whole dataset and can modify all data samples in an adversarial manner so as to maximize the estimation error caused by his attack. We characterize the attacker’s optimal attack strategy, and further introduce adversarial influence function (AIF) to quantify an estimator’s sensitivity to such adversarial attacks. We provide an approach to characterize AIF for any given robust estimator, and then design optimal estimator that minimizes AIF, which implies it is least sensitive to adversarial attacks and hence is most robust against adversarial attacks. From this characterization, we identify a tradeoff between AIF (i.e., robustness against adversarial attack) and influence function, a quantity used in classic robust estimators to measure robustness against outliers, and design estimators that strike a desirable tradeoff between these two quantities. [ABSTRACT FROM AUTHOR]

Nonlinear equations system (NES) arises commonly in science and engineering. Repulsion techniques are considered to be the effective methods to locate different roots of NES. In general, the repulsive radius needs to be given by the user before the run. However, its optimal parameter setting is difficult and problem-dependent. To alleviate this drawback, in this paper, we first propose a dynamic repulsion technique, and then a general framework based on the dynamic repulsion technique and evolutionary algorithms (EAs) is presented to effectively solve NES. The major advantages of our framework are: 1) the repulsive radius is controlled dynamically during the evolutionary process; 2) multiple roots of NES can be simultaneously located in a single run; 3) the diversity of the population is preserved due to the population reinitialization; and 4) different repulsion techniques and different EAs can be readily integrated into this framework. To extensively evaluate the performance of our framework, we choose 42 problems with diverse features as the test suite. In addition, some representative differential evolution and particle swarm optimization variants are incorporated into the framework. Our method is also compared with other state-of-the-art methods. Experimental results indicate that the dynamic repulsion technique can improve the performance of the original repulsion technique with static repulsive radius. Moreover, the proposed method is able to yield better results compared with other methods. [ABSTRACT FROM AUTHOR]

Due to the limits on market requirements, material conditions, and production situations in manufacturing process, conventional optimization approaches are difficult to obtain optimal economical and technical indices with physical constraints. To optimize several conflicting objects such as production rate, economic benefits, and gas emission, a hybrid-model-based intelligent optimization method that consists of an improved genetic algorithm and derived deep learning is put forward in this paper. Integration of the hybrid model has made modeling and optimizing an indivisible whole, in which the fitness of the genetic algorithm comes from deep neural networks by weighted sum of the output variables that correspond to the input solutions. The recurrent neural network (RNN) with disposition-gated recurrent unit (dGRU) is applied to capture the dynamics of blast furnace by training the model over datasets recorded in the production scene. Meanwhile, the self-adaptive population genetic algorithm (SAPGA) with a varied population size depending on the fitness distribution is used to locate the optimal solutions under current working conditions. The hybrid intelligent optimization model, validated by both numerical tests and practical data, has been running in an ironmaking plant for one year. It has proved to be successful in meeting industry demands by optimizing multiproduction indices simultaneously. [ABSTRACT FROM AUTHOR]

Sparse unmixing has become a popular tool for hyperspectral imagery interpretation. It refers to finding the optimal subset of a spectral library to reconstruct the image data and further estimate the proportions of different materials. Recently, multi-objective based sparse unmixing methods have presented promising performance because of their advantages in addressing combinatorial problems. A spectral and multi-objective based sparse unmixing (SMoSU) algorithm was proposed in our previous work, which solves the decision-making problem well. However, it does not show outstanding advantages in strong noise cases. To solve the problem, in this paper, SMoSU is improved based on the estimation of distribution algorithms (EDAs). The machine learning based EDAs have been a reliable approach in solving multi-objective problems. However, most of them are for special problems and relatively weak in theoretical foundations. Thus, it is unreliable to extend it directly to sparse unmixing. Here, we improve EDA on the basis of classification and propose a classification-based model for individual generating under the framework of SMoSU (CM-MoSU). In CM-MoSU, the whole population is divided to be positive and negative. Then, the macroinformation of positive individuals is used to guide the generation of new individuals. Therefore, the optimization task could pay more attention to the feasible space with high quality. Moreover, some theoretical analyses are presented to prove the reliability of CM-MoSU. In experiments, several state-of-the-art sparse unmixing algorithms are compared. Both synthetic and real-world experiments demonstrate the effectiveness of CM-MoSU. [ABSTRACT FROM AUTHOR]

Decomposition of a multiobjective optimization problem (MOP) into several simple multiobjective subproblems, named multiobjective evolutionary algorithm based on decomposition (MOEA/D)-M2M, is a new version of multiobjective optimization-based decomposition. However, it fails to consider different contributions from each subproblem but treats them equally instead. This paper proposes a collaborative resource allocation (CRA) strategy for MOEA/D-M2M, named MOEA/D-CRA. It allocates computational resources dynamically to subproblems based on their contributions. In addition, an external archive is utilized to obtain the collaborative information about contributions during a search process. Experimental results indicate that MOEA/D-CRA outperforms its peers on 61% of the test cases in terms of three metrics, thereby validating the effectiveness of the proposed CRA strategy in solving MOPs. [ABSTRACT FROM AUTHOR]

Due to the growth of modern dataset size and the desire to harness computing power of multiple machines, there is a recent surge of interest in the design of distributed machine learning algorithms. However, distributed algorithms are sensitive to Byzantine attackers who can send falsified data to prevent the convergence of algorithms or lead the algorithms to converge to value of the attackers’ choice. Some recent work proposed interesting algorithms that can deal with the scenario when up to half of the workers are compromised. In this paper, we propose a novel algorithm that can deal with an arbitrary number of Byzantine attackers. The main idea is to ask the parameter server to randomly select a small clean dataset and compute noisy gradient using this small dataset. This noisy gradient will then be used as a ground truth to filter out information sent by compromised workers. We show that the proposed algorithm converges to the neighborhood of the population minimizer regardless the number of Byzantine attackers. We further provide numerical examples to show that the proposed algorithm can benefit from the presence of good workers and achieve better performance than existing algorithms. [ABSTRACT FROM AUTHOR]

In order to obtain a good optimization method for the electrical transformer design with optimal selection of parameters, performance evaluation of three evolutionary algorithms (EAs), namely, genetic algorithm (GA), differential evolution algorithm, and nondominated sorting GA (NSGA-II), is carried out. The aim of this paper is to optimize parameters of transformer design (core thicknesses, primary-turn number, secondary-turn number, primary conductor area, and secondary conductor area) for minimization of total power losses (no-load losses and load losses) in three-phase transformer topology while maintaining high efficiency and low cost. The method used for this optimization scheme combines the finite-element method (FEM) and EAs to provide an accurate selection of parameters together with the optimized magnetic flux density and decreased loss. Experimental results show that NSGA-II+FEM model successfully provides a global feasible solution by minimizing total loss and related cost while improving the efficiency of three-phase transformer, rendering it suitable for application in the design environment of industrial transformers. [ABSTRACT FROM AUTHOR]

This paper compares three modern and two classical multiobjective optimizers (MOOs) as applied to real-world problems in electromagnetics. The behavior of sophisticated optimizers on simple test functions has been studied exhaustively. In contrast, the algorithms here are tested on practical applications, where the function evaluations are computationally expensive, making the convergence rate a crucial factor. The examples considered include the optimization of a narrowband slot antenna, a mushroom-type electromagnetic bandgap structure, and an ultrawideband Vivaldi antenna. Another popular topic in the literature is in comparing classical MOOs on electromagnetics problems. The modern optimizers chosen in this paper are state of the art and each has a distinct design philosophy. This paper introduces two unique MOOs to the electromagnetics community: BORG, an auto-adaptive genetic algorithm and the Multi-Objective Covariance Matrix Adaptation Evolutionary Strategy (MO-CMA-ES), an extension of the popular single-objective CMA-ES. These algorithms are compared to the Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D), a Chebysheff scalarization algorithm, and two classical MOOs. This paper will study the behavior of these algorithms on problems in electromagnetics with a limited number of function evaluations using five distinct metrics and will provide useful guidelines and recommended optimizer settings. [ABSTRACT FROM AUTHOR]

Population dynamics have been widely used in the design of learning and control systems for networked engineering applications, where the information dependency among elements of the network has become a relevant issue. Classic population dynamics (e.g., replicator, logit choice, Smith, and projection) require full information to evolve to the solution (Nash equilibrium). The main reason is that classic population dynamics are deduced by assuming well-mixed populations, which limits the applications where this theory can be implemented. In this paper, we extend the concept of population dynamics for nonwell-mixed populations in order to deal with distributed information structures that are characterized by noncomplete graphs. Although the distributed population dynamics proposed in this paper use partial information, they preserve similar characteristics and properties of their classic counterpart. Specifically, we prove mass conservation and convergence to Nash equilibrium. To illustrate the performance of the proposed dynamics, we show some applications in the solution of optimization problems, classic games, and the design of distributed controllers. [ABSTRACT FROM PUBLISHER]

This paper proposes a united-based imperialist competitive algorithm (UICA) for compensatory neural fuzzy systems. The original imperialist competitive algorithm (ICA) comprises numerous empires in the population, and each empire comprises one imperialist and some colonies. Each country represents a feasible solution in the empire, and the more favorable solutions become imperialists, taking over less favorable solutions (i.e., colonies). In the ICA, each colony moves toward its relevant imperialist according to an assimilation policy. This paper proposes a UICA that focuses on this assimilation policy to explore the characteristics of the colonies. The assimilation policy consists of three major parts in this paper. In the first part, a colony searches for the best previous position of the colony. In the second part, the colony faces the best-so-far imperialist. In the third part, the colony moves toward the corresponding imperialist of the colony. The proposed UICA was applied to nonlinear system problems, and the experimental results indicated that the proposed UICA is effective. [ABSTRACT FROM PUBLISHER]

This paper presents the fast topology optimization methods for rotating machines based on deep learning. The cross-sectional image of electric motors and their performances obtained during a multi-objective topology optimization based on the finite-element method and genetic algorithm (GA) is used for training of the convolutional neural network (CNN). Two different approaches are proposed: 1) CNN trained by preliminary optimization with a small population for GA is used for the main optimization with a large population and 2) CNN is used for screening of torque performances in the optimization with respect to the motor efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we propose a hybrid genetic algorithm (GA) for the optimal shape design of an axially symmetric dual-reflector antenna by combining the GA with the moving least square (MLS), which enhances the convergence rate and the global search performance. The MLS is used to construct local interpolation functions from non-uniform sample data and to estimate new superior positions. By combining these superior positions in the next generation, the MLS-GA shows better search performance for the global optimum and a faster convergence rate than those of the conventional GA. To verify the proposed MLS-GA, we applied it to the optimal shape design of the DRA at the W-band. [ABSTRACT FROM AUTHOR]

Brain storm optimization (BSO) is a swarm intelligence optimization algorithm inspired by the collective behavior of human beings in solving problems. This paper provides a conceptual overview and detailed explanation of the BSO algorithm. For the first time, the effectiveness of BSO in electromagnetic applications is demonstrated using a Yagi–Uda antenna design and a Luneburg lens antenna design, and this effectiveness is further validated via optimization, prototyping, and measurement of a dual-band slotted patch antenna design. In addition, a novel binary version of BSO (BBSO) for optimizing discrete problems is proposed, and the process of transforming the concept of BSO into a binary language is discussed in detail. A method for selecting algorithm parameter values for BBSO is shown. Finally, BBSO is applied successfully to an array thinning example and a pixelated patch antenna design. [ABSTRACT FROM AUTHOR]

Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these problems are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical instrument to assess the statistical performance of an estimator. Oracle results have focused on the theoretical properties of the uncomputable (global) minimum or maximum. In this paper, a general framework used for convex optimization problems to derive oracle inequalities for stationary points is extended. A main new ingredient of these oracle inequalities is that they are sharp: they show closeness to the best approximation within the model plus a remainder term. We apply this framework to different estimation problems. [ABSTRACT FROM AUTHOR]

This paper proposes a new optimization tool based on the cross-entropy (CE) method to assess security-constrained optimal power flow (SCOPF) solutions. First, the corresponding SCOPF stochastic problem is defined so that the optimum solution is interpreted as a rare event to be reached by a random search. Second, the CE method solves this new problem efficiently by making adaptive changes to the probability density function according to the Kullback–Leibler distance, creating a sequence of density functions that guides the search in the direction of the theoretically degenerate density at the optimal point. Different types of density functions are tested in order to cope with discrete variables present in the SCOPF problem. Two test systems, namely the IEEE 57 bus and the IEEE 300 bus, are used to evaluate the effectiveness of the proposed method in terms of solution quality and computational effort. Comparisons carried out with reference algorithms in the literature demonstrate that the CE method is capable of finding better solutions for the SCOPF problem with fewer evaluations. [ABSTRACT FROM AUTHOR]

Expansion of the distribution network and close distance of distribution transformers lead to allocation of excessive surge arresters, while the number of arresters failures in the traditional routine may cause unwanted power outages. Therefore, this paper aims to propose a method to decrease the number of surge arresters as well as keep overvoltage protection of the network in the event of direct lightning strokes. According to different bus structures of the distribution network, elimination of allocated arresters is carried out by investigation of their protective distances at different stroke conditions. A guideline is presented for the IEEE 34-bus distribution system and the outcome is compared with the standard. The analysis is also carried out for a practical distribution network at West Mazandaran Power Distribution Company, Mazandaran, Iran. Possibilities for the elimination of surge arresters at the transformer station and installation of new transformers without allocation of new arresters are investigated in the analysis. Simulations are carried out based on the standard 8/20 lightning current wave at a transient analysis of DIgSILENT. [ABSTRACT FROM PUBLISHER]

This paper proposes a hybrid algorithm based on the genetic algorithm (GA) and the evolution strategy (ES) for the electromagnetic optimization problem. The GA is not good enough at times in searching the optimal solution from the view point of the convergence speed and the solution quality, while the ES has the risk of being trapped in a local minimum. The hybrid algorithm is composed of GA and ES in order to make up for these defects. First, we reached the vicinity of optimal solution using the GA. Then, the ES is used to find the accurate optimal solution. The switching point can be a main issue, which is also resolved in this paper. First, the performance of the convergence speed and the solution accuracy are comparatively tested using the known functions. In addition, the optimized design of the 2.45 GHz coplanar waveguide-fed circularly polarized antenna is carried out as a practical application. Only the GA and the hybrid algorithm reach the satisfactory value, and the more rapid convergence can be shown by the ES in this hybrid method after 380 iterations. [ABSTRACT FROM AUTHOR]

Modern engines feature a considerable number of adjustable control parameters. With this increasing number of degrees of freedom (DoFs) for engines and the consequent considerable calibration effort required to optimize engine performance, traditional manual engine calibration or optimization methods are reaching their limits. An automated and efficient engine optimization approach is desired. In this paper, interdisciplinary research on a multiobjective evolutionary algorithm (MOEA)-based global optimization approach is developed for a homogeneous charge compression ignition (HCCI) engine. The performance of the HCCI engine optimizer is demonstrated by the cosimulation between an HCCI engine Simulink model and a Strength Pareto Evolutionary Algorithm 2 (SPEA2)-based multiobjective optimizer Java code. The HCCI engine model is developed by Simulink and validated with different engine speeds (1500–2250 r/min) and indicated mean effective pressures (IMEPs) (3–4.5 bar). The model can simulate the HCCI engine's indicated specific fuel consumption (ISFC) and indicated specific hydrocarbon (ISHC) emissions with good accuracy. The introduced MOEA optimization is an approach to efficiently optimize the engine ISFC and ISHC simultaneously by adjusting the settings of the engine's actuators automatically through the SPEA2. In this paper, the settings of the HCCI engine's actuators are intake valve opening (IVO) timing, exhaust valve closing (EVC) timing, and relative air-to-fuel ratio $\lambda$. The cosimulation study and experimental validation results show that the MOEA engine optimizer can find the optimal HCCI engine actuators' settings with satisfactory accuracy and a much lower time consumption than usual. [ABSTRACT FROM PUBLISHER]

Energy storage systems (ESSs) play a significant role in performance improvement of future electric traction systems. This paper investigates an ESS based on supercapacitors for trams as a reliable technical solution with considerable energy saving potential. Operating the ESS onboard a tram brings the following benefits: reduction of peak power demands, decrease of power consumption, improvement of performance, and efficiency. Whereas the commonly used ESS power management (PM) has been dealing only with PM without vehicle position knowledge, the main emphasis of the presented research is put on position-based Takagi–Sugeno fuzzy (T-S fuzzy) PM for human-driven trams with an ESS. The tram position, located by, e.g., a Global Positioning System module, is used to predict future energy demands and power flows. This information is used in the preparation of the supercapacitor energy level and its power flow control. The optimal ESS power flow with respect to the tram position is a very complex problem. Therefore, soft computing techniques are used in this paper. The main part of the proposed ESS PM is the T-S fuzzy controller. The T-S fuzzy reduces problem dimensionality using expert knowledge represented by the rules. The output membership functions were optimized by differential evolution. The designed ESS PM was verified on real traffic data. [ABSTRACT FROM PUBLISHER]

This paper addresses the integrated volt-var control for distribution network operation via multiobjective optimization. This paper seeks to explore the problem of energy savings and peak demand relief through the voltage reduction procedure. Currently, due to the emergence of the distribution smart grids, these procedures are gaining renewed interest and attention. The proposal presented here is for the operation phase, with a strategy based on an hourly load forecast for the next day/week, taking into account the active power intake reduction, and the voltage deviation. Therefore, the result is a set of nondominated optimal solutions, and then one may decide when, where, and how to apply them to meet different goals. The obtained solutions, for two typical distribution networks, describe relevant economic and technical benefits. [ABSTRACT FROM AUTHOR]

Energy storage systems play a significant role in both distributed power systems and utility power systems. Among the many benefits of an energy storage system, the improvement of power system cost and voltage profile can be the salient specifications of storage systems. Studies show that improper size and placement of energy storage units leads to undesired power system cost as well as the risk of voltage stability, especially in the case of high renewable energy penetration. To solve the problem, a hybrid multi-objective particle swarm optimization (HMOPSO) approach is proposed in the paper to minimize the power system cost and improve the system voltage profiles by searching sitting and sizing of storage units under consideration of uncertainties in wind power production. Furthermore, the probability cost analysis is first put forward in this paper. The proposed HMOPSO combines multi-objective particle swarm optimization (MOPSO) algorithm with elitist nondominated sorting genetic algorithm (NSGA-II) and probabilistic load flow technique. It also incorporates a five-point estimation method (5PEM) for discretizing wind power distribution. The IEEE 30-bus system is adopted to perform case studies. The simulation results for each case clearly demonstrate the necessity for optimal storage allocation, and the effectiveness of the proposed method. [ABSTRACT FROM PUBLISHER]

Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper. [ABSTRACT FROM PUBLISHER]

Design of electromagnetic devices has multimodal, multidimensional, and constrained characteristics. Metaheuristic approaches are good choices for tackling these design problems owing to their simulation-based property. As many electromagnetic design problems require a long computing time to solve (even on modern computers) and many heuristic approaches have been created, the major goal of this paper is to improve the effectiveness and robustness of existing approaches. This paper proposes an algorithm with the ensemble of two composite differential evolution (DE) ingredients. One ingredient is biased toward exploration and the other is biased toward exploitation. The probability of choosing which ingredient to search for new solutions is adaptively updated based on the previous performance of each ingredient. The algorithm is applied to solve a loudspeaker design problem with promising performance when compared with DE, artificial bee colony, two improved artificial bee colony algorithms, and a randomly choosing ingredients algorithm. [ABSTRACT FROM AUTHOR]

An optimum operating strategy is needed for early amortization of expensive hybrid electric vehicle powertrain parts. Especially in the operation of long-haul trucks, fuel costs have a large impact on the total cost of ownership, which is the key entrepreneurial figure in the transportation business. Combined with route information, a predictive powertrain control (PPC) system increases the fuel-saving. In a MATLAB/Simulink model-based generic approach, the operating strategy and the PPC are optimized using a genetic algorithm. The tradeoff between minimizing the fuel consumption and simultaneously maximizing the vehicle speed and gradeability to decrease time-related fixed costs has to be solved. This leads to a multi-optimization problem. The operating strategy is developed for a parallel hybrid topology that includes the fuel-saving functions of regenerative braking, boosting, shifting the load point, and electric drive only operation. The methodology developed answers the search for an optimum control parameter setup combining the operational strategy and the PPC system in long-haul operations. This paper describes the model building, simulation, and optimization of a rule-based control strategy. The route profile and fuel consumption of an internal combustion engine long haul truck were measured in a real-life test run. The recorded data are used for model building and to validate the simulation tool. With an optimized parameter setup, fuel-saving of up to 11% were achieved in theory with acceptable vehicle speed and gradeability. [ABSTRACT FROM AUTHOR]

Improvements to overcome premature convergence of existing wind driven optimization algorithms are proposed. The specific measures being proposed include: 1) selection of the origin point of every parcel using dynamic and random tournament selection mechanisms to guarantee that there is a good balance between exploration and exploitation searches. In this paper, the “so far searched best solution” will be exploited to guide the movement of the randomly initialized parcels by introducing a newly designed mechanism; and a probabilistic mutation is designed; and 2) full utilization of the latest information accumulated from the searched history in order to guide the search toward the potential solutions to enhance convergences, and the “so far searched worst parcel” is used to shift the new parcel away from the parcel in issue. Numerical results on three case studies are reported to showcase the feasibility and the merit of the proposed method in solving both practical engineering design problems and mathematical test functions. [ABSTRACT FROM AUTHOR]

The optimization of electrical machines and energy-harvesting devices has been one of the hot topics of research in recent years. In this context, advanced computational intelligence algorithms are suitable design tools, since they are able to optimize complex systems with a large number of constraints and free design parameters. This paper presents the social network optimization (SNO): a new population-based algorithm developed to guarantee an effective and faster exploration of the solution domain with respect to traditional optimization techniques. The proposed technique will be described and validated with a benchmark case study. Finally, the optimization problem of a tubular permanent magnet linear generator will be formulated in the context of vehicular energy-harvesting systems. [ABSTRACT FROM PUBLISHER]

Principal component analysis (PCA) is an exploratory tool widely used in data analysis to uncover the dominant patterns of variability within a population. Despite its ability to represent a data set in a low-dimensional space, PCA’s interpretability remains limited. Indeed, the components produced by PCA are often noisy or exhibit no visually meaningful patterns. Furthermore, the fact that the components are usually non-sparse may also impede interpretation, unless arbitrary thresholding is applied. However, in neuroimaging, it is essential to uncover clinically interpretable phenotypic markers that would account for the main variability in the brain images of a population. Recently, some alternatives to the standard PCA approach, such as sparse PCA (SPCA), have been proposed, their aim being to limit the density of the components. Nonetheless, sparsity alone does not entirely solve the interpretability problem in neuroimaging, since it may yield scattered and unstable components. We hypothesized that the incorporation of prior information regarding the structure of the data may lead to improved relevance and interpretability of brain patterns. We therefore present a simple extension of the popular PCA framework that adds structured sparsity penalties on the loading vectors in order to identify the few stable regions in the brain images that capture most of the variability. Such structured sparsity can be obtained by combining, e.g., \ell 1 and total variation (TV) penalties, where the TV regularization encodes information on the underlying structure of the data. This paper presents the structured SPCA (denoted SPCA-TV) optimization framework and its resolution. We demonstrate SPCA-TV’s effectiveness and versatility on three different data sets. It can be applied to any kind of structured data, such as, e.g., N -dimensional array images or meshes of cortical surfaces. The gains of SPCA-TV over unstructured approaches (such as SPCA and ElasticNet PCA) or structured approach (such as GraphNet PCA) are significant, since SPCA-TV reveals the variability within a data set in the form of intelligible brain patterns that are easier to interpret and more stable across different samples. [ABSTRACT FROM PUBLISHER]

This paper presents a novel evolutionary strategy for multiobjective optimization in which a population’s evolution is guided by exploiting the geometric structure of its Pareto front. Specifically, the Pareto front of a particle population is regarded as a set of scattered points on which interpolation is performed using a geometric curve/surface model to construct a geometric parameter space. On this basis, the normal direction of this space can be obtained and the solutions located exactly in this direction are chosen as the guiding points. Then, the dominated solutions are processed by using a local optimization technique with the help of these guiding points. Particle populations can thus evolve toward optimal solutions with the guidance of such a geometric structure. The strategy is employed to develop a fast and robust algorithm based on correlation analysis for solving the optimization problems with more than three objectives. A number of computational experiments have been conducted to compare the algorithm to another three popular multiobjective algorithms. As demonstrated in the experiments, the proposed algorithm achieves remarkable performance in terms of the solutions obtained, robustness, and speed of convergence. [ABSTRACT FROM AUTHOR]

In this paper we present a multi-objective optimization approach to subarrayed linear antenna arrays design. We define this problem as a bi-objective one. We consider two objective functions for directivity maximization and sidelobe level minimization. Memetic algorithms (MAs) are hybrid algorithms that combine the benefits of a global search Evolutionary Algorithm (EA) with a local search method. In this paper, we introduce a new memetic multi-objective evolutionary algorithm namely the memetic generalized differential evolution (MGDE3). This algorithm is a memetic extension of the popular generalized differential evolution (GDE3) algorithm. Another popular MOEA is the nondominated sorting genetic algorithm-II (NSGA-II). MGDE3, GDE3 and NSGA-II are applied to the synthesis of uniform and nonuniform subarrayed linear arrays, providing an extensive set of solutions for each design case. Depending on the desired array characteristics, the designer can select the most suitable solution. The results of the proposed method are compared with those reported in the literature, indicating the advantages and applicability of the multi-objective approach. [ABSTRACT FROM PUBLISHER]

The structure and trigger control strategy have become the most important factors that restrict the performance of the multistage synchronous induction coilgun (MSSICG). However, it is still a difficult task to design MSSICG under overload constraint due to coupling between the multiple parameters. In this paper, the maximization of the emission efficiency and acceleration stationarity is treated as a multiobjective optimization problem. By analyzing the relationship between the number of turns and the other structural parameters of the launch, the multiobjective optimization model of MSSICG is established by the current filament method which was verified by the experimental data and finite-element method. And then the second generation nondominated sorting genetic algorithm (NSGA-II) and multiobjective particle swarm optimization (MOPSO) were employed to optimize the model in order to maximize the energy transfer efficiency while achieving the smooth acceleration of the armature. With the formulated optimization model, a five-stage synchronous induction coilgun is optimized as a special case. A decision-making procedure based on the fuzzy membership function is used for obtaining best compromise solution from the set of Pareto-solutions obtained through NSGA-II and MOPSO. In addition, the optimization performance of the proposed multiobjective optimization model and the single-objective optimization model of the MSSICG was compared. The result of optimization shows that the proposed multiobjective optimization model of MSSICG can effectively improve the performance of the coilgun compared with the single-objective optimization model which takes of the launch velocity and overload acceleration as the combination objective function or only the launch velocity. [ABSTRACT FROM PUBLISHER]

Optimization metaheuristics is a powerful way to deal with many electromagnetic optimization problems. Their main advantages are that they don’t require gradient computation, they are more likely to give a global optimum solution and have a higher degree of exploration and exploitation ability. Recently, the symbiotic organisms search (SOS) algorithm was proposed to solve single-objective optimization problems. SOS mimics the symbiotic relationship among the living beings. In order to extend the classical mono-objective SOS algorithm approach, this paper proposes a new multiobjective SOS (MOSOS) based on nondominance and crowding distance criterion. Furthermore, an improved MOSOS (IMOSOS) based on normal (Gaussian) probability distribution function also was proposed and evaluated. Results on a multiobjective constrained brushless direct current (dc) motor design show that the MOSOS and IMOSOS present promising performance. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid, multiobjective optimization algorithm enabling global optimum tracking in permanent-magnet (PM) traction motor design. The methodology developed is based on the Artificial Bee Colony technique, strength Pareto evolutionary algorithm, and differential evolution strategy ensuring fast and reliable convergence to the optimal Pareto front. The effectiveness of the derived methodology is compared with other well-established and powerful algorithms from the literature through both appropriate test functions and an application example concerning an unequal teeth surface-mounted PM wheel motor design. [ABSTRACT FROM AUTHOR]

This paper proposes a novel Continuous Quantum Immune Clonal Optimization algorithm for thermal optimization on a 117 kW high-speed permanent-magnet generator (HSPMG). The proposed algorithm mixes the Quantum-Computation into the Immune-Cloning-Algorithm and causes better population diversity, higher global searching ability, and faster convergence which is approved by simulation results. Then, the improved algorithm is applied to seek an optimized slot groove and improve HSPMG thermal performance, where the 3-D fluid-thermal coupling analyses are processed with a multiobjective optimal group composed of the highest temperature and temperature difference. Both the proposed algorithm and the obtained conclusions are of significances in the design and optimization of the cooling system in electric machines. [ABSTRACT FROM AUTHOR]

The multiobjective permutation flow shop scheduling problem with sequence dependent setup times has been an object of investigations for decades. This widely studied problem from the scheduling theory links the sophisticated solution algorithms with the moderate real world applications. This paper presents a novel multiobjective discrete artificial bee colony algorithm based decomposition, called MODABC/D, to solve the sequence dependent setup times multiobjective permutation flowshop scheduling problem with the objective to minimize makespan and total flowtime. First, in order to make the standard artificial bee colony algorithm to solve the scheduling problem, a discrete artificial bee colony algorithm is proposed to solve the problem based on the perturbation operation. Then, a problem-specific solution builder heuristic is used to initialize the population to enhance the quality of the initial solution. Finally, a further local search method are comprised of a single local search procedures based on the insertion neighborhood structures to find the better solution for the nonimproved individual. The performance of the proposed algorithms is tested on the well-known benchmark suite of Taillard. The highly effective performance of the multiobjective discrete artificial bee colony algorithm-based decomposition is compared against the state of art algorithms from the existing literature in terms of both coverage value and hypervolume indicator. [ABSTRACT FROM AUTHOR]

This paper introduces a Markov model for evolutionary algorithms (EAs) that is based on interactions among individuals in the population. This interactive Markov model has the potential to provide tractable models for optimization problems of realistic size. We propose two simple discrete optimization search strategies with population-proportion-based selection and a modified mutation operator. The probability of selection is linearly proportional to the number of individuals at each point of the search space. The mutation operator randomly modifies an entire individual rather than a single decision variable. We exactly model these optimization search strategies with interactive Markov models. We present simulation results to confirm the interactive Markov model theory. We show that genetic algorithms and biogeography-based optimization perform better with the addition of population-proportion-based selection on a set of real-world benchmarks. We note that many other EAs, both new and old, might be able to be improved with this addition, or modeled with this method. [ABSTRACT FROM PUBLISHER]