Tabu search and finite convergence

DOI10.1016/S0166-218X(01)00263-3zbMath0994.90116MaRDI QIDQ1602700

Saïd Hanafi, Fred Glover

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

tabu searchannealingtree searchrecency memory

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A very fast TS/SA algorithm for the job shop scheduling problem, Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem, Evaluating the convergence of tabu enhanced hybrid quantum optimization, Tabu search exploiting local optimality in binary optimization, Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem, Graph Coloring Models and Metaheuristics for Packing Applications, Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes, Tabu search approaches for solving the two-group classification problem, Global optimizations and tabu search based on memory, Attraction probabilities in variable neighborhood search, Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods, Simulation optimization: a review of algorithms and applications, A survey on metaheuristics for stochastic combinatorial optimization, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• A basis enumeration algorithm for linear systems with geometric applications
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Reverse search for enumeration
• Dynamic tabu list management using the reverse elimination method
• Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
• Tabu Search—Part II