Genetic algorithms: an evolutionary-based global random search

AbstractRandom process are used as tools for random search in minimization algorithm, as an alternative to gradient-based searching algorithm used for instance in least square optimization. Genetic algorithms are presented in the Chapter 9, with application to non linear fitting, autoregressive moving average models. As an example of improved optimization with respect to other approaches, the travelling salesman problem is here solved with genetic algorithms.