Variable neighborhood decomposition search

DOI10.1023/A:1011336210885zbMath1041.68623OpenAlexW2152304735MaRDI QIDQ1850963

Pierre Hansen, Dionisio Perez-Britos, Nenad Mladenović

Publication date: 15 December 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011336210885

zbMATH Keywords

decompositionmetaheuristicvariable neighborhood search\(y\)-median

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (82)

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility ⋮ On the integrated charge planning with flexible jobs in primary steelmaking processes ⋮ Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm ⋮ Dynamic vehicle routing using an improved variable neighborhood search algorithm ⋮ Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ Variable neighbourhood search for bandwidth reduction ⋮ Decomposition based hybrid metaheuristics ⋮ Integrating order delivery and return operations for order fulfillment in an online retail environment ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ Single string planning problem arising in liner shipping industries: a heuristic approach ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ An algorithm for minimizing clustering functions ⋮ Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs ⋮ Learning multicriteria fuzzy classification method PROAFTN from data ⋮ Computational study of large-scale \(p\)-median problems ⋮ Application of the cross-entropy method to clustering and vector quantization ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Fast modified global \(k\)-means algorithm for incremental cluster construction ⋮ A decision method on yard cranes transformation and deployment in green ports ⋮ Metaheuristics: A Canadian Perspective ⋮ Aggregation tree construction using hierarchical structures ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Variable neighborhood search: the power of change and simplicity ⋮ The balanced \(p\)-median problem with unitary demand ⋮ Variable neighborhood tabu search and its application to the median cycle problem. ⋮ A variable neighborhood decomposition search method for supply chain management planning problems ⋮ Variable neighborhood search for harmonic means clustering ⋮ Variable neighborhood search: basics and variants ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ An effective VNS for the capacitated \(p\)-median problem ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ Combining VNS with constraint programming for solving anytime optimization problems ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search ⋮ Categorical data fuzzy clustering: an analysis of local search heuristics ⋮ Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems ⋮ A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem ⋮ An iterative local search approach applied to the optimal stratification problem ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ The stochastic capacitated branch restructuring problem ⋮ Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ A fast swap-based local search procedure for location problems ⋮ A modified variable neighborhood search for the discrete ordered median problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ An aggregation heuristic for large scale p-median problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighborhood search: Principles and applications ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ A metaheuristic to solve a location-routing problem with nonlinear costs ⋮ Variable neighborhood search for the linear ordering problem ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ Improved metaheuristics for the quartet method of hierarchical clustering ⋮ Revenue maximization of Internet of things provider using variable neighbourhood search ⋮ Solving thep-Center problem with Tabu Search and Variable Neighborhood Search ⋮ Variable neighborhood descent applied to multi-way number partitioning problem ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Variable neighbourhood search: Methods and applications ⋮ Exemplar-based clustering via simulated annealing ⋮ Exploiting Separators for Guiding VNS ⋮ An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system ⋮ Heuristics for Location Models ⋮ A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems ⋮ The maximum capture problem with random utilities: problem formulation and algorithms ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ Fuzzy J-means: a new heuristic for fuzzy clustering ⋮ Hybrid metaheuristic method for determining locations for long-term health care facilities ⋮ Heuristic procedures for solving the discrete ordered median problem ⋮ Metaheuristics in combinatorial optimization

This page was built for publication: Variable neighborhood decomposition search