Variable neighbourhood search: methods and applications

From MaRDI portal

Publication:970194

Jump to:navigation, search

DOI10.1007/s10479-009-0657-6zbMath1185.90211OpenAlexW1986254541WikidataQ57254143 ScholiaQ57254143MaRDI QIDQ970194

José Andrés 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

zbMATH Keywords

heuristic metaheuristic variable neighbourhood search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration, Heuristic algorithms for solving an integrated dynamic center facility location -- network design model, Surgical scheduling with simultaneous employment of specialised human resources, Fast local search for single row facility layout, 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, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization, Combining intensification and diversification strategies in VNS. An application to the vertex separation problem, A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions, Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach, A two phase variable neighborhood search for the multi-product inventory routing problem, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, Two level general variable neighborhood search for attractive traveling salesman 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, Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation, 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, Bi-objective optimisation model for installation scheduling in offshore wind farms, Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem, A general variable neighborhood search for the swap-body vehicle routing problem, Variable neighborhood search strategies for the order batching problem, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, A VNS approach to multi-location inventory redistribution with vehicle routing, Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Variable neighborhood search for location routing, Variable neighborhood search for the vertex separation problem, The multimode covering location problem, A binary multiple knapsack model for single machine scheduling with machine unavailability, The multiple team formation problem using sociometry, Generalization of the restricted planar location problems: unified metaheuristic algorithms, On the extremal properties of the average eccentricity, A general variable neighborhood search variants for the travelling salesman problem with draft limits, General variable neighborhood search for computing graph separators, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, Solving the clique partitioning problem as a maximally diverse grouping problem, A metaheuristic approach to the dominating tree problem, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, Variable neighbourhood structures for cycle location problems, A variable neighborhood search based algorithm for finite-horizon Markov decision processes, A variable neighborhood search algorithm for the multimode set covering problem, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, Fitting censored quantile regression by variable neighborhood search, New heuristics for the bicluster editing problem, Scheduling preventive railway maintenance activities with resource constraints, Clustering approach in maintenance of capillary railway network, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, Lower and upper bounds for the bin packing problem with fragile objects, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches, Variable neighborhood search for the travelling deliveryman problem, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, Variable neighborhood search: basics and variants, Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, A variable neighborhood search algorithm for the leather nesting problem, A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management, A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem, A multiobjective hub-airport location problem for an airline network design, A survey on optimization metaheuristics, The critical node detection problem in networks: a survey, Layout optimisation for an installation port of an offshore wind farm, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, Clustering data that are graph connected, A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems, Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning, 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, General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem, Water distribution networks design under uncertainty, Recent trends in metaheuristics for stochastic combinatorial optimization, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, Variable neighborhood descent with iterated local search for routing and wavelength assignment, A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods, GRASP with variable neighborhood descent for the online order batching problem, EIA-CNDP: an exact iterative algorithm for critical node detection problem, Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance, Efficient heuristics for the minimum labeling global cut problem, A randomized variable neighborhood descent heuristic to solve the flying sidekick traveling salesman problem, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, Transshipment service through crossdocks with both soft and hard time windows, A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor, A maximum-margin multisphere approach for binary multiple instance learning, A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows, Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction, Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, The zone-based dynamic facility layout problem, Global sensing search for nonlinear global optimization, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm, VNS solutions for the critical node problem, General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain, Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies, VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems, A variable neighborhood descent approach for the two-dimensional bin packing problem, Assigning surgery cases to operating rooms: a VNS approach for leveling ward beds occupancies, Clustering cities based on their development dynamics and variable neigborhood search, VNS variants for the Max-Mean dispersion problem, A variable neighborhood search for solving the multi-vehicle covering tour problem, A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time, A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods, Two multi-start heuristics for the \(k\)-traveling salesman problem, A heuristic approach for dividing graphs into bi-connected components with a size constraint, The hybrid electric vehicle-traveling salesman problem with time windows, An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances, Recent advances in selection hyper-heuristics, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields, A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect, A variable neighborhood search algorithm for an integrated physician planning and scheduling problem, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, A stochastic approach for planning airport ground support resources, A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands, A general VNS for the multi-depot open vehicle routing problem with time windows, General variable neighborhood search approach to group Steiner tree problem, General variable neighborhood search for the parallel machine scheduling problem with two common servers, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, The intermittent travelling salesman problem, Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, The uncapacitated r‐allocation p‐hub center problem, Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands, Using horizontal cooperation concepts in integrated routing and facility‐location decisions, A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows, A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat, Approaching the rank aggregation problem by local search-based metaheuristics, Responsive strategic oscillation for solving the disjunctively constrained knapsack problem, Variable neighborhood search for stochastic linear programming problem with quantile criterion, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane, A new taxonomy of global optimization algorithms, Variable neighborhood search: the power of change and simplicity, Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak, Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, 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, An Investigation on Compound Neighborhoods for VRPTW, An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem, Variable Neighborhood Programming as a Tool of Machine Learning, Introduction of an underground waste container system-model and solution approaches, A survey on the applications of variable neighborhood search algorithm in healthcare management, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, 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, An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion, A parallel hybrid metaheuristic for bicluster editing, A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing, A new variable neighborhood search approach for solving dynamic memory allocation problem, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, Variable Neighborhood Search for Solving the Balanced Location Problem, Variable neighborhood search for the strong metric dimension problem, A Variable Neighbourhood Search approach to the Cutwidth Minimization 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 Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, VNS based heuristic for solving the Unit Commitment problem, Variable neighborhood search for Multiple Level Warehouse Layout Problem, Packing Unit Spheres into a Cube Using VNS, Variable Neighborhood Search for Google Machine Reassignment problem, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search, Variable neighborhood search for minimum sum-of-squares clustering on networks, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Nature inspired meta heuristic algorithms for optimization problems

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:970194&oldid=12952514"