Variable neighbourhood search: methods and applications (Q970194)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Variable neighbourhood search: methods and applications	scientific article

Statements

scholarly article

0 references

Variable neighbourhood search: methods and applications (English)

0 references

0 references

Nenad Mladenović

0 references

José Andrés Moreno-Pérez

0 references

Annals of Operations Research

0 references

publication date

10 May 2010

0 references

zbMATH Keywords

variable neighbourhood search

0 references

metaheuristic

0 references

heuristic

0 references

describes a project that uses

0 references

0 references

0 references

0 references

Hyperheuristics

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10479-009-0657-6

0 references

Particle Swarm Scheduling for Work-Flow Applications in Distributed Computing Environments

0 references

Scheduling workover rigs for onshore oil production

0 references

Edge-swapping algorithms for the minimum fundamental cycle basis problem

0 references

Heuristics for the phylogeny problem

0 references

Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach

0 references

Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille

0 references

0 references

On a conjecture about the Randić index

0 references

Nordhaus-Gaddum relations for proximity and remoteness in graphs

0 references

0 references

0 references

AutoGraphiX: a survey

0 references

Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index

0 references

0 references

0 references

0 references

Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph

0 references

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

0 references

Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance

0 references

Pooling Problem: Alternate Formulations and Solution Methods

0 references

Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search

0 references

A variable neighborhood search for graph coloring.

0 references

Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling

0 references

Fuzzy J-means: a new heuristic for fuzzy clustering

0 references

Learning multicriteria fuzzy classification method PROAFTN from data

0 references

0 references

Categorical data fuzzy clustering: an analysis of local search heuristics

0 references

The maximum capture problem with random utilities: problem formulation and algorithms

0 references

Allocation search methods for a generalized class of location-allocation problems

0 references

KI 2005: Advances in Artificial Intelligence

0 references

Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

0 references

Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

0 references

A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

0 references

0 references

An Oil Pipeline Design Problem

0 references

The multi-source Weber problem with constant opening cost

0 references

Decomposition strategies for large-scale continuous location–allocation problems

0 references

Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem

0 references

The maximum return-on-investment plant location problem with market share

0 references

Local and variable neighborhood search for the \(k\) -cardinality subgraph problem

0 references

Variable neighborhood search for the heaviest \(k\)-subgraph

0 references

A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices

0 references

A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning

0 references

Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis

0 references

Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis

0 references

Search Methodologies

0 references

0 references

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

0 references

Variable neighborhood search for extremal graphs. I: The AutoGraphiX system

0 references

Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures

0 references

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

0 references

On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification

0 references

A multiobjective metaheuristic for a mean-risk multistage capacity investment problem with process flexibility

0 references

Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem

0 references

Variable neighbourhood search for the minimum labelling Steiner tree problem

0 references

Embedded local search approaches for routing optimization

0 references

Variable neighborhood search for extremal graphs 3

0 references

On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem

0 references

Variance algorithm for minimization

0 references

PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS

0 references

Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search

0 references

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

0 references

A variable neighborhood descent algorithm for a real waste collection problem with mobile depots

0 references

Design of balanced MBA student teams

0 references

An Efficient Heuristic for the Ring Star Problem

0 references

Heuristic procedures for solving the discrete ordered median problem

0 references

0 references

A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule

0 references

Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods

0 references

Stabilized column generation

0 references

An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

0 references

Large neighborhood improvements for solving car sequencing problems

0 references

Two local search approaches for solving real-life car sequencing problems

0 references

Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases

0 references

The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

0 references

Randomized heuristics for the Max-Cut problem

0 references

Local branching

0 references

A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem

0 references

New heuristics for one-dimensional bin-packing

0 references

Solving the resource-constrained project scheduling problem by a variable neighbourhood search.

0 references

An effective VNS for the capacitated \(p\)-median problem

0 references

A variable neighbourhood search algorithm for the open vehicle routing problem

0 references

A Rapidly Convergent Descent Method for Minimization

0 references

Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems

0 references

A survey of local search methods for graph coloring

0 references

A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

0 references

Variable neighborhood search for the linear ordering problem

0 references

The parallel variable neighborhood search for the \(p\)-median problem

0 references

0 references

A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation

0 references

Local search and suffix tree for car-sequencing problem with colors

0 references

0 references

Handbook of metaheuristics

0 references

A general vehicle routing problem

0 references

A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems

0 references

Algorithms for single machine total tardiness scheduling with sequence dependent setups

0 references

A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis

0 references

0 references

Computers and discovery in algebraic graph theory

0 references

0 references

Variable neighborhood search for the p-median

0 references

0 references

Variable neighborhood search: Principles and applications

0 references

J-MEANS: A new local search heuristic for minimum sum of squares clustering

0 references

0 references

Variable Neighborhood Search

0 references

First vs. best improvement: an empirical study

0 references

Algorithms for \(\ell_{1}\)-embeddability and related problems

0 references

Merging the local and global approaches to probabilistic satisfiability

0 references

On bags and bugs

0 references

Variable neighborhood decomposition search

0 references

Variable neighborhood search for the maximum clique

0 references

0 references

0 references

Variable neighborhood search and local branching

0 references

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

0 references

Variable neighbourhood search for colour image quantization

0 references

Variable neighbourhood search: Methods and applications

0 references

Variable neighborhood search for minimum cost berth allocation

0 references

A Bidirectional Greedy Heuristic for the Subspace Selection Problem

0 references

Delivery strategies for blood products supplies

0 references

A variable neighborhood search heuristic for periodic routing problems

0 references

A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

0 references

Variable space search for graph coloring

0 references

Scheduling of brand production and shipping within a sugar supply chain

0 references

An effective heuristic for the CLSP with set-up times

0 references

Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

0 references

Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

0 references

A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem

0 references

Sequential search and its application to vehicle-routing problems

0 references

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

0 references

0 references

Arbitrary-norm hyperplane separation by variable neighbourhood search

0 references

DNA Sequence Design by Dynamic Neighborhood Searches

0 references

Experimental investigation of heuristics for resource-constrained project scheduling: an update

0 references

New formulations for the Kissing Number Problem

0 references

An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

0 references

A variable neighborhood decomposition search method for supply chain management planning problems

0 references

Variable neighbourhood search for redundancy allocation problems

0 references

An ant colony optimisation algorithm for scheduling in agile manufacturing

0 references

A discrete version of particle swarm optimization for flowshop scheduling problems

0 references

Double variable neighbourhood search with smoothing for the molecular distance geometry problem

0 references

A modified VNS metaheuristic for max-bisection problems

0 references

Combining VNS with constraint programming for solving anytime optimization problems

0 references

On-line resources allocation for ATM networks with rerouting

0 references

A variable neighbourhood search algorithm for the constrained task allocation problem

0 references

The traveling purchaser problem with budget constraint

0 references

VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

0 references

A metaheuristic to solve a location-routing problem with nonlinear costs

0 references

Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem

0 references

Variable neighborhood search

0 references

Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search

0 references

Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.

0 references

Reformulation descent applied to circle packing problems

0 references

The \(p\)-median problem: a survey of metaheuristic approaches

0 references

Formulation Space Search for Circle Packing Problems

0 references

General variable neighborhood search for the continuous optimization

0 references

Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm

0 references

Variable neighborhood tabu search and its application to the median cycle problem.

0 references

Parallel Variable Neighborhood Search

0 references

Special issue: Selected papers based on the presentations at the 18th Mini EURO conference (MEC), Tenerife, Spain, November 23--25, 2005

0 references

The capacitated centred clustering problem

0 references

Guided construction search metaheuristics for the capacitated p-median problem with single source constraint

0 references

Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients

0 references

0 references

A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

0 references

Neighborhood structures for the container loading problem: a VNS implementation

0 references

A hybrid VNS–path relinking for the p-hub median problem

0 references

0 references

Alternating local search based VNS for linear classification

0 references

Scheduling periodic customer visits for a traveling salesperson

0 references

A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

0 references

0 references

An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

0 references

Bringing order into the neighborhoods: Relaxation guided variable neighborhood search

0 references

The core concept for the Multidimensional Knapsack problem

0 references

Multi-objective Flow Shop Scheduling Using Differential Evolution

0 references

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem

0 references

Variable neighborhood search for the degree-constrained minimum spanning tree problem

0 references

A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

0 references

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

0 references

A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints

0 references

An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem

0 references

Using constraint-based operators to solve the vehicle routing problem with time windows

0 references

Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem

0 references

Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

0 references

Parallel variable neighbourhood search algorithms for job shop scheduling problems

0 references

On the spectral radius of graphs with a given domination number

0 references

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem

0 references

A memetic algorithm for the flexible flow line scheduling problem with processor blocking

0 references

Solving the unconstrained optimization problem by a variable neighborhood search

0 references

Minimizing total tardiness on a single machine with controllable processing times

0 references

Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem

0 references

A tabu search algorithm for the single vehicle routing allocation problem

0 references

A population-based variable neighborhood search for the single machine total weighted tardiness problem

0 references

A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

0 references

A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application

0 references

Model and algorithm for inventory/routing decision in a three-echelon logistics system

0 references

Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm

0 references

A hybrid evolutionary algorithm for the job shop scheduling problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10479-009-0657-6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:970194

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q970194&oldid=35169404"