The importance of high performance algorithms for tackling difficult optimization problems cannot be understated, and in many cases the only available methods are metaheuristics. When designing a metaheuristic, it is preferable that it be simple,
|
2254
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1170
|
Equation of state calculations by fast computing machines
– Metropolis, Rosenbluth, et al.
- 1953
|
|
798
|
An efficient heuristic procedure for partitioning graphs
– Kernighan, Lin
- 1970
|
|
551
|
Evolutionary Algorithms in Theory and Practice
– Bäck
- 1996
|
|
364
|
Tabu Search
– Glover, Laguna
- 1997
|
|
290
|
Greedy randomized adaptive search procedures
– FEO, RESENDE
- 1995
|
|
252
|
An effective heuristic algorithm for the traveling salesman problem
– LIN, KERNIGHAN
- 1973
|
|
221
|
The travelling salesman problem: A case study in local optimization
– Johnson, McGeoch
- 1997
|
|
219
|
The Ant Colony Optimization Meta-Heuristic
– Dorigo, Caro
- 1999
|
|
213
|
A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm
– Cerny
|
|
179
|
Worst-case analysis of a new heuristic for the travelling salesman problem
– Christofides
- 1976
|
|
173
|
The reactive tabu search
– Battiti, Tecchiolli
- 1994
|
|
152
|
How to Solve It: Modern Heuristics
– Michalewicz, Fogel
- 2000
|
|
138
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
127
|
Fast algorithms for geometric traveling salesman problems
– Bentley
- 1992
|
|
106
|
Variable neighborhood search
– Mladenović, Hansen
- 1997
|
|
101
|
Evolution in time and space: The parallel genetic algorithm
– Mühlenbein
- 1991
|
|
87
|
Large-step Markov chains for the traveling salesman problem
– Martin, Otto, et al.
- 1991
|
|
78
|
Combining simulated annealing with local search heuristics
– Martin, Otto
- 1996
|
|
70
|
An introduction to variable neighborhood search. In Metaheuristics: Advances and trends in local search paradigms for optimization
– Hansen, Mladenović
- 1999
|
|
68
|
Comparison of Iterative Searches for the Quadratic Assignment Problem. Location Science 3
– Taillard
- 1995
|
|
63
|
Scatter Search and Path Relinking
– Glover
- 1999
|
|
58
|
Large-step Markov chains for the TSP incorporating local search heuristics
– Martin, Otto, et al.
- 1992
|
|
55
|
Spin Glass Theory and Beyond
– Me�zard, Parisi, et al.
- 1986
|
|
49
|
Local search algorithms for combinatorial problems — analysis, improvements, and new applications
– Stützle
- 1998
|
|
42
|
Job shop scheduling by local search
– Vaessens, Aarts, et al.
- 1994
|
|
40
|
Chained Lin-Kernighan for large traveling salesman problems
– Applegate, Cook, et al.
- 2000
|
|
37
|
Guided Local Search with Shifting Bottleneck for Job
– Balas, Vazacopoulos
- 1998
|
|
36
|
Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning
– Merz, Freisleben
|
|
35
|
Local Search with Perturbations for the PrizeCollecting Steiner Tree
– Canuto, Resende, et al.
- 1999
|
|
32
|
E.: Guided local search
– Voudouris, Tsang
- 1998
|
|
28
|
de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
– Congram, Potts, et al.
|
|
28
|
A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA: Int
– Nawaz, Enscore, et al.
|
|
27
|
The one-machine sequencing problem
– Carlier
- 1982
|
|
26
|
Partitoning of unstructured meshes for load balancing. Concurrency: Practice and Experience
– Martin, Otto
- 1995
|
|
22
|
Reactive search, a history-based heuristic for MAX-SAT
– Battiti, Protasi
- 1997
|
|
22
|
Combining the large-step optimization with tabu-search: Application to the job-shop scheduling problem
– Lourenço, Zwijnenburg
- 1996
|
|
20
|
Applying iterated local search to the permutation flow shop problem
– Stützle
- 1998
|
|
19
|
Greedy, prohibition, and reactive heuristics for graph partitioning
– Battiti, Bertossi
- 1999
|
|
19
|
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
– Glover
- 1995
|
|
18
|
Improving local search heuristic for some scheduling problems part
– Brucker, Warner
- 1997
|
|
17
|
Iterated descent: A better algorithm for local search in combinatorial optimisation problems
– Baum
- 1986
|
|
16
|
Perturbation: an efficient technique for the solution of very large instances of the euclidean tsp
– Codenotti, Manzini, et al.
- 1996
|
|
16
|
A survey of priority rule-based scheduling
– Haupt
- 1989
|
|
15
|
Iterated local search approach using genetic transformation to the traveling salesman problem
– Katayama, Narihisa
- 1999
|
|
14
|
Improved large-step Markov chain variants for the symmetric TSP
– Hong, Kahng, et al.
- 1997
|
|
14
|
Old bachelor acceptance: A new class of non-monotone threshold accepting methods
– Hu, Kahng, et al.
- 1995
|
|
14
|
Job-shop scheduling: Computational study of local search and large-step optimization methods
– Lourenço
- 1995
|
|
14
|
Cut size statistics of graph bisection heuristics
– Schreiber, Martin
- 1999
|
|
13
|
Local search heuristics for the single machine total weighted tardiness scheduling problem
– Crauwels, Potts, et al.
- 1998
|
|
