Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

The symmetric travelling salesperson problem with n cities (1-STSP) possesses no arbitrarily poor local optima for search neighborhoods defined by arbitrary unions of conjugacy classes in the symmetric group on n letters, S(n). (C) 2000 Elsevier Science Ltd. All rights reserved.