Simulated annealing and tabu search: Lessons from a line search

DOI10.1016/0305-0548(94)90013-2zbMath0813.90100OpenAlexW2072199923MaRDI QIDQ1342098

David L. Woodruff

Publication date: 11 January 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90013-2

zbMATH Keywords

simulated annealingtabu searchline searchnear optimal solutions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Teaching meta-heuristics within virtual learning environments, Continuous optimization by a variant of simulated annealing, Metaheuristics: A bibliography, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extensions of a tabu search adaptation to the quadratic assignment problem
• The tabu search metaheuristic: How we used it
• Hashing vectors for tabu search
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu Search—Part I
• Tabu Search—Part II
• Some theoretical implications of local optimization