I totally missed the announcement of the Mona Lisa TSP Challenge (100K cities) last month. My apologies.
An optimal solution to the 100,000-city Mona Lisa instance would set a new world record for the TSP. If you have ideas for producing good tours or for showing that a solution is optimal, this is a very nice challenge problem! I would be happy to report any computational results you obtain on this example.