Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00779-3
Abstract: In the last decade remarkable progress has been made in development of suitable proof techniques for analysing randomised search heuristics. The theoretical investigation of these algorithms on classes of functions is essential to the understanding… read more here.
Keywords: search; linear functions; randomised search; uniform constraint ... See more keywords
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-021-00838-3
Abstract: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph.… read more here.
Keywords: search; time; randomized search; coloring problem ... See more keywords
Index tracking optimization with cardinality constraint: a performance comparison of genetic algorithms and tabu search heuristics
Sign Up to like & getrecommendations! Published in 2017 at "Neural Computing and Applications"
DOI: 10.1007/s00521-017-2882-2
Abstract: The aim of this study was to compare the performance of the well-known genetic algorithms and tabu search heuristics with the financial problem of the partial tracking of a stock market index. Although the weights… read more here.
Keywords: index; search; genetic algorithms; tabu search ... See more keywords