Process / pipeline
变邻域搜索 (VNS)
变邻域搜索 (VNS) 是 Mladenović 和 Hansen 于 1997 年提出的一种元启发式优化框架。它通过系统地切换预定义的邻域结构集来跳出局部最优——首先扰动当前解（“抖动”）以到达搜索空间的不同区域，然后在该区域内应用局部搜索，最后仅当新解优于当前解时才接受它。该方法足够灵活，可以处理组合问题（路由、调度、图问题）以及连续优化问题，使其成为运筹学中最广泛使用的基于邻域的元启发式算法之一。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Mladenović, N. & Hansen, P. (1997). Variable Neighborhood Search. Computers & Operations Research, 24(11), 1097–1100. DOI: 10.1016/S0305-0548(97)00031-2 ↗
- Hansen, P., Mladenović, N., Brimberg, J. & Pérez, J.A.M. (2019). Variable Neighborhood Search: Basics and Variants. EURO Journal on Computational Optimization, 7(1), 3–56. DOI: 10.1007/978-3-319-91086-4_3 ↗
如何引用本页
ScholarGate. (2026, June 1). Variable Neighborhood Search (VNS). ScholarGate. https://scholargate.app/zh/optimization/variable-neighborhood-search
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →