@techreport{TD:101158,
	att_abstract={{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.}},
	att_authors={mr5626},
	att_categories={C_CCF.7, C_CCF.8},
	att_copyright={{Wiley}},
	att_copyright_notice={{The definitive version was published in   2013. {{, Volume 21}}{{, Issue 1}}{{, 2014-01-01}}{{, 10.1111/itor.12026}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Family traveling salesperson problem,  distance minimization,  randomized heuristics,  biased random-key genetic algorithm,  GRASP},
	att_techdoc={true},
	att_techdoc_key={TD:101158},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:101158_DS1_2013-04-09T15:30:46.244Z.pdf},
	author={Mauricio Resende and Luis Morán-Mirabal, Monterrey Institute of Technology and José Luis González-Velarde, Inst. Tec. Monterrey},
	institution={{International Transactions in Operational Research}},
	month={January},
	title={{Randomized heuristics for the family traveling salesperson problem
}},
	year=2014,
}