We describe a genetic algorithm (GA) for designing efficient search paths, against a moving target, in complicated environments. The immediate application is acoustic search for submarines, but the ...

The new algorithm handles changes consisting of deleted edges -- for example, if the equivalent of a stretch of a road suddenly becomes inaccessible due to roadworks.

More importantly, biologists can trace the source of certain genetic diseases. Traditionally, multiple sequence alignment algorithms use computationally complex heuristics to align the sequences.

Here’s how that algorithm works: a computer program is used to simulate a population of ants. These ants are assigned the task to find a solution to a problem. As each ant goes about their task ...