Abstract
Roughly speaking, parallel local search techniques can be divided into three categories: low-level parallelization strategies (e.g., master-slave schemes), solution-space partitioning methods and multi-thread procedures in which several processes explore concurrently the same search space. The multi-thread technique can be further subdivided into independent and cooperative search thread algorithms. In this paper, we focus on cooperative multi-thread heuristics applied to methods such as tabu search, and attempt to identify the key questions to be addressed in the design of any algorithm in this class. In particular, we show that questions related to inter-agent communications are a central element of the algorithmic design of these methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Battiti and G. Tecchiolli. Parallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU. 16(7):351–367, 1992.
D.P. Bertsekas and J.N. Tsitsiklis. Parallel and Distributed Computation, Numerical Methods. Prentice Hall, 1989.
T.G. Crainic, M. Gendreau, P. Soriano, and M. Toulouse. A Tabu Search Procedure for Multicommodity Location/Allocation with Balancing Requirements. Annals of Operations Research, 41:359–383, 1993.
T.G. Crainic, M. Toulouse, and M. Gendreau. Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements. Publication 935, Centre de recherche sur les transports, Université de Montréal, 1993.
T.G. Crainic, M. Toulouse, and M. Gendreau. Towards a Taxonomy of Parallel Tabu Search Algorithms. Publication 933, Centre de recherche sur les transports, Université de Montréal, 1993.
T.G. Crainic, M. Toulouse, and M. Gendreau. Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements. OR Spektrum, 17(2/3), 1995.
F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1(3):190–206, 1989.
F. Glover. Tabu Search — Part II. ORSA Journal on Computing, 2(l):4–32, 1990.
D.R. Greening. Parallel Simulated Annealing Techniques. Physica D, 42:293–306, 1990.
B.A. Huberman. The Performance of Cooperative Processes. Physica D, 42:38–47, 1990.
P. S. Laursen. Problem-Independent Parallel Simulated Annealing using Selection and Migration, pages 1–10, 1994.
A. Mees. Chaos in feedback systems. In Arun V. Holden, editor, Chaos. Princeton University Press, 1986.
H. Mühlenbein. Evolution in time and space — the parallel genetic algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithm & Classifier Systems. Morgan Kaufman, 1991.
H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. New Solutions to the Mapping Problem of Parallel Systems — the Evolution Approach. Parallel Computing, 6:269–279, 1987.
E. Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17:443–455, 1991.
E. Taillard. Parallel taboo search techniques for the job shop sheduling problem. ORS A Journal on Computing, 6(2): 108–117, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Toulouse, M., Crainic, T.G., Gendreau, M. (1996). Communication Issues in Designing Cooperative Multi-Thread Parallel Searches. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_30
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive