Randomized heuristics for the family traveling salesperson problem
Article first published online: 24 JUN 2013
© 2013 The Authors. International Transactions in Operational Research © 2013 International Federation of Operational Research Societies Published by John Wiley & Sons Ltd, 9600 Garsington Road, Oxford, OX4 2DQ, UK and 350 Main St, Malden, MA02148, USA.
International Transactions in Operational Research
Volume 21, Issue 1, pages 41–57, January 2014
How to Cite
Morán-Mirabal, L.F., González-Velarde, J.L. and Resende, M.G.C. (2014), Randomized heuristics for the family traveling salesperson problem. International Transactions in Operational Research, 21: 41–57. doi: 10.1111/itor.12026
- Issue published online: 9 DEC 2013
- Article first published online: 24 JUN 2013
- Manuscript Accepted: 2 MAY 2013
- Manuscript Received: 10 APR 2013
- family traveling salesperson problem;
- distance minimization;
- randomized heuristics;
- biased random-key genetic algorithm;
This paper introduces the family traveling salesperson problem (FTSP), a variant of the generalized traveling salesman problem. In the FTSP, a subset of nodes must be visited for each node cluster in the graph. The objective is to minimize the distance traveled. We describe an integer programming formulation for the FTSP and show that the commercial grade integer programming solver CPLEX 11 can only solve small instances of the problem in reasonable running time. We propose two randomized heuristics for finding optimal and near-optimal solutions of this problem. These heuristics are a biased random-key genetic algorithm and a GRASP with evolutionary path-relinking. Computational results comparing both heuristics are presented in this study.