arrow
返回

Eidetic Wolf Search Algorithm with a global memory structure

delete2016-10-01
delete12
PRE
AI
S
Simon Fong
S
Suash Deb
T
Thomas Hanne *
李
李金燕 (Jinyan Li)
DOI:10.1016/j.ejor.2016.03.043delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
A recently proposed metaheuristics called Wolf Search Algorithm (WSA) has demonstrated its efficacy for various hard-to-solve optimization problems. In this paper, an improved version of WSA namely Eidetic-WSA with a global memory structure (GMS) or just eWSA is presented. eWSA makes use of GMS for improving its search for the optimal fitness value by preventing mediocre visited places in the search space to be visited again in future iterations. Inherited from swarm intelligence, search agents in eWSA and the traditional WSA merge into an optimal solution although the agents behave and make decisions autonomously. Heuristic information gathered from collective memory of the swarm search agents is stored in GMS. The heuristics eventually leads to faster convergence and improved optimal fitness. The concept is similar to a hybrid metaheuristics based on WSA and Tabu Search. eWSA is tested with seven standard optimization functions rigorously. In particular, eWSA is compared with two state-of-the-art metaheuristics, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). eWSA shares some similarity with both approaches with respect to directed-random search. The similarity with ACO is, however, stronger as ACO uses pheromones as global information references that allow a balance between using previous knowledge and exploring new solutions. Under comparable experimental settings (identical population size and number of generations) eWSA is shown to outperform both ACO and PSO with statistical significance. When dedicating the same computation time, only ACO can be outperformed due to a comparably long run time per iteration of eWSA. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Metaheuristics
Wolf Search Algorithm
Global memory structure
Ant Colony Optimization
Particle Swarm Optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
University of Macau
学者数:
1.1W
论文数: 1.3W
被引数: 2.0W
引用论文

引用论文

Guide for Conducting Benefit-Cost Analyses of Multimodal, Multijurisdictional Freight Corridor Investments
err
IF0
err2017-04-06
err0
PREAI
errSharada Vadali; C. James Kruse; Kenneth Kuhn; Anne Goodchild
err分享
err收藏
Enabling Low-Cost Full Surface Tactile Skin for Human Robot Interaction
err2022-04-01
err0
PREAI
errXiaoran Fan; Daewon Lee; Larry Jackel; Richard Howard; Daniel Lee; Volkan Isler
err分享
err收藏
Sensitivity of different correlation measures to print-and-scan process
err2017-01-29
err0
errOAAI
errIuliia Tkachenko; Christophe Destruel; Olivier Strauss; William Puech
err分享
err收藏
err分享
err收藏
Programmable self-assembly in a thousand-robot swarm
err2014-08-15
err0
PREAI
errMichael Rubenstein; Alejandro Cornejo; Radhika Nagpal
err分享
err收藏
学者 查看更多内容