A Decomposition, Construction and Post-Processing Approach for Nurse Rostering [PDF]
, 2005 This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses.
Brucker, Peter +3 more
core +1 more source
Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem [PDF]
, 2013 In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented.
Maric, Miroslav
core
A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem [PDF]
, 2012 This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements.
Matic, Dragan
core
Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems [PDF]
, 2005 This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual ...
Burke, Edmund, Qu, Rong
core +3 more sources
Neigborhood Selection in Variable Neighborhood Search
, 2011 Variable neighborhood search (VNS) is a metaheuristic for solving optimization problems based on a simple principle: systematic changes of neighborhoods within the search, both in the descent to local minima and in the escape from the valleys which contain them. Designing these neighborhoods and applying them in a meaningful fashion is not an easy task.
Geiger, Martin Josef +2 more
openaire +2 more sources
Optimizing One Million Variable NK Landscapes by Hybridizing Deterministic Recombination and Local Search [PDF]
, 2017 In gray-box optimization, the search algorithms have access to the variable interaction graph (VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the VIG to identify an improving solution in the Hamming neighborhood in ...
Darrell, Whitley +3 more
core
A Variable Neighborhood Search Algorithm for the Multi-stage Weapon Target Assignment Problem
, 2022 Xuening Chang +36 more
openalex +1 more source
Variable Neighborhood Search Algorithms to Solve the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery [PDF]
, 2022 Yusuf Yilmaz, Can B. Kalaycı
openalex +1 more source
Variable neighborhood search for solving bandwidth coloring problem
Computer Science and Information Systems, 2017 This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view.
Dragan Matic +2 more
openaire +3 more sources
Optimizing Computer Networks Communication with the Band Collocation Problem: A Variable Neighborhood Search Approach [PDF]
, 2020 Isaac Lozano-Osorio +3 more
openalex +1 more source