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 are tackled (1) rooms locations, (2) connectivity graph, and (3) element placement.
Peña Sánchez, José María +4 more
openaire +5 more sources
Study of the General Variable Neighborhood Search (GVNS) algorithm and Variable Neighborhood Search (VNS) algorithm in CVRPTW [PDF]
AIP Conference Proceedings, 2022 Ulil Ilmi Fadila +2 more
openalex +2 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
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
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
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
Fitting censored quantile regression by variable neighborhood search [PDF]
, 2015 Quantile regression is an increasingly important topic in statistical analysis. However, fitting censored quantile regression is hard to solve numerically because the objective function to be minimized is not convex nor concave in regressors. Performance
AD Toksari +40 more
core +1 more source
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
Computers & Operations Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lai, Xiangjing +3 more
openaire +2 more sources
Bringing order into the neighborhoods: relaxation guided variable neighborhood search [PDF]
Journal of Heuristics, 2007 In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new Variable Neighborhood Descent (VND) algorithm. The ordering of the neighborhood structures in this VND is determined dynamically by solving relaxations of them. The objective
Puchinger, Jakob, Raidl, Günther
openaire +2 more sources
Una comparación de algoritmos basados en trayectoria granular para el problema de localización y ruteo con flota heterogénea (LRPH) [PDF]
, 2017 Indexación: Scopus.We consider the Location-Routing Problem with Heterogeneous Fleet (LRPH) in which the goal is to determine the depots to be opened, the customers to be assigned to each open depot, and the corresponding routes fulfilling the demand of ...
Bernal-Moyano, J.A. +4 more
core +1 more source