.png){kind=icon}
返回
Path relinking for large-scale global optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-010-0650-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider the problem of finding a global optimum of a multimodal function applying path relinking. In particular, we target unconstrained large-scale problems and compare two variants of this methodology: the static and the evolutionary path relinking (EvoPR). Both are based on the strategy of creating trajectories of moves passing through high-quality solutions in order to incorporate their attributes to the explored solutions. Computational comparisons are performed on a test-bed of 19 global optimization functions previously reported with dimensions ranging from 50 to 1,000, totalizing 95 instances. Our results show that the EvoPR procedure is competitive with the state-of-the-art methods in terms of the average optimality gap achieved. Statistical analysis is applied to draw significant conclusions.
Keyword:
Evolutionary algorithms
Path relinking
Metaheuristics
Global optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏Complementary and non-matching afferent compartments in the cat's superior colliculus: Innervation of the acetylcholinesterase-poor domain of the intermediate gray layer.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏分享收藏
查看更多内容