Using group theory and transition matrices to study a class of metaheuristic neighborhoods

DOI10.1016/S0377-2217(01)00176-XzbMath1007.90051MaRDI QIDQ1600935

David L. Neuway, Bruce W. Colletti, J. Wesley Barnes

Publication date: 16 June 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicstabu searchtraveling salesmanmetaheuristicsearch theory

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Solving the aerial fleet refueling problem using group theoretic tabu search

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• Linearity in the traveling salesman problem
• A note on characterizing the \(k-OPT\) neighborhood via group theory
• Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods

This page was built for publication: Using group theory and transition matrices to study a class of metaheuristic neighborhoods