Yugoslav Journal of Operations Research 2016 Volume 26, Issue 2, Pages: 173-188
https://doi.org/10.2298/YJOR150124006D
Full text ( 162 KB)
Gaussian variable neighborhood search for the file transfer scheduling problem
Dražić Zorica (Faculty of Mathematics, Belgrade)
This paper presents new modifications of Variable Neighborhood Search
approach for solving the file transfer scheduling problem. To obtain better
solutions in a small neighborhood of a current solution, we implement two new
local search procedures. As Gaussian Variable Neighborhood Search showed
promising results when solving continuous optimization problems, its
implementation in solving the discrete file transfer scheduling problem is
also presented. In order to apply this continuous optimization method to
solve the discrete problem, mapping of uncountable set of feasible solutions
into a finite set is performed. Both local search modifications gave better
results for the large size instances, as well as better average performance
for medium and large size instances. One local search modification achieved
significant acceleration of the algorithm. The numerical experiments showed
that the results obtained by Gaussian modifications are comparable with the
results obtained by standard VNS based algorithms, developed for
combinatorial optimization. In some cases Gaussian modifications gave even
better results.
Keywords: ombinatorial optimization, Variable Neighborhood Search, Gaussian Variable Neighborhood Search, File Transfer Scheduling Problem
Projekat Ministarstava nauke Republike Srbije, br. 174010