CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics Export

edited by: Thomas Stützle, Mauro Birattari, Holger H. Hoos

In SLS 2007, Vol. 4638 (6--8 September 2007)

Citation Format

[Posts]

View FullText article


nojhan's tags for this article

algorithm-engineering experimental metaheuristic parameter-setting performance-assessment stochastic stochastic-local-search

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

Stochastic local search (SLS) algorithms are among the most powerful techniques for solving computationally hard problems in many areas of computing science, operations research and engineering. SLS techniques range from rather simple constructive and iterative improvement algorithms to general-purpose SLS methods, also widely known as metaheuristics, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search and variable neighbourhood search. In recent years, it has become evident that the development of effective SLS algorithms is a complex engineering process that typically combines aspects of algorithm design and implementation with empirical analysis and problem-specific background knowledge. The difficulty of this process is in part due to the complexity of the problems being tackled and in part due to the large number of degrees of freedom researchers and practitioners face when developing SLS algorithms. This development process needs to be assisted by a sound methodology that adresses the issues arising in the phases of algorithm design, implementation, tuning and experimental evaluation. In addition, more research is required to understand which SLS techniques are best suited for particular problem types and to better understand the relationship between algorithm components, parameter settings, problem characteristics and performance.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.