Bottleneck assignment problems under categorization
Computers and Operations Research
Computers and Operations Research
Steiner problem in Halin networks
Discrete Applied Mathematics
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Local optimization and the traveling salesman problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Data structures for traveling salesmen
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Constructing efficient simulated annealing algorithms
Discrete Applied Mathematics
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Information Processing Letters
The Travelling Salesman and the Pq-Tree
Mathematics of Operations Research
A polynomial combinatorial algorithm for generalized minimum cost flow
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Subpath Ejection Method for the Vehicle Routing Problem
Management Science
Exponential neighbourhood local search for the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
Discrete Applied Mathematics
Domination analysis of some heuristics for the traveling salesman problem
Discrete Applied Mathematics
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures
Journal of Heuristics
Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Construction Heuristics and Domination Analysis for the Asymmetric TSP
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Scaling Algorithm for Multicommodity Flow Problems
Operations Research
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Heuristic Methods for Large Centroid Clustering Problems
Heuristic Methods for Large Centroid Clustering Problems
Large Exponential Neighbourhoods for the Traveling Salesman Problem
Large Exponential Neighbourhoods for the Traveling Salesman Problem
Multi-exchange algorithms for the minimum makespan machinescheduling problem
Multi-exchange algorithms for the minimum makespan machinescheduling problem
TSP tour domination and Hamilton cycle decompositions of regular digraphs
Operations Research Letters
Proceedings of the 2002 ACM symposium on Applied computing
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hybrid heuristics for planning lot setups and sizes
Computers and Industrial Engineering
Journal of Global Optimization
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem
Journal of Heuristics
Four point conditions and exponential neighborhoods for symmetric TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
In situ column generation for a cutting-stock problem
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
The MSOM Society Student Paper Competition: Extended Abstracts of 2005 Winners
Manufacturing & Service Operations Management
Solving Real-Life Locomotive-Scheduling Problems
Transportation Science
An electromagnetic meta-heuristic for the nurse scheduling problem
Journal of Heuristics
Heuristics for automated knowledge source integration and service composition
Computers and Operations Research
Minimizing makespan on an m-machine re-entrant flowshop
Computers and Operations Research
Exponential neighborhood search for a parallel machine scheduling problem
Computers and Operations Research
IBM Journal of Research and Development - Business optimization
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Expert Systems with Applications: An International Journal
Benefits of Reevaluating Real-Time Order Fulfillment Decisions
Manufacturing & Service Operations Management
Expert Systems with Applications: An International Journal
Incremental Network Optimization: Theory and Algorithms
Operations Research
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
High-Performance Local Search for Task Scheduling with Human Resource Allocation
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Computers and Operations Research
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
Variable neighbourhood decomposition search for 0-1 mixed integer programs
Computers and Operations Research
Matheuristics: Optimization, Simulation and Control
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
Computers and Operations Research
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A case study for timetabling in a dutch secondary school
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
INFORMS Journal on Computing
A large neighbourhood search approach to the multi-activity shift scheduling problem
Journal of Heuristics
Accurate 3D shape estimation based on combinatorial optimization
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A novel iterative shape from focus algorithm based on combinatorial optimization
Pattern Recognition
Scheduling technicians and tasks in a telecommunications company
Journal of Scheduling
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Adaptive memory in multistart heuristics for multicommodity network design
Journal of Heuristics
Planning wireless networks by shortest path
Computational Optimization and Applications
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
An improved LNS algorithm for real-time vehicle routing problem with time windows
Computers and Operations Research
Large neighbourhood search algorithms for the founder sequence reconstruction problem
Computers and Operations Research
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
Computers and Operations Research
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The pickup and delivery problem with cross-docking opportunity
ICCL'11 Proceedings of the Second international conference on Computational logistics
Workload balancing in multi-stage production processes
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A multi-exchange heuristic for a production location problem
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
A unified view on hybrid metaheuristics
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Cyclic transfers in school timetabling
OR Spectrum
The balanced academic curriculum problem revisited
Journal of Heuristics
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
One-Sided monge TSP is NP-Hard
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Characterization and automation of matching-based neighborhoods
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem
Computers and Operations Research
SigSpot: mining significant anomalous regions from time-evolving networks (abstract only)
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the theoretical properties of swap multimoves
Operations Research Letters
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Operations Research Letters
Vehicle routing scheduling using an enhanced hybrid optimization approach
Journal of Intelligent Manufacturing
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Information Sciences: an International Journal
Spanning cactus of a graph: Existence, extension, optimization, and approximation
Discrete Applied Mathematics
Journal of Intelligent Manufacturing
Heuristic search for 2D NMR alignment to support metabolite identification
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Toward understanding the optimization of complex systems
Artificial Intelligence Review
Fast fusion moves for multi-model estimation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Large neighborhood search for LNG inventory routing
Journal of Heuristics
An augmented large neighborhood search method for solving the team orienteering problem
Expert Systems with Applications: An International Journal
On set-based local search for multiobjective combinatorial optimization
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
Computers and Operations Research
A Time Predefined Variable Depth Search for Nurse Rostering
INFORMS Journal on Computing
Improved Load Plan Design Through Integer Programming Based Local Search
Transportation Science
Marketing Science
A hybrid metaheuristic for the cyclic antibandwidth problem
Knowledge-Based Systems
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
Variable and large neighborhood search to solve the multiobjective set covering problem
Journal of Heuristics
Hi-index | 0.05 |
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorithm is a heuristic algorithm that generally starts with a feasible solution and iteratively tries to obtain a better solution. Neighborhood search algorithms (alternatively called local search algorithms) are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the "neighborhood" of the current solution. A critical issue in the design of a neighborhood search algorithm is the choice of the neighborhood structure, that is, the manner in which the neighborhood is defined. As a rule of thumb, the larger the neighborhood, the better is the quality of the locally optimal solutions, and the greater is the accuracy of the final solution that is obtained. At the same time, the larger the neighborhood, the longer it takes to search the neighborhood at each iteration. For this reason, a larger neighborhood does not necessarily produce a more effective heuristic unless one can search the larger neighborhood in a very efficient manner. This paper concentrates on neighborhood search algorithms where the size of the neighborhood is "very large" with respect to the size of the input data and in which the neighborhood is searched in an efficient manner. We survey three broad classes of very large-scale neighborhood search (VLSN) algorithms: (1) variable-depth methods in which large neighborhoods are searched heuristically, (2) large neighborhoods in which the neighborhoods are searched using network flow techniques or dynamic programming, and (3) large neighborhoods induced by restrictions of the original problem that are solvable in polynomial time.