Parallel local search

Journal of Heuristics

Volumn 1, Issue 1, 1995, Pages 43-65

  Verhoeven, M G A ^a   Aarts, E H L ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

local search; parallel algorithms; single walk and multiple walk parallelism; survey

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

ASYNCHRONOUS PARALLELISM; MULTIPLE WALK PARALLELISM; SINGLE WALK PARALLELISM; SYNCHRONOUS PARALLELISM;

PARALLEL ALGORITHMS;

EID: 0029362485     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/BF02430365     Document Type: Article

References (75)

1. Parallel implementations of the statistical cooling algorithms
2. Constructing school timetables using simulated annealing: Sequential and parallel algorithms
3. A distributed implementation of simulated annealing for the traveling salesman problem
4. An Occam-based evaluation of a parallel version of simulated annealing
5. A distributed implementation of simulated annealing
6. Parallel biased search for combinatorial optimization: Genetic algorithms and tabu
7. The parallel evaluation of general arithmetic expressions
8. A parallel simulated annealing algorithm for the placement of macro-cells
9. Connection machine implementation of a tabu search algorithm for the traveling salesman problem
10. Massively parallel tabu search for the quadratic assignment problem
11. Parallel algorithms for chip placement by simulated annealing
12. Problem independent distributed simulated annealing and its applications
13. Slow annealing versus multiple fast annealing runs: An empirical investigation
14. A probabilistic analysis of local search
15. Bounding the probability of success of stochastic methods for global optimization
16. A parallel tabu search algorithm for large travelling salesman problems
17. Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
18. A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
19. Tabus search: Part I
20. A user's guide to tabu search
21. Parallel simulated annealing techniques
22. Parallelisation of probabilistic sequential search algorithms
23. Local optimization and the traveling salesman problem
24. How easy is local search?
25. An efficient heuristic procedure for partitioning graphs
26. Sequential and parallel local search for the time constrained traveling salesman problem
27. Optimization by simulated annealing
28. Configuration space analysis of travelling salesman problems
29. Placement by simulated annealing on a multiprocessor
30. A complexity theory of efficient parallel algorithms
31. Parallel algorithms for the quadratic assignment problem
32. Computer solutions of the traveling salesman problem
33. An effective heuristic algorithm for the traveling salesman problem
34. Parallel recombinative simulated annealing: A genetic algorithm
35. Serial and parallel simulated annealing and tabu search for the traveling salesman problem
36. Large-steps Markov chains for the travelling salesman problem
37. An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
38. Parallel genetic algorithms in combinatorial optimization
39. Evolution algorithms in combinatorial optimization
40. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks
41. Parallel techniques for solving large scale travelling salesperson problems
42. a theoretical framework for simulated annealing
43. Parallel standard cell placement algorithms with quality equivalent to simulated annealing
44. A problem independent parallel implementation for simulated annealing: Models and experiments
45. Parallelism in graph-partioning
46. VLSI cell-placement techniques
47. Some efficient heuristic methods for the flow shop sequencing problem
48. Robust taboo search for the quadratic assignment problem
49. Parallel iterative search methods for vehicle routing problems
50. Parallel taboo search techniques for the job shop scheduling problem
51. A local search template
52. A parallel 2-opt algorithm for the traveling salesman problem
53. Parallel local search and the travelling salesman problem (extended abstract)
54. The analysis of local search problems and their heuristics
55. Computational complexity of local search
56. Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections