Variable neighborhood search: basics and variants
From MaRDI portal
Publication:1707084
DOI10.1007/s13675-016-0075-xzbMath1390.90586OpenAlexW2516530272MaRDI QIDQ1707084
Raca Todosijević, Pierre Hansen, Saïd Hanafi, Nenad Mladenović
Publication date: 28 March 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-016-0075-x
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items
Comparison of anticipatory algorithms for a dial-a-ride problem, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, Portfolio decision analysis with a generalized balance approach, Modelling and solving the milk collection problem with realistic constraints, Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem, A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods, Data-driven optimization and statistical modeling to improve meter reading for utility companies, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Algorithm selection for the team orienteering problem, Mathematical programming based heuristics for the 0--1 MIP: a survey, Visual attractiveness in vehicle routing via bi-objective optimization, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, Learning variable neighborhood search for a scheduling problem with time windows and rejections, A hybrid algorithm for the drilling rig routing problem, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, Adaptive variable neighbourhood search approach for time-dependent joint location and dispatching problem in a multi-tier ambulance system, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping, General variable neighborhood search for the minimum stretch spanning tree problem, A general VNS for the multi-depot open vehicle routing problem with time windows, General variable neighborhood search approach to group Steiner tree problem, A no-delay single machine scheduling problem to minimize total weighted early and late work, Variable neighborhood search for the single machine scheduling problem to minimize the total early work, Hybrid variable neighborhood search for automated warehouse scheduling, General variable neighborhood search for the parallel machine scheduling problem with two common servers, Multi-objective home health care routing: a variable neighborhood search method, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, Heuristics for the capacitated dispersion problem, The uncapacitated r‐allocation p‐hub center problem, Exponential quality function for community detection in complex networks, A variable neighborhood search for flying sidekick traveling salesman problem, A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty, Variable neighborhood search approach to community detection problem, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Multi-period single-allocation hub location-routing: models and heuristic solutions, Dynamic scheduling of patients in emergency departments, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, Variable neighborhood search: the power of change and simplicity, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, Variable neighborhood search approach with intensified shake for monitor placement, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, GRASP and VNS for solving the \(p\)-next center problem, Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations, Hybrid evolutionary search for the traveling repairman problem with profits, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search, A multiobjective hub-airport location problem for an airline network design, Solving the traveling repairman problem with profits: a novel variable neighborhood search approach, Less is more: general variable neighborhood search for the capacitated modular hub location 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, Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms, On solving the order processing in picking workstations, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, A parallel variable neighborhood search for solving covering salesman problem, Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem, An efficient heuristic for a hub location routing problem, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem, Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects, Less is more: Simplified Nelder-Mead method for large unconstrained optimization, Packing a fixed number of identical circles in a circular container with circular prohibited areas, Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection, Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, 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 general variable neighborhood search for the cyclic antibandwidth problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A recipe for finding good solutions to MINLPs
- A restarted and modified simplex search for unconstrained optimization
- 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
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- 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 variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Gaussian variable neighborhood search for continuous optimization
- Multi-neighborhood tabu search for the maximum weight clique problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Reformulation descent applied to circle packing problems
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- 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
- Neighborhood portfolio approach for local search applied to timetabling problems
- The feasibility pump
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- VNS based heuristic for solving the Unit Commitment problem
- MPI Parallelization of Variable Neighborhood Search
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Pooling Problem: Alternate Formulations and Solution Methods
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- TSPLIB—A Traveling Salesman Problem Library
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- 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
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Ejection chain and filter-and-fan methods in combinatorial optimization
