Abstract
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed. Key words: Parallel Search, Heuristics, Genetic Algorithms, Simulated Annealing, Tabu Search, GRASP, Parallel Computing.
Cite
CITATION STYLE
Pardalos, P. M., Pitsoulis, L., Mavridou, T., & Resende, M. G. C. (1995). Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 980, pp. 318–331). Springer Verlag. https://doi.org/10.1007/3-540-60321-2_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
