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

Algiers, Algeria Cette adresse e-mail est protégée contre les robots spammeurs. Vous devez activer le JavaScript pour la visualiser.




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