A stabilized column generation scheme for the traveling salesman subtour problem

Authors:
Andreas Westerlund;Maud Göthe-Lundgren;Torbjörn Larsson
Affiliations:
Department of Mathematics, Linköping University, Linköping, Sweden;Department of Mathematics, Linköping University, Linköping, Sweden;Department of Mathematics, Linköping University, Linköping, Sweden
Venue:
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Year:
2006

Citing 16
Cited 2

The selective travelling salesman problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
An efficient four-phase heuristic for the generalized orienteering problem

Computers and Operations Research
A general approximation technique for constrained forest problems

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A note on the prize collecting traveling salesman problem

Mathematical Programming: Series A and B
On the nucleolus of the basic vehicle routing game

Mathematical Programming: Series A and B
A parallel implementation of the TSSP + 1 decomposition for the capacity-constrained vehicle routing problem

Computers and Operations Research
The circuit polytope: facets

Mathematics of Operations Research
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen

SIAM Journal on Computing
Stabilized column generation

Discrete Mathematics
Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

INFORMS Journal on Computing
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
Traveling Salesman Problems with Profits

Transportation Science
A note on relatives to the Held and Karp 1-tree problem

Operations Research Letters
An exact algorithm for IP column generation

Operations Research Letters

Chebyshev center based column generation

Discrete Applied Mathematics
A note on relatives to the Held and Karp 1-tree problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.