山东科学2011，Vol.24Issue(1)：93-96,4.
一个改进的变邻域搜索方法求解k-card问题
An improved variable neighborhood search based solution to the k-cardinality tree problem
董伟1
作者信息
- 1. 辽宁工程技术大学数学与系统科学研究所,辽宁,阜新,123000
- 折叠
摘要
Abstract
This paper applied variable neighborhood search (VNS) algorithm to the solution of k-card problem. This paper also defined a new neighborhood structure for the solution space, and improved the algorithm. This increased the search speed of feasible solutions in the neighborhood,and improved the quality of the approximate solutions. This algorithm was compared with the present neighborhood structure based VNS algorithm. Experimental results show its effectiveness for the k-card problem.关键词
变邻域搜索/k-card问题/启发式算法Key words
variable neighborhood search/ k- card problem/ metaheuristic分类
信息技术与安全科学引用本文复制引用
董伟..一个改进的变邻域搜索方法求解k-card问题[J].山东科学,2011,24(1):93-96,4.
