String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
| Hi-index | 0.00 |
An evolutionary algorithm for some instances of the single-source capacitated plant location problem encodes candidate solutions in two permutations, one of plant locations and a second of customers, with an integer that indicates the number of open locations. A greedy decoder identifies the solution such a genotype represents, and the EA searches for good solutions using only selection and mutation. In tests on 36 problem instances, the EA is competitive with a recent algorithm, though two superficially promising heuristic extensions do not improve its performance. The results support the general effectiveness of permutation codings in EAs that search for optimum subsets.