A survey of very large-scale neighborhood search techniques
From MaRDI portal
Publication:697563
DOI10.1016/S0166-218X(01)00338-9zbMath1014.68052WikidataQ59592553 ScholiaQ59592553MaRDI QIDQ697563
Özlem Ergun, Ravindra K. Ahuja, James B. Orlin, Abraham P. Punnen
Publication date: 17 September 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem, A unified heuristic for a large class of vehicle routing problems with backhauls, Variable and large neighborhood search to solve the multiobjective set covering problem, Simultaneous product and service delivery vehicle routing problem with time windows and order release dates, Repairing high school timetables with polymorphic ejection chains, Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, A decision support approach to automatic timetabling in higher education institutions, New convergent heuristics for 0-1 mixed integer programming, Decomposition based hybrid metaheuristics, Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty, The bipartite quadratic assignment problem and extensions, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, Model-based automatic neighborhood design by unsupervised learning, An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem, 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, Clustered maximum weight clique problem: algorithms and empirical analysis, Large neighborhood search applied to the software module clustering problem, Split-merge: using exponential neighborhood search for scheduling a batching machine, The load-balanced multi-dimensional bin-packing problem, Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, Adaptive large neighborhood search for the curriculum-based course timetabling problem, The min-p robust optimization approach for facility location problem under uncertainty, The quadratic minimum spanning tree problem and its variations, In situ column generation for a cutting-stock problem, A general heuristic for vehicle routing problems, Minimizing energies with hierarchical costs, A hybrid algorithm for the DNA sequencing problem, Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem, Matching based very large-scale neighborhoods for parallel machine scheduling, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, An exponential (matching based) neighborhood for the vehicle routing problem, Cyclic transfers in school timetabling, Algorithms for the minmax regret path problem with interval data, A variable neighborhood decomposition search method for supply chain management planning problems, Constraint-based very large-scale neighborhood search, Heuristics for vehicle routing problems: sequence or set optimization?, A computational study of local search algorithms for Italian high-school timetabling, Timetable construction: the algorithms and complexity perspective, Solving the traveling salesman problem with interdiction and fortification, Two local search approaches for solving real-life car sequencing problems, Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms, A tolerance function for the multiobjective set covering 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, Valuated matroid-based algorithm for submodular welfare problem, An analysis of neighborhood functions on generic solution spaces, Heuristics for automated knowledge source integration and service composition, Tariff concessions in production sourcing, A large neighborhood search heuristic for the longest common subsequence problem, The balanced academic curriculum problem revisited, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Markov chain methods for the bipartite Boolean quadratic programming problem, An efficient matheuristic for offline patient-to-bed assignment problems, An interactive solution approach for a bi-objective semi-desirable location problem, Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints, Adaptive memory in multistart heuristics for multicommodity network design, Hybrid adaptive large neighborhood search for the optimal statistic median problem, An improved LNS algorithm for real-time vehicle routing problem with time windows, Large neighbourhood search algorithms for the founder sequence reconstruction problem, Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem, Planning wireless networks by shortest path, Data-independent neighborhood functions and strict local optima, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Extended neighborhood: Definition and characterization, A large neighbourhood search approach to the multi-activity shift scheduling problem, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, Hybrid variable neighbourhood approaches to university exam timetabling, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, Scheduling technicians and tasks in a telecommunications company, A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem, A novel iterative shape from focus algorithm based on combinatorial optimization, Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems, Minimizing shifts for personnel task scheduling problems: a three-phase algorithm, Long-term staffing based on qualification profiles, Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, A survey of neighborhood construction algorithms for clustering and classifying data points, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Decomposition, reformulation, and diving in university course timetabling, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning, Hybridizing exact methods and metaheuristics: a taxonomy, A class of exponential neighbourhoods for the quadratic travelling salesman problem, Introduction to reconfiguration, The influence of problem specific neighborhood structures in metaheuristics performance, Four-point conditions for the TSP: the complete complexity classification, A general variable neighborhood search for the cyclic antibandwidth problem, Short-term scheduling of production fleets in underground mines using CP-based LNS, Combining very large scale and ILP based neighborhoods for a two-level location problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Performance guarantees of local search for minsum scheduling problems, Metaheuristics in combinatorial optimization, Column Generation based Primal Heuristics, A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, The Bipartite QUBO, A survey of variants and extensions of the location-routing problem, Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs, VNS-based heuristic with an exponential neighborhood for the server load balancing problem, Two very large-scale neighborhoods for single machine scheduling, On the theoretical properties of swap multimoves, The stable set problem and the thinness of a graph, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, A variable depth neighborhood search algorithm for the min-max arc crossing problem, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time, A survey of adaptive large neighborhood search algorithms and applications, Matheuristics: survey and synthesis, An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol, Literature reviews in operations research: a new taxonomy and a meta review, A three-phase heuristic for the fairness-oriented crew rostering problem, A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle, Hybridizations of evolutionary algorithms with large neighborhood search, Efficient enumeration of the optimal solutions to the correlation clustering problem, Large neighborhood improvements for solving car sequencing problems, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking, Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks, A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation, Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines, Very large-scale variable neighborhood search for the generalized assignment problem, Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms, Heuristic and metaheuristic methods for computing graph treewidth, A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries, Toward unification of exact and heuristic optimization methods, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, Fast local search algorithms for the handicapped persons transportation problem, A new ILP-based refinement heuristic for vehicle routing problems, The multiobjective multidimensional knapsack problem: a survey and a new approach, Memory and Learning in Metaheuristics, Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines, Local search with an exponential neighborhood for the servers load balancing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- A modified Lin--Kernighan traveling-salesman heuristic
- Efficiency of a local algorithm for solving the traveling salesman problem
- The traveling salesman problem. Approximate algorithms
- Steiner problem in Halin networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On the solution of traveling salesman problems
- Exponential neighbourhood local search for the traveling salesman problem
- Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour
- The traveling salesman. Computational solutions for RSP applications
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- TSP ejection chains
- Constructing efficient simulated annealing algorithms
- Tabu search for the multilevel generalized assignment problem
- Heuristic methods for large centroid clustering problems
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Domination analysis of some heuristics for the traveling salesman problem
- Nurse scheduling with tabu search and strategic oscillation
- Relaxed tours and path ejections for the traveling salesman problem
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
- An exponential neighborhood for a one-machine batching problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Bottleneck assignment problems under categorization
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- The Travelling Salesman and the PQ-Tree
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- A Scaling Algorithm for Multicommodity Flow Problems
- A Subpath Ejection Method for the Vehicle Routing Problem
- A polynomial combinatorial algorithm for generalized minimum cost flow
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- An Ejection Chain Approach for the Generalized Assignment Problem
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- Optimum Communication Spanning Trees in Series-Parallel Networks
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Linear-time computability of combinatorial problems on series-parallel graphs
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- Fast Clustering Algorithms
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Swapping Applications in a Daily Airline Fleet Assignment
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Halin graphs and the travelling salesman problem
- Data Structures for Traveling Salesmen
- A new heuristic for the traveling salesman problem
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
