期刊文献+
共找到4,170篇文章
< 1 2 209 >
每页显示 20 50 100
Multi-Robot Task Allocation Using Multimodal Multi-Objective Evolutionary Algorithm Based on Deep Reinforcement Learning 被引量:4
1
作者 苗镇华 黄文焘 +1 位作者 张依恋 范勤勤 《Journal of Shanghai Jiaotong university(Science)》 EI 2024年第3期377-387,共11页
The overall performance of multi-robot collaborative systems is significantly affected by the multi-robot task allocation.To improve the effectiveness,robustness,and safety of multi-robot collaborative systems,a multi... The overall performance of multi-robot collaborative systems is significantly affected by the multi-robot task allocation.To improve the effectiveness,robustness,and safety of multi-robot collaborative systems,a multimodal multi-objective evolutionary algorithm based on deep reinforcement learning is proposed in this paper.The improved multimodal multi-objective evolutionary algorithm is used to solve multi-robot task allo-cation problems.Moreover,a deep reinforcement learning strategy is used in the last generation to provide a high-quality path for each assigned robot via an end-to-end manner.Comparisons with three popular multimodal multi-objective evolutionary algorithms on three different scenarios of multi-robot task allocation problems are carried out to verify the performance of the proposed algorithm.The experimental test results show that the proposed algorithm can generate sufficient equivalent schemes to improve the availability and robustness of multi-robot collaborative systems in uncertain environments,and also produce the best scheme to improve the overall task execution efficiency of multi-robot collaborative systems. 展开更多
关键词 multi-robot task allocation multi-robot cooperation path planning multimodal multi-objective evo-lutionary algorithm deep reinforcement learning
原文传递
DeepSurNet-NSGA II:Deep Surrogate Model-Assisted Multi-Objective Evolutionary Algorithm for Enhancing Leg Linkage in Walking Robots
2
作者 Sayat Ibrayev Batyrkhan Omarov +1 位作者 Arman Ibrayeva Zeinel Momynkulov 《Computers, Materials & Continua》 SCIE EI 2024年第10期229-249,共21页
This research paper presents a comprehensive investigation into the effectiveness of the DeepSurNet-NSGA II(Deep Surrogate Model-Assisted Non-dominated Sorting Genetic Algorithm II)for solving complex multiobjective o... This research paper presents a comprehensive investigation into the effectiveness of the DeepSurNet-NSGA II(Deep Surrogate Model-Assisted Non-dominated Sorting Genetic Algorithm II)for solving complex multiobjective optimization problems,with a particular focus on robotic leg-linkage design.The study introduces an innovative approach that integrates deep learning-based surrogate models with the robust Non-dominated Sorting Genetic Algorithm II,aiming to enhance the efficiency and precision of the optimization process.Through a series of empirical experiments and algorithmic analyses,the paper demonstrates a high degree of correlation between solutions generated by the DeepSurNet-NSGA II and those obtained from direct experimental methods,underscoring the algorithm’s capability to accurately approximate the Pareto-optimal frontier while significantly reducing computational demands.The methodology encompasses a detailed exploration of the algorithm’s configuration,the experimental setup,and the criteria for performance evaluation,ensuring the reproducibility of results and facilitating future advancements in the field.The findings of this study not only confirm the practical applicability and theoretical soundness of the DeepSurNet-NSGA II in navigating the intricacies of multi-objective optimization but also highlight its potential as a transformative tool in engineering and design optimization.By bridging the gap between complex optimization challenges and achievable solutions,this research contributes valuable insights into the optimization domain,offering a promising direction for future inquiries and technological innovations. 展开更多
关键词 multi-objective optimization genetic algorithm surrogate model deep learning walking robots
在线阅读 下载PDF
Multi-objective Evolutionary Algorithms for MILP and MINLP in Process Synthesis 被引量:7
3
作者 石磊 姚平经 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 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
Do Search and Selection Operators Play Important Roles in Multi-Objective Evolutionary Algorithms:A Case Study 被引量:1
4
作者 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》 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
EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING
5
作者 Lei Deming Wu Zhiming 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 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... 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
Solving material distribution routing problem in mixed manufacturing systems with a hybrid multi-objective evolutionary algorithm 被引量:7
6
作者 高贵兵 张国军 +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
Optimal setting and placement of FACTS devices using strength Pareto multi-objective evolutionary algorithm 被引量:2
7
作者 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
A Hybrid Multi-Objective Evolutionary Algorithm for Optimal Groundwater Management under Variable Density Conditions 被引量:4
8
作者 YANG Yun WU Jianfeng +2 位作者 SUN Xiaomin LIN Jin WU Jichun 《Acta Geologica Sinica(English Edition)》 SCIE CAS CSCD 2012年第1期246-255,共10页
In this paper, a new hybrid multi-objective evolutionary algorithm (MOEA), the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), is proposed for the management of groundwater resources under va... In this paper, a new hybrid multi-objective evolutionary algorithm (MOEA), the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search (TS) based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm (GA) with a TS based MOEA, the niched Pareto tabu search (NPTS), which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources. 展开更多
关键词 seawater intrusion multi-objective optimization niched Pareto tabu search combined with genetic algorithm niched Pareto tabu search genetic algorithm
在线阅读 下载PDF
Tourism Route Recommendation Based on A Multi-Objective Evolutionary Algorithm Using Two-Stage Decomposition and Pareto Layering 被引量:1
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
Synergetic Optimization of Missile Shapes for Aerodynamic and Radar Cross-Section Performance Based on Multi-objective Evolutionary Algorithm
10
作者 刘洪 《Journal of Shanghai Jiaotong university(Science)》 EI 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
Multi-objective Evolutionary Algorithm Based on Target Space Partitioning Method
11
作者 尚兆霞 刘弘 李焱 《Journal of Donghua University(English Edition)》 EI CAS 2011年第2期177-181,共5页
Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimizatio... Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program. 展开更多
关键词 OPTIMIZATION algorithm multi-objective TARGET SPACE partitioning METHOD
在线阅读 下载PDF
A Review of the Evolution of Multi-Objective Evolutionary Algorithms
12
作者 Thomas Hanne Mohammad Jahani Moghaddam 《Computers, Materials & Continua》 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
Automatic Optimization of Guidance Guardrail Layout Based on Multi-Objective Evolutionary Algorithm
13
作者 Wei-Li Liu Yixin Chen +3 位作者 Xiang Li Jinghui Zhong Rongjun Chen Hu Jin 《Complex System Modeling and Simulation》 2024年第4期353-367,共15页
Guardrails commonly play a significant role in guiding pedestrians and managing crowd flow to prevent congestion in public places.However,existing methods of the guardrail layout mainly rely on manual design or mathem... Guardrails commonly play a significant role in guiding pedestrians and managing crowd flow to prevent congestion in public places.However,existing methods of the guardrail layout mainly rely on manual design or mathematical models,which are not flexible or effective enough for crowd control in large public places.To address this limitation,this paper introduces a novel automated optimization framework for guidance guardrails based on a multi-objective evolutionary algorithm.The paper incorporates guidance signs into the guardrails and designs a coding-decoding scheme based on Gray code to enhance the flexibility of the guardrail layout.In addition to optimizing pedestrian passage efficiency and safety,the paper also considers the situation of pedestnan counterflow,making the guardrai layout more practical.Experimental results have demonstrated the effectiveness of the proposed method in alleviating safety hazards caused by potential congestion,as well as its significant improvements in passage effciency and prevention of pedestrian counte rflow. 展开更多
关键词 automatical guardrall layout optimization crowd simulation multi-objective evolutionary algorithm
原文传递
Dynamic Multi-Objective Gannet Optimization(DMGO):An Adaptive Algorithm for Efficient Data Replication in Cloud Systems
14
作者 P.William Ved Prakash Mishra +3 位作者 Osamah Ibrahim Khalaf Arvind Mukundan Yogeesh N Riya Karmakar 《Computers, Materials & Continua》 2025年第9期5133-5156,共24页
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat... Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance. 展开更多
关键词 Cloud computing data replication dynamic optimization multi-objective optimization gannet optimization algorithm adaptive algorithms resource efficiency SCALABILITY latency reduction energy-efficient computing
在线阅读 下载PDF
Multi-Objective Hybrid Sailfish Optimization Algorithm for Planetary Gearbox and Mechanical Engineering Design Optimization Problems
15
作者 Miloš Sedak Maja Rosic Božidar Rosic 《Computer Modeling in Engineering & Sciences》 2025年第2期2111-2145,共35页
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op... This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain. 展开更多
关键词 multi-objective optimization planetary gearbox gear efficiency sailfish optimization differential evolution hybrid algorithms
在线阅读 下载PDF
Multi-objective optimal design of asymmetric base-isolated structures using NSGA-Ⅱ algorithm for improving torsional resistance
16
作者 Zhang Jiayu Qi Ai Yang Mianyue 《Earthquake Engineering and Engineering Vibration》 2025年第3期811-825,共15页
Finding an optimal isolator arrangement for asymmetric structures using traditional conceptual design methods that can significantly minimize torsional response while ensuring efficient horizontal seismic isolation is... Finding an optimal isolator arrangement for asymmetric structures using traditional conceptual design methods that can significantly minimize torsional response while ensuring efficient horizontal seismic isolation is cumbersome and inefficient.Thus,this work develops a multi-objective optimization method to enhance the torsional resistance of asymmetric base-isolated structures.The primary objective is to simultaneously minimize the interstory rotation of the superstructure,the rotation of the isolation layer,and the interstory displacement of the superstructure without exceeding the isolator displacement limits.A fast non-dominated sorting genetic algorithm(NSGA-Ⅱ)is employed to satisfy this optimization objective.Subsequently,the isolator arrangement,encompassing both positions and categories,is optimized according to this multi-objective optimization method.Additionally,an optimization design platform is developed to streamline the design operation.This platform integrates the input of optimization parameters,the output of optimization results,the finite element analysis,and the multi-objective optimization method proposed herein.Finally,the application of this multi-objective optimization method and its associated platform are demonstrated on two asymmetric base-isolated structures of varying heights and plan configurations.The results indicate that the optimal isolator arrangement derived from the optimization method can further improve the control over the lateral and torsional responses of asymmetric base-isolated structures compared to conventional conceptual design methods.Notably,the interstory rotation of the optimal base-isolated structure is significantly reduced,constituting only approximately 33.7%of that observed in the original base-isolated structure.The proposed platform facilitates the automatic generation of the optimal design scheme for the isolators of asymmetric base-isolated structures,offering valuable insights and guidance for the burgeoning field of intelligent civil engineering design. 展开更多
关键词 asymmetric base-isolated structures isolator arrangement multi-objective optimization NSGA-Ⅱalgorithm optimization design platform
在线阅读 下载PDF
MOCBOA:Multi-Objective Chef-Based Optimization Algorithm Using Hybrid Dominance Relations for Solving Engineering Design Problems
17
作者 Nour Elhouda Chalabi Abdelouahab Attia +4 位作者 Abdulaziz S.Almazyad Ali Wagdy Mohamed Frank Werner Pradeep Jangir Mohammad Shokouhifar 《Computer Modeling in Engineering & Sciences》 2025年第4期967-1008,共42页
Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Op... Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct objectives.Our approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto front.Our comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume metric.This paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization. 展开更多
关键词 multi-objective optimization chef-based optimization algorithm(CBOA) pareto dominance epsilon dominance cone-epsilon dominance strengthened dominance
在线阅读 下载PDF
An Improved Multi-objective Artificial Hummingbird Algorithm for Capacity Allocation of Supercapacitor Energy Storage Systems in Urban Rail Transit
18
作者 Xin Wang Jian Feng Yuxin Qin 《Journal of Bionic Engineering》 2025年第2期866-883,共18页
To address issues such as poor initial population diversity, low stability and local convergence accuracy, and easy local optima in the traditional Multi-Objective Artificial Hummingbird Algorithm (MOAHA), an Improved... To address issues such as poor initial population diversity, low stability and local convergence accuracy, and easy local optima in the traditional Multi-Objective Artificial Hummingbird Algorithm (MOAHA), an Improved MOAHA (IMOAHA) was proposed. The improvements involve Tent mapping based on random variables to initialize the population, a logarithmic decrease strategy for inertia weight to balance search capability, and the improved search operators in the territory foraging phase to enhance the ability to escape from local optima and increase convergence accuracy. The effectiveness of IMOAHA was verified through Matlab/Simulink. The results demonstrate that IMOAHA exhibits superior convergence, diversity, uniformity, and coverage of solutions across 6 test functions, outperforming 4 comparative algorithms. A Wilcoxon rank-sum test further confirmed its exceptional performance. To assess IMOAHA’s ability to solve engineering problems, an optimization model for a multi-track, multi-train urban rail traction power supply system with Supercapacitor Energy Storage Systems (SCESSs) was established, and IMOAHA was successfully applied to solving the capacity allocation problem of SCESSs, demonstrating that it is an effective tool for solving complex Multi-Objective Optimization Problems (MOOPs) in engineering domains. 展开更多
关键词 multi-objective artificial hummingbird algorithm Tent mapping based on random variables Urban rail transit Supercapacitor energy storage systems Capacity allocation
在线阅读 下载PDF
A decoupled multi-objective optimization algorithm for cut order planning of multi-color garment
19
作者 DONG Hui LYU Jinyang +3 位作者 LIN Wenjie WU Xiang WU Mincheng HUANG Guangpu 《High Technology Letters》 2025年第1期53-62,共10页
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish... This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises. 展开更多
关键词 multi-objective optimization non-dominated sorting in genetic algorithmsⅡ(NSGAII) cut order planning(COP) multi-color garment linear programming decoupling strategy
在线阅读 下载PDF
Enhancing Evolutionary Algorithms With Pattern Mining for Sparse Large-Scale Multi-Objective Optimization Problems
20
作者 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
上一页 1 2 209 下一页 到第
使用帮助 返回顶部