Resolution of simple plant location problems using an adapted genetic algorithm

This investigation presents an adapted genetic algorithm to resolve simple plant location problems. The proposed algorithm applies a clustering technique as mutation guidance and a novel local search method to enhance the solution quality. The proposed algorithm is then applied to the fifteen test problems taken from Beasley´s OR-Library (J.E. Beasley, 1990). Empirical results indicate that the error rate of the proposed adapted GA is less than 0.3 percent. In addition, the computational time is bounded by a polynomial function of the problem size