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
A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems [PDF]
, 2014 In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold.
Xu, Yuchun +4 more
core +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-based heuristic for the heterogeneous fleet vehicle routing problem [PDF]
, 2008 The heterogeneous fleet vehicle routing problem is investigated using some adaptations of the variable neighborhood search (VNS). The initial solution is obtained by Dijkstra's algorithm based on a cost network constructed by the sweep algorithm and the ...
Imran, Arif +2 more
core +1 more source
Variable neighbourhood decomposition search for 0-1 mixed integer programs [PDF]
, 2009 In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver.
Hanafi, S +7 more
core +1 more source
Designing WDM networks by a variable neighborhood search
Journal of Telecommunications and Information Technology, 2006 With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers.
Belén Melián-Batista +2 more
doaj +1 more source
Variable Neighborhood Search for Cost Function Networks
, 2023 International audienceCost Function Networks (CFNs) offer a simple and general framework for modeling and solving constrained optimization problems which allows to deal with over-constrained problems as well as preferences between solutions. Most solving
Boizumault, Patrice +3 more
core +1 more source
Mathematics, 2023 Logistics problems represent an important class of real-world problems where even small improvements in solution quality can lead to significant decreases in operational costs.
Luka Matijević +2 more
doaj +1 more source
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
Jakob Puchinger, Günther R. Raidl
openaire +2 more sources