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...

Celý popis

Podrobná bibliografia

Vydané v:	International transactions in operational research Ročník 32; číslo 6; s. 3780 - 3800
Hlavní autori:	Danielsen, Ketil, Hvattum, Lars Magnus
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Blackwell Publishing Ltd 01.11.2025
Predmet:	0‐1 integer programming adaptive memory Algorithms binary optimization Criteria Heuristic Heuristic methods Integer programming Optimization tabu criterion Tabu search
ISSN:	0969-6016, 1475-3995
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!