|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Fine grained tournament selection for the simple plant location problem||First page:||152||Last page:||158||Conference:||5th Online World Conference on Soft Computing Methods in Industrial Applications||Issue Date:||2000||Rank:||M30||ISBN:||951-22-5205-8||URL:||https://vladofilipovic.github.io/Science/Papers/A6.2-4.pdf||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.
Show full item record
checked on Sep 14, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.