On local search based heuristics for optimization problems
David Kaljun, Janez Žerovnik · Croatian Operational Research Review · 2014
When comparing various metaheuristics, even asking a fair and formally consistent question is often difficult.Having this in mind, we provide some further evidence that simple local search heuristics may be at least a very competitive choice.On a dataset from an industrial application, i.e., construction of an optical system, we compare local search and genetic algorithms.In our case, the best performance is obtained by a combination of both heuristics.