MPI Parallelization of Variable Neighborhood Search
Electronic Notes in Discrete Mathematics, 2012 Abstract We analyze five parallelization strategies for the Variable Neighborhood Search (VNS) meta–heuristic. They are based on the asynchronous cooperative execution of several threads on different processors. Some of them are adapted from the recent literature, while the others are the newly proposed. We test parallelization on various levels, and
Tatjana Davidović +1 more
openaire +1 more source
Variable Neighborhood Search for Edge-Ratio Network Clustering [PDF]
, 2014 International audienceEdge-ratio clustering was introduced in [Cafieri et al., Phys.Rev. E 81(2):026105, 2010], as a criterion for optimal graph bipartitioning in hierarchical divisive algorithms for cluster identification in networks.
Cafieri, Sonia +2 more
core +1 more source
Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem [PDF]
, 2021 Alla Kammerdiner +2 more
openalex +1 more source
Variable Neighborhood Search for the File Transfer Scheduling Problem [PDF]
, 2012 ACM Computing Classification System (1998): I.2.8, G.1.6.In this paper a file transfer scheduling problem is considered. This problem is known to be NP-hard, and thus provides a challenging area for metaheuristics.
Dražić, Zorica
core
An oil pipeline design problem [PDF]
, 2003 Copyright @ 2003 INFORMSWe consider a given set of offshore platforms and onshore wells producing known (or estimated) amounts of oil to be connected to a port.
Aarts E. H. L. +13 more
core +1 more source
Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) Untuk Penyelesaian Kasus Vehicle Routing Problem with TIME Windows (VRPTW) [PDF]
, 2017 Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes,
Iswari, T. (Titi)
core +2 more sources
Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pierre Hansen +3 more
openaire +2 more sources
Solving the Task Assignment Problem with a Variable Neighborhood Search [PDF]
, 2010 In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem ...
Filipović, Vladimir +3 more
core
The robust single machine scheduling problem with uncertain release and processing times [PDF]
, 2014 In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst ...
Bierlaire, Michel +2 more
core +1 more source
Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core