[Zurück]

J. Inführ, G. Raidl:
"GRASP and variable neighborhood search for the virtual network mapping problem";
Vortrag: International Workshop on Hybrid Metaheuristics (HM), Ischia, Italien; 23.05.2013 - 25.05.2013; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013", Lecture Notes in Computer Science, Volume 7919 (2013), ISBN: 978-3-642-38515-5; S. 159 - 173.

Virtual network mapping considers the problem of fitting
multiple virtual networks into one physical network in a cost-optimal way.
This problem arises in Future Internet research. One of the core ideas is
to utilize different virtual networks to cater to different application classes,
each with customized protocols that deliver the required Quality-of-
Service. In this work we introduce a Greedy Randomized Adaptive Search
Procedure (GRASP) and Variable Neighborhood Search (VNS) algorithm
for solving the Virtual NetworkMapping Problem. Both algorithms make
use of a Variable Neighborhood Descent with ruin-and-recreate neighborhoods.
We show that the VNS approach significantly outperforms the previously
best known algorithms for this problem.

http://publik.tuwien.ac.at/files/PubDat_223157.pdf