Variable neighborhood search
From MaRDI portal
Publication:1374041
DOI10.1016/S0305-0548(97)00031-2zbMATH Open0889.90119WikidataQ57254144 ScholiaQ57254144MaRDI QIDQ1374041FDOQ1374041
Pierre Hansen, Nenad Mladenović
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Tabu Search—Part I
- Tabu Search—Part II
- Title not available (Why is that?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- Metaheuristics: A bibliography
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Title not available (Why is that?)
- Fast Algorithms for Geometric Traveling Salesman Problems
- Algorithms for the maximum satisfiability problem
- The traveling salesman problem with backhauls
Cited In (only showing first 100 items - show all)
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- 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
- Repairing MIP infeasibility through local branching
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- Scheduling workover rigs for onshore oil production
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- VNS variants for the Max-Mean dispersion problem
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- Time series interpolation via global optimization of moments fitting
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Variable neighborhood search for the strong metric dimension problem
- Variable neighborhood search and tabu search for the web service selection problem
- Variable neighborhood search method for optimizing the emergency service network of police special forces units
- Sequential search and its application to vehicle-routing problems
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Randomized heuristics for the Max-Cut problem
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem
- Minimising maximum response time
- A nested heuristic for parameter tuning in support vector machines
- A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions
- A variable neighborhood search particle filter for bearings-only target tracking
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- Minimizing the total completion time in a distributed two stage assembly system with setup times
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
- Single string planning problem arising in liner shipping industries: a heuristic approach
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Scheduled penalty variable neighborhood search
- New heuristic algorithms for solving the planar \(p\)-median problem
- Variable neighborhood search for the pharmacy duty scheduling problem
- Variable neighborhood search based algorithms for high school timetabling
- Variable neighborhood search for the workload balancing problem in service enterprises
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
- Two level general variable neighborhood search for attractive traveling salesman problem
- An efficient hybrid meta-heuristic for aircraft landing problem
- Variable neighborhood search for the vertex separation problem
- Algorithms for the maximum \(k\)-club problem in graphs
- The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
- A general VNS heuristic for the traveling salesman problem with time windows
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Bounding, filtering and diversification in CP-based local branching
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- A nonmonotone GRASP
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Variable space search for graph coloring
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Variable neighborhood search for the maximum clique
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
- Graph colouring approaches for a satellite range scheduling problem
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- Classification of applied methods of combinatorial optimization
- Principles for the design of large neighborhood search
- Scheduling periodic customer visits for a traveling salesperson
- The consistent production routing problem
- The uncapacitated r‐allocation p‐hub center problem
- From fitness landscapes evolution to automatic local search algorithm generation
- An effective VNS for the capacitated \(p\)-median problem
- A modified VNS metaheuristic for max-bisection problems
- Exact \(L_{2}\)-norm plane separation
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Minimizing total tardiness on a single machine with controllable processing times
- Alternating local search based VNS for linear classification
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- A quality and distance guided hybrid algorithm for the vertex separator problem
- Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
- Variable neighborhood search strategies for the order batching problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- HUBBI: iterative network design for incomplete hub location problems
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Variable neighborhood search for the travelling deliveryman problem
- Minimizing latency in post-disaster road clearance operations
- An efficient heuristic for a hub location routing problem
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 Q1374041)
