@techreport{TD:101128,
	att_abstract={{We introduce the K-Interconnected Multi-Depot Multi-Traveling Salesmen Problem, a new problem that resembles some network design and location routing problems but carries the inherent difficulty of not having a fixed set of depots or terminals.
We propose a heuristic based on a biased random-key genetic algorithm to solve it.
This heuristic uses local search procedures to
best choose the terminal vertices and improve the
tours of a given solution.
We compare our heuristic with a multi-start
procedure using the same local improvements and we show that the proposed
algorithm is competitive.
}},
	att_authors={mr5626},
	att_categories={C_CCF.2, C_CCF.7, C_CCF.8},
	att_copyright={{ACM}},
	att_copyright_notice={{(c) ACM, 2013. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in 2013 {{, 2013-07-30}}{{, 10.1145/2463372.2463434}}.
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={Network Design,  Routing Problems,  Biased Random-Key Genetic Algorithm,  Local Search.},
	att_techdoc={true},
	att_techdoc_key={TD:101128},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:101128_DS1_2013-03-01T23:59:46.459Z.pdf},
	author={Mauricio Resende and Carlos E. de Andrade, UNICAMP and Flávio K. Miyazawa, UNICAMP},
	institution={{GECCO 2013}},
	month={July},
	title={{Evolutionary algorithm for the K-interconnected multi-depot multi-traveling salesmen problem}},
	year=2013,
}