Abstract:
We consider the NP-hard integer three-index axial assignment problem. Strategies for combining feasible solutions of the problem are investigated. Combining can be used as a supplement to heuristic or approximate solution algorithms instead of the generally accepted step of choosing the record among the feasible solutions found. The results of computational experiments are presented that demonstrate the promising nature of the approach proposed.