A hybrid approach to approximate the Pareto front of the MOST problem
This study introduces a hybrid NSGA-II algorithm with Multi-VNS for approximating the Pareto front of the multi-objective spanning tree (MOST) problem, building on recent approa...