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问题求解中,重新定义了一种邻域结构,改进了算法,使得邻域内可行解的搜索速度得以加快,并提高了近似解的质量.对几个实际问题进行了数值实验,并与现有邻域结构的变邻域搜索算法进行了对比,实验结果证明了改进变邻域搜索算法对k-card问题的有效性.
展开▼
