Application of the volume algorithm to the approximate and exact solving of the asymmetric traveling salesman problem

Application of the volume algorithm to the approximate and exact solving of the asymmetric traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20072095
Country: Portugal
Volume: 25
Issue: 2
Start Page Number: 277
End Page Number: 294
Publication Date: Dec 2005
Journal: Investigao Operacional
Authors: , ,
Keywords: heuristics
Abstract:

In this paper we present computational results with the volume algorithm, a variant of the subgradient method, when solving the linear relaxation that stems from the extended disaggregated flow formulation of the Asymmetric Travelling Salesman Problems. Computational experiments were performed on a selection of instances from the TSPLib and some randomly generated instances according to the Dimacs Implementation Challenge. We have also tried ATSP heuristics within the volume algorithm. Computational experiments show moderated success on medium-scale instances.

Reviews

Required fields are marked *. Your email address will not be published.