A dynamic artificial immune algorithm applied to challenging benchmarking problems

Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of these uncertainties is a constantly changing environment in which the optima change their location over time. New heuristics or adaptations to already available algorithms must be conceived in order to deal with such problems. Among the desirable features that a search strategy should exhibit to deal with dynamic optimization are diversity maintenance, a memory of past solutions, and a multipopulation structure of candidate solutions. In this paper, an immune-inspired algorithm that presents these features, called dopt-aiNet, is properly adapted to deal with six newly proposed benchmark instances, and the obtained results are outlined according to the available specifications for the competition at the Congress on Evolutionary Computation 2009.

• Type: Conference
• Year: 2009
• Where: CEC
• Authors: Fabrício Olivetti de França, Fernando J. Von Zuben
• Keywords: Artificial Intelligence, Benchmark Optimization Problems, CEC 2009, Objective Function, Real-world Scenarios