English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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. [Projekat Ministarstava nauke Republike Srbije, br. 174010

Gaussian variable neighborhood search for the file transfer scheduling problem