Fine grained tournament selection for the simple plant location problem

Abstract

The simple plant location problem is considered and a genetic algorithm is proposed to solve this problem. Genetic algorithm that solves simple plant location problem uses an improvement of tournament selection, called fine grained tournament selection, as selection operator. New operator is generalization of classical tournament selection, that keeps all good features of classical tournament selection. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to rank-based and classical tournament selection.