可变邻域搜索
启发式
元启发式
实施
数学优化
变量(数学)
计算机科学
局部搜索(优化)
数学
摄动(天文学)
理论计算机科学
算法
量子力学
物理
数学分析
程序设计语言
作者
Pierre Hansen,Nenad Mladenović,Raca Todosijević,Saïd Hanafi
标识
DOI:10.1007/s13675-016-0075-x
摘要
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum , and in a perturbation phase to escape from the corresponding valley. In this paper, we present some of VNS basic schemes as well as several VNS variants deduced from these basic schemes. In addition, the paper includes parallel implementations and hybrids with other metaheuristics .
科研通智能强力驱动
Strongly Powered by AbleSci AI