Variable neighborhood search
From MaRDI portal
Publication:1374041
DOI10.1016/S0305-0548(97)00031-2zbMATH Open0889.90119WikidataQ57254144 ScholiaQ57254144MaRDI QIDQ1374041FDOQ1374041
Authors: Nenad Mladenović, Pierre Hansen 
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Tabu Search—Part I
- Tabu Search—Part II
- Title not available (Why is that?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- Metaheuristics: A bibliography
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Title not available (Why is that?)
- Fast Algorithms for Geometric Traveling Salesman Problems
- Algorithms for the maximum satisfiability problem
- The traveling salesman problem with backhauls
Cited In (only showing first 100 items - show all)
- First vs. best improvement: an empirical study
- Skewed bivariate models and nonparametric estimation for the CTE risk measure
- Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill
- 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
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- A reactive GRASP with path relinking for capacitated clustering
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks
- Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
- Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- Heuristics for the traveling repairman problem with profits
- Securing home health care in times of natural disasters
- A stochastic model related to the Richards-type growth curve. Estimation by means of simulated annealing and variable neighborhood search
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Product line pricing for services with capacity constraints and dynamic substitution
- A survey on optimization metaheuristics
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Global optimization using \(q\)-gradients
- Nested general variable neighborhood search for the periodic maintenance problem
- The bipartite quadratic assignment problem and extensions
- A model for clustering data from heterogeneous dissimilarities
- A computational study for bilevel quadratic programs using semidefinite relaxations
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
- A two phase variable neighborhood search for the multi-product inventory routing problem
- Improved bounds for large scale capacitated arc 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
- Skewed general variable neighborhood search for the location routing scheduling problem
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Self-organizing feature maps for the vehicle routing problem with backhauls
- Combining VNS with constraint programming for solving anytime optimization problems
- Variable neighborhood search for minimum cost berth allocation
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- The heterogeneous \(p\)-median problem for categorization based clustering
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- New heuristics for one-dimensional bin-packing
- General variable neighborhood search for the continuous optimization
- The traveling purchaser problem with budget constraint
- Solving the clique partitioning problem as a maximally diverse grouping problem
- A flexible model and efficient solution strategies for discrete location problems
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Variable neighbourhood search for the variable sized bin packing problem
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- A TABU search heuristic for the team orienteering problem
- Recent models and algorithms for one-to-one pickup and delivery problems
- Variable neighborhood search for order batching in a warehouse
- Metaheuristics -- the metaphor exposed
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
- Median and covering location problems with interconnected facilities
- Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
- Reformulation descent applied to circle packing problems
- On characterization of maximal independent sets via quadratic optimization
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A simple and effective metaheuristic for the minimum latency problem
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- The hybrid electric vehicle-traveling salesman problem with time windows
- 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
- Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- Hyper-heuristic approaches for the response time variability problem
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- The location routing problem using electric vehicles with constrained distance
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
- Multiobjective GRASP with path relinking
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Variable neighbourhood search for bandwidth reduction
- Algorithms for single machine total tardiness scheduling with sequence dependent setups
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
This page was built for publication: Variable neighborhood search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374041)
