A survey of very large-scale neighborhood search techniques
From MaRDI portal
Publication:697563
Recommendations
- Constraint-based very large-scale neighborhood search
- A survey of adaptive large neighborhood search algorithms and applications
- Principles for the design of large neighborhood search
- Very large-scale neighborhood search for the multidimensional assignment problem
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Very large-scale neighborhood search for the quadratic assignment problem
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- Very large-scale variable neighborhood search for the generalized assignment problem
Cites work
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1054956 (Why is no real title available?)
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1953191 (Why is no real title available?)
- scientific article; zbMATH DE number 1488098 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- A method for solving traveling-salesman problems
- A modified Lin--Kernighan traveling-salesman heuristic
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- A new heuristic for the traveling salesman problem
- A polynomial combinatorial algorithm for generalized minimum cost flow
- A scaling algorithm for multicommodity flow problems
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- A subpath ejection method for the vehicle routing problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An ejection chain approach for the generalized assignment problem
- An exponential neighborhood for a one-machine batching problem
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Bottleneck assignment problems under categorization
- Computer Solutions of the Traveling Salesman Problem
- Constructing efficient simulated annealing algorithms
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Data Structures for Traveling Salesmen
- Domination analysis of some heuristics for the traveling salesman problem
- Efficiency of a local algorithm for solving the traveling salesman problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Exponential neighbourhood local search for the traveling salesman problem
- Fast Clustering Algorithms
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- Halin graphs and the travelling salesman problem
- Heuristic methods for large centroid clustering problems
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear-time computability of combinatorial problems on series-parallel graphs
- Nurse scheduling with tabu search and strategic oscillation
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- On the solution of traveling salesman problems
- Optimum Communication Spanning Trees in Series-Parallel Networks
- Parallel iterative search methods for vehicle routing problems
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- Relaxed tours and path ejections for the traveling salesman problem
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- Steiner problem in Halin networks
- Swapping Applications in a Daily Airline Fleet Assignment
- TSP ejection chains
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- Tabu search for the multilevel generalized assignment problem
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- The traveling salesman. Computational solutions for RSP applications
- The travelling salesman and the PQ-tree.
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
Cited in
(only showing first 100 items - show all)- Column generation based primal heuristics
- A large neighborhood search heuristic for the longest common subsequence problem
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- A computational study of local search algorithms for Italian high-school timetabling
- Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Split-merge: using exponential neighborhood search for scheduling a batching machine
- Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
- The load-balanced multi-dimensional bin-packing problem
- Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
- Constraint-based very large-scale neighborhood search
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
- Repairing high school timetables with polymorphic ejection chains
- Cyclic transfers in school timetabling
- Heuristics for automated knowledge source integration and service composition
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry
- Hybrid variable neighbourhood approaches to university exam timetabling
- A general heuristic for vehicle routing problems
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Two local search approaches for solving real-life car sequencing problems
- A hybrid algorithm for the DNA sequencing problem
- Scheduling technicians and tasks in a telecommunications company
- A new ILP-based refinement heuristic for vehicle routing problems
- Two very large-scale neighborhoods for single machine scheduling
- Principles and Practice of Constraint Programming – CP 2004
- The quadratic minimum spanning tree problem and its variations
- Adaptive memory in multistart heuristics for multicommodity network design
- Variable and large neighborhood search to solve the multiobjective set covering problem
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- Metaheuristics in combinatorial optimization
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Principles for the design of large neighborhood search
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
- A decision support approach to automatic timetabling in higher education institutions
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- Algorithms for the minmax regret path problem with interval data
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A unified heuristic for a large class of vehicle routing problems with backhauls
- The balanced academic curriculum problem revisited
- Decomposition, reformulation, and diving in university course timetabling
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- An interactive solution approach for a bi-objective semi-desirable location problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- New convergent heuristics for 0-1 mixed integer programming
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Decomposition based hybrid metaheuristics
- A variable neighborhood decomposition search method for supply chain management planning problems
- Timetable construction: the algorithms and complexity perspective
- Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty
- The bipartite quadratic assignment problem and extensions
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Model-based automatic neighborhood design by unsupervised learning
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Fast local search algorithms for the handicapped persons transportation problem
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- A survey of variants and extensions of the location-routing problem
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Exponential neighborhood search for a parallel machine scheduling problem
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
- An exponential (matching based) neighborhood for the vehicle routing problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Long-term staffing based on qualification profiles
- Valuated matroid-based algorithm for submodular welfare problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A tolerance function for the multiobjective set covering problem
- Intensification neighborhoods for local search methods
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- Memory and learning in metaheuristics
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Heuristic and metaheuristic methods for computing graph treewidth
- Minimizing energies with hierarchical costs
- Simultaneous product and service delivery vehicle routing problem with time windows and order release dates
- A game theoretic model for the optimal location of integrated air defense system missile batteries
- Toward unification of exact and heuristic optimization methods
- Heuristics for vehicle routing problems: sequence or set optimization?
- Solving the traveling salesman problem with interdiction and fortification
- A large neighborhood search heuristic for supply chain network design
- Clustered maximum weight clique problem: algorithms and empirical analysis
- Large neighborhood search applied to the software module clustering problem
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: A survey of very large-scale neighborhood search techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697563)
