标题
The feedback artificial tree (FAT) algorithm
作者
关键词
-
出版物
SOFT COMPUTING
Volume -, Issue -, Pages -
出版商
Springer Science and Business Media LLC
发表日期
2020-02-14
DOI
10.1007/s00500-020-04758-2
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- Artificial Bee Colony algorithm with improved search mechanism
- (2019) Amreek Singh et al. SOFT COMPUTING
- Improved impact responses of a honeycomb sandwich panel structure with internal resonators
- (2019) Q. Q. Li et al. ENGINEERING OPTIMIZATION
- Dissipative multi-resonator acoustic metamaterials for impact force mitigation and collision energy absorption
- (2019) Q. Q. Li et al. ACTA MECHANICA
- A novel inverse procedure for load identification based on improved artificial tree algorithm
- (2019) Huxiu Xu et al. ENGINEERING WITH COMPUTERS
- An improved artificial bee colony algorithm and its application to reliability optimization problems
- (2018) Soheila Ghambari et al. APPLIED SOFT COMPUTING
- A hybrid particle swarm optimizer with sine cosine acceleration coefficients
- (2018) Ke Chen et al. INFORMATION SCIENCES
- Design and optimization of three-resonator locally resonant metamaterial for impact force mitigation
- (2018) Q.Q. Li et al. Smart Materials and Structures
- Particle swarm optimization with convergence speed controller for large-scale numerical optimization
- (2018) Han Huang et al. SOFT COMPUTING
- Parametric modeling and multiobjective crashworthiness design optimization of a new front longitudinal beam
- (2018) Libin Duan et al. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
- Multi-objective reliability-based design optimization for the VRB-VCS FLB under front-impact collision
- (2018) Libin Duan et al. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
- The artificial tree (AT) algorithm
- (2017) Q.Q. Li et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Adaptive Multimodal Continuous Ant Colony Optimization
- (2017) Qiang Yang et al. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
- Gravitational search algorithm with both attractive and repulsive forces
- (2017) Hamed Zandevakili et al. SOFT COMPUTING
- A modified ABC algorithm based on improved-global-best-guided approach and adaptive-limit strategy for global optimization
- (2016) Fuli Zhong et al. APPLIED SOFT COMPUTING
- Soft computing in remote sensing image processing
- (2016) Yanfei Zhong et al. SOFT COMPUTING
- Vessel traffic flow forecasting by RSVR with chaotic cloud simulated annealing genetic algorithm and KPCA
- (2015) Ming-Wei Li et al. NEUROCOMPUTING
- An adaptive particle swarm optimization algorithm for reservoir operation optimization
- (2014) Zhongbo Zhang et al. APPLIED SOFT COMPUTING
- Adaptive image denoising using cuckoo algorithm
- (2014) Memoona Malik et al. SOFT COMPUTING
- A review on applications of heuristic optimization algorithms for optimal power flow in modern power systems
- (2014) Ming NIU et al. Journal of Modern Power Systems and Clean Energy
- Differential evolution improved with self-adaptive control parameters based on simulated annealing
- (2014) Haixiang Guo et al. Swarm and Evolutionary Computation
- Adaptive population tuning scheme for differential evolution
- (2012) Wu Zhu et al. INFORMATION SCIENCES
- A modified artificial bee colony algorithm
- (2011) Wei-feng Gao et al. COMPUTERS & OPERATIONS RESEARCH
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
- (2011) Joaquín Derrac et al. Swarm and Evolutionary Computation
- GSA: A Gravitational Search Algorithm
- (2009) Esmat Rashedi et al. INFORMATION SCIENCES
- On the performance of artificial bee colony (ABC) algorithm
- (2007) D. Karaboga et al. APPLIED SOFT COMPUTING
- Ant colony optimization for continuous domains
- (2006) Krzysztof Socha et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More