Variable neighborhood search
From MaRDI portal
Publication:1374041
DOI10.1016/S0305-0548(97)00031-2zbMATH Open0889.90119WikidataQ57254144 ScholiaQ57254144MaRDI QIDQ1374041FDOQ1374041
Pierre Hansen, Nenad Mladenović
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)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Lower and upper bounds for the bin packing problem with fragile objects
- Risk approaches for delivering disaster relief supplies
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
- A survey of recent research on location-routing problems
- An iterative approach for the serial batching problem with parallel machines and job families
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs
- The \(p\)-median problem: a survey of metaheuristic approaches
- Integer programming techniques for the nurse rostering problem
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Variable neighborhood search for harmonic means clustering
- Allocation search methods for a generalized class of location-allocation problems
- Variable neighbourhood search: Methods and applications
- A hybrid evolution strategy for the open vehicle routing problem
- Attraction probabilities in variable neighborhood search
- Heuristics for the multi-period orienteering problem with multiple time windows
- AutoGraphiX: a survey
- Variable neighborhood search: Principles and applications
- Stabilized column generation
- Variable neighbourhood search: methods and applications
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
- Scheduling technicians and tasks in a telecommunications company
- Variable neighborhood tabu search and its application to the median cycle problem.
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A mathematical model and a metaheuristic approach for a memory allocation problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- A two-stage approach to the orienteering problem with stochastic weights
- Location-arc routing problem: heuristic approaches and test instances
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Variable neighborhood search for location routing
- A survey of search methodologies and automated system development for examination timetabling
- A survey for the quadratic assignment problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Heuristics for the mirrored traveling tournament problem
- An improved column generation algorithm for minimum sum-of-squares clustering
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Hybrid variable neighbourhood approaches to university exam timetabling
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Ambulance location and relocation problems with time-dependent travel times
- The orienteering problem with stochastic travel and service times
- Vehicle routing with compartments: applications, modelling and heuristics
- A metaheuristic for stochastic service network design
- Transshipment service through crossdocks with both soft and hard time windows
- Norm statistics and the complexity of clustering problems
- Delivery strategies for blood products supplies
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A general vehicle routing problem
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- An adaptive memory algorithm for the split delivery vehicle routing problem
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Industrial aspects and literature survey: fleet composition and routing
- Vehicle dispatching algorithms for container transshipment hubs
- The distributed permutation flowshop scheduling problem
- Vendor managed inventory for environments with stochastic product usage
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Merging the local and global approaches to probabilistic satisfiability
- A survey of local search methods for graph coloring
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Fuzzy metrics and its applications in image processing
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- The static bike relocation problem with multiple vehicles and visits
- Drawing graphs with mathematical programming and variable neighborhood search
- Optimization of algorithms with OPAL
- A hierarchical algorithm for the planar single-facility location routing problem
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Variable neighborhood search and local branching
- Iterative approaches for a dynamic memory allocation problem in embedded systems
- Neighborhood structures for the container loading problem: a VNS implementation
- Industrial aspects and literature survey: Combined inventory management and routing
- A variable neighborhood search heuristic for periodic routing problems
- Solving a capacitated hub location problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- MOAQ and ant-Q algorithm for multiple objective optimization problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems
- Solution approaches to large shift scheduling problems
- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
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)
