genetic algorithm

A genetic algorithm (GA) is a method for solving both constrained and

unconstrained optimization problems based on a natural selection process that
mimics biological evolution
Genetic algorithms are commonly used to generate high-quality solutions to
optimization and search problems by relying on biologically inspired operators
such as mutation, crossover and selection
In computing terms, a genetic algorithm implements the model of computation
by having arrays of bits or characters (binary string) to represent the
chromosomes. Each string represents a potential solution. The genetic algorithm
then manipulates the most promising chromosomes searching for improved
solutions. A genetic algorithm operates through a cycle of three stages:
1. Build and maintain a population of solutions to a problem
2. Choose the better solutions for recombination with each other
3. Use their offspring to replace poorer solutions.

Advantages/Benefits of Genetic Algorithm

 The concept is easy to understand.
 GA search from a population of points, not a single point.
 GA use payoff (objective function) information, not derivatives.
 GA supports multi-objective optimization.
 GA use probabilistic transition rules, not deterministic rules

Disdvantages of Algorithms:
 Alogorithms is Time consuming.
 Difficult to show Branching and Looping in Algorithms.
 Big tasks are difficult to put in Algorithms
 Simulated annealing problem
Simulated annealing (SA) is a probabilistic technique for approximating the global
optimum of a given function. Specifically, it is a metaheuristic to approximate
global optimization in a large search space for an optimization problem
Simulated annealing is a method for solving unconstrained and bound-
constrained optimization problems. The method models the physical process of
heating a material and then slowly lowering the temperature to decrease defects,
thus minimizing the system energy
Simulated annealing can be used for very hard computational optimization
problems where exact algorithms fail; even though it usually achieves an
approximate solution to the global minimum, it could be enough for many
practical problems

Advantages of Simulated Annealing

 can deal with arbitrary systems and cost functions
 statistically guarantees finding an optimal solution
 is relatively easy to code, even for complex problems
 generally gives a ``good'' solution
The benefits of simulated annealing are its easy implementation and its possibility of
finding a global optimal even after finding a local minimum, as it accepts solutions that are
worse than the best candidate

Disadvantages of Simulated Annealing

 Repeatedly annealing with a schedule is very slow, especially if the cost
function is expensive to compute
 For problems where the energy landscape is smooth, or there are few
local minima,
 Heuristic methods, which are problem-specific or take advantage of
extra information about the system, will often be better than general
methods. But SA is often comparable to heuristics.
 The method cannot tell whether it has found an optimal solution. Some
other method (e.g. branch and bound) is required to do this.