On local search based heuristics for optimization problems

Authors

  • David Kaljun Faculty of Mechanical Engineering, University of Ljubljana Aškerčeva 6, Ljubljana, Slovenia
  • Janez Žerovnik Faculty of Mechanical Engineering, University of Ljubljana Aškerčeva 6, Ljubljana, Slovenia

Abstract

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 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.

Downloads

Additional Files

Published

2015-01-27

Issue

Volume 5 (2014), Number 2

Section

CRORR Journal Regular Issue

License

- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal

- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).