dept. Operational Research. University of Sciences and Technology Houari Boumediene

Algiers, Algeria This email address is being protected from spambots. You need JavaScript enabled to view it.




The Multi-Objective Minimum Spanning Tree prob- lem (MOST ) has been shown to be NP -hard even with two criteria. In this study we propose a hybrid GA-VNS algorithm that exploits the advantages of both ”Non-dominated Sorting Genetic Algorithm” (NSGA-II) and ”Variable Neighborhood Search” (VNS) metaheuristics to find...



 Télécharger l'article : A GA-VNS based algorithm for the multi-objective spanning tree problem