Variable neighborhood search: the power of change and simplicity (Q6164603)

scientific article; zbMATH DE number 7706733

Language	Label	Description	Also known as
English	Variable neighborhood search: the power of change and simplicity	scientific article; zbMATH DE number 7706733

Statements

instance of

scholarly article

0 references

title

Variable neighborhood search: the power of change and simplicity (English)

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

4 July 2023

0 references

zbMATH Keywords

metaheuristic

0 references

variable neighborhood search

0 references

less-is-more

0 references

variable formulation space

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An adaptive variable neighborhood search for solving the multi-objective node placement problem

0 references

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems

0 references

Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search

0 references

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

0 references

A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction

0 references

A Heuristic for Nonlinear Global Optimization

0 references

Decomposition strategies for large-scale continuous location–allocation problems

0 references

Attraction probabilities in variable neighborhood search

0 references

Q4359509

0 references

A general framework for nested variable neighborhood search

0 references

Gaussian variable neighborhood search for continuous optimization

0 references

MPI Parallelization of Variable Neighborhood Search

0 references

A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem

0 references

Continuous variable neighbourhood search with modified Nelder–Mead for non-differentiable optimization

0 references

A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule

0 references

Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization

0 references

The feasibility pump

0 references

Local branching

0 references

The parallel variable neighborhood search for the \(p\)-median problem

0 references

A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands

0 references

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility

0 references

Q2861506

0 references

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

0 references

First vs. best improvement: an empirical study

0 references

Variable neighbourhood search: methods and applications

0 references

Variable neighborhood decomposition search

0 references

Variable neighborhood search: basics and variants

0 references

Variable neighborhood search and local branching

0 references

A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem

0 references

Q4365133

0 references

Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem

0 references

An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers

0 references

A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances

0 references

Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs

0 references

A variable neighborhood decomposition search method for supply chain management planning problems

0 references

A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities

0 references

A guided reactive GRASP for the capacitated multi-source Weber problem

0 references

Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem

0 references

General variable neighborhood search for the continuous optimization

0 references

Variable neighborhood search

0 references

Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.

0 references

Reformulation descent applied to circle packing problems

0 references

Two level general variable neighborhood search for attractive traveling salesman problem

0 references

Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS

0 references

Variable neighbourhood search for bandwidth reduction

0 references

A hybrid variable neighborhood search algorithm for targeted offers in direct marketing

0 references

Facility siting and integer-friendly programming

0 references

Heuristic concentration: Two stage solution construction

0 references

A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem

0 references

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies

0 references

A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations

0 references

Parallel computational optimization in operations research: a new integrative framework, literature review and research directions

0 references

Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems

0 references

Parallel variable neighbourhood search algorithms for job shop scheduling problems

0 references

Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem

0 references

Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

0 references

Learning variable neighborhood search for a scheduling problem with time windows and rejections

0 references

Nested general variable neighborhood search for the periodic maintenance problem

0 references

A general variable neighborhood search for the swap-body vehicle routing problem

0 references

A general variable neighborhood search variants for the travelling salesman problem with draft limits

0 references

Solving the unconstrained optimization problem by a variable neighborhood search

0 references

Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem

0 references

A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices

0 references

An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

0 references

A parallel variable neighborhood search for solving covering salesman problem

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

10.1016/J.COR.2023.106221

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6164603