Variable neighbourhood search: Methods and applications
From MaRDI portal
Publication:1029572
DOI10.1007/s10288-008-0089-1zbMath1179.90332OpenAlexW2088243692WikidataQ57254146 ScholiaQ57254146MaRDI QIDQ1029572
Pierre Hansen, Nenad Mladenović, José Andrés Moreno-Pérez
Publication date: 13 July 2009
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-008-0089-1
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
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, The multi-vehicle profitable pickup and delivery problem, A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Twelve surveys in operations research, VNS solutions for the critical node problem, A hybrid variable neighborhood search algorithm for targeted offers in direct marketing, Classification of applied methods of combinatorial optimization, An approach of the exact linearization techniques to analysis of population dynamics of the mosquito Aedes aegypti, Fast local search for single row facility layout, Nested general variable neighborhood search for the periodic maintenance problem, A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, Scheduled penalty variable neighborhood search, Multi-instance classification through spherical separation and VNS, Two level general variable neighborhood search for attractive traveling salesman problem, Skewed general variable neighborhood search for the location routing scheduling problem, A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations, The dynamic vehicle allocation problem with application in trucking companies in Brazil, DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems, 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, A metaheuristic approach to the dominating tree problem, A recipe for finding good solutions to MINLPs, Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, A variable neighborhood search based algorithm for finite-horizon Markov decision processes, New heuristic for harmonic means clustering, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes, Fitting censored quantile regression by variable neighborhood search, LP-based heuristics for the distinguishing string and substring selection problems, Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect, Variable neighborhood descent for the incremental graph drawing, Clustering approach in maintenance of capillary railway network, General variable neighborhood search approach to group Steiner tree problem, The intermittent travelling salesman problem, An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times, Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Variable neighborhood scatter search for the incremental graph drawing problem, General variable neighborhood search for the order batching and sequencing problem, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, Variable neighborhood search for the travelling deliveryman problem, A simulated annealing hyper-heuristic methodology for flexible decision support, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A general VNS heuristic for the traveling salesman problem with time windows, Variable neighborhood search for harmonic means clustering, Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, Locating a semi-obnoxious covering facility with repelling polygonal regions, Surveys in operations research, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, An improved column generation algorithm for minimum sum-of-squares clustering, Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem, Column generation bounds for numerical microaggregation, A multiobjective hub-airport location problem for an airline network design, A survey on optimization metaheuristics, A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem, A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems, Variable neighborhood descent with iterated local search for routing and wavelength assignment, A global optimization method for the design of space trajectories, Variable neighbourhood search: methods and applications, A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Revenue maximization of Internet of things provider using variable neighbourhood search, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, Attraction probabilities in variable neighborhood search, A hybrid heuristic algorithm for the open-pit-mining operational planning problem, A derivative-free algorithm for refining numerical microaggregation solutions, Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties, Heuristic approaches to the distinguishing substring selection problem, A GVNS algorithm for solving the multi-depot vehicle routing problem, Learning music time series with a parallel hybrid forecasting model calibrated with reduced VNS, Candidate groups search for K-harmonic means data clustering, Algorithms with greedy heuristic procedures for mixture probability distribution separation, Global optimization based on local searches, Global optimization based on local searches, Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND, Hybrid Metaheuristic for Bicluster Editing Problem, A variable neighborhood search for the multi-product inventory routing problem, A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups, A SA-VNS approach for the High School Timetabling Problem, GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery, Multi-objective approaches for the open-pit mining operational planning problem, A fast metaheuristic for the travelling salesperson problem with hotel selection, Variable neighborhood search for minimum sum-of-squares clustering on networks, Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
Uses Software
Cites Work
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Variable neighborhood search for the maximum clique
- 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
- Detailed layout planning for irregularly-shaped machines with transportation path design
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Scheduling periodic customer visits for a traveling salesperson
- The \(p\)-median problem: a survey of metaheuristic approaches
- On a conjecture about the Randić index
- Solving the unconstrained optimization problem by a variable neighborhood search
- Learning multicriteria fuzzy classification method PROAFTN from data
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- An effective VNS for the capacitated \(p\)-median problem
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- Variable neighborhood search for minimum cost berth allocation
- A general vehicle routing problem
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
- Combining VNS with constraint programming for solving anytime optimization problems
- General variable neighborhood search for the continuous optimization
- Local search and suffix tree for car-sequencing problem with colors
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- A modified VNS metaheuristic for max-bisection problems
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Variable space search for graph coloring
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Allocation search methods for a generalized class of location-allocation problems
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Algorithms for \(\ell_{1}\)-embeddability and related problems
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- Stabilized column generation
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood search
- Variable neighborhood tabu search and its application to the median cycle problem.
- A variable neighborhood search for graph coloring.
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Local branching
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- The core concept for the Multidimensional Knapsack problem
- A multiobjective metaheuristic for a mean-risk multistage capacity investment problem with process flexibility
- Reformulation descent applied to circle packing problems
- The maximum capture problem with random utilities: problem formulation and algorithms
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- Heuristics for the phylogeny problem
- Fuzzy J-means: a new heuristic for fuzzy clustering
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Embedded local search approaches for routing optimization
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Neighborhood structures for the container loading problem: a VNS implementation
- Merging the local and global approaches to probabilistic satisfiability
- New formulations for the Kissing Number Problem
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A variable neighborhood decomposition search method for supply chain management planning problems
- Categorical data fuzzy clustering: an analysis of local search heuristics
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- On the spectral radius of graphs with a given domination number
- On bags and bugs
- On-line resources allocation for ATM networks with rerouting
- Variable neighborhood search and local branching
- Sequential search and its application to vehicle-routing problems
- A survey of local search methods for graph coloring
- Scheduling workover rigs for onshore oil production
- First vs. best improvement: an empirical study
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Variable neighborhood search for the linear ordering problem
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- The capacitated centred clustering problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Variable neighborhood search for extremal graphs 3
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Multi-objective Flow Shop Scheduling Using Differential Evolution
- Pooling Problem: Alternate Formulations and Solution Methods
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- Search Methodologies
- AutoGraphiX: a survey
- A tabu search algorithm for the single vehicle routing allocation problem
- The maximum return-on-investment plant location problem with market share
- An ant colony optimisation algorithm for scheduling in agile manufacturing
- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
- An Oil Pipeline Design Problem
- TSPLIB—A Traveling Salesman Problem Library
- Variable neighborhood search for the p-median
- Randomized heuristics for the Max-Cut problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Variable Neighborhood Search
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- The multi-source Weber problem with constant opening cost
- Design of balanced MBA student teams
- An effective heuristic for the CLSP with set-up times
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
- Particle Swarm Scheduling for Work-Flow Applications in Distributed Computing Environments
- An Efficient Heuristic for the Ring Star Problem
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- A Rapidly Convergent Descent Method for Minimization
- A variable neighbourhood search algorithm for the constrained task allocation problem
- Decomposition strategies for large-scale continuous location–allocation problems
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem
- Formulation Space Search for Circle Packing Problems
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Variable neighbourhood search for redundancy allocation problems
- A hybrid VNS–path relinking for the p-hub median problem
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
- Variable neighbourhood search for colour image quantization
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- DNA Sequence Design by Dynamic Neighborhood Searches
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Scheduling of brand production and shipping within a sugar supply chain
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
- A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
- KI 2005: Advances in Artificial Intelligence
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- New heuristics for one-dimensional bin-packing
- Using constraint-based operators to solve the vehicle routing problem with time windows
