期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem 被引量:6
1
作者 Yu Xue Yi Zhuang +2 位作者 Tianquan Ni Siru Ni Xuezhi Wen 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第1期59-68,共10页
Cooperative jamming weapon-target assignment (CJWTA) problem is a key issue in electronic countermeasures (ECM). Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness... Cooperative jamming weapon-target assignment (CJWTA) problem is a key issue in electronic countermeasures (ECM). Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution (SLDDE) algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems. 展开更多
关键词 global optimization SELF-ADAPTIVE discrete differentialevolution weapon-target assignment (WTA) cooperative jamming.
在线阅读 下载PDF
Improved Differential Evolution with Shrinking Space Technique for Constrained Optimization 被引量:7
2
作者 Chunming FU Yadong XU +2 位作者 Chao JIANG Xu HAN Zhiliang HUANG 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2017年第3期553-565,共13页
Most of the current evolutionary algorithms for constrained optimization algorithm are low computational efficiency. In order to improve efficiency, an improved differential evolution with shrinking space technique an... Most of the current evolutionary algorithms for constrained optimization algorithm are low computational efficiency. In order to improve efficiency, an improved differential evolution with shrinking space technique and adaptive trade-off model, named ATMDE, is proposed to solve constrained optimization problems. The proposed ATMDE algorithm employs an improved differential evolution as the search optimizer to generate new offspring individuals into evolutionary population. For the con- straints, the adaptive trade-off model as one of the most important constraint-handling techniques is employed to select better individuals to retain into the next population, which could effectively handle multiple constraints. Then the shrinking space technique is designed to shrink the search region according to feedback information in order to improve computational efficiency without losing accuracy. The improved DE algorithm introduces three different mutant strategies to generate different offspring into evo- lutionary population. Moreover, a new mutant strategy called "DE/rand/best/l" is constructed to generate new individuals according to the feasibility proportion ofcurrent population. Finally, the effectiveness of the pro- posed method is verified by a suite of benchmark functions and practical engineering problems. This research presents a constrained evolutionary algorithm with high efficiency and accuracy for constrained optimization problems. 展开更多
关键词 Constrained optimization - differentialevolution Adaptive trade-off model Shrinking spacetechnique
在线阅读 下载PDF
Sequencing of Mixed Model Assembly Lines Based on Improved Shuffled Frog Leaping Algorithm 被引量:1
3
作者 ZHAO Xiaoqiang JI Shurong 《Journal of Donghua University(English Edition)》 EI CAS 2018年第2期154-159,共6页
Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain exten... Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO) 展开更多
关键词 MIXED model ASSEMBLY LINE (MMAL) SEQUENCING shuffledfrog leaping ALGORITHM (SFLA) CHAOS optimization differentialevolution ALGORITHM
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部