The Cardinality Constrained Covering Travelling Salesman Problem

Computers and Operations Research, Volume 30, Issue 1, January 2003, pp. 97-116

University of Alberta School of Business Research Paper No. 2013-1078

Posted: 2 Jul 2013

Date Written: June 1, 2002

Abstract

In this paper, we propose a new method for partitioning a graph into an unspecified number of Hamiltonian subgraphs with minimum and maximum size requirements on the subgraphs. We refer to this problem as the cardinality constrained covering traveling salesman problem (CCC-TSP). Special cases of this problem include the assignment problem and the traveling salesman problem (TSP). This paper proposes a heuristic solution methodology to a general class of problems that is important because by setting the parameters, one can obtain different important problems including the traveling salesman problem and the assignment problem. Although these specific problems have been studied extensively in the past, the generalized version proposed here and the solution methodology set forth, are new contributions. The solution methodology presented in this paper produces solutions within known error bounds of the optimal solution value. The computational results indicate an ability to obtain very high-quality solutions by expending a modest computational effort for problems in excess of 200 nodes.

Suggested Citation

Patterson, Raymond and Rolland, Erik, The Cardinality Constrained Covering Travelling Salesman Problem (June 1, 2002). Computers and Operations Research, Volume 30, Issue 1, January 2003, pp. 97-116, University of Alberta School of Business Research Paper No. 2013-1078, Available at SSRN: https://ssrn.com/abstract=2282054

Erik Rolland

Ohio State University ( email )

2100 Neil Avenue
Columbus, OH 43210
United States
614-292-7692 (Phone)
614-292-2118 (Fax)

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
504
PlumX Metrics