Statistical Design of Genetic Algorithms for Combinatorial Optimization Problems

Abstract EN

Many genetic algorithms (GA) have been applied to solve different NP-complete combinatorial optimization problems so far.

The striking point of using GA refers to selecting a combination of appropriate patterns in crossover, mutation, and and so forth and fine tuning of some parameters such as crossover probability, mutation probability, and and so forth.

One way to design a robust GA is to select an optimal pattern and then to search for its parameter values using a tuning procedure.

This paper addresses a methodology to both optimal pattern selection and the tuning phases by taking advantage of design of experiments and response surface methodology.

To show the performances of the proposed procedure and demonstrate its applications, it is employed to design a robust GA to solve a project scheduling problem.

Through the statistical comparison analyses between the performances of the proposed method and an existing GA, the effectiveness of the methodology is shown.