Variable neighbourhood search: methods and applications
From MaRDI portal
Publication:970194
DOI10.1007/S10479-009-0657-6zbMATH Open1185.90211DBLPjournals/anor/HansenMM10OpenAlexW1986254541WikidataQ57254143 ScholiaQ57254143MaRDI QIDQ970194FDOQ970194
José A. Moreno Pérez, Pierre Hansen, Nenad Mladenović
Publication date: 10 May 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0657-6
Recommendations
Cites Work
- GLOB -- a new VNS-based software for global optimization
- AutoGraphiX: a survey
- TSPLIB—A Traveling Salesman Problem Library
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- A Rapidly Convergent Descent Method for Minimization
- Title not available (Why is that?)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- A survey of local search methods for graph coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Allocation search methods for a generalized class of location-allocation problems
- Variable neighbourhood search: Methods and applications
- Stabilized column generation
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood tabu search and its application to the median cycle problem.
- Local branching
- Merging the local and global approaches to probabilistic satisfiability
- A variable neighbourhood search algorithm for the open vehicle routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- A reactive variable neighborhood search for the vehicle-routing problem with time windows
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Title not available (Why is that?)
- An Oil Pipeline Design Problem
- Decomposition strategies for large-scale continuous location–allocation problems
- The \(p\)-median problem: a survey of metaheuristic approaches
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Using constraint-based operators to solve the vehicle routing problem with time windows
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search and local branching
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- Search Methodologies
- Variable Neighborhood Search
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Neighborhood structures for the container loading problem: a VNS implementation
- A variable neighborhood search heuristic for periodic routing problems
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Multi-objective Flow Shop Scheduling Using Differential Evolution
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Delivery strategies for blood products supplies
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- A general vehicle routing problem
- Developments of variable neighborhood search
- Pooling Problem: Alternate Formulations and Solution Methods
- Handbook of metaheuristics
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Variable neighborhood decomposition search
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- A nonlinear programming technique for the optimization of continuous processing systems
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Variable neighborhood search for the p-median
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search for minimum cost berth allocation
- Combining VNS with constraint programming for solving anytime optimization problems
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- The traveling purchaser problem with budget constraint
- Reformulation descent applied to circle packing problems
- The maximum capture problem with random utilities: problem formulation and algorithms
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- First vs. best improvement: an empirical study
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- A hybrid evolutionary algorithm for the job shop scheduling problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- An Efficient Heuristic for the Ring Star Problem
- Formulation Space Search for Circle Packing Problems
- New heuristics for one-dimensional bin-packing
- General variable neighborhood search for the continuous optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Variable space search for graph coloring
- Minimizing total tardiness on a single machine with controllable processing times
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- 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
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
- The parallel variable neighborhood search for the \(p\)-median problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- A variable neighborhood decomposition search method for supply chain management planning problems
- Categorical data fuzzy clustering: an analysis of local search heuristics
- A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
- Scheduling workover rigs for onshore oil production
- 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
- Scheduling of brand production and shipping within a sugar supply chain
- A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- On the selection of the globally optimal prototype subset for nearest-neighbor classification
- Title not available (Why is that?)
- Randomized heuristics for the Max-Cut problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variable neighbourhood search algorithm for the constrained task allocation problem
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Title not available (Why is that?)
- Variable neighborhood search for the maximum clique
- Scheduling periodic customer visits for a traveling salesperson
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- An effective VNS for the capacitated \(p\)-median problem
- A modified VNS metaheuristic for max-bisection problems
- Alternating local search based VNS for linear classification
- The capacitated centred clustering problem
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- The core concept for the Multidimensional Knapsack problem
- Sequential search and its application to vehicle-routing problems
- Parallel Variable Neighborhood Search
- An effective heuristic for the CLSP with set-up times
- Two local search approaches for solving real-life car sequencing problems
- Title not available (Why is that?)
- Variance algorithm for minimization
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- A variable neighborhood search for graph coloring.
- Local search and suffix tree for car-sequencing problem with colors
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- On bags and bugs
- On the spectral radius of graphs with a given domination number
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Variable neighborhood search for the linear ordering problem
- Primal-dual variable neighborhood search for the simple plant-location problem
- Title not available (Why is that?)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- On a conjecture about the Randić index
- Design of balanced MBA student teams
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- Heuristics for the phylogeny problem
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Title not available (Why is that?)
- Heuristic procedures for solving the discrete ordered median problem
- DNA Sequence Design by Dynamic Neighborhood Searches
- Learning multicriteria fuzzy classification method PROAFTN from data
- Fuzzy J-means: a new heuristic for fuzzy clustering
- Embedded local search approaches for routing optimization
- The multi-source Weber problem with constant opening cost
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Large neighborhood improvements for solving car sequencing problems
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- Solving the unconstrained optimization problem by a variable neighborhood search
- Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Title not available (Why is that?)
- What forms do interesting conjectures have in graph theory?
- Variable neighborhood search for extremal graphs 3
- Title not available (Why is that?)
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille
- How far is, should and could be conjecture-making in graph theory an automated process?
- Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
- KI 2005: Advances in Artificial Intelligence
- New formulations for the Kissing Number Problem
- On-line resources allocation for ATM networks with rerouting
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- Computers and discovery in algebraic graph theory
- Special issue: Selected papers based on the presentations at the 18th Mini EURO conference (MEC), Tenerife, Spain, November 23--25, 2005
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- Algorithms for \(\ell_{1}\)-embeddability and related problems
- A multiobjective metaheuristic for a mean-risk multistage capacity investment problem with process flexibility
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
- Particle Swarm Scheduling for Work-Flow Applications in Distributed Computing Environments
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem
- 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
- Variable neighbourhood search for colour image quantization
Cited In (only showing first 100 items - show all)
- An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A generalized variable neighborhood search for combinatorial optimization problems
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Variable Neighborhood Search
- VNS variants for the Max-Mean dispersion problem
- Lower and upper bounds for the bin packing problem with fragile objects
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
- Variable neighborhood search for solving the balanced location problem
- Variable neighborhood search for the strong metric dimension problem
- Variable neighborhood search for Google machine reassignment problem
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Attraction probabilities in variable neighborhood search
- Variable neighborhood search for location routing
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Transshipment service through crossdocks with both soft and hard time windows
- Fast local search for single row facility layout
- Surgical scheduling with simultaneous employment of specialised human resources
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- A survey on optimization metaheuristics
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- Nested general variable neighborhood search for the periodic maintenance problem
- A model for clustering data from heterogeneous dissimilarities
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- A two phase variable neighborhood search for the multi-product inventory routing problem
- DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A multiobjective hub-airport location problem for an airline network design
- A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- A quadtree-based allocation method for a class of large discrete Euclidean location problems
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- Two level general variable neighborhood search for attractive traveling salesman problem
- Variable neighborhood search for the vertex separation problem
- Arbitrary-norm hyperplane separation by variable neighbourhood search
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- The multimode covering location problem
- The multiple team formation problem using sociometry
- Solving the clique partitioning problem as a maximally diverse grouping problem
- VNS solutions for the critical node problem
- The uncapacitated r‐allocation p‐hub center problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Clustering data that are graph connected
- On the extremal properties of the average eccentricity
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- Variable neighborhood search strategies for the order batching problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- The critical node detection problem in networks: a survey
- A variable neighborhood descent approach for the two-dimensional bin packing problem
- A variable neighborhood search and its application to a ring star problem generalization
- Variable neighborhood search for the travelling deliveryman problem
- The hybrid electric vehicle-traveling salesman problem with time windows
- Developments of variable neighborhood search
- A new local search for continuous location problems
- A modified variable neighborhood search for the discrete ordered median problem
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A variable neighborhood search algorithm for the multimode set covering problem
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- A variable neighborhood search approach for the vertex bisection problem
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- J-means and I-means for minimum sum-of-squares clustering on networks
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
- Recent trends in metaheuristics for stochastic combinatorial optimization
- Layout optimisation for an installation port of an offshore wind farm
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- Solving the unconstrained optimization problem by a variable neighborhood search
- Generalization of the restricted planar location problems: unified metaheuristic algorithms
- Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
- Two multi-start heuristics for the \(k\)-traveling salesman problem
- Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap
- Variable neighbourhood search
- A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- A general variable neighborhood search for the swap-body vehicle routing problem
- A VNS approach to multi-location inventory redistribution with vehicle routing
- Bi-objective optimisation model for installation scheduling in offshore wind farms
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
Uses Software
This page was built for publication: Variable neighbourhood search: methods and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970194)
