Variable neighborhood search: Principles and applications

DOI10.1016/S0377-2217(00)00100-4zbMath0981.90063WikidataQ115188678 ScholiaQ115188678MaRDI QIDQ5937708

Pierre Hansen, Nenad Mladenović

Publication date: 24 March 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationheuristiclocal search algorithmmetaheuristicvariable neighborhood searchVNS

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Related Items (only showing first 100 items - show all)

A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ Iterated local search for the team orienteering problem with time windows ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ A survey of recent research on location-routing problems ⋮ New neighborhood structures for the double traveling salesman problem with multiple stacks ⋮ Delivery strategies for blood products supplies ⋮ Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks ⋮ Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints ⋮ Anytime Pareto local search ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ The multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Fast local search for single row facility layout ⋮ Aggregation heuristic for the open-pit block scheduling problem ⋮ The bipartite quadratic assignment problem and extensions ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Nested general variable neighborhood search for the periodic maintenance problem ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Large neighborhood search for multi-trip vehicle routing ⋮ A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ A math-heuristic for the warehouse location-routing problem in disaster relief ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ A nested heuristic for parameter tuning in support vector machines ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A variable neighborhood search particle filter for bearings-only target tracking ⋮ A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints ⋮ A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions ⋮ Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search ⋮ A local search heuristic for the \((r| p)\)-centroid problem in the plane ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic ⋮ Variable neighborhood search for location routing ⋮ An efficient hybrid meta-heuristic for aircraft landing problem ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ Hybrid column generation and large neighborhood search for the dial-a-ride problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A destroy and repair algorithm for the bike sharing rebalancing problem ⋮ Variable neighborhood search for the second type of two-sided assembly line balancing problem ⋮ The dynamic vehicle allocation problem with application in trucking companies in Brazil ⋮ On the extremal properties of the average eccentricity ⋮ An iterative approach for the serial batching problem with parallel machines and job families ⋮ Point-to-point shortest paths on dynamic time-dependent road networks ⋮ A recipe for finding good solutions to MINLPs ⋮ Algorithms for the maximum \(k\)-club problem in graphs ⋮ Space and time allocation in a shipyard assembly hall ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ Metaheuristic methods based on tabu search for assigning judges to competitions ⋮ Adapting derivative free optimization methods to engineering models with discrete variables ⋮ Design of highly synchronizable and robust networks ⋮ The tree representation for the pickup and delivery traveling salesman problem with LIFO loading ⋮ Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking ⋮ A GRASP with evolutionary path relinking for the truck and trailer routing problem ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ Variable neighborhood search for harmonic means clustering ⋮ Similarities between meta-heuristics algorithms and the science of life ⋮ Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem ⋮ A unified framework for population-based metaheuristics ⋮ Functional data clustering via piecewise constant nonparametric density estimation ⋮ Heuristic and exact algorithms for the multi-pile vehicle routing problem ⋮ A variable neighborhood search based matheuristic for nurse rostering problems ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Column generation bounds for numerical microaggregation ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics ⋮ A filling function method for unconstrained global optimization ⋮ A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads ⋮ The heterogeneous \(p\)-median problem for categorization based clustering ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ Assigning judges to competitions of several rounds using tabu search ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem ⋮ Variable neighborhood search for the maximum clique ⋮ A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem ⋮ Heuristic methods for the optimal statistic median problem ⋮ Multiobjective optimization for multimode transportation problems ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem ⋮ Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning ⋮ Heuristics for the multi-period orienteering problem with multiple time windows ⋮ Optimum simultaneous discretization with data grid models in supervised classification: a Bayesian model selection approach ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ Transshipment service through crossdocks with both soft and hard time windows ⋮ Objective function features providing barriers to rapid global optimization ⋮ Heuristic procedures for solving the discrete ordered median problem ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods ⋮ Metaheuristics in combinatorial optimization

Uses Software

• Unnamed Item
• Unnamed Item
• OR-Library
• AutoGraphiX
• GRAFFITI
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• GRAFFITI
• Algorithms for the maximum satisfiability problem
• On conjectures of Graffiti
• A note on solving large p-median problems
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• Heuristic concentration and tabu search: A head to head comparison
• Stabilized column generation
• Local optima topology for the \(k\)-coloring problem
• A new adaptive multi-start technique for combinatorial global optimizations
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• Variable neighborhood decomposition search
• The traveling salesman problem with backhauls
• Metaheuristics: A bibliography
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Location-Allocation Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• Fast Algorithms for Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Variable neighborhood search for the p-median
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Fast generation of cubic graphs
• Computer Solutions of the Traveling Salesman Problem
• Exact and approximate solutions to the multisource weber problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• J-MEANS: A new local search heuristic for minimum sum of squares clustering

This page was built for publication: Variable neighborhood search: Principles and applications