Variable Neighborhood Search

DOI10.1007/0-306-48056-5_6zbMath1102.90371OpenAlexW4211231030WikidataQ61773343 ScholiaQ61773343MaRDI QIDQ4452895

Nenad Mladenović, Pierre Hansen

Publication date: 7 March 2004

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.635.7056

Mathematics Subject Classification ID

Nonlinear programming (90C30) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (88)

A review of hyper-heuristics for educational timetabling ⋮ A priori orienteering with time windows and stochastic wait times at customers ⋮ Metaheuristic Algorithms ⋮ Metaheuristics for solving a multimodal home-healthcare scheduling problem ⋮ Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search ⋮ An overview of graph covering and partitioning ⋮ Variable neighbourhood search for bandwidth reduction ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container ⋮ Single string planning problem arising in liner shipping industries: a heuristic approach ⋮ GRASP and path relinking for the equitable dispersion problem ⋮ Variable neighborhood search for location routing ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ Hybrid method with CS and BRKGA applied to the minimization of tool switches problem ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ An algorithmic framework for generating optimal two-stratum experimental designs ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism ⋮ General variable neighborhood search for computing graph separators ⋮ Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80 ⋮ Solving the quadratic minimum spanning tree problem ⋮ Fuzzy optimization for distribution of frozen food with imprecise times ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ Shop scheduling in manufacturing environments: a review ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups ⋮ General variable neighborhood search approach to group Steiner tree problem ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Feature selection in machine learning via variable neighborhood search ⋮ Metaheuristics: A Canadian Perspective ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ Product line pricing for services with capacity constraints and dynamic substitution ⋮ Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments ⋮ Exact and approximate algorithms for variable selection in linear discriminant analysis ⋮ Learning cluster-based structure to solve constraint satisfaction problems ⋮ Securing home health care in times of natural disasters ⋮ Risk approaches for delivering disaster relief supplies ⋮ An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem ⋮ Variable neighborhood search for minimum cost berth allocation ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks ⋮ General variable neighborhood search for the continuous optimization ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints ⋮ A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices ⋮ A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule ⋮ PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Bringing order into the neighborhoods: Relaxation guided variable neighborhood search ⋮ Local and variable neighborhood search for the \(k\) -cardinality subgraph problem ⋮ Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Variable neighborhood descent with iterated local search for routing and wavelength assignment ⋮ Local search neighbourhoods for dealing with a novel nurse rostering model ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ Alternating local search based VNS for linear classification ⋮ Variable neighbourhood search: methods and applications ⋮ Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm ⋮ Variable neighborhood search and local branching ⋮ Scheduling workover rigs for onshore oil production ⋮ First vs. best improvement: an empirical study ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Reformulation descent applied to circle packing problems ⋮ Merging the local and global approaches to probabilistic satisfiability ⋮ Variable neighborhood search for the linear ordering problem ⋮ Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry ⋮ Construction and improvement algorithms for dispersion problems ⋮ Efficient algorithms for cluster editing ⋮ VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem ⋮ Variable neighbourhood search: Methods and applications ⋮ A new variable neighborhood search approach for solving dynamic memory allocation problem ⋮ Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report ⋮ A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays ⋮ Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots ⋮ Exact and heuristic solutions of the global supply chain problem with transfer pricing ⋮ A relax‐and‐price heuristic for the inventory‐location‐routing problem ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis ⋮ VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem ⋮ Metaheuristics in combinatorial optimization

This page was built for publication: Variable Neighborhood Search