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.

Key words: variable neighborhood search, k-card problem, metaheuristic