A local search template.

DOI10.1016/S0305-0548(97)00093-2MaRDI QIDQ1406708zbMATH OpenOpenAlexFDO

Authors R. J. M. Vaessens, E. 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 annealinglocal searchgenetic algorithmstabu searchthreshold acceptingiterative improvement

Mathematics Subject Classification ID

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

Recommendations

• Local search: complexity and approximation
• scientific article; zbMATH DE number 18531
• Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
• How easy is local search?
• scientific article; zbMATH DE number 1082099

Cites work

• scientific article; zbMATH DE number 18531 (Why is no real title available?)
• scientific article; zbMATH DE number 23663 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1082100 (Why is no real title available?)
• scientific article; zbMATH DE number 1082101 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A method for solving traveling-salesman problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• How easy is local search?
• Job Shop Scheduling by Local Search
• Optimization by simulated annealing
• Tabu Search—Part I
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

Cited in

(10)

• scientific article; zbMATH DE number 1961991 (Why is no real title available?)
• Paroid search: Generic local combinatorial optimization
• Approximate local search in combinatorial optimization
• An efficient solution method to design the cost-minimizing platform portfolio
• Hill Climbing with Multiple Local Optima
• The template design problem: a perspective with metaheuristics
• Classification of applied methods of combinatorial optimization
• Local search: complexity and approximation
• Parallel local search
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

This page was built for publication: A local search template.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406708)