Combinations of local search and exact algorithms

Authors:
Irina Dumitrescu;Thomas Stützle
Affiliations:
Darmstadt University of Technology, CS Department, Darmstadt, Germany;Darmstadt University of Technology, CS Department, Darmstadt, Germany
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 13
Cited 7

Integer and combinatorial optimization

Integer and combinatorial optimization
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
The ant colony optimization meta-heuristic

New ideas in optimization
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
A computational study of the job-shop and the flow-shop scheduling problems

A computational study of the job-shop and the flow-shop scheduling problems
A hybrid approach for the 0-1 multidimensional knapsack problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Bringing order into the neighborhoods: relaxation guided variable neighborhood search

Journal of Heuristics
Tackling the container loading problem: a hybrid approach based on integer linear programming and genetic algorithms

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Integrated heuristics for scheduling multiple order jobs in a complex job shop

International Journal of Metaheuristics
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

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
Hybrid metaheuristics in combinatorial optimization: a tutorial

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe the advantadges and disadvantages of local search and exact methods of solving NP-hard problems and see why combining the two approaches is highly desirable. We review some of the papers existent in the literature that create new algorithms from such combinations. In this paper we focus on local search approaches that are strengthened by the use of exact algorithms.