Variable neighborhood search: the power of change and simplicity
From MaRDI portal
Publication:6164603
DOI10.1016/j.cor.2023.106221MaRDI QIDQ6164603
Said Salhi, Dragan Urošević, Jack Brimberg, Raca Todosijević
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items (1)
Cites Work
- A Heuristic for Nonlinear Global Optimization
- Nested general variable neighborhood search for the periodic maintenance problem
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- Two level general variable neighborhood search for attractive traveling salesman problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A guided reactive GRASP for the capacitated multi-source Weber problem
- Solving the unconstrained optimization problem by a variable neighborhood search
- General variable neighborhood search for the continuous optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Variable neighbourhood search: methods and applications
- Attraction probabilities in variable neighborhood search
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Facility siting and integer-friendly programming
- Heuristic concentration: Two stage solution construction
- Variable neighborhood search
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Local branching
- A general variable neighborhood search for the swap-body vehicle routing problem
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A general framework for nested variable neighborhood search
- Variable neighborhood search: basics and variants
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
- Gaussian variable neighborhood search for continuous optimization
- Reformulation descent applied to circle packing problems
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
- A parallel variable neighborhood search for solving covering salesman problem
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
- 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
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- Variable neighbourhood search for bandwidth reduction
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- A variable neighborhood decomposition search method for supply chain management planning problems
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
- Variable neighborhood search and local branching
- First vs. best improvement: an empirical study
- The feasibility pump
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances
- MPI Parallelization of Variable Neighborhood Search
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Continuous variable neighbourhood search with modified Nelder–Mead for non-differentiable optimization
- Decomposition strategies for large-scale continuous location–allocation problems
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Variable neighborhood search: the power of change and simplicity
