Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
针对基数约束旅行商问题（要求访问至少L个、至多U个城市，最大化访问节点权重之和），提出一种基于弹出链的禁忌搜索方法，并在随机生成测试问题上报告了不同实现的计算结果。
A cardinality-constrained TSP (CC-TSP) problem requires the salesman to visit at least L and at most U cities, represented by nodes of a graph. The objective of this problem is to maximize the sum of weights of nodes visited. In this paper we propose a tabu search method based on ejection chain procedures, which have proved effective for many kinds of combinatorial optimization problems. Computational results on a set of randomly generated test problems with various implementations of the algorithm are reported.