Results 11 to 20 of about 221,092 (272)
Topological variable neighborhood search
Journal of Big DataThe design of the novel metaheuristic method, called Topological Variable Neighborhood Search, is presented and its theoretical properties are elaborated. The proposed metaheuristic method is implemented, applied to several well-known NP-hard problems on
Vladimir Filipović, Aleksandar Kartelj
doaj +2 more sources
Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization, 2017 Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper,
Pierre Hansen +3 more
doaj +2 more sources
Designer-driven 3D buildings generated using variable neighborhood search [PDF]
2014 IEEE Conference on Computational Intelligence and Games, 2014 This paper presents a mechanism to generate virtual buildings considering designer constraints and guidelines. This mechanism is implemented as a pipeline of different Variable Neighborhood Search (VNS) optimization processes in which several subproblems
LaTorre de la Fuente, Antonio +4 more
core +4 more sources
Variable Neighborhood Search [PDF]
Computers & Operations Research, 1997 Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems. Its basic idea is systematic change of neighborhood both within a descent phase to find a local optimum and in a perturbation phase to get out of the corresponding valley.
Mladenović, N., Hansen, P.
openaire +2 more sources
Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering
مجلة بغداد للعلوم, 2022 Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions.
Hayder Naser Khraibet Al-Behadili
doaj +1 more source
Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison [PDF]
Yugoslav Journal of Operations Research, 2015 Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show
Kritzinger Stefanie +3 more
doaj +1 more source
Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering
Computation, 2020 The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids).
Lev Kazakovtsev +3 more
doaj +1 more source
Primal-dual variable neighborhood search for the simple plant-location problem [PDF]
, 2007 Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions.
Brimberg, J +3 more
core +1 more source
A variable neighborhood search simheuristic for project portfolio selection under uncertainty [PDF]
, 2018 With limited nancial resources, decision-makers in rms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more realistic constraints are considered, the problem becomes
Döering, Jana +4 more
core +1 more source
On Neighborhood Tree Search [PDF]
, 2012 We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different ...
Derbel, Bilel, Derbel, Houda
core +5 more sources