Solution‐based versus attribute‐based tabu search for binary integer programming

Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decad...

Full description

Saved in:
Bibliographic Details
Published in:International transactions in operational research Vol. 32; no. 6; pp. 3780 - 3800
Main Authors: Danielsen, Ketil, Hvattum, Lars Magnus
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.11.2025
Subjects:
ISSN:0969-6016, 1475-3995
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decades, an alternative has received increased attention lately. Using a set of hash functions to map solutions onto hash values, a solution‐based tabu criterion has been used successfully, in particular for optimization problems involving binary variables. This paper compares the performance of solution‐based and attribute‐based tabu search on the general binary integer programming problem. According to computational experiments conducted on a sample of 160 benchmark instances, there is no statistically significant difference between the performances of solution‐based tabu search and attribute‐based tabu search.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.70011