Abstract

Optimization problems attempt to find out the minimum or maximum of a certain function (usually referred to as the cost function). The cost function can either be continuous or discrete. Discrete optimization problems arise, when the variables occurring in the optimization function can take only a finite number of discrete values and also subject to constraint conditions. In continuous optimization problems, variables can take a continuous set of real values. In recent years it has become clear that different application domains lend themselves to different solution techniques. Many heuristics have been developed which aim at finding a good or