一个改进的变邻域搜索方法求解k-card问题

J4 ›› 2011, Vol. 24 ›› Issue (1): 93-96.

一个改进的变邻域搜索方法求解k-card问题

董伟

辽宁工程技术大学数学与系统科学研究所，辽宁阜新 123000

出版日期:2011-02-20 发布日期:2011-02-20

An improved variable neighborhood search based solution to the k-card inality tree problem

DONG Wei

Institute of Mathematics and Systems Science， Liaoning Technical University，Fuxin 123000, China

Online:2011-02-20 Published:2011-02-20

摘要/Abstract

摘要：

本文将变邻域搜索算法应用到k-card问题求解中，重新定义了一种邻域结构，改进了算法，使得邻域内可行解的搜索速度得以加快，并提高了近似解的质量。对几个实际问题进行了数值实验，并与现有邻域结构的变邻域搜索算法进行了对比，实验结果证明了改进变邻域搜索算法对k-card问题的有效性。

关键词: 变邻域搜索, k-card问题, 启发式算法

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

中图分类号:

TP301.6

董伟. 一个改进的变邻域搜索方法求解k-card问题[J]. J4, 2011, 24(1): 93-96.

DONG Wei. An improved variable neighborhood search based solution to the k-card inality tree problem[J]. J4, 2011, 24(1): 93-96.

[1]	陈清, 徐小明. 考虑路段充电和时间窗的电动车取送货问题[J]. 山东科学, 2023, 36(3): 78-89.
[2]	刘勇，朱晓宁. 实货制下铁路枢纽货运站业务调整模型[J]. 山东科学, 2014, 27(5): 46-53.