ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > RANDOMIZED SEARCH HEURISTICS:
Reports tagged with randomized search heuristics:
TR04-076 | 17th September 2004
Oliver Giel, Ingo Wegener

Searching Randomly for Maximum Matchings

Many real-world optimization problems in, e.g., engineering or biology have the property that not much is known about the function to be optimized. This excludes the application of problem-specific algorithms. Simple randomized search heuristics are then used with surprisingly good results. In order to understand the working principles behind such ... more >>>

TR06-084 | 19th June 2006
Frank Neumann, Carsten Witt

Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic is rather weak. Building up such a theory is demanded to understand how these heuristics work as well as to come up with better algorithms ... more >>>

TR06-143 | 15th November 2006
Frank Neumann, Carsten Witt

Ant Colony Optimization and the Minimum Spanning Tree Problem

Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. ... more >>>



ISSN 1433-8092 | Imprint