检索结果-内蒙古大学图书馆

Design and optimization of diffraction-limited storage ring lattices based on many-objective evolutionary algorithms

引用

Nuclear Science and Techniques 2023年第10期34卷 20-35页

作者： He-Xing Yin Jia-Bao Guan Shun-Qiang Tian Ji-Ke Wang The Institute for Advanced Studies Wuhan UniversityWuhan 430072China Shanghai Advanced Research Institute Chinese Academy of SciencesShanghai 201210China

Multi-objective evolutionary algorithms(MOEAs) are typically used to optimize two or three objectives in the accelerator field and perform well. However, the performance of these algorithms may severely deteriorate when the optimization objectives for an accelerator are equal to or greater than four. Recently, many-objective evolutionary algorithms(MaOEAs)that can solve problems with four or more optimization objectives have received extensive attention. In this study, two diffraction-limited storage ring(DLSR) lattices of the Extremely Brilliant Source(ESRF-EBS) type with different energies were designed and optimized using three MaOEAs and a widely used MOEA. The initial population was found to have a significant impact on the performance of the algorithms and was carefully studied. The performances of the four algorithms were compared, and the results demonstrated that the grid-based evolutionary algorithm(GrEA) had the best *** OEAs were applied in many-objective optimization of DLSR lattices for the first time, and lattices with natural emittances of 116 and 23 pm·rad were obtained at energies of 2 and 6 GeV, respectively, both with reasonable dynamic aperture and local momentum aperture(LMA). This work provides a valuable reference for future many-objective optimization of DLSRs.

关键词： Storage ring lattices many-objective evolutionary algorithms GrEA algorithm NSGA

来源：评论

学校读者我要写书评

暂无评论

Comparison of many-objective evolutionary algorithms using performance metrics ensemble

引用

ADVANCES IN ENGINEERING SOFTWARE 2014年 76卷 1-8页

作者： He, Z. Yen, G. G. Oklahoma State Univ Sch Elect & Comp Engn Stillwater OK 74078 USA

In this study, we have thoroughly researched on performance of six state-of-the-art Multiobjective evolutionary algorithms (MOEAs) under a number of carefully crafted many-objective optimization benchmark problems. Each MOEA apply different method to handle the difficulty of increasing objectives. Performance metrics ensemble exploits a number of performance metrics using double elimination tournament selection and provides a comprehensive measure revealing insights pertaining to specific problem characteristics that each MOEA could perform the best. Experimental results give detailed information for performance of each MOEA to solve many-objective optimization problems. More importantly, it shows that this performance depends on two distinct aspects: the ability of MOEA to address the specific characteristics of the problem and the ability of MOEA to handle high-dimensional objective space. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Performance metrics ensemble many-objective optimization problem evolutionary algorithms Double elimination tournament selection many-objective evolutionary algorithms Performance metrics

来源：评论

学校读者我要写书评

暂无评论

A comparative study of many-objective evolutionary algorithms for the discovery of software architectures

引用

EMPIRICAL SOFTWARE ENGINEERING 2016年第6期21卷 2546-2600页

作者： Ramirez, Aurora Raul Romero, Jose Ventura, Sebastian Univ Cordoba Dept Comp Sci & Numer Anal Cordoba 14071 Spain

During the design of complex systems, software architects have to deal with a tangle of abstract artefacts, measures and ideas to discover the most fitting underlying architecture. A common way to structure such complex systems is in terms of their interacting software components, whose composition and connections need to be properly adjusted. Along with the expected functionality, non-functional requirements are key at this stage to guide the many design alternatives to be evaluated by software architects. The appearance of Search Based Software Engineering (SBSE) brings an approach that supports the software engineer along the design process. evolutionary algorithms can be applied to deal with the abstract and highly combinatorial optimisation problem of architecture discovery from a multiple objective perspective. The definition and resolution of many-objective optimisation problems is currently becoming an emerging challenge in SBSE, where the application of sophisticated techniques within the evolutionary computation field needs to be considered. In this paper, diverse non-functional requirements are selected to guide the evolutionary search, leading to the definition of several optimisation problems with up to 9 metrics concerning the architectural maintainability. An empirical study of the behaviour of 8 multi- and many-objective evolutionary algorithms is presented, where the quality and type of the returned solutions are analysed and discussed from the perspective of both the evolutionary performance and those aspects of interest to the expert. Results show how some many-objective evolutionary algorithms provide useful mechanisms to effectively explore design alternatives on highly dimensional objective spaces.

关键词： Software architecture discovery Search based software engineering many-objective evolutionary algorithms Multi-objective evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

ESOEA: Ensemble of single objective evolutionary algorithms for many-objective optimization

引用

SWARM AND evolutionary COMPUTATION 2019年 50卷

作者： Pal, Monalisa Bandyopadhyay, Sanghamitra Indian Stat Inst Machine Intelligence Unit 203 Barrackpore Trunk Rd Kolkata 700108 India

Inspired by the success of decomposition based evolutionary algorithms and the necessary search for a versatile many-objective optimization algorithm which is adaptive to several kinds of characteristics of the search space, the proposed work presents an adaptive framework which addresses many-objective optimization problems by using an ensemble of single objective evolutionary algorithms (ESOEA). It adopts a reference-direction based approach to decompose the population, followed by scalarization to transform the many-objective problem into several single objective sub-problems which further enhances the selection pressure. Additionally, with a feedback strategy, ESOEA explores the directions along difficult regions and thus, improving the search capabilities along those directions. For experimental validation, ESOEA is integrated with an adaptive Differential Evolution and experimented on several benchmark problems from the DTLZ, WFG, IMB and CEC 2009 competition test suites. To assess the efficacy of ESOEA, the performance is noted in terms of convergence metric, inverted generational distance, and hypervolume indicator, and is compared with numerous other multi- and/or many-objective evolutionary algorithms. For a few test cases, the resulting Pareto-fronts are also visualized which help in the further analysis of the results and in establishing the robustness of ESOEA.

关键词： many-objective evolutionary algorithms Differential evolution Pareto-optimality Non-dominated solutions DTLZ, WFG, IMB and CEC 2009 competition test problems

来源：评论

学校读者我要写书评

暂无评论

An overview on evolutionary algorithms for many-objective optimization problems

引用

WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY 2019年第1期9卷

作者： von Lucken, Christian Brizuela, Carlos Baran, Benjamin Univ Nacl Asunc Fac Politecn San Lorenzo Paraguay CICESE Res Ctr Div Appl Phys Dept Comp Sci Ensenada Baja California Mexico

Multiobjective evolutionary algorithms (MOEAs) effectively solve several complex optimization problems with two or three objectives. However, when they are applied to many-objective optimization, that is, when more than three criteria are simultaneously considered, the performance of most MOEAs is severely affected. Several alternatives have been reported to reproduce the same performance level that MOEAs have achieved in problems with up to three objectives when considering problems with higher dimensions. This work briefly reviews the main search difficulties, visualization, evaluation of algorithms, and new procedures in many-objective optimization using evolutionary methods. Approaches for the development of evolutionary many-objective algorithms are classified into: (a) based on preference relations, (b) aggregation-based, (c) decomposition-based, (d) indicator-based, and (e) based on dimensionality reduction. The analysis of the reviewed works indicates the promising future of such methods, especially decomposition-based approaches;however, much still need to be done to develop more robust, faster, and predictable evolutionary many-objective algorithms. This article is categorized under: Technologies > Computational Intelligence

关键词： evolutionary algorithms many-objective optimization many-objective evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

A modified two-archive evolutionary algorithm for many-objective ecological cascade reservoir operation

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2024年第4期24卷 223-239页

作者： Wei, Zichen Wang, Hui Liao, Futao Wang, Shuai Nanchang Inst Technol Sch Informat Engn Nanchang 330099 Peoples R China

many-objective optimisation problems (MaOPs) widely exist in real-world applications. Though two-archive2 evolutionary algorithm (Two Arch2) showed good performance in solving MaOPs, its performance highly depends on the update methods of convergence archive (CA) and diversity archive (DA). To further improve the efficiency of updating two archives, this paper proposes a modified two-archive evolutionary algorithm (called MTaEA). Firstly, MTaEA adopts two different strategies to update CA. Then, a new update strategy based on radial projection and parallel distance is designed for DA. To validate the performance of MTaEA, two benchmark sets (DTLZ and MaF) with 3, 5, 10, 15, and 20 objectives are tested. Results show MTaEA obtains competitive performance when compared with six other state-of-the-art approaches. Finally, the proposed MTaEA is applied to many-objective ecological cascade reservoir operation in central China. Simulation results indicate MTaEA still achieves promising performance.

关键词： many-objective evolutionary algorithms many-objective optimisation problems parallel distance two-archive cascade reservoir operation scheduling

来源：评论

学校读者我要写书评

暂无评论

A two-stage many-objective evolutionary algorithm with dynamic generalized Pareto dominance

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2022年第11期37卷 9833-9862页

作者： Wang, Hui Wei, Zichen Yu, Gan Wang, Shuai Wu, Jiali Liu, Jiawen Nanchang Inst Technol Sch Informat Engn Nanchang Jiangxi Peoples R China Fuyang Normal Univ Sch Informat Engn Fuyang Peoples R China

many-objective evolutionary algorithms (MaOEAs) are widely used to solve many-objective optimization problems. As the number of objectives increases, it is difficult to achieve a balance between the population diversity and the convergence. Additionally, the selection pressure decreases rapidly. To tackle these issues, this paper proposes a two-stage many-objective evolutionary algorithm with dynamic generalized Pareto dominance (called TS-DGPD). First, a two-stage method is utilized for environmental selection. The first stage employs the cosine distance to accelerate the convergence. The second stage uses L p ${L}_{p}$-norm maintain the population diversity. Moreover, a dynamic generalized Pareto dominance (DGPD) is used to increase the selection pressure of the population. To evaluate the performance of TS-DGPD, we compare it with several other MaOEAs on two benchmark sets with 3, 5, 8, 10, 15, and 20 objectives. Experimental results show that TS-DGPO performs satisfactorily on convergence and diversity.

关键词： generalized Pareto dominance many-objective evolutionary algorithms many-objective optimization problems multiobjective optimization two-stage selection

来源：评论

学校读者我要写书评

暂无评论

evolutionary composition of QoS-aware web services: A many-objective perspective

引用

EXPERT SYSTEMS WITH APPLICATIONS 2017年 72卷 357-370页

作者： Ramirez, Aurora Antonio Parejo, Jose Raul Romero, Jose Segura, Sergio Ruiz-Cortes, Antonio Univ Cordoba Dept Comp Sci & Numer Anal Campus Rabanales E-14071 Cordoba Spain Univ Seville Dept Comp Languages & Syst ETSII Avda Reina Mercedes S-N E-41012 Seville Spain

Web service based applications often invoke services provided by third-parties in their workflow. The Quality of Service (QoS) provided by the invoked supplier can be expressed in terms of the Service Level Agreement specifying the values contracted for particular aspects like cost or throughput, among others. In this scenario, intelligent systems can support the engineer to scrutinise the service market in order to select those candidates that best fit with the expected composition focusing on different QoS aspects. This search problem, also known as QoS-aware web service composition, is characterised by the presence of many diverse QoS properties to be simultaneously optimised from a multi-objective perspective. Nevertheless, as the number of QoS properties considered during the design phase increases and a larger number of decision factors come into play, it becomes more difficult to find the most suitable candidate solutions, so more sophisticated techniques are required to explore and return diverse, competitive alternatives. With this aim, this paper explores the suitability of many-objective evolutionary algorithms for addressing the binding problem of web services on the basis of a real-world benchmark with 9 QoS properties. A complete comparative study demonstrates that these techniques, never before applied to this problem, can achieve a better trade-off between all the QoS properties, or even promote specific QoS properties while keeping high values for the rest. In addition, this search process can be performed within a reasonable computational cost, enabling its adoption by intelligent and decision-support systems in the field of service oriented computation. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： QoS-aware web service composition many-objective evolutionary algorithms Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A multistage evolutionary algorithm for many-objective optimization

引用

INFORMATION SCIENCES 2022年 589卷 531-549页

作者： Shen, Jiangtao Wang, Peng Dong, Huachao Li, Jinglu Wang, Wenxin Northwestern Polytech Univ Sch Marine Sci & Technol Xian 710072 Peoples R China

Convergence and diversity are of high significance to many-objective optimization, which are considered by most state-of-the-art many-objective evolutionary algorithms (MaOEAs) simultaneously. However, it is not easy to balance them during the optimization process due to their conflicting nature. This study proposes a multistage MaOEA to address this issue, where convergence and diversity are processed respectively at different optimization stages. At the first stage, the population approaches Pareto front rapidly and the diversity is ignored. After the population is converged, the diversity will be emphasized by applying the decision variable clustering method at the second stage. When the population achieves high convergence and diversity, the algorithm will enter the last stage, where the quality of the solution set is fine-tuned by substituting those solutions with worse convergence and diversity degrees. As demonstrated by the experimental results with peer competitors on common benchmark problems, that the proposed algorithm is promising. (C) 2022 Elsevier Inc. All rights reserved.

关键词： many-objective evolutionary algorithms many-objective optimization problems Multistage optimization Convergence and diversity

来源：评论

学校读者我要写书评

暂无评论

The charging station and swapping station site selection with many-objective evolutionary algorithm

引用

APPLIED INTELLIGENCE 2023年第14期53卷 18041-18060页

作者： He, Yongqiang Zhang, Yanjun Fan, Tian Cai, Xingjuan Xu, Yubin Taiyuan Univ Sci & Technol Sch Comp Sci & Technol Taiyuan Peoples R China

The battery swap mode is a novel way of energy supplement for electric vehicles. Inevitably, there are some business transactions between battery swapping station (BSS) and battery centralized charging station (BCCS) in the mode. Therefore, it is essential to plan the construction of BSS and BCCS uniformly. Moreover, the needs of enterprises and users are not taken into account simultaneously in the existing site selection model. To resolve this problem, a many-objective joint site selection (MOJSS) model of BSS and BCCS is proposed in this paper. It mainly includes four objective functions: construction cost, coverage rate, investment income and satisfaction, which consider distance constraint between user demand points and the BSS, distance constraint between BBS and BSS, and the service ability constraint of BSS and the BCCS. To better solve the proposed model, a Grid-based evolutionary algorithm based on hybrid environment selection strategy is proposed. Furthermore, the segmented integer coding strategy and the specific genetic operation are designed based on the characteristic of model. It is compared with the existing many-objective evolutionary algorithms on standard test problems. Then the algorithm is applied to solve the established model. The experimental result demonstrated the reasonableness and effectiveness of proposed model. Finally, the site selection results are illustrated by a set of solutions.

关键词： Electric vehicles many-objective joint site selection BCCS BSS many-objective evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：