Variable Neighborhood Search

DOI10.1007/0-306-48056-5_6zbMATH Open1102.90371OpenAlexW4211231030WikidataQ61773343 ScholiaQ61773343MaRDI QIDQ4452895FDOQ4452895

Authors: Pierre Hansen, Nenad Mladenović 

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

Recommendations

• Developments of variable neighborhood search
• Fundamentals of variable neighborhood search
• Variable neighbourhood search: Methods and applications
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

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

This page was built for publication: Variable Neighborhood Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452895)