Skip to main content
SpringerLink
Log in

Strategies for the Parallel Implementation of Metaheuristics

  • Chapter
Essays and Surveys in Metaheuristics

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 15))

Abstract

Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but also lead to more robust algorithms. We review some trends in parallel computing and report recent results about linear speedups that can be obtained with parallel implementations using multiple independent processors. Parallel implementations of tabu search, GRASP, genetic algorithms, simulated annealing, and ant colonies are reviewed and discussed to illustrate the main strategies used in the parallelization of different metaheuristics and their hybrids.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E.H.L. Aarts, F.M.J. de Bont, J.H.A. Habers, and P.J.M. van Laarhoven. Parallel Implementations of the Statistical Cooling Algorithm. Integration, 4:209–238, 1986.

    Google Scholar 

  2. E.H.L. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. Wiley, 1989.

    MATH  Google Scholar 

  3. E.H.L. Aarts and J. Korst. Selected Topics in Simulated Annealing. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).

    Google Scholar 

  4. E.H.L. Aarts and M. Verhoeven. Local Search. In: Annotated Bibliographies in Combinatorial Optimization, M. Dell’Amico, F. Maffioli, and S. Martello, editors, pages 163–180, Wiley, 1997.

    Google Scholar 

  5. D. Abramson and J. Abela. A Parallel Genetic Algorithm for Solving the School Timetabling Problem. In: Proceedings of the 15th Australian Computer Science Conference, pages 1–11, 1992.

    Google Scholar 

  6. R.M. Aiex, S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez. Cooperative Multi-Thread Parallel Tabu Search with an Application to Circuit Partitioning. Lecture Notes in Computer Science, 1457:310–331, 1998.

    Article  Google Scholar 

  7. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with Path-Relinking for the Three-Index Assignment Problem. Submitted for publication, 2000.

    Google Scholar 

  8. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability Distribution of Solution Time in GRASP: An Experimental Investigation. To appear in: Journal of Heuristics.

    Google Scholar 

  9. S.M. Alaoui, O. Frieder, and T. El-Ghazawi. A Parallel Genetic Algorithm for Task Mapping on Parallel Machines. Lecture Notes in Computer Science, 1586:201–209, 1999.

    Article  Google Scholar 

  10. E. Alba and J.M. Troya. Influence of the Migration Policy in Parallel Distributed GAs with Structured and Panmictic Populations. Applied Intelligence, 12:163–181, 2000.

    Article  Google Scholar 

  11. E. Alba and J.M. Troya. Analyzing Synchronous and Asynchronous Parallel Distributed Genetic Algorithms. Future Generation Computer Systems, 17:451–465, 2001.

    Article  MATH  Google Scholar 

  12. J.R. Allwright and D.B. Carpenter. A Distributed Implementation of Simulated Annealing for the Travelling Salesman Problem. Parallel Computing, 10:335–338, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  13. A.C. Alvim. Parallelization Strategies of the GRASP Metaheuristic (in Portuguese). M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 1998.

    Google Scholar 

  14. A.C. Alvim and C.C. Ribeiro. Load Balancing for the Parallelization of the GRASP Metaheuristic (in Portuguese). In: Proceedings of the X Brazilian Symposium on Computer Architecture, pages 279–282, Búzios, 1998.

    Google Scholar 

  15. D. Andre and J.R. Koza. Parallel Genetic Programming: A Scalable Implementation using the Transputer Network Architecture. In: Advances in Genetic Programming 2, P.J. Angeline and K.E. Kinnear, Jr., editors, pages 317–338, MIT Press, 1996.

    Google Scholar 

  16. A.A. Andreatta and C.C. Ribeiro. A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits. Annals of Operations Research, 50:1–36, 1994.

    Article  MATH  Google Scholar 

  17. Argonne National Laboratory. PGAPack Parallel Genetic Algorithm Library. Online document, http://www-p.mcs.anl.gov/CCST/research/reports_pre1998/comp_bio/stalk/pgapack.html, last visited on February 11, 2001.

    Google Scholar 

  18. G. Authié, A. Ferreira, J.-L. Roch, G. Villard, J. Roman, C. Roucairol, and B. Virot (editors). Algorithmique Parallèle: Analyse et Conception. Hermès, 1994.

    Google Scholar 

  19. R. Azencott. Simulated Annealing: Parallelization Techniques. Wiley, 1992.

    MATH  Google Scholar 

  20. P. Badeau, F. Guertin, M. Gendreau, J.-Y. Potvin, and E. Taillard. A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Transportation Research-C, 5:109–122, 1997.

    Article  Google Scholar 

  21. P. Banerjee and M. Jones. A Parallel Simulated Annealing Algorithm for Standard Cell Placement on a Hypercube Computer. In: Proceedings of the 1986 International Conference on Computer-Aided Design, pages 34–37, Santa Clara, 1986.

    Google Scholar 

  22. P. Banerjee, M. Jones, and J. Sargent. Parallel Simulated Annealing Algorithms for Standard Cell Placement on Hypercube Multi-Processors. IEEE Transactions on Parallel and Distributed Systems, 1:91–106, 1990.

    Article  Google Scholar 

  23. M.P. Bastos and C.C. Ribeiro. Reactive Tabu Search with Path Relinking for the Steiner Problem in Graphs. In: Essays and Surveys in Metaheuris-tics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).

    Chapter  Google Scholar 

  24. R. Battiti and G. Tecchiolli. Parallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU. Microprocessors and Microsystems, 16:351–367, 1992.

    Article  Google Scholar 

  25. R. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journal on Computing, 6:126–140, 1994.

    Article  MATH  Google Scholar 

  26. J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069–1072, 1990.

    Google Scholar 

  27. T.C. Belding. The Distributed Genetic Algorithm Revisited. In: Proceedings of the Sixth International Conference on Genetic Algorithms, L. Es-chelman, editor, pages 114–121, Morgan Kaufmann, 1995.

    Google Scholar 

  28. R. Bianchini and CM. Brown. Parallel Genetic Algorithms on Distributed-Memory Architectures. Transputer Research and Applications, 6:67–82, 1993.

    Google Scholar 

  29. M. Bolondi and M. Bondanza. Parallelizzazione di un algoritmo per la risoluzione del problema del commesso viaggiatore. M.Sc. Dissertation, Dipartimento di Elettronica e Informazione, Politecnico di Milano, 1993.

    Google Scholar 

  30. R.K. Brunner and L.V. Kale. Adapting to Load on Workstation Clusters. In: Proceedings of the Seventh Symposium on the Frontiers of Massively Parallel Computation, pages 106–112, IEEE Computer Society Press, 1999.

    Chapter  Google Scholar 

  31. M. Bubak and K. Sowa. Object-Oriented Implementation of Parallel Genetic Algorithms. In: High Performance Cluster Computing: Programming and Applications, R. Buyya, editor, vol. 2, pages 331–349, Prentice Hall, 1999.

    Google Scholar 

  32. B. Bullnheimer, G. Kotsis, and C. Strauss. Parallelization Strategies for the Ant System. Applied Optimization, 24:87–100, 1998.

    Article  MathSciNet  Google Scholar 

  33. D. Butenhof. Programming with POSIX Threads. Addison Wesley, 1997.

    Google Scholar 

  34. R. Buyya (editor). High Performance Cluster Computing: Architectures and Systems. Prentice-Hall, 1999.

    Google Scholar 

  35. E. Cantú-Paz. A Survey of Parallel Genetic Algorithms. Calculateurs Paralèlels, Réseaux et Systèmes Répartis, 10:141–171, 1998.

    Google Scholar 

  36. E. Cantú-Paz. Implementing Fast and Flexible Parallel Genetic Algorithms, volume III. In: Practical Handbook of Genetic Algorithms, L.D. Chambers, editor, pages 65–84, CRC Press, 1999.

    Google Scholar 

  37. E. Cantú-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer, 2000.

    MATH  Google Scholar 

  38. E. Cantú-Paz. Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms. To appear in: Journal of Heuristics.

    Google Scholar 

  39. E. Cantú-Paz and D.E. Goldberg. Predicting Speedups of Idealized Bounding Cases of Parallel Genetic Algorithms. In: Proceedings of the Seventh International Conference on Genetic Algorithms, T. Bäck, editor, pages 113–121, Morgan Kaufmann, 1997.

    Google Scholar 

  40. E. Cantú-Paz and D.E. Goldberg. Parallel Genetic Algorithms: Theory and Practice. Computer Methods in Applied Mechanics and Engineering, 186:221–238, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  41. S.A. Canuto. Local Search for the Prize-Collecting Steiner Tree Problem (in Portuguese). M.Sc. Dissertation, Department of Computer Science, Catholic University of Rio de Janeiro, 2000.

    Google Scholar 

  42. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local Search with Perturbations for the Prize-Collecting Steiner Tree Problem in Graphs. To appear in: Networks.

    Google Scholar 

  43. N. Carriero and D. Gelernter. How to Write Parallel Programs: A Guide to the Perplexed. ACM Computing Surveys,21:323–357,1989.

    Article  Google Scholar 

  44. A. Casotto, F. Romeo, and A. Sangiovanni-Vincentelli. A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-6:727–751, 1987.

    Article  Google Scholar 

  45. A. Casotto and A. Sangiovanni-Vincentelli. Placement of Standard Cells using Simulated Annealing on the Connection Machine. In: Proceedings of the 1987 International Conference on Computer-Aided Design, pages 350–353, Santa Clara, 1987.

    Google Scholar 

  46. C.B. Cavalcante, V.C. Cavalcante, C.C. Ribeiro, and C.C. de Souza. Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem. In: Essays and Surveys in Metaheuristics,C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).

    Google Scholar 

  47. C.B. Cavalcante, Y. Colombani, S. Heipcke, and C.C. Souza. Scheduling under Labour Resource Constraints. Constraints, 5:415–422, 2000.

    Article  MATH  Google Scholar 

  48. C.B. Cavalcante, C.C. Souza, M.W. Savelsbergh, Y.Wang, and L.A. Wolsey. Scheduling Projects with Labor Constraints. To appear in: Discrete Applied Mathematics.

    Google Scholar 

  49. G. Cavalheiro, F. Galilée, and J.-L. Roch. Athapascan-1: Parallel Programming with Asynchronous Tasks. Online document, http://www-apache.imag.fr/software/ath1/publications/files/98-ath1-yale.ps.gz, last visited on March 14, 2001.

  50. N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32:444–458, 1989.

    Article  Google Scholar 

  51. J. Chakrapani and J. Skorin-Kapov. Massively Parallel Tabu Search for the Quadratic Assignment Problem. Annals of Operations Research, 41:327–341, 1993.

    Article  MATH  Google Scholar 

  52. J. Chakrapani and J. Skorin-Kapov. Connection Machine Implementation of a Tabu Search Algorihm for the Traveling Salesman Problem. Journal of Computing and Information Technology, 1:29–63, 1993.

    Google Scholar 

  53. P. Chalermwat, T. El-Ghazawi, and J. LeMoigne. 2-Phase GA-Based Image Registration on Parallel Clusters. Future Generation Computer Systems, 17:467–476, 2001.

    Article  MATH  Google Scholar 

  54. J.A. Chandy and P. Banerjee. Parallel Simulated Annealing Strategies for VLSI Cell Placement. In: Proceedings of the 9th International Conference on VLSI Design, Bangalore, 1996.

    Google Scholar 

  55. J.A. Chandy, S. Kim, B. Ramkumar, S. Parkes, and P. Banerjee. An Evaluation of Parallel Simulated Annealing Strategies with Applications to Standard Cell Placement. IEEE Transactions on Computer Aided Design, 16:398–410, 1997.

    Article  Google Scholar 

  56. A. Chipperfield and P. Fleming. Parallel Genetic Algorithms. In: Parallel and Distributed Computing Handbook, A.Y. Zomaya, editor, pages 1118–1143, McGraw-Hill, 1996.

    Google Scholar 

  57. A. Colorni, M. Dorigo, and V. Maniezzo. Distributed Optimization by Ant Colonies. In: Proceedings of the European Conference on Artificial Life, pages 134–142, Paris, Elsevier, 1991.

    Google Scholar 

  58. U.S. da Costa, D.B. Déharbe, and A.M. Moreira. Variable Orderings of BDDs with Parallel Genetic Algorithms. In: Proceedings of the International Conference on Parallel and Distributes Processing Techniques and Applications, pages 1181–1186, Las Vegas, CSREA Press, 2000.

    Google Scholar 

  59. T.G. Crainic and M. Gendreau. Cooperative Parallel Tabu Search for Capacitated Network Design. To appear in: Journal of Heuristics.

    Google Scholar 

  60. T.G. Crainic and M. Toulouse. Parallel Metaheuristics. In: Fleet Management and Logistics, T.G. Crainic and G. Laporte, editors, pages 205–251, Kluwer, 1998.

    Chapter  Google Scholar 

  61. T.G. Crainic, M. Toulouse, and M. Gendreau. Parallel Asynchronous Tabu Search in Multicommodity Location-Allocation with Balancing Requirements. Annals of Operations Research, 63:277–299, 1995.

    Article  Google Scholar 

  62. T.G. Crainic, M. Toulouse, and M. Gendreau. Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements. OR Spektrum, 17:113–123, 1995.

    Article  MATH  Google Scholar 

  63. T.G. Crainic, M. Toulouse, and M. Gendreau. Towards a Taxonomy of Parallel Tabu Search Algorithms. INFORMS Journal of Computing, 9:61–72, 1997.

    Article  MATH  Google Scholar 

  64. D.E. Culler, P.S. Jaswinder, and A. Gupta. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, 1999.

    Google Scholar 

  65. V.-D. Cung, T. Mautor, P. Michelon, and A. Tavares. A Scatter Search Based Approach for the Quadratic Assignment Problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation and Evolutionary Programming, T. Baeck, Z. Michalewicz, and X. Yao, editors, pages 165–170, IEEE, 1997.

    Google Scholar 

  66. L. Dagum and R. Menon. OpenMP: An Industry-Standard API for Shared-Memory Programming. IEEE Computational Science and Engineering, 5:46–55, 1998.

    Article  Google Scholar 

  67. F. Darema, S. Kirkpatrick, and V. Norton. Parallel Algorithms for Chip Placement by Simulated Annealing. IBM Journal of Research and Development, 31:391–402, 1987.

    Article  Google Scholar 

  68. I. De Falco, R. Del Balio, A. Delia Cioppa, and E. Tarantino. A Parallel Genetic Algorithm for Transonic Airfoil. In: Proceedings of the IEEE International Conference on Evolutionary Computing, pages 429–434, University of Western Australia, 1995.

    Chapter  Google Scholar 

  69. G. Di Caro and M. Dorigo. A Mobile Agents Approach to Adaptive Routing. In: Proceedings of the 31st Hawaii International Conference on System, pages 74–83, IEEE Computer Society Press, 1998.

    Google Scholar 

  70. N. Dodd. Slow Annealing Versus Multiple Fast Annealing Runs: An Empirical Investigation. Parallel Computing, 16:269–272, 1990.

    Article  MATH  Google Scholar 

  71. M. Dorigo, G. Di Caro, and L.M. Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life, 5:137–172, 1999.

    Article  Google Scholar 

  72. C.W. Duin and S. Voss. Efficient Path and Vertex Exchange in Steiner Tree Algorithms. Networks, 29:89–105, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  73. M.D. Durand. Parallel Simulated Anealing: Accuracy vs. Speed in Placement. IEEE Design and Test of Computers, 6:8–34, 1989.

    Google Scholar 

  74. M.D. Durand and S.R. White. Trading Accuracy for Speed in Parallel Simulated Annealing Algorithms. Parallel Computing, 26:135–150, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  75. H.T. Eikelder, M. Verhoeven, T. Vossen, and E. Aarts. A Probabilistic Analysis of Local Search. In: Metaheuristics: Theory and Applications, I. Osman and J. Kelly, editors, pages 605–618, Kluwer, 1996.

    Google Scholar 

  76. A. Fachat and K.H. Hoffman. Implementation of Ensemble-Based Simulated Annealing with Dynamic Load Balancing under MPI. Computer Physics Communications, 107:49–53, 1997.

    Article  MATH  Google Scholar 

  77. E. Felten, S.C. Karlin, and S.W. Otto. The Traveling Salesman Problem on a Hypercubic, MIMD Computer. In: Proceedings of the 1985 International Conference on Parallel Processing, pages 6–10, 1985.

    Google Scholar 

  78. T.A. Feo and M.G.C. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters, 8:67–71, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  79. T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6:109–133, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  80. T.A. Feo, M.G.C. Resende, and S.H. Smith. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42:860–878, 1994.

    Article  MATH  Google Scholar 

  81. F. Fernandez, J.M. Sanchez, M. Tomassini, and J.A. Gomez. A Parallel Genetic Programming Tool Based on PVM. Lecture Notes in Computer Science, 1697:241–248, 1999.

    Article  Google Scholar 

  82. P. Festa and M.G. Resende. GRASP: An Annotated Bibliography. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).

    Google Scholar 

  83. C.N. Fiechter. A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems. Discrete Applied Mathematics, 51:243–267, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  84. M.J. Flynn. Very High-Speed Computing Systems. Proceedings of the IEEE,54:1901–1909, 1966.

    Article  Google Scholar 

  85. I. Foster. Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley, 1995.

    MATH  Google Scholar 

  86. R. Frost. Ensemble Based Simulated Annealing. Online document, http://www-rohan.sdsu.edu/~frostr/Ebsa/Ebsa.html, last visited on February 11, 2001.

  87. B.-L. Garcia, J.-Y. Potvin, and J.-M. Rousseau. A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Windows Constraints. Computers and Operations Research, 21:1025–1033, 1994.

    Article  MATH  Google Scholar 

  88. S. Geman and D. Geman. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Transactions on Pattern Analysis and Mechanical Intelligence, 6:721–741, 1984.

    Article  MATH  Google Scholar 

  89. M. Gendreau, F. Guertin, J-Y. Potvin, and E. Taillard. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33:381–390, 1999.

    Article  MATH  Google Scholar 

  90. A. Globus, J. Lawton, and T. Wipke. Automatic Molecular Design using Evolutionary Techniques. Nanotechnology, 10:290–299, 1999.

    Article  Google Scholar 

  91. F. Glover. Tabu Search — Part I. ORSA Journal on Computing, 1:190–206, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  92. F. Glover. Tabu Search — Part II. ORSA Journal on Computing, 2:4–32, 1990.

    Article  MATH  Google Scholar 

  93. F. Glover. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems. Discrete Applied Mathematics, 65:223–253, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  94. F. Glover. Tabu Search and Adaptive Memory Programing — Advances, Applications and Challenges. In: Interfaces in Computer Science and Operations Research, R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, pages 1–75, Kluwer, 1996.

    Google Scholar 

  95. F. Glover. Multi-Start and Strategic Oscillation Methods — Principles to Exploit Adaptive Memory. In: Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, M. Laguna and J.L. Gonzalez-Velarde, editors, pages 1–24, Kluwer, 2000.

    Chapter  Google Scholar 

  96. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.

    Book  MATH  Google Scholar 

  97. F. Glover, M. Laguna, and R. Marti. Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics, 39:653–684, 2000.

    MathSciNet  Google Scholar 

  98. F. Glover and E. Pesch. TSP Ejection Chains. Discrete Applied Mathematics, 76:165–181, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  99. V.S. Gordon and D. Whitley. Serial and Parallel Genetic Algorithms as Function Optimizers. In: Proceedings of the Fifth International Conference on Genetic Algorithms, S. Forrest, editor, pages 177–183, Morgan Kaufmann, 1993.

    Google Scholar 

  100. D.R. Greening. Parallel Simulated Annealing Techniques. Physica D, 42:293–306, 1990.

    Article  Google Scholar 

  101. J.J. Grefenstette. Parallel Adaptive Algorithms for Function Optimizations. Technical Report CS-81–19, Vanderbilt University, 1981.

    Google Scholar 

  102. W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, and M. Snir. MPI: The Complete Reference, Volume 2 — The MPI Extensions. MIT Press, 1998.

    Google Scholar 

  103. W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message Passing-Interface. MIT Press, 1994.

    Google Scholar 

  104. A. Gueist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sun-deram. PVM: Parallel Virtual Machine — A User’s Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994 (online document, http://www.netlib.org/pvm3/book/pvm-book.html, last visited on May 7, 2001).

    Google Scholar 

  105. High Performance FORTRAN Forum. High Performance Fortran. Online document, http://dacnet.rice.edu/Depts/RPC/HPFF/, last visited on May 7, 2001.

  106. J.H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, 1975.

    Google Scholar 

  107. J.H. Holland. Genetic Algorithms. Scientific American, 267:44–50, 1992.

    Article  Google Scholar 

  108. H. Hoos and T. Stützle. Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. Artificial Intelligence, 112:213–232, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  109. L. Ingber. Lester Ingber’s Archive. Online document, http://www.ingber.com/, last visited on February 11, 2001.

  110. Institute of Electric and Electronic Engineering. Information Technology -Portable Operating Systems Interface (POSIX) — Part 1 — Ammendment 2: Threads Extension. 1995.

    Google Scholar 

  111. L.V. Kale, M. Bhandarkar, R. Brunner, and J. Yelon. Multiparadigm, Multilingual Interoperability: Experience with Converse. Lecture Notes in Computer Science, 1388:111–112, 1998.

    Article  Google Scholar 

  112. L.V. Kale, R. Brunner, J. Phillips, and K. Varadarajan. Application Performance of a Linux Cluster using Converse. Lecture Notes in Computer Science, 1586:483–495, 1999.

    Article  Google Scholar 

  113. L.V. Kale and S. Krishnan. Charm++: Parallel Programming with Message-Driven Objects. In: Parallel Programming using C++, G.V. Wilson and P. Lu, editors, pages 175–213, MIT Press, 1996.

    Google Scholar 

  114. S. Kim, J.A. Chandy, S. Parkes, B. Ramkumar, and P. Banerjee. ProperPLACE: A Portable, Parallel Algorithm for Cell Placement. In: Proceedings of the 8th International Parallel Processing Symposium, pages 932–941, Cancun, 1994.

    Chapter  Google Scholar 

  115. S. Kirkpatrick, CD. Gelatt, and M.P. Vecchi. Optimisation by Simulated Annealing. Science, 220:671–680, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  116. G. Kliewer, K. Klohs, and S. Tschöke. Parallel Simulated Annealing Library (parSA): User Manual. Technical Report, Computer Science Department, University of Paderborn, 1999.

    Google Scholar 

  117. A. Knies, M. O’Keefe, and T. MacDonald. High Performance FORTRAN: A Practical Analysis. Scientific Programming, 3:187–199, 1994.

    Google Scholar 

  118. C. Koelbel, D. Loveman, R. Schreiber, G. Steele Jr., and M. Zosel. The High Performance FORTRAN Handbook. The MIT Press, 1994.

    Google Scholar 

  119. U. Kohlmorgen, H. Schmeck, and K. Haase. Experiences with Fine-Grained Parallel Genetic Algorithms. Annals of Operations Research, 90:203–220, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  120. S.A. Kravitz and R.A. Rutenbar. Placement by Simulated Annealing on a Multiprocessor. IEEE Transactions on Computer Aided Design, 6:534–549, 1987.

    Article  Google Scholar 

  121. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing Design and Analysis of Parallel Algorithms. Benjaming/Cummings, 1994.

    MATH  Google Scholar 

  122. S.-Y. Lee and K.G. Lee. Asynchronous Communication of Multiple Markov Chains in Parallel Simulated Annealing. In: Proceedings of the International Conference on Parallel Processing, volume III, pages 169–176, St. Charles, 1992.

    Google Scholar 

  123. T.-H. Lai and S. Sahni. Anomalies in Parallel Branch-And-Bound Algorithms. Communications of the ACM, 27:594–602, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  124. T.-H. Lai and A. Sprague. A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions. Information Processing Letters, 23:119–122, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  125. K.G. Lee and S.-Y. Lee. Efficient Parallelization of Simulated Annealing using Multiple Markov Chains: An Application to Graph Partitioning. In: Proceedings of the International Conference on Parallel Processing, volume III, pages 177–180, St. Charles, 1992.

    Google Scholar 

  126. S.-Y. Lee and K.G. Lee. Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains. IEEE Transactions on Parallel and Distributed Systems, 7:993–1008, 1996.

    Article  Google Scholar 

  127. D. Levine. A Parallel Genetic Algorithm for the Set Partitioning Problem. Technical Report ANL-9423, Argonne National Laboratory, 1994.

    Google Scholar 

  128. B. Lewis. Multithreaded Programming with Java Technology. Prentice Hall, 2000.

    Google Scholar 

  129. Y. Li, P.M. Pardalos, and M.G.C. Resende. A Greedy Randomized Adaptive Search Procedure for Quadratic Assignment Problem. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 16:237–261, 1994.

    MathSciNet  Google Scholar 

  130. G.-J. Li and B.W. Wah. Coping with Anomalies in Parallel Branch-and-Bound Algorithms. IEEE Transactions on Computers, C-35:568–573, 1986.

    Article  MathSciNet  Google Scholar 

  131. B. Mans and C. Roucairol. Performances of Parallel Branch and Bound Algorithms with Best-First Search. Discrete Applied Mathematics, 66:57–76, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  132. N. Marco and S. Lanteri. A Two Level Parallelization Strategy for Genetic Algorithms Applied to Optimum Shape Design. Parallel Computing, 26:377–397, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  133. S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. GRASP Procedures for the Steiner Problem in Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 43:133–146, 1998.

    MathSciNet  Google Scholar 

  134. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P. Pardalos. A Parallel GRASP for the Steiner Tree Problem in Graphs using a Hybrid Local Search Strategy. Journal of Global Optimization, 17:267–283, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  135. S.L. Martins, C.C. Ribeiro, and N.R. Rodriguez. Parallel Computing Environments. To appear in: Handbook of Combinatorial Optimization,P. Pardalos and M.G.C. Resende, editors, Oxford.

    Google Scholar 

  136. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A Parallel GRASP for the Steiner Problem in Graphs. Lecture Notes in Computer Science, 1457:285–297, 1998.

    Article  MathSciNet  Google Scholar 

  137. T.G. Mattson. Scientific Computation. In: Parallel and Distributed Computing Handbook, A.Y. Zomaya, editor, pages 981–1002, Mc-Graw-Hill, 1996.

    Google Scholar 

  138. K. Mehlhorn. A Faster Approximation for the Steiner Problem in Graphs. Information Processing Letters, 27:125–128, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  139. J. Merlin, S. Baden, S. Fink, and B. Chapman. Multiple Data Parallelism with HPF and KeLP. Future Generation Computer Systems, 15:393–405, 1999.

    Article  Google Scholar 

  140. J. Merlin and A. Hey. An Introduction to High Performance FORTRAN. Scientific Programming, 4:87–113, 1995.

    Google Scholar 

  141. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996.

    MATH  Google Scholar 

  142. M. Miki, T. Hiroyasu, and M. Kasai. Application of the Temperature Parallel Simulated Annealing to Continous Optimization Problems. IPSL Transaction, 41:1607–1616, 2000.

    Google Scholar 

  143. L.B. Morales, R. Garduño-Juárez, J.M. Aguilar-Alvarado, and F.J. Riveros-Castro. A Parallel Tabu Search for Conformational Energy Optimization of Oligopeptides. Journal of Computational Chemistry, 21:147–156, 2000.

    Article  Google Scholar 

  144. H.S. Morse. Practical Parallel Computing. AP Professional, 1994.

    Google Scholar 

  145. MPI Forum. MPI: A Message-Passing Interface Standard. The International Journal of Supercomputing Applications and High Performance Computing, 8:159–416, 1994.

    Google Scholar 

  146. MPI Forum. A Message-Passing Interface Standard. Online document, http://www.mpi-forum.org/docs/docs.html, last visited on February 19, 2001.

  147. MPI Forum. MPI-2: Extensions to the Message-Passing Interface. Online document, http://www.mpi-forum.org/docs/docs.html, last visited on February 19, 2001.

  148. H. Muhlenbein. Parallel Genetic Algorithms in Combinatorial Optimization. In: Computer Science and Operations Research: New Developments in their Interfaces, O. Balci, R. Sharda, and S. Zenios, editors, pages 441–456, Pergamon Press, 1992.

    Google Scholar 

  149. R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A Parallel GRASP for the Data Association Multidimensional Assignment Problem. IMA Volumes in Mathematics and its Applications, 106:159–180, 1998.

    Article  MathSciNet  Google Scholar 

  150. S. Oak and H. Wong. Java Threads. O’Reilly, 1997.

    Google Scholar 

  151. L.S. Ochi, L.M. Drummond, A.O. Victor, and D.S. Vianna. A Parallel Evolutionary Algorithm for Solving the Vehicle Routing Problem with Heterogeneous Fleet. Future Generation Computer Systems Journal, 14:285–292, 1998.

    Article  Google Scholar 

  152. L. Osborne and B. Gillett. A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks. ORSA Journal on Computing, 3:213–225, 1991.

    Article  MATH  Google Scholar 

  153. M. Oussaidène, B. Chopard, O.V. Pictel, and M. Tomassini. Parallel Genetic Programming and its Application to Trading Model Induction. Parallel Computing, 23:1183–1198, 1997.

    Article  MATH  Google Scholar 

  154. P. Pardalos, L. Pitsoulis, and M.G. Resende. A Parallel GRASP Implementation for the Quadratic Assignment Problem. In: Parallel Algorithms for Irregular Problems: State of Art, A. Ferreira and J. Rolim, editors, pages 115–133, Kluwer, 1995.

    Google Scholar 

  155. P. Pardalos, L. Pitsoulis, and M.G. Resende. A Parallel GRASP for MAX-SAT. Lecture Notes in Computer Science, 1184:575–585, 1996.

    Article  Google Scholar 

  156. S. Parkes, J.A. Chandy, and P. Banerjee. A Library-Based Approach to Portable, Parallel, Object-Oriented Programming: Interface, Implementation, and Application. In: Proceedings of the ACM Supercomputing’94 Conference,pages 69–78, Washington, 1994.

    Google Scholar 

  157. C.C. Pettey, M.R. Leuze, and J. Grefenstette. A Parallel Genetic Algorithm. In: Proceedings of the Second International Conference on Genetic Algorithms, J. Grefenstette, editor, pages 155–161, Lawrence Erlbraum Associates, 1987.

    Google Scholar 

  158. G.F. Pfister. In Search of Clusters. Prentice-Hall, 1998.

    Google Scholar 

  159. B. Planquelle, J.-F. Méhaut, and N. Revol. Multi-Cluster Approach with PM2. In: Proceedings of the 1999 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 779–785, Las Vegas, 1999.

    Google Scholar 

  160. A. Plastino, C.C. Ribeiro, and N.R. Rodriguez. A Framework for SPMD Applications. In: Proceedings of the XII Brazilian Symposium on Computer Architecture, pages 245–252, São Pedro, 2000.

    Google Scholar 

  161. S.C. Porto and C.C. Ribeiro. Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints. Journal of Heuristics, 1:207–223, 1995.

    Article  Google Scholar 

  162. S.C. Porto and C.C. Ribeiro. A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. International Journal of High Speed Computing, 7:45–71, 1995.

    Article  Google Scholar 

  163. S.C. Porto and C.C. Ribeiro. A Case Study on Parallel Synchronous Implementations of Tabu Search Based on Neighborhood Decomposition. Investigación Operativa, 5:233–259, 1996.

    Google Scholar 

  164. S.C. Porto, J.P. Kitajima, and C.C. Ribeiro. Performance Evaluation of a Parallel Tabu Search Task Scheduling Algorithm. Parallel Computing, 26:73–90, 2000.

    Article  MATH  Google Scholar 

  165. M. Prais and C.C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in Traffic Assignment. INFORMS Journal on Computing, 12:164–176, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  166. M.J. Quinn. Parallel Computing: Theory and Practice. McGraw-Hill, 1994.

    Google Scholar 

  167. K.H. Randall. Cilk: Efficient Multithreaded Computing. Ph.D. Dissertation, MIT, Department of Electrical Engineering and Computer Science, 1998.

    Google Scholar 

  168. C. Rego and C. Roucairol. A Parallel Tabu Search Algorithm using Ejection Chains for the VRP. In: Metaheuristics: Theory and Applications, I.H. Osman and J.P. Kelly, editors, pages 253–295, Kluwer, 1996.

    Google Scholar 

  169. C.R. Reeves. Genetic Algorithms. In: Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, editor, pages 151–196, Blackwell, 1993.

    Google Scholar 

  170. M.G.C. Resende. Computing Approximate Solutions of the Maximum Covering Problem Using GRASP. Journal of Heuristics, 4:161–171,1998.

    Article  MATH  Google Scholar 

  171. M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran Subroutines for Approximate Solutions of Maximum Independent Set Problems Using GRASP. ACM Transactions on Mathematical Software, 24:386–394, 1998.

    Article  MATH  Google Scholar 

  172. M.G.C. Resende, P. Pardalos, and Y. Li. Algorithm 754: Fortran Subroutines for Approximate Solutions of Dense Quadratic Assignment Problems Using GRASP. ACM Transactions on Mathematical Software, 22:104–118, 1996.

    Article  MATH  Google Scholar 

  173. M.G.C. Resende, L. Pitsoulis, and P. Pardalos. Approximate Solution of Weighted MAX-SAT Problems Using GRASP. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 35:393–405, 1997.

    MathSciNet  Google Scholar 

  174. M.G.C. Resende, L. Pitsoulis, and P. Pardalos. Fortran Subroutines for Computing Approximate Solutions of MAX-SAT Problems Using GRASP. Discrete Applied Mathematics, 100:95–13, 2000.

    Article  MATH  Google Scholar 

  175. M.G.C. Resende and C.C. Ribeiro. A GRASP for Graph Planarization. Networks, 29:173–189, 1997.

    Article  MATH  Google Scholar 

  176. C.C. Ribeiro, M. Minoux, and M.C. Penna. An Optimum Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment. European Journal of Operational Research, 41:232–239, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  177. C.C. Ribeiro and M.G.C. Resende. Algorithm 797: Fortran Subroutines for Approximate Solutions of Graph Planarization Problems Using GRASP. ACM Transactions on Mathematical Software, 25:341–352, 1999.

    Article  MATH  Google Scholar 

  178. W. Rivera-Gallego. A Genetic Algorithm for Circulant Euclidean Distance Matrices. Journal of Applied Mathematics and Computation, 97:197–208, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  179. J.S. Rose, W.M. Snelgrove, and Z.G. Vranesic. Parallel Cell Placement Algorithms with Quality Equivalent to Simulated Annealing. IEEE Transactions on Computer-Aided Design, 7:387–396, 1998.

    Article  Google Scholar 

  180. P. Roussel-Ragot and G. Dreyfus. A Problem-Independent Parallel Implementation of Simulated Annealing: Models and Experiments. IEEE Transactions on Computer-Aided Design, 9:827–835, 1990.

    Article  Google Scholar 

  181. O. Roux and C. Fonlupt. Ant Programming: Or How to use Ants for Automatic Programming. In: Proceedings of the 2nd International Workshop on Ant Colony Optimization, pages 121–129, Brussels, 2000.

    Google Scholar 

  182. R.A. Rutenbar and S.A. Kravitz. Layout by Annealing in a Parallel Environment. In: Proceedings of the IEEE International Conference on Computer Design, pages 434–437, Port Chester, 1986.

    Google Scholar 

  183. A. Salhi. Parallel Implementation of a Genetic-Programming Based Tool for Symbolic Regression. Information Processing Letters, 66:299–307, 1998.

    Article  Google Scholar 

  184. J. Schulze and T. Fahle. A Parallel Algorithm for the Vehicle Routing Problem with Time Window Constraints. Annals of Operations Research, 86:585–607, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  185. Scientific Computing Associates. Linda’s User’s Guide and Reference Manual, version 4.0.1 — SP2/POE. 1995.

    Google Scholar 

  186. B. Selman, H. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. In: Proceedings of the 12th National Conference on Artificial Intelligence, pages 337–343, Seattle, MIT Press, 1994.

    Google Scholar 

  187. G.A. Sena, D. Megherbi, and G. Isern. Implementation of a Parallel Genetic Algorithm on a Cluster of Workstations: Traveling Salesman Problem, a Case Study. Future Generation Computer Systems, 17:477–488, 2001.

    Article  MATH  Google Scholar 

  188. T. Stützle. Parallelization Strategies for Ant Colony Optimization. Lecture Notes in Computer Science, 1498:722–731, 1998.

    Article  Google Scholar 

  189. T. Stützle and H. Hoos. The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem. In: Proceedings of the 1997 IEEE J^th International Conference on Evolutionary Computation, pages 308–313, IEEE Press, 1997.

    Google Scholar 

  190. Supercomputing Technologies Group. CILK 5.3.1 Reference Manual. MIT Laboratory for Computer Science. Online document, http://supertech.lcs.mit.edu/cilk, last visited on March 14, 2001.

  191. E. Taillard. Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 7:443–455, 1991.

    Article  MathSciNet  Google Scholar 

  192. E. Taillard. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA Journal on Computing, 6:108–117, 1994.

    Article  MATH  Google Scholar 

  193. E. Taillard. Ant Systems. To appear in: Handbook of Applied Optimization, P. Pardalos and M.G.C. Resende, editors, Oxford.

    Google Scholar 

  194. E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, 31:170–186, 1997.

    Article  MATH  Google Scholar 

  195. H. Takahashi and A. Matsuyama. An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica, 24:573–577, 1980.

    MathSciNet  MATH  Google Scholar 

  196. E.-G. Talbi, Z. Hafidi, and J-M. Geib. A Parallel Adaptive Tabu Search Approach. Parallel Computing, 24:2003–2019, 1998.

    Article  MathSciNet  Google Scholar 

  197. E.-G. Talbi, Z. Hafidi, and J-M. Geib. Parallel Adaptive Tabu Search for Large Optimization Problems. In: Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, pages 255–266, Kluwer, 1999.

    Google Scholar 

  198. E.-G. Talbi and T. Muntean. Hill-climbing, Simulated Annealing and Genetic Algorithms: A Comparative Study. In: Proceedings of the International Conference on Systems Sciences: Task Scheduling in Parallel and Distributed Systems, H. El-Rewini and T. Lewis, editors, pages 565–573, IEEE Computer Society Press, 1993.

    Google Scholar 

  199. E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard. Parallel Ant Colonies for Combinatorial Optimization Problems. Lecture Notes in Computer Science, 1586:239–247, 1999.

    Article  Google Scholar 

  200. E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard. Parallel Ant Colonies for the Quadratic Assignment Problem. Future Generation Computer Systems, 17:441–449, 2001.

    Article  MATH  Google Scholar 

  201. S.N. Talukdar, L. Baerentzen, and A. Gove. Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics, 4:295–321, 1998.

    Article  MATH  Google Scholar 

  202. R. Tanese. Distribued Genetic Algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms, J.D. Schaffer, editor, pages 434–439, Morgan Kaufmann, 1989.

    Google Scholar 

  203. M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search. Journal of Heuristics, 1:43–65, 1995.

    Article  MATH  Google Scholar 

  204. M.G.A. Verhoeven, M.E.M. Severens, and E.H.L. Aarts. Local Search for Steiner Trees in Graphs. In: Modern Heuristic Search Methods, V.J. Rayward-Smith, I.H. Osman, C.R. Reeves, and G.D. Smith, editors, pages 117–129, Wiley, 1996.

    Google Scholar 

  205. S. Voss. Tabu Search: Applications and Prospects. In: Network Optimization Problems, D.-Z. Du and P.M. Pardalos, editors, pages 333–353, World Scientific, 1993.

    Google Scholar 

  206. D.W. Walker. The Design of a Standard Message Passing Interface for Distributed Memory Concurrent Computers. Parallel Computing, 20:657–673, 1994.

    Article  MATH  Google Scholar 

  207. E.E. Witte, R.D. Chamberlain, and M.A. Franklin. Parallel Simulated Annealing using Speculative Computation. IEEE Transactions on Parallel and Distributed Systems, 2:483–494, 1991.

    Article  Google Scholar 

  208. C.P. Wong and R.D. Fiebrich. Simulated Annealing-Based Circuit Placement Algorithm on the Connection Machine System. In: Proceedings of the International Conference on Computer Design, pages 78–82, Rye Brook, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire PRiSM-CNRS, Université de Versailles, 45 avenue des Etats Unis, 78035, Versailles Cedex, France

    Van-Dat Cung & Catherine Roucairol

  2. Department of Computer Science, Catholic University of Rio de Janeiro, R. Marquês de São Vicente 225, Rio de Janeiro, 22453–900, Brazil

    Simone L. Martins & Celso C. Ribeiro

Authors
  1. Van-Dat Cung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simone L. Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Catherine Roucairol
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Cung, VD., Martins, S.L., Ribeiro, C.C., Roucairol, C. (2002). Strategies for the Parallel Implementation of Metaheuristics. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-1507-4_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5588-5

  • Online ISBN: 978-1-4615-1507-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation