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

DOI10.1016/S0377-2217(01)00176-XzbMATH Open1007.90051MaRDI QIDQ1600935FDOQ1600935

David L. Neuway, B. W. Colletti, J. W. Barnes

Publication date: 16 June 2002

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

zbMATH Keywords

heuristicsmetaheuristictabu searchsearch theorytraveling salesman

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Solving the aerial fleet refueling problem using group theoretic tabu search

Uses Software

• GAP

Recommendations

• Title not available (Why is that?) 👍 👎
• Metaheuristics 👍 👎
• Metaheuristics in combinatorial optimization 👍 👎
• Theory and principled methods for the design of metaheuristics 👍 👎
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping 👍 👎
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search 👍 👎
• The influence of problem specific neighborhood structures in metaheuristics performance 👍 👎
• ENHANCED META-HEURISTICS WITH VARIABLE NEIGHBORHOOD SEARCH STRATEGY FOR COMBINATORIAL OPTIMIZATION PROBLEMS 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600935)