A stabilized column generation scheme for the traveling salesman subtour problem
2006 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, Vol. 154, no 15, 2212-2238 p.Article in journal (Refereed) Published
Given an undirected graph with edge costs and both revenues and weights on the vertices, the traveling salesman subtour problem is to find a subtour that includes a depot vertex, satisfies a knapsack constraint on the vertex weights, and that minimizes edge costs minus vertex revenues along the subtour.
We propose a decomposition scheme for this problem. It is inspired by the classic side-constrained 1-tree formulation of the traveling salesman problem, and uses stabilized column generation for the solution of the linear programming relaxation. Further, this decomposition procedure is combined with the addition of variable upper bound (VUB) constraints, which improves the linear programming bound. Furthermore, we present a heuristic procedure for finding feasible subtours from solutions to the column generation problems. An extensive experimental analysis of the behavior of the computational scheme is presented.
Place, publisher, year, edition, pages
2006. Vol. 154, no 15, 2212-2238 p.
IdentifiersURN: urn:nbn:se:liu:diva-36277DOI: 10.1016/j.dam.2005.04.012Local ID: 30825OAI: oai:DiVA.org:liu-36277DiVA: diva2:257125