Operador de cruzamento baseado em partições aplicado ao problema da árvore de Steiner em grafos

Abstract

This work proposes a method to apply the generalized partition crossing operator (GPX) to the Steiner tree graph problem (STPG). In general, the generalized partition crossover operator has the principle of taking advantage of the best parts of two solutions, always ensuring that the best generated solution is always better or that it keeps the cost of the initial solutions without increasing the computational complexity of the operator. The model is functional, so you can reuse it for other combinatorial optimization problems in graphs, with other constraints just by changing some algorithm structures.