Hyperheuristic as Tuning Tool of Generalized Swap Strategy

This paper introduces a hyperheuristic, which is supposed to be used as a tuning tool of generalized swap strategy suggested for Pareto front approximation. Pareto front as a small subset of all feasible solutions is searched for whenever the solved location problem combines two contradictory criteria. The quality of obtained results will be evaluated based on comparing the complete Pareto front to its approximation. The used problem instances correspond to real systems established in self-governing regions of Slovakia.