期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到65篇文章
< 1 2 … 4 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Review of the Evolution of Multi-Objective Evolutionary Algorithms 认领 引用 被引量：1
1
作者 Thomas Hanne Mohammad Jahani Moghaddam 《Computers, Materials & Continua》 SCIE EI 2025年第12期4203-4236,共34页
Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review exp... Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review explores the historical development of MOEAs,beginning with foundational concepts in multi-objective optimization,basic types of MOEAs,and the evolution of Pareto-based selection and niching methods.Further advancements,including decom-position-based approaches and hybrid algorithms,are discussed.Applications are analyzed in established domains such as engineering and economics,as well as in emerging fields like advanced analytics and machine learning.The significance of MOEAs in addressing real-world problems is emphasized,highlighting their role in facilitating informed decision-making.Finally,the development trajectory of MOEAs is compared with evolutionary processes,offering insights into their progress and future potential. 展开更多
关键词 Multi-objective optimization evolutionary algorithms Pareto-based selection decomposition-based methods advanced analytics
暂未订购 下载PDF
Constraint Intensity-Driven Evolutionary Multitasking for Constrained Multi-Objective Optimization 认领 引用
2
作者 Leyu Zheng Mingming Xiao +2 位作者 Yi Ren Ke Li Chang Sun 《Computers, Materials & Continua》 SCIE EI 2026年第3期1241-1261,共21页
In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and red... In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs. 展开更多
关键词 Constrained multi-objective optimization evolutionary algorithm evolutionary multitasking knowledge transfer
暂未订购 下载PDF
Multi-Objective Evolutionary Framework for High-Precision Community Detection in Complex Networks 认领 引用
3
作者 Asal Jameel Khudhair Amenah Dahim Abbood 《Computers, Materials & Continua》 SCIE EI 2026年第1期1453-1483,共31页
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r... Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification. 展开更多
关键词 Multi-objective optimization evolutionary algorithms community detection heuristic metaheuristic hybrid social network models
暂未订购 下载PDF
A Survey of Evolutionary Algorithms for Multi-Objective Optimization Problems With Irregular Pareto Fronts 认领 引用 被引量：54
4
作者 Yicun Hua Qiqi Liu +1 位作者 Kuangrong Hao Yaochu Jin 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2021年第2期303-318,I0001-I0004,共16页
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remed... Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested. 展开更多
关键词 Evolutionary algorithm machine learning multi-objective optimization problems(MOPs) irregular Pareto fronts
暂未订购 下载PDF
Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis 认领 引用 被引量：6
5
作者 石磊 姚平经 《Chinese Journal of Chemical Engineering》 SCIE EI CAS 2001年第2期173-178,共6页
Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitnes... Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis. 展开更多
关键词 multi-objective programming multi-objective evolutionary algorithm steady-state non-dominated sorting genetic algorithm process synthesis
暂未订购 下载PDF
Enhancing Evolutionary Algorithms With Pattern Mining for Sparse Large-Scale Multi-Objective Optimization Problems 认领 引用 被引量：2
6
作者 Sheng Qi Rui Wang +3 位作者 Tao Zhang Weixiong Huang Fan Yu Ling Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第8期1786-1801,共16页
Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to tr... Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to traverse vast expanse with limited computational resources.Furthermore,in the context of sparse,most variables in Pareto optimal solutions are zero,making it difficult for algorithms to identify non-zero variables efficiently.This paper is dedicated to addressing the challenges posed by SLMOPs.To start,we introduce innovative objective functions customized to mine maximum and minimum candidate sets.This substantial enhancement dramatically improves the efficacy of frequent pattern mining.In this way,selecting candidate sets is no longer based on the quantity of nonzero variables they contain but on a higher proportion of nonzero variables within specific dimensions.Additionally,we unveil a novel approach to association rule mining,which delves into the intricate relationships between non-zero variables.This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value.We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs.The results demonstrate that our approach achieves competitive solutions across various challenges. 展开更多
关键词 Evolutionary algorithms pattern mining sparse large-scale multi-objective problems(SLMOPs) sparse large-scale optimization.
暂未订购 下载PDF
An Efficient Evolutionary Algorithm for Few-for-Many Optimization 认领 引用
7
作者 Ke Shang Hisao Ishibuchi +1 位作者 Zexuan Zhu Qingfu Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2026年第6期1362-1377,共16页
Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike tradi... Few-for-many(F4M)optimization,recently introduced as a novel paradigm in multi-objective optimization,aims to find a small set of solutions that effectively handle a large number of conflicting objectives.Unlike traditional many-objective optimization methods,which typically attempt comprehensive coverage of the Pareto front,F4M optimization emphasizes finding a small representative solution set to efficiently address highdimensional objective spaces.Motivated by the computational complexity and practical relevance of F4M optimization,this paper proposes a new evolutionary algorithm explicitly tailored for efficiently solving F4M optimization problems.Inspired by Smetric selection evolutionary multi-objective optimization algorithm(SMS-EMOA),our proposed approach employs a(μ+1)-evolution strategy guided by the objective of F4M optimization.Furthermore,to facilitate rigorous performance assessment,we propose a novel benchmark test suite specifically designed for F4M optimization by leveraging the similarity betw een the R2indicator and F4M formulations.Our test suite is highly flexible,allowing any existing multi-objective optimization problem to be transformed into a corresponding F4M instance via scalarization using the weighted Tchebycheff function.Comprehensive experimental evaluations on benchmarks demonstrate the superior performance of our algorithm compared to existing state-of-the-art algorithms,especially on instances involving a large number of objectives.The source code of the proposed algorithm will be released publicly.Source code is available at http://gffzz188fe103f8f1460asnfwuqc6vbfwv6555.ffgz.tsg.suse.edu.cn/MOL-SZU/SoM-EMOA. 展开更多
关键词 Evolutionary algorithm few-for-many optimization many-objective optimization (MOO) multi-objective optimization
暂未订购 下载PDF
Solving material distribution routing problem in mixed manufacturing systems with a hybrid multi-objective evolutionary algorithm 认领 引用 被引量：7
8
作者 高贵兵 张国军 +2 位作者 黄刚 朱海平 顾佩华 《Journal of Central South University》 SCIE EI CAS 2012年第2期433-442,共10页
The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency... The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II. 展开更多
关键词 material distribution routing problem multi-objective optimization evolutionary algorithm local search
暂未订购 下载PDF
Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering 认领 引用 被引量：2
9
作者 Xiaoyao Zheng Baoting Han Zhen Ni 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2023年第2期486-500,共15页
Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions ... Tourism route planning is widely applied in the smart tourism field.The Pareto-optimal front obtained by the traditional multi-objective evolutionary algorithm exhibits long tails,sharp peaks and disconnected regions problems,which leads to uneven distribution and weak diversity of optimization solutions of tourism routes.Inspired by these limitations,we propose a multi-objective evolutionary algorithm for tourism route recommendation(MOTRR)with two-stage and Pareto layering based on decomposition.The method decomposes the multiobjective problem into several subproblems,and improves the distribution of solutions through a two-stage method.The crowding degree mechanism between extreme and intermediate populations is used in the two-stage method.The neighborhood is determined according to the weight of the subproblem for crossover mutation.Finally,Pareto layering is used to improve the updating efficiency and population diversity of the solution.The two-stage method is combined with the Pareto layering structure,which not only maintains the distribution and diversity of the algorithm,but also avoids the same solutions.Compared with several classical benchmark algorithms,the experimental results demonstrate competitive advantages on five test functions,hypervolume(HV)and inverted generational distance(IGD)metrics.Using the experimental results of real scenic spot datasets from two famous tourism social networking sites with vast amounts of users and large-scale online comments in Beijing,our proposed algorithm shows better distribution.It proves that the tourism routes recommended by our proposed algorithm have better distribution and diversity,so that the recommended routes can better meet the personalized needs of tourists. 展开更多
关键词 Evolutionary algorithm multi-objective optimization Pareto optimization tourism route recommendation two-stage decomposition
暂未订购 下载PDF
EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING 认领 引用
10
作者 Lei Deming Wu Zhiming 《Chinese Journal of Mechanical Engineering》 EI CAS 2005年第4期494-497,共4页
A new representation method is first presented based on priority roles.According to this method,each entry in the chromosome indicates that in the procedure of the Giffler and Thompson(GT)algorithm,the conflict occurr... A new representation method is first presented based on priority roles.According to this method,each entry in the chromosome indicates that in the procedure of the Giffler and Thompson(GT)algorithm,the conflict occurring in the corresponding machine is resolved by the corresponding priority role.Then crowding-measure multi-objective evolutionary algorithm(CMOEA)is designed,in which both archive maintenance and fitness assignment use crowding measure.Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling. 展开更多
关键词 Job shop Crowding measure Archive maintenance Fitness assignment Multi-objective evolutionary algorithm
暂未订购 下载PDF
Optimal setting and placement of FACTS devices using strength Pareto multi-objective evolutionary algorithm 认领 引用 被引量：2
11
作者 Amin Safari Hossein Shayeghi Mojtaba Bagheri 《Journal of Central South University》 SCIE EI CAS CSCD 2017年第4期829-839,共11页
This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for... This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems. 展开更多
关键词 strength Pareto multi-objective evolutionary algorithm static var compensator (SVC) thyristor controlled series capacitor (TCSC) static voltage stability margin optimal location
暂未订购 下载PDF
Do Search and Selection Operators Play Important Roles in Multi-Objective Evolutionary Algorithms:A Case Study 认领 引用 被引量：2
12
作者 Yan Zhen-yu, Kang Li-shan, Lin Guang-ming ,He MeiState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei, ChinaSchool of Computer Science, UC, UNSW Australian Defence Force Academy, Northcott Drive, Canberra, ACT 2600 AustraliaCapital Bridge Securities Co. ,Ltd, Floor 42, Jinmao Tower, Shanghai 200030, China 《Wuhan University Journal of Natural Sciences》 EI CAS 2003年第S1期195-201,共7页
Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search an... Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators. 展开更多
关键词 multi-objective evolutionary algorithm convergence property analysis search operator selection operator Markov chain
暂未订购 下载PDF
Synergetic Optimization of Missile Shapes for Aerodynamic and Radar Cross-Section Performance Based on Multi-objective Evolutionary Algorithm 认领 引用
13
作者 刘洪 《Journal of Shanghai Jiaotong university(Science)》 2004年第2期36-40,共5页
A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set ... A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles. 展开更多
关键词 multi-objective design(MOD) multidisciplinary design optimization (MDO) evolutionary algorithm synergetic optimization decision making scheme interactive preference articulation Pareto optimal set
暂未订购 下载PDF
Evolutionary Algorithm Based on Surrogate and Inverse Surrogate Models for Expensive Multiobjective Optimization 认领 引用
14
作者 Qi Deng Qi Kang +4 位作者 MengChu Zhou Xiaoling Wang Shibing Zhao Siqi Wu Mohammadhossein Ghahramani 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第5期961-973,共13页
When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by usin... When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models.The generated solutions exhibit excessive randomness,which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima.To improve SAEAs greatly,this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1)Employing a surrogate model in lieu of expensive(true)function evaluations;and 2)Proposing and using an inverse surrogate model to generate new solutions.By using the same training data but with its inputs and outputs being reversed,the latter is simple to train.It is then used to generate new vectors in objective space,which are mapped into decision space to obtain their corresponding solutions.Using a particular example,this work shows its advantages over existing SAEAs.The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency. 展开更多
关键词 Expensives multi-objective optimization reverse model surrogate-assisted evolutionary algorithms(SAEAs)
暂未订购 下载PDF
Evolutionary Computation for Large-scale Multi-objective Optimization: A Decade of Progresses 认领 引用 被引量：10
15
作者 Wen-Jing Hong Peng Yang Ke Tang 《International Journal of Automation and computing》 CSCD 2021年第2期155-169,共15页
Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged a... Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed. 展开更多
关键词 Large-scale multi-objective optimization high-dimensional search space evolutionary computation evolutionary algorithms scalability
暂未订购 下载PDF
An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches 认领 引用 被引量：5
16
作者 WU Xiuli PENG Junjian +2 位作者 XIE Zirun ZHAO Ning WU Shaomin 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2021年第2期272-285,共14页
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro... In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches. 展开更多
关键词 flexible job shop variable batch inverse scheduling multi-objective evolutionary algorithm based on decomposition a batch optimization algorithm with inverse scheduling
暂未订购 下载PDF
Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier 认领 引用 被引量：1
17
作者 JunWang Linxi Zhang +4 位作者 Hao Zhang Funan Peng Mohammed A.El-Meligy Mohamed Sharaf Qiang Fu 《Computers, Materials & Continua》 SCIE EI 2024年第4期1281-1299,共19页
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly... The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently. 展开更多
关键词 Multi-objective evolutionary optimization algorithm decision variables grouping extreme point pareto frontier
暂未订购 下载PDF
A Surrogate-Assisted Multi-Objective Evolutionary Algorithm with Discontinuity-Inducing Variables 认领 引用
18
作者 Chunlin He Guangsong Guo +2 位作者 Yong Zhang Xianfang Song Xinfang Ji 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2026年第1期349-378,共30页
In practice,some multi-objective optimization problems exhibit expensive calculation characteristic,called expensive multi-objective optimization problems(EMOPs).Most of the existing expensive multi-objective evolutio... In practice,some multi-objective optimization problems exhibit expensive calculation characteristic,called expensive multi-objective optimization problems(EMOPs).Most of the existing expensive multi-objective evolutionary algorithms do not consider the discontinuity of Pareto front(PF),their performance is not ideal when solving EMOPs with discontinuous PF.In view of this,this paper proposes a surrogate-assisted multi-objective evolutionary algorithm with discontinuity-inducing variables(VD-SAMOEA).First,a method combining density clustering and random sampling is developed to identify variables that significantly impact the discontinuity of PF.And then,based on the identified discontinuity-inducing variables,a local exploitation strategy with varying search intervals is presented to improve the algorithm’s search performance for the sparse PF segments.Further,a local surrogate model construction method based on geodesic flow kernel multi-source transfer learning is proposed to improve the accuracy of the local surrogate model on the exploited region.Moreover,a convergence-indicator-guided hybrid global search strategy is proposed to balance the diversity and convergence of the population.Finally,experimental results on 20 test functions and the carbon fiber spinning problem indicate that,compared to 11 typical algorithms,the proposed algorithm can obtain high-quality Pareto optimal solutions with a lower computational cost. 展开更多
关键词 evolutionary computation multi-objective optimization surrogate-assisted evolutionary algorithm particle swarm optimization
暂未订购 下载PDF
QIMIG:A Quantum-Inspired Evolutionary Framework for Software Library Migration 认领 引用
19
作者 Yun Liu Jinghua Zhao +3 位作者 Liang Ma Zijie Huang Lizhi Cai Jianxin Ge 《Computers, Materials & Continua》 SCIE EI 2026年第9期795-812,共18页
Automated library migration reduces refactoring costs but challenges traditional evolutionary algorithms,which often suffer from premature convergence and poor recall in sparse,complex API mapping spaces.To address th... Automated library migration reduces refactoring costs but challenges traditional evolutionary algorithms,which often suffer from premature convergence and poor recall in sparse,complex API mapping spaces.To address this,we propose QIMIG,a multi-objective optimization framework integrating quantum-inspired encoding with quality-aware and greedy heuristic filtering.QIMIG utilizes a probabilistic Q-bit representation to maintain population diversity and avoid local optima.Simultaneously,its heuristic components leverage historical usage context to filter semantic noise and guide the search toward valid mappings.Evaluated on 9 real-world migration rules derived from 57,447 open-source projects,QIMIG statistically significantly outperforms state-of-the-art baselines such as UNSGA-III.The framework achieves a global mean F1-score of 0.92,exceeding the best-performing baseline by an absolute margin of 0.05,and demonstrates strong stability in resolving complex mapping structures. 展开更多
关键词 Library migration API mapping search-based software engineering quantum-inspired evolutionary algorithm multi-objective optimization
暂未订购 下载PDF
Efficient multi-objective CMA-ES algorithm assisted by knowledge-extraction-based variable-fidelity surrogate model 认领 引用
20
作者 Zengcong LI Kuo TIAN +1 位作者 Shu ZHANG Bo WANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2023年第6期213-232,共20页
To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is prese... To accelerate the multi-objective optimization for expensive engineering cases, a Knowledge-Extraction-based Variable-Fidelity Surrogate-assisted Covariance Matrix Adaptation Evolution Strategy(KE-VFS-CMA-ES) is presented. In the first part, the KE-VFS model is established. Firstly, the optimization is performed using the low-fidelity surrogate model to obtain the Low-Fidelity Non-Dominated Solutions(LF-NDS). Secondly, aiming to obtain the High-Fidelity(HF) sample points located in promising areas, the K-means clustering algorithm and the space-filling strategy are used to extract knowledge from the LF-NDS to the HF space. Finally,the KE-VFS model is established by means of the obtained HF and LF sample points. In the second part, a novel model management based on the Modified Hypervolume Improvement(MHVI) criterion and pre-screening strategy is proposed. In each generation of KE-VFS-CMA-ES, excessive candidate points are firstly generated and then calculated by the MHVI criterion to find out a few potential points, which will be evaluated by the HF model. Through the above two parts,the promising areas can be detected and the potential points can be screened out, which contributes to speeding up the optimization process twofold. Three classic benchmark functions and a time-consuming engineering case of the aerospace integrally stiffened shell are studied, and results illustrate the excellent efficiency, robustness and applicability of KE-VFS-CMA-ES compared with other four known multi-objective optimization algorithms. 展开更多
关键词 Covariance matrix adaptation evolution strategy Model management Multi-objective optimization Surrogate-assisted evolutionary algorithm Variable-fidelity surrogate model
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 4 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈