Swarm and Evolutionary Computation最新文献

In many-objective optimization, both convergence and diversity are equally important. However, in high-dimensional spaces, traditional decomposition-based many-objective evolutionary algorithms struggle to ensure population diversity. Conversely, traditional Pareto dominance-based many-objective evolutionary algorithms face challenges in ensuring population convergence. In this paper, we propose a novel many-objective evolutionary algorithm based on interaction force and hybrid optimization mechanism (MaOEAIH) for effectively addressing the difficulty in balancing convergence and diversity. First, we use the concept of interaction force to simulate the convergence (akin to gravity) and diversity (repulsion) of the population. Subsequently, we design an optimization mechanism that combines decomposition and Pareto dominance to enhance the convergence and diversity of the population separately. Simultaneously, to eliminate dominance resistance solutions, we propose a quartile method based on boundary solutions. Additionally, Random perturbations are also introduced to certain individuals within the population to facilitate their escape from local optima. MaOEAIH is compared with some state-of-the-art algorithms on 31 well-known test problems with 3-15 objectives. The experimental results show that, compared to other algorithms, MaOEAIH not only obtains solution sets of higher quality when dealing with different types of many-objective optimization problems, but also effectively addresses key challenges including insufficient selection pressure, difficulty balancing convergence and diversity, and susceptibility to population entrapment in local optima within many-objective optimization scenarios.

Two-sided assembly lines are typically employed in the production of medium and large-sized products with the aim of reducing the length of the assembly line, enhancing assembly efficiency and consequently reducing the time required for product assembly. However, traditional Two-sided assembly lines lack effective resource scheduling management methods in production scheduling, which results in low productivity and high resource costs. In order to address this issue, we propose a new two-sided resource-constrained assembly line balancing problem (TRCLBP) model. The model takes the minimum number of workstations and the minimum assembly cost as its objective function and proposes an improved genetic algorithm (I-GA) to solve it. A three-layer chromosome initialization method is proposed for the assembly tasks and resource decisions, which effectively improves the diversity and quality of the initial population. Furthermore, the algorithm employs strategies such as matching crossover and redistributing variants to ensure rapid convergence of the populations and to prevent them from falling into local optimums. Finally, the efficacy of the model and algorithm proposed in this paper is validated through a comprehensive analysis of arithmetic case studies and enterprise engineering examples. This analysis reveals a reduction of approximately 18 % in the total cost of assembly. Furthermore, the model enables enterprises to make informed decisions regarding the optimal allocation of resources, thereby reducing production costs and improving the efficiency of assembly operations during periods of expansion.

Multi-objective optimization problems (MOPs) aim to obtain a set of Pareto-optimal solutions, and as the number of objectives increases, the quantity of these optimal solutions grows exponentially. However, a plethora of optimal solutions can impose significant decision stress on decision-makers. Subset selection, as the extension of a model, can extract a representative set of solutions, thereby alleviating the decision-makers’ choice pressure. In addition, extending a model undoubtedly incurs additional time costs. To cope with the foregoing issues, a fast subset selection method named ranking-based subset selection (RBSS) is proposed in this paper. It can efficiently select a small number of optimal solutions within an unbounded external archive and can be directly applied to any multi-objective evolutionary algorithm. This allows it to maintain good distribution and diversity with very little time investment. We employed a ranking-based approach to map the objective space to a ranking space (an integer space) defined by us and then selected the corresponding subset in the ranking space. The well-behaved mathematical properties of the ranking space and the advantages of using integer calculations accelerated the subset selection process. Experimental results indicate that compared to several state-of-the-art subset selection methods, RBSS is capable of selecting a set of representative and diverse solutions across different types of MOPs, while consuming significantly less time. Specifically, for problems where the Pareto front is a two-dimensional manifold and a one-dimensional manifold, the time consumption of RBSS is approximately only 0.028% to 27.5% and 4.6e−4% to 0.15% of that required by other algorithms, respectively.

Due to the increasing demand for green manufacturing, energy-saving scheduling problems have garnered significant attention. These problems aim to reduce energy consumption at the production system level within workshops. To simulate a realistic production environment, this study addresses an energy-saving flexible job shop scheduling problem that considers two types of speed-adjustable resources, namely machines and transporters. The optimization objective is to minimize the comprehensive energy consumption of the workshop. A novel mathematical model is initially constructed based on the specific characteristics of the problem at hand. Given its NP-hard nature, a new Q-learning-based biology migration algorithm (QBMA) is proposed, which encompasses diverse search strategies and employs a Q-learning algorithm to dynamically select search strategies, thereby preventing blind search during the evolutionary process. The experimental results of our study demonstrate the promising efficacy of QBMA in effectively addressing the aforementioned problem, while also highlighting the positive impact of considering resources with adjustable speed.

In this paper, we study the stochastic resource-constrained project scheduling problem with transfer and idle costs (SRCPSP-TIC) under uncertain environments, where the resource transfer and idle take time and costs. Priority rule (PR) based heuristics are the most commonly used approaches for project scheduling under uncertain environments due to their simplicity and efficiency. For PR-based heuristics of the SRCPSP-TIC, activity priority rules (APRs) and transfer priority rules (TPRs) are necessary to decide the activity sequence and resource transfer. Traditionally, APRs and TPRs need to be manually designed, which is time-consuming and difficult to adapt to different scheduling scenarios. Therefore, based on two individual representation methods, we propose two co-evolution genetic programming (CGP) based hyper-heuristics to evolve APRs and TPRs automatically. Furthermore, a fitness function surrogate-assisted method and a transfer learning mechanism are designed to improve the efficiency and solution quality of the CGP. Based on the instances with different stochastic activity duration distributions, we test the performance of different CGP-based hyper-heuristics and compare the evolved PRs with the classical PRs to demonstrate the effectiveness of evolved PRs. Experimental results show that the proposed algorithms can automatically evolve efficient PRs for the SRCPSP-TIC.

Optimization algorithms and large language models (LLMs) enhance decision-making in dynamic environments by integrating artificial intelligence with traditional techniques. LLMs, with extensive domain knowledge, facilitate intelligent modeling and strategic decision-making in optimization, while optimization algorithms refine LLM architectures and output quality. This synergy offers novel approaches for advancing general AI, addressing both the computational challenges of complex problems and the application of LLMs in practical scenarios. This review outlines the progress and potential of combining LLMs with optimization algorithms, providing insights for future research directions.

In this paper, we address the prize-collecting generalized minimum spanning tree problem (PC-GMSTP) which aims to find a minimum spanning tree to connect a network of clusters using exactly one vertex per cluster, minimizing the total cost of connecting the clusters while considering both the costs of edges and the prizes offered by the vertices. An Adaptive Multi-meme Memetic Algorithm (AMMA) is proposed to tackle PC-GMSTP, which combines an adaptive reproduction procedure and a collaborated local search procedure. The adaptive reproduction procedure uses either crossover or mutation to produce offspring to maintain a good balance between exploration and exploitation of the search space, and the probability to use crossover or mutation is adaptively adjusted based on the diversity of population. The collaborated local search procedure, which includes two efficient local search operators, can effectively enhance the intensification ability of AMMA due to their complementary features. Extensive computational experiments on 126 challenging instances demonstrate the superiority of AMMA, outperforming 23 best-known solutions from existing literature while achieving similar solutions for the remaining 103 instances. Wilcoxon’s signed rank test confirms that the performance of AMMA is significantly better than the state-of-the-art algorithms.

Many real multi-objective optimization problems with 20-50 decision variables often have only a small number of function evaluations available, because of their heavy time/money burden. Therefore, surrogate models are often utilized as alternatives for expensive function evaluations. However, the approximation error of the surrogate model is inevitable compared to the real function evaluation. The approximation error has a similar impact on the algorithm as noise, i.e., different optimization stages suffer from various impacts. Therefore, the current optimization stage can be indirectly detected via measuring the impact of the noise formulated by the approximation error. In addition, the rising dimension of the search space leads to an increase in the approximation errors of the surrogate models, which poses a huge challenge for existing surrogate-assisted multi-objective evolutionary algorithms. In this work, we propose a stage-adaptive surrogate-assisted multi-objective evolutionary algorithm to solve the medium-scale optimization problems. In the proposed algorithm, the ensemble model consisting of the latest and historical models is used as the surrogate model, on the basis of which a set of potential candidates can be discovered. Then, a stage-adaptive infill sampling strategy selects the most suitable sampling strategy by analyzing the demand of the current optimization stage on convergence, diversity, model accuracy to sample from the candidates. As for the current optimization stage, it is detected by a noise impact indicator, where the approximation errors of surrogate models are formulated as noise. The experimental results on a series of medium-scale expensive test problems demonstrate the superiority of the proposed algorithm over six state-of-the-art compared algorithms.

Feature selection (FS), as one of the most significant preprocessing techniques in the fields of machine learning and pattern recognition, has received great attention. In recent years, evolutionary computation has become a popular technique for handling FS problems due to its superior global search performance. In this paper, a comprehensive review of evolutionary computation research on the FS problems is presented. Firstly, a new taxonomy for the basic components of evolutionary feature selection algorithms (EFSs) is proposed, including encoding strategy, population initialization, population updating, local search, multi-FS hybrid and ensemble. Secondly, we summarize the latest research progress of EFSs on some new and complex scenarios, including large-scale high-dimensional data, multi-objective/metric scenario, multi-label data, distributed storage data, multi-task scenario, multi-modal scenario, interpretable FS and stable FS, etc. Moreover, this survey provides also an in-depth analysis of real-world applications of EFSs, such as hyperspectral band selection, bioinformatics gene selection, text classification and fault detection, etc. Finally, several opportunities for future work are pointed out.

Energy consumption and makespan of workflow execution are two core performance indicators in operating cloud platforms. But, simultaneously optimizing these two indicators encounters various challenges, such as elastic resources, large-scale decision variables, and sophisticated workflow structures. To handle these challenges, we design an adaptive evolutionary scheduling algorithm, namely AESA, with three innovative strategies. First, a heuristic population initialization strategy is devised to gather workflow tasks onto limited potential resources, thereby alleviating the negative impact of redundant cloud resources on evolutionary search efficiency. Then, a variable analysis strategy is designed to dynamically measure the contribution of each decision variable in pushing the population towards Pareto-optimal fronts. Moreover, AESA embraces an adaptive strategy to reward more evolutionary opportunities for decision variables with higher contributions to handle large-scale decision variables in a targeted manner, further improving the efficiency of evolutionary search. Finally, extensive experiments are performed based on real-world cloud platforms and workflow traces to verify the effectiveness of the proposed AESA. The comparison results validate its superior performance by significantly outperforming five representative baselines in optimizing makespan and energy consumption. Also, the results of ablation experiments demonstrate that all three components contribute to AESA’s overall performance, with the adaptive reward mechanism being the most significant.