990 results
Search Results
2. Introduction to the Special Section on Nature Inspired Methods in Industry Applications.
- Author
-
Slowik, Adam and Kwasnicka, Halina
- Abstract
In this paper, we present a short introduction to the special section on nature-inspired optimization methods and their industry applications. The focus of this paper is on a brief presentation of the main idea (topics, algorithms, engineering problems) of the papers which were accepted for the publication in this special section. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
3. Enhancing Decomposition-Based Algorithms by Estimation of Distribution for Constrained Optimal Software Product Selection.
- Author
-
Xiang, Yi, Yang, Xiaowei, Zhou, Yuren, and Huang, Han
- Subjects
EVOLUTIONARY algorithms ,ALGORITHMS ,INTERDISCIPLINARY approach to knowledge ,BENCHMARK problems (Computer science) ,COMPUTER software ,SOFTWARE engineering ,DEFINITIONS - Abstract
This paper integrates an estimation of distribution (EoD)-based update operator into decomposition-based multiobjective evolutionary algorithms for binary optimization. The probabilistic model in the update operator is a probability vector, which is adaptively learned from historical information of each subproblem. We show that this update operator can significantly enhance decomposition-based algorithms on a number of benchmark problems. Moreover, we apply the enhanced algorithms to the constrained optimal software product selection (OSPS) problem in the field of search-based software engineering. For this real-world problem, we give its formal definition and then develop a new repair operator based on satisfiability solvers. It is demonstrated by the experimental results that the algorithms equipped with the EoD operator are effective in dealing with this practical problem, particularly for large-scale instances. The interdisciplinary studies in this paper provide a new real-world application scenario for constrained multiobjective binary optimizers and also offer valuable techniques for software engineers in handling the OSPS problem. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
4. High-Frequency Electric Machines for Boundary Layer Ingestion Fan Propulsor.
- Author
-
Yoon, Andy, Xiao, Jianqiao, Lohan, Danny, Arastu, Faraz, and Haran, Kiruba
- Subjects
ELECTRIC machines ,BOUNDARY layer (Aerodynamics) ,JET engines ,ELECTRIC motors ,INGESTION ,EVOLUTIONARY algorithms - Abstract
High specific power electric motor is a key enabling technology for electric/hybrid-electric propulsion for aircraft. High-frequency, air core machine topologies show potential for high specific power when the machines are integrated within jet engines at high speed, e.g. 15,000 rpm. In this paper, we explore how these machines scale to a boundary layer ingestion (BLI) fan application in newly proposed Single-aisle Turboelectric Aircraft with an Aft Boundary Layer Propulsor (STARC-ABL). Detailed analytical models that have been experimentally verified, and an evolutionary genetic algorithm are utilized to choose an optimized design for the BLI propulsor. Analyses show that a 2.6 MW, 11 kW/kg, 98% electric motor is achievable. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
5. Handling Constrained Multiobjective Optimization Problems With Constraints in Both the Decision and Objective Spaces.
- Author
-
Liu, Zhi-Zhong and Wang, Yong
- Subjects
DECISION feedback equalizers ,EVOLUTIONARY algorithms ,CONSTRAINED optimization - Abstract
Constrained multiobjective optimization problems (CMOPs) are frequently encountered in real-world applications, which usually involve constraints in both the decision and objective spaces. However, current artificial CMOPs never consider constraints in the decision space (i.e., decision constraints) and constraints in the objective space (i.e., objective constraints) at the same time. As a result, they have a limited capability to simulate practical scenes. To remedy this issue, a set of CMOPs, named DOC, is constructed in this paper. It is the first attempt to consider both the decision and objective constraints simultaneously in the design of artificial CMOPs. Specifically, in DOC, various decision constraints (e.g., inequality constraints, equality constraints, linear constraints, and nonlinear constraints) are collected from real-world applications, thus making the feasible region in the decision space have different properties (e.g., nonlinear, extremely small, and multimodal). On the other hand, some simple and controllable objective constraints are devised to reduce the feasible region in the objective space and to make the Pareto front have diverse characteristics (e.g., continuous, discrete, mixed, and degenerate). As a whole, DOC poses a great challenge for a constrained multiobjective evolutionary algorithm (CMOEA) to obtain a set of well-distributed and well-converged feasible solutions. In order to enhance current CMOEAs’ performance on DOC, a simple and efficient two-phase framework, named ToP, is proposed in this paper. In ToP, the first phase is implemented to find the promising feasible area by transforming a CMOP into a constrained single-objective optimization problem. Then in the second phase, a specific CMOEA is executed to obtain the final solutions. ToP is applied to four state-of-the-art CMOEAs, and the experimental results suggest that it is quite effective. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
6. Neuroevolution in Games: State of the Art and Open Challenges.
- Author
-
Risi, Sebastian and Togelius, Julian
- Abstract
This paper surveys research on applying neuroevolution (NE) to games. In neuroevolution, artificial neural networks are trained through evolutionary algorithms, taking inspiration from the way biological brains evolved. We analyze the application of NE in games along five different axes, which are the role NE is chosen to play in a game, the different types of neural networks used, the way these networks are evolved, how the fitness is determined and what type of input the network receives. The paper also highlights important open research challenges in the field. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
7. Scheduling Dual-Objective Stochastic Hybrid Flow Shop With Deteriorating Jobs via Bi-Population Evolutionary Algorithm.
- Author
-
Fu, Yaping, Zhou, MengChu, Guo, Xiwang, and Qi, Liang
- Subjects
FLOW shop scheduling ,FLOW shops ,EVOLUTIONARY algorithms ,PRODUCTION scheduling ,JOB shops ,TABU search algorithm ,ONLINE algorithms ,PROCESS optimization - Abstract
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]
- Published
- 2020
- Full Text
- View/download PDF
8. Optimized Planar Elliptical Dipole Antenna for UWB EMC Applications.
- Author
-
Tziris, Emmanouil N., Lazaridis, Pavlos I., Zaharis, Zaharias D., Cosmas, John P., Mistry, Keyur K., and Glover, Ian A.
- Subjects
DIPOLE antennas ,ULTRA-wideband antennas ,PARTICLE swarm optimization ,EVOLUTIONARY algorithms ,ANTENNA design ,MATHEMATICAL functions ,DIFFERENTIAL evolution ,METAHEURISTIC algorithms - Abstract
This paper presents a novel method for optimizing a planar elliptical dipole antenna with elliptical slots, for ultrawideband electromagnetic compatibility applications. The antenna is required to achieve minimum return loss and boresight realized gain with an adequate gain flatness across the frequency range of 1–5 GHz. Such an antenna is a powerful tool for electromagnetic measurements, due to its very compact size and its wide operating bandwidth. The main optimization method used in this paper is the invasive weed optimization (IWO), which is a nature-inspired metaheuristic evolutionary algorithm. The conventional and a modified version of IWO are compared to other prior-art evolutionary algorithms, such as the particle swarm optimization and differential evolution. The comparison is performed by applying all the methods on a set of mathematical test functions and also on the specific antenna design problem presented in this paper. The comparative results demonstrate the superiority of the modified IWO over the other optimization methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. Composite Differential Evolution for Constrained Evolutionary Optimization.
- Author
-
Wang, Bing-Chuan, Li, Han-Xiong, Li, Jia-Peng, and Wang, Yong
- Subjects
CONSTRAINED optimization ,DIFFERENTIAL evolution ,EVOLUTIONARY algorithms ,SEARCH algorithms ,EVOLUTIONARY computation ,LINEAR programming - Abstract
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]
- Published
- 2019
- Full Text
- View/download PDF
10. On the Easiest and Hardest Fitness Functions.
- Author
-
He, Jun, Chen, Tianshi, and Yao, Xin
- Subjects
EVOLUTIONARY algorithms ,MATHEMATICAL functions ,GENETIC programming ,EVOLUTIONARY computation ,POLYNOMIALS - Abstract
The hardness of fitness functions is an important research topic in the field of evolutionary computation. In theory, this paper can help with understanding the ability of evolutionary algorithms (EAs). In practice, this paper may provide a guideline to the design of benchmarks. The aim of this paper is to answer the following research questions. Given a fitness function class, which functions are the easiest with respect to an EA? Which are the hardest? How are these functions constructed? This paper provides theoretical answers to these questions. The easiest and hardest fitness functions are constructed for an elitist (1 + 1) EA to maximize a class of fitness functions with the same optima. It is demonstrated that the unimodal functions are the easiest and deceptive functions are the hardest in terms of the time-based fitness landscape. This paper also reveals that in a fitness function class, the easiest function to one algorithm may become the hardest to another algorithm, and vice versa. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
11. Economic Dispatch With Non-Smooth Objectives—Part II: Dimensional Steepest Decline Method.
- Author
-
Zhan, Junpeng, Wu, Q. H., Guo, Chuangxin, and Zhou, Xiaoxin
- Subjects
VALVES ,ELECTRIC power production research ,EVOLUTIONARY algorithms ,ELECTRIC power distribution ,ELECTRIC power systems - Abstract
Economic dispatch (ED) considering valve-point effect, multiple fuel options, prohibited operating zones of generation units is a more accurate model compared to a conventional ED model. It is non-smooth and thus evolutionary algorithms (EAs) are so far the only feasible approaches for the model. In Part II of the paper, a new method, the dimensional steepest decline method (DSD), is proposed for the ED with non-smooth objectives. The DSD is based on the local minimum analysis of the ED problem presented in Part I of the paper. The fuel cost's decline rate between each two adjacent singular points is utilized to find the optimal solutions in a serial sequence. The computational complexity of the DSD is analyzed. The DSD has been applied to solve different types of ED problems on different test systems, including large-scale systems. The simulation results show that DSD can obtain more accurate solutions and consume much less time and its advantage is more obvious on large-scale systems, in comparison with the state-of-art EAs. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
12. Evolutionary Dynamic Multiobjective Optimization Assisted by a Support Vector Regression Predictor.
- Author
-
Cao, Leilei, Xu, Lihong, Goodman, Erik D., Bao, Chunteng, and Zhu, Shuwei
- Subjects
EVOLUTIONARY algorithms ,VECTOR spaces ,TIME measurements ,HISTORICAL maps - Abstract
Dynamic multiobjective optimization problems (DMOPs) challenge multiobjective evolutionary algorithms (MOEAs) because those problems change rapidly over time. The class of DMOPs whose objective functions change over time steps, in ways that exhibit some hidden patterns has gained much attention. Their predictability indicates that the problem exhibits some correlations between solutions obtained in sequential time periods. Most of the current approaches use linear models or similar strategies to describe the correlations between historical solutions obtained, and predict the new solutions in the following time period as an initial population from which the MOEA can begin searching in order to improve its efficiency. However, nonlinear correlations between historical solutions and current solutions are more common in practice, and a linear model may not be suitable for the nonlinear case. In this paper, we present a support vector regression (SVR)-based predictor to generate the initial population for the MOEA in the new environment. The basic idea of this predictor is to map the historical solutions into a high-dimensional feature space via a nonlinear mapping, and to do linear regression in this space. SVR is used to implement this process. We incorporate this predictor into the MOEA based on decomposition (MOEA/D) to construct a novel algorithm for solving the aforementioned class of DMOPs. Comprehensive experiments have shown the effectiveness and competitiveness of our proposed predictor, comparing with the state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
13. An Evolutionary Algorithm for Large-Scale Sparse Multiobjective Optimization Problems.
- Author
-
Tian, Ye, Zhang, Xingyi, Wang, Chao, and Jin, Yaochu
- Subjects
EVOLUTIONARY computation ,EVOLUTIONARY algorithms ,FEATURE selection ,TEST design - Abstract
In the last two decades, a variety of different types of multiobjective optimization problems (MOPs) have been extensively investigated in the evolutionary computation community. However, most existing evolutionary algorithms encounter difficulties in dealing with MOPs whose Pareto optimal solutions are sparse (i.e., most decision variables of the optimal solutions are zero), especially when the number of decision variables is large. Such large-scale sparse MOPs exist in a wide range of applications, for example, feature selection that aims to find a small subset of features from a large number of candidate features, or structure optimization of neural networks whose connections are sparse to alleviate overfitting. This paper proposes an evolutionary algorithm for solving large-scale sparse MOPs. The proposed algorithm suggests a new population initialization strategy and genetic operators by taking the sparse nature of the Pareto optimal solutions into consideration, to ensure the sparsity of the generated solutions. Moreover, this paper also designs a test suite to assess the performance of the proposed algorithm for large-scale sparse MOPs. The experimental results on the proposed test suite and four application examples demonstrate the superiority of the proposed algorithm over seven existing algorithms in solving large-scale sparse MOPs. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
14. Toward Efficient Design Space Exploration for Fault-Tolerant Multiprocessor Systems.
- Author
-
Yuan, Bo, Chen, Huanhuan, and Yao, Xin
- Subjects
NP-hard problems ,GLOBAL optimization ,EVOLUTIONARY algorithms ,PROCESS optimization ,PATTERNS (Mathematics) - Abstract
The design space exploration (DSE) of fault-tolerant multiprocessor systems is very complex, as it contains three interacting NP-hard problems: 1) task hardening; 2) task mapping; and 3) task scheduling. In addition, replication-based task hardening can introduce new tasks, called replicas, into the system, enlarging the design space further. As a population-based global optimization algorithm, evolutionary algorithms (EAs) have been widely used to explore this huge design space over the last decade. However, as analyzed in this paper, the search space of previous works is highly redundant, resulting in poor efficiency and scalability. This paper proposes an efficient EA-based DSE method for the design of large-scale fault-tolerant multiprocessor systems. The main novelties of this paper include: 1) mapping exploration is explicitly separated, i.e., task mapping is optimized during the evolutionary search, while replica mapping is constructed heuristically according to the current co-synthesis state; 2) the design space of task hardening and task mapping are explored independently by a cooperative co-EA; and 3) as a complement to global search of EA, problem-specific local search operators are designed for both task hardening and task mapping, reducing the number of fitness evaluations required. Compared with the most relevant state-of-the-art method, the superiority of the proposed method is demonstrated using extensive experiments on a large set of benchmarks, e.g., $1.75\times \sim 2.50\times $ better results can be obtained on the benchmarks of 300 tasks and 30 processors. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
15. Evolutionary Multitasking With Dynamic Resource Allocating Strategy.
- Author
-
Gong, Maoguo, Tang, Zedong, Li, Hao, and Zhang, Jun
- Subjects
COMPUTER multitasking ,EVOLUTIONARY algorithms ,BENCHMARK problems (Computer science) ,RESOURCE allocation ,ONLINE algorithms ,ADAPTIVE control systems - Abstract
Evolutionary multitasking is a recently proposed paradigm to simultaneously solve multiple tasks using a single population. Most of the existing evolutionary multitasking algorithms treat all tasks equally and then assign the same amount of resources to each task. However, when the resources are limited, it is difficult for some tasks to converge to acceptable solutions. This paper aims at investigating the resource allocation in the multitasking environment to efficiently utilize the restrictive resources. In this paper, we design a novel multitask evolutionary algorithm with an online dynamic resource allocation strategy. Specifically, the proposed dynamic resource allocation strategy allocates resources to each task adaptively according to the requirements of tasks. We also design an adaptive method to control the resources invested into cross-domain searching. The proposed algorithm is able to allocate the computational resources dynamically according to the computational complexities of tasks. The experimental results demonstrate the superiority of the proposed method in comparison with the state-of-the-art algorithms on benchmark problems of multitask optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
16. Effective Hot Rolling Batch Scheduling Algorithms in Compact Strip Production.
- Author
-
Chen, Qingda, Pan, Quanke, Zhang, Biao, Ding, Jingliang, and Li, Junqing
- Subjects
BEES algorithm ,HOT rolling ,BATCH processing ,METAHEURISTIC algorithms ,EVOLUTIONARY algorithms ,BEE colonies ,COMPUTER scheduling - Abstract
This paper studies a hot rolling batch scheduling problem in compact strip production (CSP), which is decomposed into a two-stage problem. The first stage is the strip combination problem aimed at determining the strip combination of each rolling turn and the number of rolling turns with the objective of minimizing the number of virtual strips, and the second is the strip allocation and sequencing problem aimed at optimizing the allocation and rolling sequence of the strips in each rolling turn. We first model this two-stage problem considering a set of production constraints and then design an optimal approach to solve the strip combination problem. Subsequently, we design an evolutionary algorithm (i.e., artificial bee colony algorithm) with a novel search strategy for employed bees, a dynamic strategy for onlooker bees, a variable neighborhood search strategy for a scout bee, and an enhanced strategy to solve the problem in the second stage. Computational experiments demonstrate the effectiveness of the proposed algorithms. Note to Practitioners—The hot rolling batch scheduling process is crucial in linking the casting and rolling processes of iron and steel productions. In the rolling batch scheduling problem of CSP, there is no buffer between the casting and rolling processes, and virtual strips must be added to satisfy production constraints. Most rolling batch scheduling methods do not consider the addition of virtual strips. In this paper, we mathematically characterize the hot rolling batch scheduling problem in CSP with flexible production constraints. We then show how the optimal approach and artificial bee colony algorithm are designed. Finally, the effectiveness of the proposed algorithms is demonstrated by comparisons with other well-known metaheuristic algorithms. This paper can be extended to other hot rolling batch scheduling problems with buffers and hybrid flowshop scheduling problems. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
17. Compensation Network Optimal Design Based on Evolutionary Algorithm for Inductive Power Transfer System.
- Author
-
Chen, Weiming, Lu, Weiguo, Iu, Herbert Ho-Ching, and Fernando, Tyrone
- Subjects
EVOLUTIONARY algorithms ,CURRENT fluctuations ,EVOLUTIONARY computation ,ALGORITHMS ,MATHEMATICAL models ,EXPERIMENTAL design - Abstract
Conventional design and optimization of passive compensation network (PCN) for inductive power transfer (IPT) system are based on specific topologies. The demerits of this design method are: i) The topology is mostly chosen by experience; ii) The design parameters are not multi-objective optimal. Aiming at these issues, this paper proposes an optimal PCN design scheme based on evolutionary algorithm (EA) to synchronously optimize the topology and parameters of PCN for IPT system. Firstly, a unified mathematical model of the PCN is presented and derived by transmission matrix. Then, according to the mathematical model, the multi-objective functions (such as output fluctuation and efficiency) as well as the constraints (such as load and coupling coefficient) for the optimal PCN design are established. The EA based multi-objective optimal PCN design algorithm is further constructed. Six optimal results are obtained using the algorithm, and one optimized PCN having minimum output current fluctuation and high-efficiency is chosen to validate the effectiveness of the proposed design scheme in experiment. For the given IPT system with the optimized PCN, the maximum fluctuation of output current is no more than 11%, within 200% of load variation and about 77% of coupling variation. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. Genetic Improvement of Software: A Comprehensive Survey.
- Author
-
Petke, Justyna, Haraldsson, Saemundur O., Harman, Mark, Langdon, William B., White, David R., and Woodward, John R.
- Subjects
EVOLUTIONARY algorithms ,COMPUTER software testing ,GENETIC programming ,SOFTWARE engineering ,EMPIRICAL research - Abstract
Genetic improvement (GI) uses automated search to find improved versions of existing software. We present a comprehensive survey of this nascent field of research with a focus on the core papers in the area published between 1995 and 2015. We identified core publications including empirical studies, 96% of which use evolutionary algorithms (genetic programming in particular). Although we can trace the foundations of GI back to the origins of computer science itself, our analysis reveals a significant upsurge in activity since 2012. GI has resulted in dramatic performance improvements for a diverse set of properties such as execution time, energy and memory consumption, as well as results for fixing and extending existing system functionality. Moreover, we present examples of research work that lies on the boundary between GI and other areas, such as program transformation, approximate computing, and software repair, with the intention of encouraging further exchange of ideas between researchers in these fields. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
19. Electricity Theft Detection in AMI With Low False Positive Rate Based on Deep Learning and Evolutionary Algorithm.
- Author
-
Gu, Dexi, Gao, Yunpeng, Chen, Kang, Shi, Junhao, Li, Yunfeng, and Cao, Yijia
- Subjects
MACHINE learning ,EVOLUTIONARY algorithms ,DEEP learning ,PARTICLE swarm optimization ,ELECTRICITY ,THEFT - Abstract
Due to the diversity of power consumption patterns, the false positive rate (FPR) of data-driven electricity theft detection (ETD) methods is too high to meet practical needs, which severely restricts the engineering application of data-based methods. To reduce FPR of ETD methods based on advanced metering infrastructure (AMI), a deep neural network with low FPR (LFPR-DNN) is proposed in this paper. First, a deep model is constructed based on one-dimensional convolution and residual network, which can automatically extract features from consumption data. Then, a two-stage training scheme is used to train the network. In the first stage, the conventional gradient descent algorithm is used to update the network weights. To minimize the impact of data imbalance on detection performance, focal loss is used. Besides, grid search is used to optimize the hyper-parameters of the model. In the second stage, with FPR as the optimization objective, the particle swarm optimization (PSO) algorithm is used to train the network. Finally, the proposed LFPR-DNN is verified by using the open Irish data set. Compared to other state-of-the-art classifiers, LFPR-DNN has the lowest FPR with 0.29% and the highest AUC with 99.42%. The FPR is reduced by an order of magnitude, which verifies the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
20. Multi-Objective Optimization of Interior Permanent Magnet Machine for Heavy-Duty Vehicle Direct-Drive Applications.
- Author
-
Ji, Jinghua, Yang, Yanjiao, Ling, Zhijian, and Zhao, Wenxiang
- Subjects
PERMANENT magnets ,MAGNETIC structure ,ELECTROMOTIVE force ,EVOLUTIONARY algorithms ,INTERIOR-point methods ,MACHINERY ,INDUCTION motors - Abstract
In this paper, an interior permanent magnet (IPM) machine is presented and optimized for heavy-duty vehicle direct-drive applications. Since efficiency decrease and serious heating come along with excessive core loss under flux weakening control, a rotor topology with the combination of the eccentricity structure and magnetic barriers is proposed. The key is to achieve the comprehensive optimization of the proposed rotor topology to satisfy the different requirements under diverse operating points. Then, a multi-objective automatic parallel optimization method is applied, which simultaneously analyzes multi-condition operation without weight coefficients defined artificially. The 3D Pareto solution set is generated by using nature inspired evolutionary algorithm based on the high-precision metal-modals of optimal prognosis, which reduce the needed computation cost significantly. Moreover, the back electromotive force total harmonic distortion, torque and core loss of the optimal machine are analyzed at corresponding operating points. Finally, the finite-element results are validated by experiments based on a prototype machine. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. A Hybrid Cooperative Method With Lévy Flights for Electric Vehicle Charge Scheduling.
- Author
-
Kalakanti, Arun Kumar and Rao, Shrisha
- Abstract
With the advent of electric vehicles (EVs), issues connected to the electric vehicle charging scheduling (EVCS) problem, which is $\textsf {NP}$ -hard, have become important. In previous studies, EVCS has been mainly formulated as a constrained shortest-path problem; however, such formulations have not involved variables such as charging rates, traffic congestion, scalability, and waiting time at charging station (CS), that need to be considered in practical settings. Earlier research has also tended to focus on the strengths of particular evolutionary optimization algorithms like differential evolution (DE) or particle swarm optimization (PSO) over others or traditional mathematical programming methods, with only a limited study of hybrid approaches. In this paper, fast and slow charging options at a station are considered in the EVCS problem for practical use. In previous studies, EVs have been considered to have fixed speeds; however, in order to mitigate CS congestion and thus waiting times at CSs, dynamic speed control of EVs has been considered in this work. This work also investigates the scalability of different EVCS solutions. A hybrid approach using PSO and the Firefly algorithm (FFA) with a Lévy flights search strategy is designed and implemented to solve the EVCS. Also, different hybrid methods variants of PSO and FFA have been evaluated in this paper to find the best performing hybrid variant. Experimental results validate the effectiveness of our approach on both synthetic and the real-world transportation networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. Multitasking Multiobjective Evolutionary Operational Indices Optimization of Beneficiation Processes.
- Author
-
Yang, Cuie, Ding, Jinliang, Jin, Yaochu, Wang, Chengzhi, and Chai, Tianyou
- Subjects
COMPUTER multitasking ,PROCESS optimization ,ASSORTATIVE mating ,GLOBAL optimization ,KNOWLEDGE transfer ,EVOLUTIONARY algorithms - Abstract
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]
- Published
- 2019
- Full Text
- View/download PDF
23. Multiobjective Infill Criterion Driven Gaussian Process-Assisted Particle Swarm Optimization of High-Dimensional Expensive Problems.
- Author
-
Tian, Jie, Tan, Ying, Zeng, Jianchao, Sun, Chaoli, and Jin, Yaochu
- Subjects
MATHEMATICAL optimization ,PARTICLE swarm optimization ,GAUSSIAN processes ,EVOLUTIONARY algorithms ,SOCIAL learning ,BENCHMARK problems (Computer science) - Abstract
Model management plays an essential role in surrogate-assisted evolutionary optimization of expensive problems, since the strategy for selecting individuals for fitness evaluation using the real objective function has substantial influences on the final performance. Among many others, infill criterion driven Gaussian process (GP)-assisted evolutionary algorithms have been demonstrated competitive for optimization of problems with up to 50 decision variables. In this paper, a multiobjective infill criterion (MIC) that considers the approximated fitness and the approximation uncertainty as two objectives is proposed for a GP-assisted social learning particle swarm optimization algorithm. The MIC uses nondominated sorting for model management, thereby avoiding combining the approximated fitness and the approximation uncertainty into a scalar function, which is shown to be particularly important for high-dimensional problems, where the estimated uncertainty becomes less reliable. Empirical studies on 50-D and 100-D benchmark problems and a synthetic problem constructed from four real-world optimization problems demonstrate that the proposed MIC is more effective than existing scalar infill criteria for GP-assisted optimization given a limited computational budget. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
24. A Taxonomy for Metamodeling Frameworks for Evolutionary Multiobjective Optimization.
- Author
-
Deb, Kalyanmoy, Hussein, Rayan, Roy, Proteek Chandan, and Toscano-Pulido, Gregorio
- Subjects
METAL-organic frameworks ,MATHEMATICAL optimization ,PARETO analysis ,EVOLUTIONARY algorithms ,NUMERICAL analysis - Abstract
One of the main difficulties in applying an optimization algorithm to a practical problem is that evaluation of objectives and constraints often involve computationally expensive procedures. To handle such problems, a metamodel is first formed from a few exact (high-fidelity) solution evaluations and then optimized by an algorithm in a progressive manner. However, in solving multiobjective or many-objective optimization problems involving multiple constraints, a simple extension of the idea to form one metamodel for each objective and constraint function may not constitute the most efficient approach. The cumulative effect of errors from each metamodel may turn out to be detrimental for the accuracy of the overall optimization procedure. In this paper, we propose a taxonomy of different plausible metamodeling frameworks for multiobjective and many-objective optimization and provide a comparative study by discussing advantages and disadvantages of each framework. The results presented in this paper are obtained using the well-known Kriging metamodeling approach. Based on our extensive simulation studies on proposed frameworks, we report intriguing observations about the behavior of each framework, which may provide salient guidelines for further studies in this emerging area within evolutionary multiobjective optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
25. Generalized Multitasking for Evolutionary Optimization of Expensive Problems.
- Author
-
Ding, Jinliang, Yang, Cuie, Jin, Yaochu, and Chai, Tianyou
- Subjects
COMPUTER multitasking ,TASK performance ,MATHEMATICAL optimization ,EVOLUTIONARY algorithms ,DECISION making ,COMPUTER simulation - Abstract
Conventional evolutionary algorithms (EAs) are not well suited for solving expensive optimization problems due to the fact that they often require a large number of fitness evaluations to obtain acceptable solutions. To alleviate the difficulty, this paper presents a multitasking evolutionary optimization framework for solving computationally expensive problems. In the framework, knowledge is transferred from a number of computationally cheap optimization problems to help the solution of the expensive problem on the basis of the recently proposed multifactorial EA (MFEA), leading to a faster convergence of the expensive problem. However, existing MFEAs do not work well in solving multitasking problems whose optimums do not lie in the same location or when the dimensions of the decision space are not the same. To address the above issues, the existing MFEA is generalized by proposing two strategies, one for decision variable translation and the other for decision variable shuffling, to facilitate knowledge transfer between optimization problems having different locations of the optimums and different numbers of decision variables. To assess the effectiveness of the generalized MFEA (G-MFEA), empirical studies have been conducted on eight multitasking instances and eight test problems for expensive optimization. The experimental results demonstrate that the proposed G-MFEA works more efficiently for multitasking optimization and successfully accelerates the convergence of expensive optimization problems compared to single-task optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
26. Handling Multiple Scenarios in Evolutionary Multiobjective Numerical Optimization.
- Author
-
Deb, Kalyanmoy, Zhu, Ling, and Kulkarni, Sandeep
- Subjects
EVOLUTIONARY algorithms ,MATHEMATICAL optimization ,CONJOINT analysis ,NUMERICAL analysis ,PERFORMANCE evaluation - Abstract
Solutions to most practical numerical optimization problems must be evaluated for their performance over a number of different loading or operating conditions, which we refer here as scenarios. Therefore, a meaningful and resilient optimal solution must be such that it remains feasible under all scenarios and performs close to an individual optimal solution corresponding to each scenario. Despite its practical importance, multiscenario consideration has received a lukewarm attention, particularly in the context of multiobjective optimization. The usual practice is to optimize for the worst-case scenario. In this paper, we review existing methodologies in this direction and set our goal to suggest a new and potential population-based method for handling multiple scenarios by defining scenario-wise domination principle and scenario-wise diversity-preserving operators. To evaluate, the proposed method is applied to a number of numerical test problems and engineering design problems with a detail explanation of the obtained results and compared with an existing method. This first systematic evolutionary-based multiscenario, multiobjective optimization study on numerical problems indicates that multiple scenarios can be handled in an integrated manner using an evolutionary multiobjective optimization framework to find a well-balanced compromise set of solutions to multiple scenarios and maintain a tradeoff among multiple objectives. In comparison to an existing serial multiple optimization approach, the proposed approach finds a set of compromised tradeoff solutions simultaneously. An achievement of multiobjective tradeoff and multiscenario tradeoff is algorithmically challenging, but due to its practical appeal, further research and application must be spent. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
27. Optimized Smart Grid Energy Procurement for LTE Networks Using Evolutionary Algorithms.
- Author
-
Ghazzai, Hakim, Yaacoub, Elias, Alouini, Mohamed-Slim, and Abu-Dayya, Adnan
- Subjects
SMART power grids ,LONG-Term Evolution (Telecommunications) ,EVOLUTIONARY algorithms ,ENERGY consumption ,GREENHOUSE gases & the environment ,EMISSIONS (Air pollution) ,WIRELESS sensor networks - Abstract
Energy efficiency aspects in cellular networks can contribute significantly to reducing worldwide greenhouse gas emissions. The base station (BS) sleeping strategy has become a well-known technique to achieve energy savings by switching off redundant BSs mainly for lightly loaded networks. Moreover, introducing renewable energy as an alternative power source has become a real challenge among network operators. In this paper, we formulate an optimization problem that aims to maximize the profit of Long-Term Evolution (LTE) cellular operators and to simultaneously minimize the \CO2 emissions in green wireless cellular networks without affecting the desired quality of service (QoS). The BS sleeping strategy lends itself to an interesting implementation using several heuristic approaches, such as the genetic (GA) and particle swarm optimization (PSO) algorithms. In this paper, we propose GA-based and PSO-based methods that reduce the energy consumption of BSs by not only shutting down underutilized BSs but by optimizing the amounts of energy procured from different retailers (renewable energy and electricity retailers), as well. A comparison with another previously proposed algorithm is also carried out to evaluate the performance and the computational complexity of the employed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
28. Value Function Discovery in Markov Decision Processes With Evolutionary Algorithms.
- Author
-
Onderwater, Martijn, Bhulai, Sandjai, and van der Mei, Rob
- Subjects
PARTIALLY observable Markov decision processes ,EVOLUTIONARY algorithms ,CYBERNETICS - Abstract
In this paper, we introduce a novel method for the discovery of value functions for Markov decision processes (MDPs). This method, which we call value function discovery (VFD), is based on ideas from the evolutionary algorithm field. VFDs key feature is that it discovers descriptions of value functions that are algebraic in nature. This feature is unique, because the descriptions include the model parameters of the MDP. The algebraic expression of the value function discovered by VFD can be used in several scenarios, e.g., conversion to a policy (with one-step policy improvement) or control of systems with time-varying parameters. The work in this paper is a first step toward exploring potential usage scenarios of discovered value functions. We give a detailed description of VFD and illustrate its application on an example MDP. For this MDP, we let VFD discover an algebraic description of a value function that closely resembles the optimal value function. The discovered value function is then used to obtain a policy, which we compare numerically to the optimal policy of the MDP. The resulting policy shows near-optimal performance on a wide range of model parameters. Finally, we identify and discuss future application scenarios of discovered value functions. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
29. The 2014 General Video Game Playing Competition.
- Author
-
Perez-Liebana, Diego, Samothrakis, Spyridon, Togelius, Julian, Schaul, Tom, Lucas, Simon M., Couetoux, Adrien, Lee, Jerry, Lim, Chong-U, and Thompson, Tommy
- Abstract
This paper presents the framework, rules, games, controllers, and results of the first General Video Game Playing Competition, held at the IEEE Conference on Computational Intelligence and Games in 2014. The competition proposes the challenge of creating controllers for general video game play, where a single agent must be able to play many different games, some of them unknown to the participants at the time of submitting their entries. This test can be seen as an approximation of general artificial intelligence, as the amount of game-dependent heuristics needs to be severely limited. The games employed are stochastic real-time scenarios (where the time budget to provide the next action is measured in milliseconds) with different winning conditions, scoring mechanisms, sprite types, and available actions for the player. It is a responsibility of the agents to discover the mechanics of each game, the requirements to obtain a high score and the requisites to finally achieve victory. This paper describes all controllers submitted to the competition, with an in-depth description of four of them by their authors, including the winner and the runner-up entries of the contest. The paper also analyzes the performance of the different approaches submitted, and finally proposes future tracks for the competition. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
30. An Efficient Bayesian Optimization Approach for Automated Optimization of Analog Circuits.
- Author
-
Lyu, Wenlong, Xue, Pan, Yang, Fan, Yan, Changhao, Hong, Zhiliang, Zeng, Xuan, and Zhou, Dian
- Subjects
MATHEMATICAL optimization ,BAYESIAN analysis ,EVOLUTIONARY algorithms - Abstract
The computation-intensive circuit simulation makes the analog circuit sizing challenging for large-scale/complicated analog/RF circuits. A Bayesian optimization approach has been proposed recently for the optimization problems involving the evaluations of black-box functions with high computational cost in either objective functions or constraints. In this paper, we propose a weighted expected improvement-based Bayesian optimization approach for automated analog circuit sizing. Gaussian processes (GP) are used as the online surrogate models for circuit performances. Expected improvement is selected as the acquisition function to balance the exploration and exploitation during the optimization procedure. The expected improvement is weighted by the probability of satisfying the constraints. In this paper, we propose a complete Bayesian optimization framework for the optimization of analog circuits with constraints for the first time. The existing GP model-based optimization methods for analog circuits take the GP models as either offline models or as assistance for the evolutionary algorithms. We also extend the Bayesian optimization algorithm to handle multi-objective optimization problems. Compared with the state-of-the-art approaches listed in this paper, the proposed Bayesian optimization method achieves better optimization results with significantly less number of simulations. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
31. Information for Authors.
- Subjects
FUZZY systems ,FUZZY sets ,EVOLUTIONARY algorithms - Published
- 2017
- Full Text
- View/download PDF
32. Tri-Goal Evolution Framework for Constrained Many-Objective Optimization.
- Author
-
Zhou, Yalan, Zhu, Min, Wang, Jiahai, Zhang, Zizhen, Xiang, Yi, and Zhang, Jun
- Subjects
CONSTRAINED optimization ,EVOLUTIONARY algorithms ,LINEAR programming ,EVOLUTIONARY computation - Abstract
It is generally accepted that the essential goal of many-objective optimization is the balance between convergence and diversity. For constrained many-objective optimization problems (CMaOPs), the feasibility of solutions should be considered as well. Then the real challenge of constrained many-objective optimization can be generalized to the balance among convergence, diversity, and feasibility. In this paper, a tri-goal evolution framework is proposed for CMaOPs. The proposed framework carefully designs two indicators for convergence and diversity, respectively, and converts the constraints into the third indicator for feasibility. Since the essential goal of constrained many-objective optimization is to balance convergence, diversity, and feasibility, the philosophy of the proposed framework matches the essential goal of constrained many-objective optimization well. Thus, it is natural to use the proposed framework to deal with CMaOPs. Further, the proposed framework is conceptually simple and easy to instantiate for constrained many-objective optimization. A variety of balance schemes and ranking methods can be used to achieve the balance among convergence, diversity and feasibility. Three typical instantiations of the proposed framework are then designed. Experimental results on a constrained many-objective optimization test suite show that the proposed framework is highly competitive with existing state-of-the-art constrained many-objective evolutionary algorithms for CMaOPs. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
33. Offline Data-Driven Multiobjective Optimization: Knowledge Transfer Between Surrogates and Generation of Final Solutions.
- Author
-
Yang, Cuie, Ding, Jinliang, Jin, Yaochu, and Chai, Tianyou
- Subjects
KNOWLEDGE transfer ,EVOLUTIONARY algorithms ,TARDINESS ,BENCHMARK problems (Computer science) ,EVOLUTIONARY computation ,TASK analysis ,GROUP process - Abstract
In offline data-driven optimization, only historical data is available for optimization, making it impossible to validate the obtained solutions during the optimization. To address these difficulties, this paper proposes an evolutionary algorithm assisted by two surrogates, one coarse model and one fine model. The coarse surrogate (CS) aims to guide the algorithm to quickly find a promising subregion in the search space, whereas the fine one focuses on leveraging good solutions according to the knowledge transferred from the CS. Since the obtained Pareto optimal solutions have not been validated using the real fitness function, a technique for generating the final optimal solutions is suggested. All achieved solutions during the whole optimization process are grouped into a number of clusters according to a set of reference vectors. Then, the solutions in each cluster are averaged and outputted as the final solution of that cluster. The proposed algorithm is compared with its three variants and two state-of-the-art offline data-driven multiobjective algorithms on eight benchmark problems to demonstrate its effectiveness. Finally, the proposed algorithm is successfully applied to an operational indices optimization problem in beneficiation processes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
34. Multiobjective Optimization of a Tubular Coreless LPMSM Based on Adaptive Multiobjective Black Hole Algorithm.
- Author
-
Wu, Tao, Feng, Zhenan, Wu, Chong, Lei, Gang, Guo, Youguang, Zhu, Jianguo, and Wang, Xinmei
- Subjects
PERMANENT magnet motors ,EVOLUTIONARY algorithms ,PERMANENT magnets ,FINITE element method ,ALGORITHMS ,SPACE trajectories ,BLACK holes - Abstract
In most multiobjective optimization problems of electrical machines, the weighted function method is used to convert them into single-objective optimization problems. This paper applies a kind of new multiobjective evolutionary algorithms (MOEAs), called adaptive multiobjective black hole (AMOBH) algorithms, to achieve effective multiobjective optimization of a tubular coreless linear permanent magnet synchronous motor (LPMSM). To reduce the computation cost of the MOEAs, a one-layer analytical model (AM) is presented for the tubular coreless LPMSM in this paper. The accuracy of the simplified one-layer AM is verified by comparisons with multilayer AM and finite element analysis (FEA) under different structure parameters. It is found that the simplified AM has good accuracy and can decrease the computation cost significantly. AMOBH algorithm is subsequently introduced. The optimal Pareto front with regard to thrust, copper loss, and permanent magnet volume are analyzed, and more diversified optimization results are provided. The final Pareto solution can be selected directly by practical physical values according to the application requirements. Finally, a prototype is fabricated for the selected design; its experimental results are provided and compared with those of the FEA results. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
35. Evolutionary Collaborative Human-UAV Search for Escaped Criminals.
- Author
-
Zheng, Yu-Jun, Du, Yi-Chen, Ling, Hai-Feng, Sheng, Wei-Guo, and Chen, Sheng-Yong
- Subjects
EVOLUTIONARY algorithms ,CRIMINALS - Abstract
The use of unmanned aerial vehicles (UAVs) for target searching in complex environments has increased considerably in recent years. The numerous studies on UAV search methods have been reported, but few have been conducted on collaborative human-UAV search which is common in many applications. In this paper, we present a problem of collaborative human-UAV search for escaped criminals, the aim of which is to minimize the expected time of capture rather than detection. We show that our problem is much more complex than the problem of pure UAV search. The difficulty of our problem is further increased by the fact that criminals will attempt to avoid detection and capture. To solve the problem, we propose a hybrid evolutionary algorithm (EA) that uses three evolutionary operators, namely, comprehensive learning, variable mutation, and local search, to efficiently explore the solution space. The experimental results demonstrate that the proposed method outperforms some well-known EAs and other popular UAV search methods on test instances. An application of our method to a real-world operation took 311 min to capture a criminal who had escaped for over three days, validating its practicability and performance advantage. This paper provides a good basis for promoting the application of EAs to a wider class of man–machine collaboration scheduling problems. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
36. Efficient Generalized Surrogate-Assisted Evolutionary Algorithm for High-Dimensional Expensive Problems.
- Author
-
Cai, Xiwen, Gao, Liang, and Li, Xinyu
- Subjects
HIGH-dimensional model representation ,BENCHMARK problems (Computer science) ,GENETIC algorithms ,MATHEMATICAL optimization ,EVOLUTIONARY computation ,PARALLEL algorithms ,EVOLUTIONARY algorithms - Abstract
Engineering optimization problems usually involve computationally expensive simulations and many design variables. Solving such problems in an efficient manner is still a major challenge. In this paper, a generalized surrogate-assisted evolutionary algorithm is proposed to solve such high-dimensional expensive problems. The proposed algorithm is based on the optimization framework of the genetic algorithm (GA). This algorithm proposes to use a surrogate-based trust region local search method, a surrogate-guided GA (SGA) updating mechanism with a neighbor region partition strategy and a prescreening strategy based on the expected improvement infilling criterion of a simplified Kriging in the optimization process. The SGA updating mechanism is a special characteristic of the proposed algorithm. This mechanism makes a fusion between surrogates and the evolutionary algorithm. The neighbor region partition strategy effectively retains the diversity of the population. Moreover, multiple surrogates used in the SGA updating mechanism make the proposed algorithm optimize robustly. The proposed algorithm is validated by testing several high-dimensional numerical benchmark problems with dimensions varying from 30 to 100, and an overall comparison is made between the proposed algorithm and other optimization algorithms. The results show that the proposed algorithm is very efficient and promising for optimizing high-dimensional expensive problems. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
37. Solving Nonlinear Equations System With Dynamic Repulsion-Based Evolutionary Algorithms.
- Author
-
Liao, Zuowen, Gong, Wenyin, Yan, Xuesong, Wang, Ling, and Hu, Chengyu
- Subjects
NONLINEAR equations ,EVOLUTIONARY algorithms ,PARTICLE swarm optimization ,DIFFERENTIAL evolution ,DYNAMICAL systems ,RADIUS (Geometry) ,EVOLUTIONARY computation - Abstract
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]
- Published
- 2020
- Full Text
- View/download PDF
38. Automatic Niching Differential Evolution With Contour Prediction Approach for Multimodal Optimization Problems.
- Author
-
Wang, Zi-Jia, Zhan, Zhi-Hui, Lin, Ying, Yu, Wei-Jie, Wang, Hua, Kwong, Sam, and Zhang, Jun
- Subjects
DIFFERENTIAL evolution ,ALGORITHMS ,EVOLUTIONARY algorithms ,TECHNOLOGY convergence - Abstract
Niching techniques have been widely incorporated into evolutionary algorithms (EAs) for solving multimodal optimization problems (MMOPs). However, most of the existing niching techniques are either sensitive to the niching parameters or require extra fitness evaluations (FEs) to maintain the niche detection accuracy. In this paper, we propose a new automatic niching technique based on the affinity propagation clustering (APC) and design a novel niching differential evolution (DE) algorithm, termed as automatic niching DE (ANDE), for solving MMOPs. In the proposed ANDE algorithm, APC acts as a parameter-free automatic niching method that does not need to predefine the number of clusters or the cluster size. Also, it can facilitate locating multiple peaks without extra FEs. Furthermore, the ANDE algorithm is enhanced by a contour prediction approach (CPA) and a two-level local search (TLLS) strategy. First, the CPA is a predictive search strategy. It exploits the individual distribution information in each niche to estimate the contour landscape, and then predicts the rough position of the potential peak to help accelerate the convergence speed. Second, the TLLS is a solution refine strategy to further increase the solution accuracy after the CPA roughly predicting the peaks. Compared with the other state-of-the-art DE and non-DE multimodal algorithms, even the winner of competition on multimodal optimization, the experimental results on 20 widely used benchmark functions illustrate the superiority of the proposed ANDE algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
39. A Novel Hybrid Neural Network-Based Multirobot Path Planning With Motion Coordination.
- Author
-
Pradhan, Buddhadeb, Nandi, Arijit, Hui, Nirmal Baran, Roy, Diptendu Sinha, and C. Rodrigues, Joel J. P.
- Subjects
POTENTIAL field method (Robotics) ,PARTICLE swarm optimization ,ARTIFICIAL neural networks ,MULTIAGENT systems ,ROBOT motion ,EVOLUTIONARY algorithms - Abstract
Multi-robot navigation is a challenging task, especially for many robots, since individual gains may more often than not adversely affect the global gain. This paper investigates the problem of multiple robots moving towards individual goals within a common workspace whereas the motion of every individual robot is deduced by a novel Particle Swarm Optimization (PSO) tuned Feed Forward Neural Network (FFNN). Motion coordination among the robots is implemented using a cooperative coordination algorithm that identifies critical robots and maintains cooperation count while actuating deviation in select robots. The contribution of this paper is twofold; firstly in hybridizing the Artificial Neural Network(ANN) by employing PSO, an evolutionary algorithm, to find optimal values of deviation for every critical robot using velocity and acceleration constraints, secondly ensuing the convergence of the PSO by carrying first and second order stability analysis. Experiments have been carried out to evaluate and validate the efficacy of the proposed coordination schemes by changing the number of robots under hundred different scenarios each, and the founded results demonstrate the efficacy of the proposed schemes. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
40. MOELS: Multiobjective Evolutionary List Scheduling for Cloud Workflows.
- Author
-
Wu, Quanwang, Zhou, MengChu, Zhu, Qingsheng, Xia, Yunni, and Wen, Junhao
- Subjects
GENETIC programming ,EVOLUTIONARY algorithms ,WORKFLOW management systems ,HEURISTIC algorithms ,CLOUD computing ,WORKFLOW management - Abstract
Cloud computing has nowadays become a dominant technology to reduce the computation cost by elastically providing resources to users on a pay-per-use basis. More and more scientific and business applications represented by workflows have been moved or are in active transition to cloud platforms. Therefore, efficient cloud workflow scheduling methods are in high demand. This paper investigates how to simultaneously optimize makespan and economical cost for workflow scheduling in clouds and proposes a multiobjective evolutionary list scheduling (MOELS) algorithm to address it. It embeds the classic list scheduling into a powerful multiobjective evolutionary algorithm (MOEA): a genome is represented by a scheduling sequence and a preference weight and is interpreted to a scheduling solution via a specifically designed list scheduling heuristic, and the genomes in the population are evolved through tailored genetic operators. The simulation experiments with the real-world data show that MOELS outperforms some state-of-the-art methods as it can always achieve a higher hypervolume (HV) value. Note to Practitioners—This paper describes a novel method called MOELS for minimizing both costs and makespan when deploying a workflow into a cloud datacenter. MOELS seamlessly combines a list scheduling heuristic and an evolutionary algorithm to have complementary advantages. It is compared with two state-of-the-art algorithms MOHEFT (multiobjective heterogeneous earliest finish time) and EMS-C (evolutionary multiobjective scheduling for cloud) in the simulation experiments. The results show that the average hypervolume value from MOELS is 3.42% higher than that of MOHEFT, and 2.27% higher than that of EMS-C. The runtime that MOELS requires rises moderately as a workflow size increases. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
41. A Sparse Spectral Clustering Framework via Multiobjective Evolutionary Algorithm.
- Author
-
Luo, Juanjuan, Jiao, Licheng, and Lozano, Jose A.
- Subjects
EVOLUTIONARY algorithms ,EVOLUTIONARY computation ,MATHEMATICAL optimization ,PARETO analysis ,MATRICES (Mathematics) - Abstract
This paper introduces sparse representation into spectral clustering and provides a sparse spectral clustering framework via a multiobjective evolutionary algorithm. In contrast to conventional spectral clustering, the main contribution of this paper is to construct the similarity matrix using a sparse representation approach by modeling spectral clustering as a constrained multiobjective optimization problem. Specific operators are designed to obtain a set of high quality solutions in the optimization process. Furthermore, we design a method to select a tradeoff solution from the Pareto front using a measurement called ratio cut based on an adjacency matrix constructed by all the nondominated solutions. We also extend the framework to the semi-supervised clustering field by using the semi-supervised information brought by the labeled samples to set some constraints or to guide the searching process. Experiments on commonly used datasets show that our approach outperforms four well-known similarity matrix construction methods in spectral clustering, and one multiobjective clustering algorithm. A practical application in image segmentation also demonstrates the efficiency of the proposed algorithm. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
42. Accelerating Large-Scale Multiobjective Optimization via Problem Reformulation.
- Author
-
He, Cheng, Li, Lianghao, Tian, Ye, Zhang, Xingyi, Cheng, Ran, Jin, Yaochu, and Yao, Xin
- Subjects
EVOLUTIONARY algorithms ,EVOLUTIONARY computation ,DIFFERENTIAL evolution ,ALGORITHMS - Abstract
In this paper, we propose a framework to accelerate the computational efficiency of evolutionary algorithms on large-scale multiobjective optimization. The main idea is to track the Pareto optimal set (PS) directly via problem reformulation. To begin with, the algorithm obtains a set of reference directions in the decision space and associates them with a set of weight variables for locating the PS. Afterwards, the original large-scale multiobjective optimization problem is reformulated into a low-dimensional single-objective optimization problem. In the reformulated problem, the decision space is reconstructed by the weight variables and the objective space is reduced by an indicator function. Thanks to the low dimensionality of the weight variables and reduced objective space, a set of quasi-optimal solutions can be obtained efficiently. Finally, a multiobjective evolutionary algorithm is used to spread the quasi-optimal solutions over the approximate Pareto optimal front evenly. Experiments have been conducted on a variety of large-scale multiobjective problems with up to 5000 decision variables. Four different types of representative algorithms are embedded into the proposed framework and compared with their original versions, respectively. Furthermore, the proposed framework has been compared with two state-of-the-art algorithms for large-scale multiobjective optimization. The experimental results have demonstrated the significant improvement benefited from the framework in terms of its performance and computational efficiency in large-scale multiobjective optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
43. Analytical and Evolutionary Methods for Finding Cut Volumes in Fault Trees Constrained by Location.
- Author
-
Hanes, Jeff and Wiegand, R. Paul
- Subjects
FAULT trees (Reliability engineering) ,SINGLE event effects ,EVOLUTIONARY algorithms ,SYSTEM failures ,FAULT location (Engineering) - Abstract
Fault tree analysis (FTA) is used to find and mitigate vulnerabilities in a system based on its constituent components. Methods exist to efficiently find minimal cut sets (MCSs), which are combinations of components whose failure causes the system to fail. However, traditional FTA ignores the physical location of the components. Components that are close to each other could be defeated by a single event with a radius of effect, such as an explosion or fire. This motivates the search for techniques to identify such vulnerabilities. Adding physical locations to the fault tree structure can help identify vulnerabilities in the overall system. Using this information requires extending existing solution methods or developing entirely new methods. In this paper, two solution approaches were explored. The first executes traditional FTA software, then searches for clusters in the resulting MCS to find these vulnerabilities. The second uses an evolutionary algorithm to search directly for volumes containing components that form cut sets. Results show that the evolutionary approach provided better answers (i.e., smaller volumes) overall and is suitable to identify vulnerabilities caused by proximity of components. However, the cluster approach performed well when evaluating higher numbers of locations and may be suitable in specific situations. Potential refinements to both methods are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
44. A Novel Evolutionary Sampling Assisted Optimization Method for High-Dimensional Expensive Problems.
- Author
-
Wang, Xinjing, Wang, G. Gary, Song, Baowei, Wang, Peng, and Wang, Yang
- Subjects
EVOLUTIONARY algorithms ,DIFFERENTIAL evolution ,PARTICLE swarm optimization ,AEROFOILS - Abstract
Surrogate-assisted evolutionary algorithms (SAEAs) are promising methods for solving high-dimensional expensive problems. The basic idea of SAEAs is the integration of nature-inspired searching ability of evolutionary algorithms and prediction ability of surrogate models. This paper proposes a novel evolutionary sampling assisted optimization (ESAO) method which combines the two abilities to consider global exploration and local exploitation. Differential evolution is employed to generate offspring using mutation and crossover operators. A global radial basis functions surrogate model is built for prescreening of the offspring’s objective function values and identifying the best one, which will be evaluated with the true function. The best offspring will replace its parent’s position in the population if its function value is smaller than that of its parent. A local surrogate model is then built with selected current best solutions. An optimizer is applied to find the optimum of the local model. The optimal solution is then evaluated with the true function. Besides, a better point found in the local search will be added into the population in the global search. Global and local searches will alternate if one search cannot lead to a better solution. Comprehensive analysis is conducted to study the mechanism of ESAO and insights are gained on different local surrogates. The proposed algorithm is compared with two state-of-the-art SAEAs on a series of high-dimensional problems and results show that ESAO behaves better both in effectiveness and robustness on most of the test problems. Besides, ESAO is applied to an airfoil optimization problem to show its effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
45. A Cooperative Co-Evolutionary Approach to Large-Scale Multisource Water Distribution Network Optimization.
- Author
-
Chen, Wei-Neng, Jia, Ya-Hui, Zhao, Feng, Luo, Xiao-Nan, Jia, Xing-Dong, and Zhang, Jun
- Subjects
WATER distribution ,DECOMPOSITION method ,DRINKING water ,EVOLUTIONARY algorithms ,INFORMATION design ,WATER supply - Abstract
Potable water distribution networks (WDNs) are important infrastructures of modern cities. A good design of the network can not only reduce the construction expenditure but also provide reliable service. Nowadays, the scale of the WDN of a city grows dramatically along with the city expansion, which brings heavy pressure to its optimal design. In order to solve the large-scale WDN optimization problem, a cooperative co-evolutionary algorithm is proposed in this paper. First, an iterative trace-based decomposition method is specially designed by utilizing the information of water tracing to divide a large-scale network into small subnetworks. Since little domain knowledge is required, the decomposition method has great adaptability to multiform networks. Meanwhile, during optimization, the proposed algorithm can gradually refine the decomposition to make it more accurate. Second, a new fitness function is devised to handle the pressure constraint of the problem. The function transforms the constraint into a part of the objective to punish the infeasible solutions. Finally, a new suite of benchmark networks are created with both balanced and imbalanced cases. Experimental results on a widely used real network and the benchmark networks show that the proposed algorithm is promising. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
46. A New Two-Stage Evolutionary Algorithm for Many-Objective Optimization.
- Author
-
Sun, Yanan, Xue, Bing, Zhang, Mengjie, and Yen, Gary G.
- Subjects
EVOLUTIONARY algorithms ,MATHEMATICAL optimization ,BENCHMARK problems (Computer science) ,EVOLUTIONARY computation ,GENETIC algorithms ,HEURISTIC algorithms ,ALGORITHMS - Abstract
Convergence and diversity are interdependently handled during the evolutionary process by most existing many-objective evolutionary algorithms (MaOEAs). In such a design, the degraded performance of one would deteriorate the other, and only solutions with both are able to improve the performance of MaOEAs. Unfortunately, it is not easy to constantly maintain a population of solutions with both convergence and diversity. In this paper, an MaOEA based on two independent stages is proposed for effectively solving many-objective optimization problems (MaOPs), where the convergence and diversity are addressed in two independent and sequential stages. To achieve this, we first propose a nondominated dynamic weight aggregation method by using a genetic algorithm, which is capable of finding the Pareto-optimal solutions for MaOPs with concave, convex, linear and even mixed Pareto front shapes, and then these solutions are employed to learn the Pareto-optimal subspace for the convergence. Afterward, the diversity is addressed by solving a set of single-objective optimization problems with reference lines within the learned Pareto-optimal subspace. To evaluate the performance of the proposed algorithm, a series of experiments are conducted against six state-of-the-art MaOEAs on benchmark test problems. The results show the significantly improved performance of the proposed algorithm over the peer competitors. In addition, the proposed algorithm can focus directly on a chosen part of the objective space if the preference area is known beforehand. Furthermore, the proposed algorithm can also be used to effectively find the nadir points. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
47. A Hybrid Swarm-Based Approach to University Timetabling.
- Author
-
Fong, Cheng Weng, Asmuni, Hishammuddin, and McCollum, Barry
- Subjects
BEES algorithm ,EVOLUTIONARY algorithms ,STOCHASTIC convergence ,MATHEMATICAL optimization ,METAHEURISTIC algorithms - Abstract
This paper is concerned with the application of an automated hybrid approach in addressing the university timetabling problem. The approach described is based on the nature-inspired artificial bee colony (ABC) algorithm. An ABC algorithm is a biologically-inspired optimization approach, which has been widely implemented in solving a range of optimization problems in recent years such as job shop scheduling and machine timetabling problems. Although the approach has proven to be robust across a range of problems, it is acknowledged within the literature that there currently exist a number of inefficiencies regarding the exploration and exploitation abilities. These inefficiencies can often lead to a slow convergence speed within the search process. Hence, this paper introduces a variant of the algorithm which utilizes a global best model inspired from particle swarm optimization to enhance the global exploration ability while hybridizing with the great deluge (GD) algorithm in order to improve the local exploitation ability. Using this approach, an effective balance between exploration and exploitation is attained. In addition, a traditional local search approach is incorporated within the GD algorithm with the aim of further enhancing the performance of the overall hybrid method. To evaluate the performance of the proposed approach, two diverse university timetabling datasets are investigated, i.e., Carter’s examination timetabling and Socha course timetabling datasets. It should be noted that both problems have differing complexity and different solution landscapes. Experimental results demonstrate that the proposed method is capable of producing high quality solutions across both these benchmark problems, showing a good degree of generality in the approach. Moreover, the proposed method produces best results on some instances as compared with other approaches presented in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
48. Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee.
- Author
-
Qian, Chao, Shi, Jing-Cheng, Tang, Ke, and Zhou, Zhi-Hua
- Subjects
EVOLUTIONARY algorithms ,GREEDY algorithms ,MATHEMATICAL optimization ,GENERALIZATION ,SOCIAL networks - Abstract
The problem of maximizing monotone ${k}$ -submodular functions under a size constraint arises in many applications, and it is NP-hard. In this paper, we propose a new approach which employs a multiobjective evolutionary algorithm to maximize the given objective and minimize the size simultaneously. For general cases, we prove that the proposed method can obtain the asymptotically tight approximation guarantee, which was also achieved by the greedy algorithm. Moreover, we further give instances where the proposed approach performs better than the greedy algorithm on applications of influence maximization, information coverage maximization, and sensor placement. Experimental results on real-world data sets exhibit the superior performance of the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
49. An Improved and More Scalable Evolutionary Approach to Multiobjective Clustering.
- Author
-
Garza-Fabre, Mario, Handl, Julia, and Knowles, Joshua
- Subjects
DATA mining ,EVOLUTIONARY algorithms ,BIG data ,PROBABILITY theory ,K-means clustering - Abstract
The multiobjective realization of the data clustering problem has shown great promise in recent years, yielding clear conceptual advantages over the more conventional, single-objective approach. Evolutionary algorithms have largely contributed to the development of this increasingly active research area on multiobjective clustering. Nevertheless, the unprecedented volumes of data seen widely today pose significant challenges and highlight the need for more effective and scalable tools for exploratory data analysis. This paper proposes an improved version of the multiobjective clustering with automatic ${k}$ -determination algorithm. Our new algorithm improves its predecessor in several respects, but the key changes are related to the use of an efficient, specialized initialization routine and two alternative reduced-length representations. These design components exploit information from the minimum spanning tree and redefine the problem in terms of the most relevant subset of its edges. This paper reveals that both the new initialization routine and the new solution representations not only contribute to decrease the computational overhead, but also entail a significant reduction of the search space, enhancing therefore the convergence capabilities and overall effectiveness of the method. These results suggest that the new algorithm proposed here will offer significant advantages in the realm of “big data” analytics and applications. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
50. A New Decomposition-Based NSGA-II for Many-Objective Optimization.
- Author
-
Elarbi, Maha, Bechikh, Slim, Gupta, Abhishek, Ben Said, Lamjed, and Ong, Yew-Soon
- Subjects
EVOLUTIONARY algorithms ,MATHEMATICAL decomposition - Abstract
Multiobjective evolutionary algorithms (MOEAs) have proven their effectiveness and efficiency in solving problems with two or three objectives. However, recent studies show that MOEAs face many difficulties when tackling problems involving a larger number of objectives as their behavior becomes similar to a random walk in the search space since most individuals are nondominated with respect to each other. Motivated by the interesting results of decomposition-based approaches and preference-based ones, we propose in this paper a new decomposition-based dominance relation to deal with many-objective optimization problems and a new diversity factor based on the penalty-based boundary intersection method. Our reference point-based dominance (RP-dominance), has the ability to create a strict partial order on the set of nondominated solutions using a set of well-distributed reference points. The RP-dominance is subsequently used to substitute the Pareto dominance in nondominated sorting genetic algorithm-II (NSGA-II). The augmented MOEA, labeled as RP-dominance-based NSGA-II, has been statistically demonstrated to provide competitive and oftentimes better results when compared against four recently proposed decomposition-based MOEAs on commonly-used benchmark problems involving up to 20 objectives. In addition, the efficacy of the algorithm on a realistic water management problem is showcased. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.