An analysis of parameter adaptation in reactive tabu search

DOI10.1111/ITOR.12043zbMath1291.90326OpenAlexW2026930130WikidataQ62671998 ScholiaQ62671998MaRDI QIDQ4979993

Franco Mascia, Thomas Stützle, Mauro Birattari, Paola Pellegrini

Publication date: 20 June 2014

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12043

zbMATH Keywords

quadratic assignment problemmaximum clique problemreactive tabu searchon-line parameter adaptation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (2)

Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ Optimal decision trees for the algorithm selection problem: integer programming based approaches

Uses Software

• DIMACS
• coin
• CFinder
• Unnamed Item

Cites Work

• Unnamed Item
• Bagging predictors
• Algorithms for the maximum satisfiability problem
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Reactive and dynamic local search for max-clique: engineering effective building blocks
• QAPLIB - a quadratic assignment problem library
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Future paths for integer programming and links to artificial intelligence
• Phased local search for the maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• Mining market data: a network approach
• Finding a Maximum Clique in an Arbitrary Graph
• The Reactive Tabu Search
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• Reactive local search for the maximum clique problem

This page was built for publication: An analysis of parameter adaptation in reactive tabu search