1
|
Su J, Huang H, Li G, Li X, Hao Z. Self-Organizing Neural Scheduler for the Flexible Job Shop Problem With Periodic Maintenance and Mandatory Outsourcing Constraints. IEEE TRANSACTIONS ON CYBERNETICS 2023; 53:5533-5544. [PMID: 35380979 DOI: 10.1109/tcyb.2022.3158334] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
Scheduling is significant in improving the production efficiency and reducing delivery delays for manufacturing enterprises. Unlike the flexible job-shop scheduling problem, two special constraints are encountered in real-world power supply manufacturing systems: 1) periodic maintenance and 2) mandatory outsourcing. As the characteristics of these constraints are not considered in existing scheduling algorithms, schedules generated by most existing approaches are not optimal or even conflict with these constraints. In this article, a self-organizing neural scheduler (SoNS) is proposed to overcome this limitation. A long short-term memory encoder is developed to transform the variable-length structural information into fixed-length feature vectors. Moreover, the reinforcement learning model is proposed to automatically select policies for improving candidate schedules. To validate the effectiveness of the proposed algorithm, extensive experiments are conducted on over 300 problem instances. The nonparametric Kruskal-Wallis tests confirm that the proposed algorithm outperforms several state-of-the-art methods in terms of effectiveness and robustness within a limited computational budget. It demonstrates that the proposed SoNS can solve scheduling problems with the periodic maintenance and mandatory outsourcing constraints effectively.
Collapse
|
2
|
Zhang E, Nie Z, Yang Q, Wang Y, Liu D, Jeon SW, Zhang J. Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems. Inf Sci (N Y) 2023. [DOI: 10.1016/j.ins.2023.03.086] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 03/19/2023]
|
3
|
Wang W, Liu HL, Tan KC. A Surrogate-Assisted Differential Evolution Algorithm for High-Dimensional Expensive Optimization Problems. IEEE TRANSACTIONS ON CYBERNETICS 2023; 53:2685-2697. [PMID: 35687633 DOI: 10.1109/tcyb.2022.3175533] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
The radial basis function (RBF) model and the Kriging model have been widely used in the surrogate-assisted evolutionary algorithms (SAEAs). Based on their characteristics, a global and local surrogate-assisted differential evolution algorithm (GL-SADE) for high-dimensional expensive problems is proposed in this article, in which a global RBF model is trained with all samples to estimate a global trend, and then its optima is used to significantly accelerate the convergence process. A local Kriging model prefers to select points with good predicted fitness and great uncertainty, which can effectively prevent the search from getting trapped into local optima. When the local Kriging model finds the best solution so far, a reward search strategy is executed to further exploit the local Kriging model. The experiments on a set of benchmark functions with dimensions varying from 30 to 200 are conducted to evaluate the performance of the proposed algorithm. The experimental results of the proposed algorithm are compared to four state-of-the-art algorithms to show its effectiveness and efficiency in solving high-dimensional expensive problems. Besides, GL-SADE is applied to an airfoil optimization problem to show its effectiveness.
Collapse
|
4
|
Liu SC, Chen ZG, Zhan ZH, Jeon SW, Kwong S, Zhang J. Many-Objective Job-Shop Scheduling: A Multiple Populations for Multiple Objectives-Based Genetic Algorithm Approach. IEEE TRANSACTIONS ON CYBERNETICS 2023; 53:1460-1474. [PMID: 34516383 DOI: 10.1109/tcyb.2021.3102642] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
The job-shop scheduling problem (JSSP) is a challenging scheduling and optimization problem in the industry and engineering, which relates to the work efficiency and operational costs of factories. The completion time of all jobs is the most commonly considered optimization objective in the existing work. However, factories focus on both time and cost objectives, including completion time, total tardiness, advance time, production cost, and machine loss. Therefore, this article first time proposes a many-objective JSSP that considers all these five objectives to make the model more practical to reflect the various demands of factories. To optimize these five objectives simultaneously, a novel multiple populations for multiple objectives (MPMO) framework-based genetic algorithm (GA) approach, called MPMOGA, is proposed. First, MPMOGA employs five populations to optimize the five objectives, respectively. Second, to avoid each population only focusing on its corresponding single objective, an archive sharing technique (AST) is proposed to store the elite solutions collected from the five populations so that the populations can obtain optimization information about the other objectives from the archive. This way, MPMOGA can approximate different parts of the entire Pareto front (PF). Third, an archive update strategy (AUS) is proposed to further improve the quality of the solutions in the archive. The test instances in the widely used test sets are adopted to evaluate the performance of MPMOGA. The experimental results show that MPMOGA outperforms the compared state-of-the-art algorithms on most of the test instances.
Collapse
|
5
|
Developing Nonlinear Customer Preferences Models for Product Design Using Opining Mining and Multiobjective PSO-Based ANFIS Approach. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2023; 2023:6880172. [PMID: 36860421 PMCID: PMC9970701 DOI: 10.1155/2023/6880172] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 10/12/2022] [Revised: 01/24/2023] [Accepted: 02/02/2023] [Indexed: 02/22/2023]
Abstract
Online customer reviews can clearly show the customer experience, and the improvement suggestions based on the experience, which are helpful to product optimization and design. However, the research on establishing a customer preference model based on online customer reviews is not ideal, and the following research problems are found in previous studies. Firstly, the product attribute is not involved in the modelling if the corresponding setting cannot be found in the product description. Secondly, the fuzziness of customers' emotions in online reviews and nonlinearity in the models were not appropriately considered. Thirdly, the adaptive neuro-fuzzy inference system (ANFIS) is an effective way to model customer preferences. However, if the number of inputs is large, the modelling process will be failed due to the complex structure and long computational time. To solve the above-given problems, this paper proposed multiobjective particle swarm optimization (PSO) based ANFIS and opinion mining, to build customer preference model by analyzing the content of online customer reviews. In the process of online review analysis, the opinion mining technology is used to conduct comprehensive analysis on customer preference and product information. According to the analysis of information, a new method for establishing customer preference model is proposed, that is, a multiobjective PSO based ANFIS. The results show that the introducing of multiobjective PSO method into ANFIS can effectively solve the defects of ANFIS itself. Taking hair dryer as a case study, it is found that the proposed approach performs better than fuzzy regression, fuzzy least-squares regression, and genetic programming based fuzzy regression in modelling customer preference.
Collapse
|
6
|
Wang ZJ, Yang Q, Zhang YH, Chen SH, Wang YG. Superiority combination learning distributed particle swarm optimization for large-scale optimization. Appl Soft Comput 2023. [DOI: 10.1016/j.asoc.2023.110101] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/18/2023]
|
7
|
Dar SA, Imtiaz N. Classification of neuroimaging data in Alzheimer's disease using particle swarm optimization: A systematic review. APPLIED NEUROPSYCHOLOGY. ADULT 2023:1-12. [PMID: 36719791 DOI: 10.1080/23279095.2023.2169886] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/01/2023]
Abstract
AIM Particle swarm optimization (PSO) is an algorithm that involves the optimization of Non-linear and Multidimensional problems to reach the best solutions with minimal parameterization. This metaheuristic model has frequently been used in the Pathological domain. This optimization model has been used in diverse forms while predicting Alzheimer's disease. It is a robust algorithm that works on linear and multi-modal data while predicting Alzheimer's disease. PSO techniques have been in action for quite some time for detecting various diseases and this paper systematically reviews the papers on various kinds of PSO techniques. METHODS To perform the systematic review, PRISMA guidelines were followed and a Boolean search ("particle swarm optimization" OR "PSO") AND Neuroimaging AND (Alzheimer's disease prediction OR classification OR diagnosis) were performed. The query was run in 4-reputed databases: Google Scholar, Scopus, Science Direct, and Wiley publications. RESULTS For the final analysis, 10 papers were incorporated for qualitative and quantitative synthesis. PSO has shown a dominant character while handling the uni-modal as well as the multi-modal data while predicting the conversion from MCI to Alzheimer's. It can be seen from the table that almost all the 10 reviewed papers had MRI-driven data. The accuracy rate was accentuated while adding other modalities or Neurocognitive measures. CONCLUSIONS Through this algorithm, we are providing an opportunity to other researchers to compare this algorithm with other state-of-the-art algorithms, while seeing the classification accuracy, with the aim of early prediction and progression of MCI into Alzheimer's disease.
Collapse
Affiliation(s)
- Suhail Ahmad Dar
- Department of Psychology, Aligarh Muslim University, Aligarh, India
| | - Nasheed Imtiaz
- Department of Psychology, Aligarh Muslim University, Aligarh, India
| |
Collapse
|
8
|
Hou S, Yu J, Su Y, Liu Z, Dai J. Flow distribution optimization of parallel pumps based on improved mayfly algorithm. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2023. [DOI: 10.3233/jifs-222783] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/04/2023]
Abstract
An improved mayfly algorithm is proposed for the energy saving optimization of parallel chilled water pumps in central air conditioning system, with the minimum energy consumption of parallel pump units as the optimization objective and the speed ratio of each pump as the optimization variable for the solution. For the problem of uneven random initialization of mayflies, the variable definition method of Circle chaotic mapping is used to make the initial position of the population uniformly distributed in the solution space, and the mayfly fitness value and the optimal fitness value are incorporated into the calculation of the weight coefficient, which better balances the global exploration and local exploitation of the algorithm. For the problem that the algorithm is easy to fall into the local optimum at the later stage, a multi-subpopulation cooperative strategy is proposed to improve the global search ability of the algorithm. Finally, the performance of the improved mayfly algorithm is tested with two parallel pumping system cases, and the stability and time complexity of the algorithm are verified. The experiments show that the algorithm can get a better operation strategy in solving the parallel water pump energy saving optimization problem, and can achieve energy saving effect of 0.72% 8.68% compared with other optimization algorithms, and the convergence speed and stability of the algorithm have been significantly improved, which can be better applied to practical needs.
Collapse
Affiliation(s)
- Shuai Hou
- School of Building Services Science and Engineering, Xi’an University of Architecture and Technology, Xi’an, ShaanXi, China
| | - Junqi Yu
- School of Building Services Science and Engineering, Xi’an University of Architecture and Technology, Xi’an, ShaanXi, China
| | - Yucong Su
- School of Building Services Science and Engineering, Xi’an University of Architecture and Technology, Xi’an, ShaanXi, China
| | - Zongyi Liu
- School of Building Services Science and Engineering, Xi’an University of Architecture and Technology, Xi’an, ShaanXi, China
| | - Junwei Dai
- School of Building Services Science and Engineering, Xi’an University of Architecture and Technology, Xi’an, ShaanXi, China
| |
Collapse
|
9
|
Qiao Y, Luo W, Lin X, Xu P, Preuss M. DBCC2: an improved difficulty-based cooperative co-evolution for many-modal optimization. COMPLEX INTELL SYST 2023. [DOI: 10.1007/s40747-022-00937-w] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/15/2023]
Abstract
AbstractEvolutionary multimodal optimization algorithms aim to provide multiple solutions simultaneously. Many studies have been conducted to design effective evolutionary algorithms for solving multimodal optimization problems. However, optimization problems with many global and acceptable local optima have not received much attention. This type of problem is undoubtedly challenging. In this study, we focus on problems with many optima, the so-called many-modal optimization problems, and this study is an extension of our previous conference work. First, a test suite including additively nonseparable many-modal optimization problems and partially additively separable many-modal optimization problems is designed. Second, an improved difficulty-based cooperative co-evolution algorithm (DBCC2) is proposed, which dynamically estimates the difficulties of subproblems and allocates the computational resources during the search. Experimental results show that DBCC2 has competitive performance.
Collapse
|
10
|
QoS prediction for web services in cloud environments based on swarm intelligence search. Knowl Based Syst 2023. [DOI: 10.1016/j.knosys.2022.110081] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
|
11
|
Zhang L, Oh SK, Pedrycz W, Yang B, Wang L. A Promotive Particle Swarm Optimizer With Double Hierarchical Structures. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:13308-13322. [PMID: 34473638 DOI: 10.1109/tcyb.2021.3101880] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
In this study, a novel promotive particle swarm optimizer with double hierarchical structures is proposed. It is inspired by successful mechanisms present in social and biological systems to make particles compete fairly. In the proposed method, the swarm is first divided into multiple independent subpopulations organized in a hierarchical promotion structure, which protects subpopulation at each hierarchy to search for the optima in parallel. A unidirectional communication strategy and a promotion operator are further implemented to allow excellent particles to be promoted from low-hierarchy subpopulations to high-hierarchy subpopulations. Furthermore, for the internal competition within each subpopulation of the hierarchical promotion structure, a hierarchical multiscale optimum controlled by a tiered architecture of particles is constructed for particles, in which each particle can synthesize a set of optima of its different scales. The hierarchical promotion structure can protect particles that just fly to promising regions and have low fitness from competing with the entire swarm. Also, the double hierarchical structures increase the diversity of searching. Numerical experiments and statistical analysis of results reported on 30 benchmark problems show that the proposed method improves the accuracy and convergence speed especially in solving complex problems when compared with several variations of particle swarm optimization.
Collapse
|
12
|
Liu N, Pan JS, Chu SC, Hu P. A sinusoidal social learning swarm optimizer for large-scale optimization. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.110090] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
|
13
|
Pan A, Shen B, Wang L. Ensemble of resource allocation strategies in decision and objective spaces for multiobjective optimization. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2022.05.005] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
14
|
Pan QK, Gao L, Wang L. An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:5999-6012. [PMID: 33373315 DOI: 10.1109/tcyb.2020.3041494] [Citation(s) in RCA: 4] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
This article addresses a novel scheduling problem, a distributed flowshop group scheduling problem, which has important applications in modern manufacturing systems. The problem considers how to arrange a variety of jobs subject to group constraints at a number of identical manufacturing cellulars, each one with a flowshop structure, with the objective of minimizing makespan. We explore the problem-specific knowledge and present a mixed-integer linear programming model, a counterintuitive paradox, and two suites of accelerations to save computational efforts. Due to the complexity of the problem, we consider a decomposition strategy and propose a cooperative co-evolutionary algorithm (CCEA) with a novel collaboration model and a reinitialization scheme. A comprehensive and thorough computational and statistical campaign is carried out. The results show that the proposed collaboration model and reinitialization scheme are very effective. The proposed CCEA outperforms a number of metaheuristics adapted from closely related scheduling problems in the literature by a significantly considerable margin.
Collapse
|
15
|
Wang ZJ, Zhou YR, Zhang J. Adaptive Estimation Distribution Distributed Differential Evolution for Multimodal Optimization Problems. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:6059-6070. [PMID: 33373312 DOI: 10.1109/tcyb.2020.3038694] [Citation(s) in RCA: 4] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Multimodal optimization problems (MMOPs) require algorithms to locate multiple optima simultaneously. When using evolutionary algorithms (EAs) to deal with MMOPs, an intuitive idea is to divide the population into several small "niches," where different niches focus on locating different optima. These population partition strategies are called "niching" techniques, which have been frequently used for MMOPs. The algorithms for simultaneously locating multiple optima of MMOPs are called multimodal algorithms. However, many multimodal algorithms still face the difficulty of population partition since most of the niching techniques involve the sensitive niching parameters. Considering this issue, in this article, we propose a parameter-free niching method based on adaptive estimation distribution (AED) and develop a distributed differential evolution (DDE) algorithm, which is called AED-DDE, for solving MMOPs. In AED-DDE, each individual finds its own appropriate niche size to form a niche and acts as an independent unit to find a global optimum. Therefore, we can avoid the difficulty of population partition and the sensitivity of niching parameters. Different niches are co-evolved by using the master-slave multiniche distributed model. The multiniche co-evolution mechanism can improve the population diversity for fully exploring the search space and finding more global optima. Moreover, the AED-DDE algorithm is further enhanced by a probabilistic local search (PLS) to refine the solution accuracy. Compared with other multimodal algorithms, even the winner of CEC2015 multimodal competition, the comparison results fully demonstrate the superiority of AED-DDE.
Collapse
|
16
|
Collective information-based particle swarm optimization for multi-fuel CHP economic dispatch problem. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.108902] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
|
17
|
Wang F, Wang X, Sun S. A reinforcement learning level-based particle swarm optimization algorithm for large-scale optimization. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2022.04.053] [Citation(s) in RCA: 6] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
18
|
The cheetah optimizer: a nature-inspired metaheuristic algorithm for large-scale optimization problems. Sci Rep 2022; 12:10953. [PMID: 35768456 PMCID: PMC9243145 DOI: 10.1038/s41598-022-14338-z] [Citation(s) in RCA: 7] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/22/2022] [Accepted: 06/06/2022] [Indexed: 01/30/2023] Open
Abstract
Motivated by the hunting strategies of cheetahs, this paper proposes a nature-inspired algorithm called the cheetah optimizer (CO). Cheetahs generally utilize three main strategies for hunting prey, i.e., searching, sitting-and-waiting, and attacking. These strategies are adopted in this work. Additionally, the leave the pray and go back home strategy is also incorporated in the hunting process to improve the proposed framework's population diversification, convergence performance, and robustness. We perform intensive testing over 14 shifted-rotated CEC-2005 benchmark functions to evaluate the performance of the proposed CO in comparison to state-of-the-art algorithms. Moreover, to test the power of the proposed CO algorithm over large-scale optimization problems, the CEC2010 and the CEC2013 benchmarks are considered. The proposed algorithm is also tested in solving one of the well-known and complex engineering problems, i.e., the economic load dispatch problem. For all considered problems, the results are shown to outperform those obtained using other conventional and improved algorithms. The simulation results demonstrate that the CO algorithm can successfully solve large-scale and challenging optimization problems and offers a significant advantage over different standards and improved and hybrid existing algorithms. Note that the source code of the CO algorithm is publicly available at https://www.optim-app.com/projects/co.
Collapse
|
19
|
Boosted Sine Cosine Algorithm with Application to Medical Diagnosis. COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2022; 2022:6215574. [PMID: 35785140 PMCID: PMC9242811 DOI: 10.1155/2022/6215574] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 04/24/2022] [Revised: 05/19/2022] [Accepted: 05/26/2022] [Indexed: 01/09/2023]
Abstract
The sine cosine algorithm (SCA) was proposed for solving optimization tasks, of which the way to obtain the optimal solution is mainly through the continuous iteration of the sine and cosine update formulas. However, SCA also faces low population diversity and stagnation of locally optimal solutions. Hence, we try to eliminate these problems by proposing an enhanced version of SCA, named ESCA_PSO. ESCA_PSO is proposed based on hybrid SCA and particle swarm optimization (PSO) by incorporating multiple mutation strategies into the original SCA_PSO. To validate the effect of ESCA_PSO in handling global optimization problems, ESCA_PSO was compared with quality algorithms on various types of benchmark functions. In addition, the proposed ESCA_PSO was employed to tune the best parameters of support vector machines for dealing with medical diagnosis tasks. The results prove the efficiency of the proposed algorithms in solving optimization problems.
Collapse
|
20
|
Wang Y, Li J, Chen C, Zhang J, Zhan Z. Scale adaptive fitness evaluation‐based particle swarm optimisation for hyperparameter and architecture optimisation in neural networks and deep learning. CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY 2022. [DOI: 10.1049/cit2.12106] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022] Open
Affiliation(s)
- Ye‐Qun Wang
- School of Computer Science and Engineering South China University of Technology Guangzhou China
| | - Jian‐Yu Li
- School of Computer Science and Engineering South China University of Technology Guangzhou China
| | - Chun‐Hua Chen
- School of Software Engineering South China University of Technology Guangzhou China
| | - Jun Zhang
- Hanyang University Ansan South Korea
| | - Zhi‐Hui Zhan
- School of Computer Science and Engineering South China University of Technology Guangzhou China
| |
Collapse
|
21
|
Chen C, Yan Y, Liu Q. An adaptive differential evolution with extended historical memory and iterative local search. Appl Soft Comput 2022. [DOI: 10.1016/j.asoc.2022.109203] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
22
|
Pan Z, Lei D, Wang L. A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:5051-5063. [PMID: 33119528 DOI: 10.1109/tcyb.2020.3026571] [Citation(s) in RCA: 6] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
In recent years, both distributed scheduling problem and energy-efficient scheduling have attracted much attention. As the integration of these two problems, the distributed energy-efficient scheduling problem is of great realistic significance. To the best of our knowledge, the distributed energy-efficient parallel machines scheduling problem (DEPMSP) has not been studied yet. This article aims to solve DEPMSP by integrating factory assignment and machine assignment into an extended machine assignment to handle the coupled relations of subproblems. A knowledge-based two-population optimization (KTPO) algorithm is proposed to minimize total energy consumption and total tardiness simultaneously. Five properties are derived by analyzing the characteristics of DEPMSP. The population is initialized by using two heuristics based on problem-specific knowledge and a random heuristic. The nondominated sorting genetic algorithm-II and differential evolution perform cooperatively on the population in parallel. Moreover, two knowledge-based local search operators are proposed to enhance the exploitation. Extensive simulation experiments are conducted by comparing KTPO with four algorithms from the literature. The comparative results and statistical analysis demonstrate the effectiveness and advantages of KTPO in solving DEPMSP.
Collapse
|
23
|
Srivastava A, Das DK. A New Aggrandized Class Topper Optimization Algorithm to Solve Economic Load Dispatch Problem in a Power System. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:4187-4197. [PMID: 33156797 DOI: 10.1109/tcyb.2020.3024607] [Citation(s) in RCA: 9] [Impact Index Per Article: 4.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
Optimization techniques are widely being used to solve large and complex economical load dispatch (ELD) and combined emission economical dispatch (CEED) problems in power systems. These techniques can solve these problems in a short computational time. In this article, a new human intelligence-based metaheuristic optimization technique, that is, aggrandized class topper optimization (CTO), is proposed to solve ELD and CEED problems. This proposed algorithm is an upgraded form of classical CTO in which the concept of remedial classes is incorporated to enhance the learning ability of weak students of a class. To validate the exploration, exploitation, convergence, and local minima avoidance capabilities of the proposed algorithm, 29 benchmark functions are considered. Furthermore, seven different test cases for the ELD problem and four test cases for a CEED problem are considered to test the effectiveness of the proposed algorithm to solve these complex problems. The result analysis proves that the proposed algorithm provides better and effective results in almost each test case.
Collapse
|
24
|
An Improved Particle Swarm Optimization Algorithm and Its Application to the Extreme Value Optimization Problem of Multivariable Function. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2022; 2022:1935272. [PMID: 35602623 PMCID: PMC9122683 DOI: 10.1155/2022/1935272] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/22/2022] [Revised: 03/25/2022] [Accepted: 03/31/2022] [Indexed: 11/23/2022]
Abstract
It is proposed to improve the study of particle optimization and its application in order to solve the problem of inefficiency and lack of local optimization skills in the use of particle herd optimization. Firstly, the basic principle, mathematical description, algorithm parameters, and flow of the original (Particle Swarm Optimization, PSO) algorithm are introduced, and then the standard PSO algorithm is introduced; thirdly, over the last 10 years, four types of improvements have been proposed through the study of improved particle algorithms. The improved algorithm is applied to the extreme value optimization problem of multivariable function. The simulation results show that the basic (Cloud Particle Swarm Optimization, CPSO) algorithm within 500 generations has not reached convergence for 8 times, 6 times, 4 times, and 5 times, respectively. In the case of convergence, the average number of steps is much higher than ICPSO, and the improved algorithm converges completely. In terms of time performance, the convergence time of ICPSO is much better than that of CPSO algorithm. Therefore, the improved particle optimization algorithm ensures the effectiveness of the improvement measures, such as small optimization algebra, fast merging speed, high efficiency, and good population diversity.
Collapse
|
25
|
Elite Directed Particle Swarm Optimization with Historical Information for High-Dimensional Problems. MATHEMATICS 2022. [DOI: 10.3390/math10091384] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/05/2023]
Abstract
High-dimensional optimization problems are ubiquitous in every field nowadays, which seriously challenge the optimization ability of existing optimizers. To solve this kind of optimization problems effectively, this paper proposes an elite-directed particle swarm optimization (EDPSO) with historical information to explore and exploit the high-dimensional solution space efficiently. Specifically, in EDPSO, the swarm is first separated into two exclusive sets based on the Pareto principle (80-20 rule), namely the elite set containing the top best 20% of particles and the non-elite set consisting of the remaining 80% of particles. Then, the non-elite set is further separated into two layers with the same size from the best to the worst. As a result, the swarm is divided into three layers. Subsequently, particles in the third layer learn from those in the first two layers, while particles in the second layer learn from those in the first layer, on the condition that particles in the first layer remain unchanged. In this way, the learning effectiveness and the learning diversity of particles could be largely promoted. To further enhance the learning diversity of particles, we maintain an additional archive to store obsolete elites, and use the predominant elites in the archive along with particles in the first two layers to direct the update of particles in the third layer. With these two mechanisms, the proposed EDPSO is expected to compromise search intensification and diversification well at the swarm level and the particle level, to explore and exploit the solution space. Extensive experiments are conducted on the widely used CEC’2010 and CEC’2013 high-dimensional benchmark problem sets to validate the effectiveness of the proposed EDPSO. Compared with several state-of-the-art large-scale algorithms, EDPSO is demonstrated to achieve highly competitive or even much better performance in tackling high-dimensional problems.
Collapse
|
26
|
|
27
|
Xia J, Wang Z, Yang D, Li R, Liang G, Chen H, Heidari AA, Turabieh H, Mafarja M, Pan Z. Performance optimization of support vector machine with oppositional grasshopper optimization for acute appendicitis diagnosis. Comput Biol Med 2022; 143:105206. [PMID: 35101730 DOI: 10.1016/j.compbiomed.2021.105206] [Citation(s) in RCA: 32] [Impact Index Per Article: 16.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/14/2021] [Revised: 12/27/2021] [Accepted: 12/30/2021] [Indexed: 12/13/2022]
Abstract
Preoperative differentiation of complicated and uncomplicated appendicitis is challenging. The research goal was to construct a new intelligent diagnostic rule that is accurate, fast, noninvasive, and cost-effective, distinguishing between complicated and uncomplicated appendicitis. Overall, 298 patients with acute appendicitis from the Wenzhou Central Hospital were recruited, and information on their demographic characteristics, clinical findings, and laboratory data was retrospectively reviewed and applied in this study. First, the most significant variables, including C-reactive protein (CRP), heart rate, body temperature, and neutrophils discriminating complicated from uncomplicated appendicitis, were identified using random forest analysis. Second, an improved grasshopper optimization algorithm-based support vector machine was used to construct the diagnostic model to discriminate complicated appendicitis (CAP) from uncomplicated appendicitis (UAP). The resultant optimal model can produce an average of 83.56% accuracy, 81.71% sensitivity, 85.33% specificity, and 0.6732 Matthews correlation coefficients. Based on existing routinely available markers, the proposed intelligent diagnosis model is highly reliable. Thus, the model can potentially be used to assist doctors in making correct clinical decisions.
Collapse
Affiliation(s)
- Jianfu Xia
- Department of General Surgery, The Second Affiliated Hospital of Shanghai University (Wenzhou Central Hospital), Wenzhou, Zhejiang, 325000, China.
| | - Zhifei Wang
- Department of Hepatobiliary, Pancreatic and Minimally Invasive Surgery, Zhejiang Provincial People's Hospital, Hangzhou, 310014, China.
| | - Daqing Yang
- Department of General Surgery, The Second Affiliated Hospital of Shanghai University (Wenzhou Central Hospital), Wenzhou, Zhejiang, 325000, China.
| | - Rizeng Li
- Department of General Surgery, The Second Affiliated Hospital of Shanghai University (Wenzhou Central Hospital), Wenzhou, Zhejiang, 325000, China.
| | - Guoxi Liang
- Department of Information Technology, Wenzhou Polytechnic, Wenzhou, 325035, China.
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Hamza Turabieh
- Department of Information Technology, College of Computers and Information Technology, Taif University, P.O. Box 11099, Taif, 21944, Taif, Saudi Arabia.
| | - Majdi Mafarja
- Department of Computer Science, Birzeit University, Birzeit, 72439, Palestine.
| | - Zhifang Pan
- The First Affiliated Hospital of Wenzhou Medical University, Wenzhou, 325000, PR China.
| |
Collapse
|
28
|
Xu X, Ren W. A hybrid model of stacked autoencoder and modified particle swarm optimization for multivariate chaotic time series forecasting. Appl Soft Comput 2022. [DOI: 10.1016/j.asoc.2021.108321] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/23/2022]
|
29
|
Li JY, Zhan ZH, Zhang J. Evolutionary Computation for Expensive Optimization: A Survey. MACHINE INTELLIGENCE RESEARCH 2022. [PMCID: PMC8777172 DOI: 10.1007/s11633-022-1317-4] [Citation(s) in RCA: 4] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Subscribe] [Scholar Register] [Indexed: 01/14/2023]
Abstract
Expensive optimization problem (EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation (EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.
Collapse
|
30
|
Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design. MATHEMATICS 2022. [DOI: 10.3390/math10020276] [Citation(s) in RCA: 13] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.
Collapse
|
31
|
Multi-Population Enhanced Slime Mould Algorithm and with Application to Postgraduate Employment Stability Prediction. ELECTRONICS 2022. [DOI: 10.3390/electronics11020209] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/01/2023]
Abstract
In this study, the authors aimed to study an effective intelligent method for employment stability prediction in order to provide a reasonable reference for postgraduate employment decision and for policy formulation in related departments. First, this paper introduces an enhanced slime mould algorithm (MSMA) with a multi-population strategy. Moreover, this paper proposes a prediction model based on the modified algorithm and the support vector machine (SVM) algorithm called MSMA-SVM. Among them, the multi-population strategy balances the exploitation and exploration ability of the algorithm and improves the solution accuracy of the algorithm. Additionally, the proposed model enhances the ability to optimize the support vector machine for parameter tuning and for identifying compact feature subsets to obtain more appropriate parameters and feature subsets. Then, the proposed modified slime mould algorithm is compared against various other famous algorithms in experiments on the 30 IEEE CEC2017 benchmark functions. The experimental results indicate that the established modified slime mould algorithm has an observably better performance compared to the algorithms on most functions. Meanwhile, a comparison between the optimal support vector machine model and other several machine learning methods on their ability to predict employment stability was conducted, and the results showed that the suggested the optimal support vector machine model has better classification ability and more stable performance. Therefore, it is possible to infer that the optimal support vector machine model is likely to be an effective tool that can be used to predict employment stability.
Collapse
|
32
|
Dong R, Chen H, Heidari AA, Turabieh H, Mafarja M, Wang S. Boosted kernel search: Framework, analysis and case studies on the economic emission dispatch problem. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107529] [Citation(s) in RCA: 27] [Impact Index Per Article: 9.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/25/2022]
|
33
|
Zhang Q, Wang Z, Heidari AA, Gui W, Shao Q, Chen H, Zaguia A, Turabieh H, Chen M. Gaussian Barebone Salp Swarm Algorithm with Stochastic Fractal Search for medical image segmentation: A COVID-19 case study. Comput Biol Med 2021; 139:104941. [PMID: 34801864 DOI: 10.1016/j.compbiomed.2021.104941] [Citation(s) in RCA: 20] [Impact Index Per Article: 6.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/21/2021] [Revised: 10/11/2021] [Accepted: 10/11/2021] [Indexed: 01/11/2023]
Abstract
An appropriate threshold is a key to using the multi-threshold segmentation method to solve image segmentation problems, and the swarm intelligence (SI) optimization algorithm is one of the popular methods to obtain the optimal threshold. Moreover, Salp Swarm Algorithm (SSA) is a recently released swarm intelligent optimization algorithm. Compared with other SI optimization algorithms, the optimization solution strategy of the SSA still needs to be improved to enhance further the solution accuracy and optimization efficiency of the algorithm. Accordingly, this paper designs an effective segmentation method based on a non-local mean 2D histogram and 2D Kapur's entropy called SSA with Gaussian Barebone and Stochastic Fractal Search (GBSFSSSA) by combining Gaussian Barebone and Stochastic Fractal Search mechanism. In GBSFSSSA, the Gaussian Barebone and Stochastic Fractal Search mechanism effectively balance the global search ability and local search ability of the basic SSA. The CEC2017 competition data set is used to prove the algorithm's performance, and GBSFSSSA shows an absolute advantage over some typical competitive algorithms. Furthermore, the algorithm is applied in image segmentation of COVID-19 CT images, and the results are analyzed based on three different metrics: peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM), which can lead to the conclusion that the overall performance of GBSFSSSA is better than the comparison algorithm and can effectively improve the segmentation of medical images. Therefore, it is justified that GBSFSSSA is a reliable and effective method in solving the multi-threshold image segmentation problem.
Collapse
Affiliation(s)
- Qian Zhang
- Wenzhou University of Technology, Wenzhou, 325035, China.
| | - Zhiyan Wang
- School of Artificial Intelligence, Jilin International Studies University, Changchun, 130000, China.
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Wenyong Gui
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Qike Shao
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Atef Zaguia
- Department of Computer Science, College of Computers and Information Technology, Taif University, P.O. BOX 11099, Taif, 21944, Saudi Arabia.
| | - Hamza Turabieh
- Department of Information Technology, College of Computers and Information Technology, PO Box 11099, Taif, 21944, Saudi Arabia.
| | - Mayun Chen
- Department of Pulmonary and Critical Care Medicine, The First Affiliated Hospital of Wenzhou Medical University, Wenzhou, 325000, China.
| |
Collapse
|
34
|
Hu J, Heidari AA, Zhang L, Xue X, Gui W, Chen H, Pan Z. Chaotic diffusion‐limited aggregation enhanced grey wolf optimizer: Insights, analysis, binarization, and feature selection. INT J INTELL SYST 2021. [DOI: 10.1002/int.22744] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/20/2023]
Affiliation(s)
- Jiao Hu
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Lejun Zhang
- College of Information Engineering Yangzhou University Yangzhou China
| | - Xiao Xue
- College of Computer Science and Technology Henan Polytechnic University Zhengzhou China
| | - Wenyong Gui
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Zhifang Pan
- Zhejiang Engineering Research Center of Intelligent Medicine The First Affiliated Hospital of Wenzhou Medical University Wenzhou China
| |
Collapse
|
35
|
Yan Y, Zhou Q, Cheng S, Liu Q, Li Y. Bilevel-search particle swarm optimization for computationally expensive optimization problems. Soft comput 2021. [DOI: 10.1007/s00500-021-06169-3] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
36
|
Zhang Z, Xiao T, Qin X. Fly visual evolutionary neural network solving large‐scale global optimization. INT J INTELL SYST 2021. [DOI: 10.1002/int.22564] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/23/2022]
Affiliation(s)
- Zhuhong Zhang
- Department of Big Data Science and Engineering, College of Big Data and Information Engineering Guizhou University Guiyang Guizhou China
| | - Tianyu Xiao
- Guizhou Provincial Characteristic Key Laboratory of System Optimization and Scientific Computation Guizhou University Guiyang Guizhou China
| | - Xiuchang Qin
- Guizhou Provincial Characteristic Key Laboratory of System Optimization and Scientific Computation Guizhou University Guiyang Guizhou China
| |
Collapse
|
37
|
Qiao Z, Shan W, Jiang N, Heidari AA, Chen H, Teng Y, Turabieh H, Mafarja M. Gaussian bare‐bones gradient‐based optimization: Towards mitigating the performance concerns. INT J INTELL SYST 2021. [DOI: 10.1002/int.22658] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/08/2023]
Affiliation(s)
- Zenglin Qiao
- School of Emergency Management, Institute of Disaster Prevention Langfang China
| | - Weifeng Shan
- School of Emergency Management, Institute of Disaster Prevention Langfang China
- Institute of Geophysics, China Earthquake Administration Beijing China
| | - Nan Jiang
- College of Information Engineering, East China Jiaotong University Nanchang Jiangxi China
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Yuntian Teng
- Institute of Geophysics, China Earthquake Administration Beijing China
| | - Hamza Turabieh
- Department of Information Technology College of Computers and Information Technology, Taif University Taif Saudi Arabia
| | - Majdi Mafarja
- Department of Computer Science Birzeit University West Bank Palestine
| |
Collapse
|
38
|
Li JY, Zhan ZH, Liu RD, Wang C, Kwong S, Zhang J. Generation-Level Parallelism for Evolutionary Computation: A Pipeline-Based Parallel Particle Swarm Optimization. IEEE TRANSACTIONS ON CYBERNETICS 2021; 51:4848-4859. [PMID: 33147159 DOI: 10.1109/tcyb.2020.3028070] [Citation(s) in RCA: 11] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
Due to the population-based and iterative-based characteristics of evolutionary computation (EC) algorithms, parallel techniques have been widely used to speed up the EC algorithms. However, the parallelism usually performs in the population level where multiple populations (or subpopulations) run in parallel or in the individual level where the individuals are distributed to multiple resources. That is, different populations or different individuals can be executed simultaneously to reduce running time. However, the research into generation-level parallelism for EC algorithms has seldom been reported. In this article, we propose a new paradigm of the parallel EC algorithm by making the first attempt to parallelize the algorithm in the generation level. This idea is inspired by the industrial pipeline technique. Specifically, a kind of EC algorithm called local version particle swarm optimization (PSO) is adopted to implement a pipeline-based parallel PSO (PPPSO, i.e., P3SO). Due to the generation-level parallelism in P3SO, when some particles still perform their evolutionary operations in the current generation, some other particles can simultaneously go to the next generation to carry out the new evolutionary operations, or even go to further next generation(s). The experimental results show that the problem-solving ability of P3SO is not affected while the evolutionary speed has been substantially accelerated in a significant fashion. Therefore, generation-level parallelism is possible in EC algorithms and may have significant potential applications in time-consumption optimization problems.
Collapse
|
39
|
Which, Who and How: Detecting fraudulent sale accumulation behavior from multi-dimensional sparse data. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107260] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/20/2022]
|
40
|
Zhang Z, Li L, Lu J. Gradient-based fly immune visual recurrent neural network solving large-scale global optimization. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.05.002] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
41
|
Li X, Mao K, Lin F, Zhang X. Particle swarm optimization with state-based adaptive velocity limit strategy. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.03.077] [Citation(s) in RCA: 10] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|
42
|
Li JY, Zhan ZH, Wang H, Zhang J. Data-Driven Evolutionary Algorithm With Perturbation-Based Ensemble Surrogates. IEEE TRANSACTIONS ON CYBERNETICS 2021; 51:3925-3937. [PMID: 32776886 DOI: 10.1109/tcyb.2020.3008280] [Citation(s) in RCA: 23] [Impact Index Per Article: 7.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
Data-driven evolutionary algorithms (DDEAs) aim to utilize data and surrogates to drive optimization, which is useful and efficient when the objective function of the optimization problem is expensive or difficult to access. However, the performance of DDEAs relies on their surrogate quality and often deteriorates if the amount of available data decreases. To solve these problems, this article proposes a new DDEA framework with perturbation-based ensemble surrogates (DDEA-PES), which contain two efficient mechanisms. The first is a diverse surrogate generation method that can generate diverse surrogates through performing data perturbations on the available data. The second is a selective ensemble method that selects some of the prebuilt surrogates to form a final ensemble surrogate model. By combining these two mechanisms, the proposed DDEA-PES framework has three advantages, including larger data quantity, better data utilization, and higher surrogate accuracy. To validate the effectiveness of the proposed framework, this article provides both theoretical and experimental analyses. For the experimental comparisons, a specific DDEA-PES algorithm is developed as an instance by adopting a genetic algorithm as the optimizer and radial basis function neural networks as the base models. The experimental results on widely used benchmarks and an aerodynamic airfoil design real-world optimization problem show that the proposed DDEA-PES algorithm outperforms some state-of-the-art DDEAs. Moreover, when compared with traditional nondata-driven methods, the proposed DDEA-PES algorithm only requires about 2% computational budgets to produce competitive results.
Collapse
|
43
|
Abstract
AbstractComplex continuous optimization problems widely exist nowadays due to the fast development of the economy and society. Moreover, the technologies like Internet of things, cloud computing, and big data also make optimization problems with more challenges including Many-dimensions, Many-changes, Many-optima, Many-constraints, and Many-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many-objective optimization problems, constrained optimization problems, and expensive optimization problems in practical applications. The evolutionary computation (EC) algorithms are a kind of promising global optimization tools that have not only been widely applied for solving traditional optimization problems, but also have emerged booming research for solving the above-mentioned complex continuous optimization problems in recent years. In order to show how EC algorithms are promising and efficient in dealing with the 5-M complex challenges, this paper presents a comprehensive survey by proposing a novel taxonomy according to the function of the approaches, including reducing problem difficulty, increasing algorithm diversity, accelerating convergence speed, reducing running time, and extending application field. Moreover, some future research directions on using EC algorithms to solve complex continuous optimization problems are proposed and discussed. We believe that such a survey can draw attention, raise discussions, and inspire new ideas of EC research into complex continuous optimization problems and real-world applications.
Collapse
|
44
|
Wang ZJ, Zhan ZH, Kwong S, Jin H, Zhang J. Adaptive Granularity Learning Distributed Particle Swarm Optimization for Large-Scale Optimization. IEEE TRANSACTIONS ON CYBERNETICS 2021; 51:1175-1188. [PMID: 32224474 DOI: 10.1109/tcyb.2020.2977956] [Citation(s) in RCA: 32] [Impact Index Per Article: 10.7] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
Large-scale optimization has become a significant and challenging research topic in the evolutionary computation (EC) community. Although many improved EC algorithms have been proposed for large-scale optimization, the slow convergence in the huge search space and the trap into local optima among massive suboptima are still the challenges. Targeted to these two issues, this article proposes an adaptive granularity learning distributed particle swarm optimization (AGLDPSO) with the help of machine-learning techniques, including clustering analysis based on locality-sensitive hashing (LSH) and adaptive granularity control based on logistic regression (LR). In AGLDPSO, a master-slave multisubpopulation distributed model is adopted, where the entire population is divided into multiple subpopulations, and these subpopulations are co-evolved. Compared with other large-scale optimization algorithms with single population evolution or centralized mechanism, the multisubpopulation distributed co-evolution mechanism will fully exchange the evolutionary information among different subpopulations to further enhance the population diversity. Furthermore, we propose an adaptive granularity learning strategy (AGLS) based on LSH and LR. The AGLS is helpful to determine an appropriate subpopulation size to control the learning granularity of the distributed subpopulations in different evolutionary states to balance the exploration ability for escaping from massive suboptima and the exploitation ability for converging in the huge search space. The experimental results show that AGLDPSO performs better than or at least comparable with some other state-of-the-art large-scale optimization algorithms, even the winner of the competition on large-scale optimization, on all the 35 benchmark functions from both IEEE Congress on Evolutionary Computation (IEEE CEC2010) and IEEE CEC2013 large-scale optimization test suites.
Collapse
|
45
|
Zhan ZH, Zhang J, Lin Y, Li JY, Huang T, Guo XQ, Wei FF, Kwong S, Zhang XY, You R. Matrix-Based Evolutionary Computation. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE 2021. [DOI: 10.1109/tetci.2020.3047410] [Citation(s) in RCA: 14] [Impact Index Per Article: 4.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
|
46
|
Xia X, Gui L, Yu F, Wu H, Wei B, Zhang YL, Zhan ZH. Triple Archives Particle Swarm Optimization. IEEE TRANSACTIONS ON CYBERNETICS 2020; 50:4862-4875. [PMID: 31613789 DOI: 10.1109/tcyb.2019.2943928] [Citation(s) in RCA: 30] [Impact Index Per Article: 7.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
There are two common challenges in particle swarm optimization (PSO) research, that is, selecting proper exemplars and designing an efficient learning model for a particle. In this article, we propose a triple archives PSO (TAPSO), in which particles in three archives are used to deal with the above two challenges. First, particles who have better fitness (i.e., elites) are recorded in one archive while other particles who offer faster progress, called profiteers in this article, are saved in another archive. Second, when breeding each dimension of a potential exemplar for a particle, we choose a pair of elite and profiteer from corresponding archives as two parents to generate the dimension value by ordinary genetic operators. Third, each particle carries out a specific learning model according to the fitness of its potential exemplars. Furthermore, there is no acceleration coefficient in TAPSO aiming to simplify the learning models. Finally, if an exemplar has excellent performance, it will be regarded as an outstanding exemplar and saved in the third archive, which can be reused by inferior particles aiming to enhance the exploitation and to save computing resources. The experimental results and comparisons between TAPSO and other eight PSOs on 30 benchmark functions and four real applications suggest that TAPSO attains very promising performance in different types of functions, contributing to both higher solution accuracy and faster convergence speed. Furthermore, the effectiveness and efficiency of these new proposed strategies are discussed based on extensive experiments.
Collapse
|
47
|
Zhang X, Du KJ, Zhan ZH, Kwong S, Gu TL, Zhang J. Cooperative Coevolutionary Bare-Bones Particle Swarm Optimization With Function Independent Decomposition for Large-Scale Supply Chain Network Design With Uncertainties. IEEE TRANSACTIONS ON CYBERNETICS 2020; 50:4454-4468. [PMID: 31545754 DOI: 10.1109/tcyb.2019.2937565] [Citation(s) in RCA: 26] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
Supply chain network design (SCND) is a complicated constrained optimization problem that plays a significant role in the business management. This article extends the SCND model to a large-scale SCND with uncertainties (LUSCND), which is more practical but also more challenging. However, it is difficult for traditional approaches to obtain the feasible solutions in the large-scale search space within the limited time. This article proposes a cooperative coevolutionary bare-bones particle swarm optimization (CCBBPSO) with function independent decomposition (FID), called CCBBPSO-FID, for a multiperiod three-echelon LUSCND problem. For the large-scale issue, binary encoding of the original model is converted to integer encoding for dimensionality reduction, and a novel FID is designed to efficiently decompose the problem. For obtaining the feasible solutions, two repair methods are designed to repair the infeasible solutions that appear frequently in the LUSCND problem. A step translation method is proposed to deal with the variables out of bounds, and a labeled reposition operator with adaptive probabilities is designed to repair the infeasible solutions that violate the constraints. Experiments are conducted on 405 instances with three different scales. The results show that CCBBPSO-FID has an evident superiority over contestant algorithms.
Collapse
|
48
|
Xia X, Gui L, He G, Wei B, Zhang Y, Yu F, Wu H, Zhan ZH. An expanded particle swarm optimization based on multi-exemplar and forgetting ability. Inf Sci (N Y) 2020. [DOI: 10.1016/j.ins.2019.08.065] [Citation(s) in RCA: 68] [Impact Index Per Article: 17.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
49
|
Jian JR, Zhan ZH, Zhang J. Large-scale evolutionary optimization: a survey and experimental comparative study. INT J MACH LEARN CYB 2019. [DOI: 10.1007/s13042-019-01030-4] [Citation(s) in RCA: 27] [Impact Index Per Article: 5.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
50
|
Zhan ZH, Wang ZJ, Jin H, Zhang J. Adaptive Distributed Differential Evolution. IEEE TRANSACTIONS ON CYBERNETICS 2019; 50:4633-4647. [PMID: 31634855 DOI: 10.1109/tcyb.2019.2944873] [Citation(s) in RCA: 32] [Impact Index Per Article: 6.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
Due to the increasing complexity of optimization problems, distributed differential evolution (DDE) has become a promising approach for global optimization. However, similar to the centralized algorithms, DDE also faces the difficulty of strategies' selection and parameters' setting. To deal with such problems effectively, this article proposes an adaptive DDE (ADDE) to relieve the sensitivity of strategies and parameters. In ADDE, three populations called exploration population, exploitation population, and balance population are co-evolved concurrently by using the master-slave multipopulation distributed framework. Different populations will adaptively choose their suitable mutation strategies based on the evolutionary state estimation to make full use of the feedback information from both individuals and the whole corresponding population. Besides, the historical successful experience and best solution improvement are collected and used to adaptively update the individual parameters (amplification factor F and crossover rate CR) and population parameter (population size N), respectively. The performance of ADDE is evaluated on all 30 widely used benchmark functions from the CEC 2014 test suite and all 22 widely used real-world application problems from the CEC 2011 test suite. The experimental results show that ADDE has great superiority compared with the other state-of-the-art DDE and adaptive differential evolution variants.
Collapse
|