A local search template.

DOI10.1016/S0305-0548(97)00093-2zbMath1040.90542OpenAlexW2087594839MaRDI QIDQ1406708

R. J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra

Publication date: 7 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00093-2

zbMATH Keywords

simulated annealingtabu searchgenetic algorithmslocal searchthreshold acceptingiterative improvement

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items

Classification of applied methods of combinatorial optimization, Parallel local search, An efficient solution method to design the cost-minimizing platform portfolio, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

Cites Work

• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• How easy is local search?
• Tabu Search—Part I
• A Method for Solving Traveling-Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Job Shop Scheduling by Local Search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item