Parallel Metaheuristics for Combinatorial Optimization

  • Sandra Duni Ekşiog̃lu
  • Panos M. Pardalos
  • Mauricio G. C. Resende
Part of the Applied Optimization book series (APOP, volume 67)


In this chapter, we review parallel metaheuristics for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, variable neighborhood search, and greedy randomized adaptive search procedures (GRASP) are discussed.


Parallel local search parallel GRASP parallel genetic algorithms parallel simulated annealing parallel tabu search variable neighborhood descent parallel computing environments heuristics combinatorial optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines — A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley and Sons, 1989.zbMATHGoogle Scholar
  2. [2]
    R. M. Aiex and M.G.C. Resende and C.C. Ribeiro. Probability Distribution of Solution Time in GRASP: an Experimental Investigation, AT&T Labs Research Technical Report: 00.7.2 (2000).Google Scholar
  3. [3]
    I. Azencott. Simulated Annealing: Parallelization Techniques, Wiley (1992).zbMATHGoogle Scholar
  4. [4]
    S.G. Akl, D.T. Barnard and R.J. Doran. Design, Analysis, and Implementation of a Parallel Tree Search Algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-4 (1982), pp. 192–203.zbMATHGoogle Scholar
  5. [5]
    I. Alth. A Parallel Game Tree Search Algorithm with a Linear Speedup, Journal of Algorithms, 15:175–198, 1993.MathSciNetGoogle Scholar
  6. [6]
    A.C.F. Alvim. Parallelization strategies for the metaheuristic GRASP. Master’s thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453–900 Brazil, April 1998. In Portuguese.Google Scholar
  7. [7]
    G.Y. Ananth, V. Kumar and P. M. Pardalos. Parallel Processing of Discrete Optimization Problems, In Encyclopedia of Microcomputers Vol. 13 (1993), pp. 129–147, Marcel Dekker Inc., New York.Google Scholar
  8. [8]
    D. Bader. (2000).
  9. [9]
    R. Battiti and G. Tecchiolli. Parallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU, Microprocessors and Microsystems, 16:351–367, 1992.Google Scholar
  10. [10]
    N. Boissin and J.-L. Lutton. A Parallel Simulated Annealing Algorithm, Parallel Computing, 19:859–872, 1993.MathSciNetzbMATHGoogle Scholar
  11. [11]
    R.J. Brouwer, P. Banerjee. A Parallel Simulated Annealing Algorithm for Channel Routing on a Hypercube Multiprocessor, Proceedings of 1988 IEEE International Conference on Computer Design, pp. 4–7.Google Scholar
  12. [12]
    N. Carriero and D. Gelernter and T. Mattson. Linda in Context, Communications of the ACM, 32:444–458, 1989.Google Scholar
  13. [13]
    N. Carriero and D. Gelernter and T. Mattson. The Linda Alternative to Message-Passing Systems, Parallel Computing, 20:458–633, 1994.Google Scholar
  14. [14]
  15. [15]
    A. Casotto and A. Sanngiovanni-Vincentelli. Placement of Standard Cells Using Simulated Annealing on the Connection Machine Proceedings ICCAD, 1987, pp. 350–352.Google Scholar
  16. [16]
    Y. Censor and S.A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications, Oxford University Press (1997).Google Scholar
  17. [17]
    J. Chakrapani and J. Skorin-Kapov. Massively Parallel Tabu Search for the Quadratic Assignment Problem, Annals of Operation Research, 41:327–341, 1993.zbMATHGoogle Scholar
  18. [18]
    R.D. Chamberlain, M.N. Edelman, M.A. Franklin, E.E. Witte. Simulated Annealing on a Multiprocessor, Proceedings of 1988 IEEE International Conference on Computer Design, pp. 540–544.Google Scholar
  19. [19]
    G.A. Cleveland and S.F. Smith. Using Genetic Algorithms to Schedule Flow Shop Releases, Proceedings of the Third International Conference on Genetic Algorithms, (1990), Morgan Kaufmann, Los Altos, CA.Google Scholar
  20. [20]
    J.P. Cohoon, S.U. Hegde, W.N. Martin and D. Richards. Punctuated Equilibria: A Parallel Genetic Algorithm, Proceedings of the Second International Conference on Genetic Algorithms and their Applications, J.J. Grefenstette (editor), July 1987, pp. 148–154.Google Scholar
  21. [21]
    CPLEX. Home Page of CPLEX, a division of ILOG (2000),Google Scholar
  22. [22]
    T.G. Crainic and M. Toulouse. Parallel Metaheuristics, Technical report, Centre de recherche sur les transports, Université de Montr’ eal, November 1997.Google Scholar
  23. [23]
    D. Cvijovic and J. Klinowski. Taboo Search: An Approach to the Multiple Minima Problem, Science, 267:664–666, 1995.MathSciNetGoogle Scholar
  24. [24]
    K.A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Doctoral dissertation, Department of Computer and Communication Sciences, University of Michigan, 1975.Google Scholar
  25. [25]
    L. DeRose and Y. Zhang and D.A. Reed. SvPablo: A Multi-language Performance Analysis System, 10th International Conference on Computer Performance Evaluation — Modeling Techniques and Tools, (1998), pp. 352–355.Google Scholar
  26. [26]
    N. Dodd. Slow Annealing Versus Multiple Fast Annealing Runs: An Empirical Investigation, Parallel Computing, 16:269–272, 1990.zbMATHGoogle Scholar
  27. [27]
    Etnus Com. Home page for Etnus Com. (1999),Google Scholar
  28. [28]
    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.MathSciNetzbMATHGoogle Scholar
  29. [29]
    T.A. Feo and M.G.C. Resende and S.H. Smith. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Operations Research, 42:860–878, 1994.zbMATHGoogle Scholar
  30. [30]
    T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, 6:109–133, 1995.MathSciNetzbMATHGoogle Scholar
  31. [31]
    A. Ferreira and P.M. Pardalos (Eds.), Solving Combinatorial Optimization Problems in Parallel, Methods and Techniques, Lecture Notes in Computer Science (1995), 1054.Google Scholar
  32. [32]
    A. Ferreira and J.D.P. Rolim (Eds.), Parallel Algorithms for Irregular Problems: State of the Art, Kluwer Academic Publishers (1995).zbMATHGoogle Scholar
  33. [33]
    C.-N. Fiechter. A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems, Discrete Applied Mathematics, 51:243–267, 1994.MathSciNetzbMATHGoogle Scholar
  34. [34]
    I. Foster. Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering Addison-Wesley (1995).zbMATHGoogle Scholar
  35. [35]
    J. Galarowicz and B. Mohr. Analyzing Message Passing Programs on the Cray T3 with PAT and VAMPIR, Proceedings of Fourth European CRAYSGI MPP workshop, H. Lederer and F. Hertwick, eds. IPP-Report des MPI für Plasmaphysik, IPP R/46 (1998), pp. 29–49,Google Scholar
  36. [36]
    A. Geist and A. Beguelin and J. Dongarra and W. Jiang and R. Manchek and V. Sunderman. PVM: Parallel Virtual Machine — A user’s guide and tutorial for networked parallel computing, MIT Press (1994), ( Scholar
  37. [37]
    F. Glover. Tabu Search. Part I, ORSA J. Comput., 1:190–206, 1989.MathSciNetzbMATHGoogle Scholar
  38. [38]
    F. Glover. Tabu Search. Part II, ORSA J. Comput., 2:4–32, 1990.zbMATHGoogle Scholar
  39. [39]
    F. Glover, E. Taillard and D. de Werra. A User’s Guide to Tabu Search, Annals of Operation Research, 41:3–28, 1993.zbMATHGoogle Scholar
  40. [40]
    F. Glover and M. Laguna. Tabu Search, Kluwer Academic Publishers (1997).zbMATHGoogle Scholar
  41. [41]
    M. Gorges-Schleuter. ASPARAGOS: A Parallel Genetic Algorithm and Population Genetics, Lecture Notes on Computer Science, 565:407–518, 1989.MathSciNetGoogle Scholar
  42. [42]
    D.R. Greening. Asynchronous Parallel Simulated Annealing, Lectures in Complex Systems, 3:497–505, 1990.Google Scholar
  43. [43]
    W. Gropp and E. Lusk and A. Skjellum. Using MPI: Portable Parallel Programming with the Message Passing Interface, MIT Press (1994).Google Scholar
  44. [44]
    W. Gropp and S. Huss-Lederman and A. Lumsdaine and E. Lusk and B. Nitzberg and W. Saphir and M. Snir. MPI: The Complete Reference, In The MPI Extensions, Vol. 2, MIT Press (1998).Google Scholar
  45. [45]
    P. Hansen and B. Jaumard and N. Mladenović and A. Parreira. Variable Neighborhood Searchfor Weighted Maximum Satisfiability. In Preparation (2000).Google Scholar
  46. [46]
    P. Hansen and N. Mladenović. Variable Neighborhood Search for the pMedian. Location Science, 5:207–226, 1998.Google Scholar
  47. [47]
    P. Hansen and N. Mladenović. An Introduction to Variable Neighborhood Search. In Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, S. Voss et al. (Eds.), pp. 433–458, 1999, Kluwer, Dordrecht.Google Scholar
  48. [48]
    P. Hansen and N. Mladenović. Variable Neighborhood Search: Principles and Applications. European Journal of Operational Research (to appear).Google Scholar
  49. [49]
    P. Hansen and N. Mladenović. Variable Neighborhood Search. In Handbook ofApplied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press (2001).Google Scholar
  50. [50]
    P. Hansen and N. Mladenović and N. Labbe and M. Gendreau. Variable Neighborhood Search for the Traveling Salesman Problem. In preparation (2000).Google Scholar
  51. [51]
    P. Hansen and N. Mladenović and N. Perez-Brito. Variable Neighborhood Decomposition Search. Journal of Heuristics (to appear).Google Scholar
  52. [52]
    J.H. Holland. Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.Google Scholar
  53. [53]
    High Performance FORTRAN Forum. High Performance FORTRAN Language Specification Version 2.0, Google Scholar
  54. [54]
    S. R. Huang and L.S. Davis. Speedup Analysis of Centralized Parallel Heuristic Search Algorithms, Proceedings ofthe International Conference on Parallel Processing, Vol. 3. Algorithms and Applications (1990), pp. 18–21.Google Scholar
  55. [55]
    IBM. Parallel ESSL Version 2 Release 1.2 Guide and Reference (SA227273), (1999),Google Scholar
  56. [56]
    IEEE (Institute of Electric and Electronic Engineering). Information Technology — Portable Operating Systems Interface (POSIX) — Part 1- Amendment 2: Threads Extension, (1995).Google Scholar
  57. [57]
    L. Ingber. ASA-package (2000), Scholar
  58. [58]
    P. Jog, J.Y. Suh and D. Van Gucht. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem, SIAM Journal of optimization, 1:515–529, 1991.zbMATHGoogle Scholar
  59. [59]
    D.S. Johnson. Local Optimization and the Traveling Salesman Problem, Proceedings of the Seventh Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 447:446–461, 1990.Google Scholar
  60. [60]
    D. S. Johnson, C. H. Papadimitriou and M. Yannakakis. How Easy is Local Search?, Journal of Computer and System Sciences, 17:(1)79–100, 1988.MathSciNetGoogle Scholar
  61. [61]
    M. Jones and P. Banerjee. Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube, Proceedings of the 24th Design Automation Conference, 1987, pp. 807–813.Google Scholar
  62. [62]
    S. Kirkpatrick, C.D. Gellat Jr. and M.P. Vecchi. Optimization by Simulated Annealing, Science, 220:671–680, 1983.MathSciNetzbMATHGoogle Scholar
  63. [63]
    G. Kliewer and S. Tschöke. A General Parallel Simulated Annealing Library and its Application in Airline Industry, Proceedings of the 14th International Parallel and Distributed Processing Symposium, IPDPS (2000), pp. 55–61.Google Scholar
  64. [64]
    G. Kliewer and K. Klohs and S. Tschöke. Parallel Simulated Annealing Library (parSA): User manual, Technical report, University of Paderborn (1999), parsa.Google Scholar
  65. [65]
    A. Knies and M. O’Keefe and T. MacDonald. High Performance FORTRAN: A Practical Analysis, Scientific Programming, 3:187–199, 1994.Google Scholar
  66. [66]
    C. Koelbel and D. Loveman and R. Schreiber and G. Steele Jr. and M. Zosel. The High Performance FORTRAN Handbook, MIT Press (1994).Google Scholar
  67. [67]
    V. Kumar and A. Grama and A. Gupta and G. Karypis. Introduction to Parallel Computing Design and Analysis of Parallel Algorithms, Benjaming/Cummings (1994).zbMATHGoogle Scholar
  68. [68]
    G. von Laszewski. Intelligent Structural Operators for K-Way Graph Partitioning Problem, Proceedings of the Fourth International Conference on Genetic Algorithms, (1991), Morgan Kaufmann, San Mateo, CA.Google Scholar
  69. [69]
    C.Y. Lee and S.J. Kim. Parallel Genetic Algorithms for the EarlinessTardiness Job Scheduling Problem with General Penalty Weights, Computers & Ind. Eng., 28:231–243, 1995.Google Scholar
  70. [70]
    F. Lee. Parallel Simulated Annealing on a Message-Passing MultiComputer, Ph.D. thesis, Utah State University (1995).Google Scholar
  71. [71]
    W.G. Macready and A.G. Siapas and S.A. Kauffman. Criticality and Parallelism in Combinatorial Optimization, Science, 271:56–59, 1996.Google Scholar
  72. [72]
    A. Mahanti and C.J. Daniels. A SIMD Approach to Parallel Heuristic Search, Artificial Intelligence, 10:243–282, 1993.MathSciNetGoogle Scholar
  73. [73]
    T.A. Marsland and F. Popowich. Parallel Game-Tree Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-7 (1985), pp. 442–452.Google Scholar
  74. [74]
    O. Martin and S.W. Otto and E.W. Felten. Large-Steps Markov Chains for the Travelling Salesman Problem, Complex Systems, 5:299–326, 1991.MathSciNetzbMATHGoogle Scholar
  75. [75]
    S.L. Martins. Parallelization strategies for metaheuristics in distributed memory environments, Ph.D. thesis, Department of Computer Sciences, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 1999.Google Scholar
  76. [76]
    S.L. Martins and C.C. Ribeiro. A parallel GRASP for the Steiner problem in graphs. In A. Ferreira and J. Rolim (Editors), Proceedings of IRREGULAR’98 — 5th International Symposium on Solving Irregularly Structured Problems in Parallel, Lecture Notes in Computer Science, SpringerVerlag, 1457:285–297, 1998.Google Scholar
  77. [77]
    S.L. Martins and C.C. Ribeiro and N. Rodriguez. Parallel Computing Environments. In Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Editors), Oxford University Press, 2001.Google Scholar
  78. [78]
    J. Merlin and A. Hey. An Introduction to High Performance FORTRAN, Scientific Programming, 4:87–113, 1995.Google Scholar
  79. [79]
    N. Metropolis and A. Rosenbluth and M. Rosenbluth and A. Teller and E. Teller. Equation of State Calculations by Fast Computing Machines, Journal of Chemical Physics, 21:1087–1092, 1953.Google Scholar
  80. [80]
    A. Migdalas and P.M. Pardalos (Eds.), Parallel Computing in Optimization, Kluwer Academic Publishers, 1997.zbMATHGoogle Scholar
  81. [81]
    B.P. Miller and M.D. Callagham and J.M. Cargille and J.K. Hollingsworth and R.B. Irvin and K.L. Karavanic and K. Kunchithapadam and T. Newhall. The Paradyn Parallel Performance Tools, IEEE Computer, 28:37–46, 1995.Google Scholar
  82. [82]
    Practical Parallel Computing. AP Professional (1994).Google Scholar
  83. [83]
    MPI Forum. A Message-Passing Interface Standard, The International Journal of Supercomputing Applications and High Performance Computing, 8:13 8–161, 1994.Google Scholar
  84. [84]
    MPI Forum. A Message-Passing Interface Standard, (1995),Google Scholar
  85. [85]
    H. Muhlenbein. Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, Lecture Notes in Computer Science, 565:398–406, 1989.MathSciNetGoogle Scholar
  86. [86]
    H. Muhlenbein, M. Schomisch and J. Born. The Parallel Genetic Algorithm as Function Optimizer, Proceedings on an International Conference on Genetic Algorithms, (1991).Google Scholar
  87. [87]
    R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A parallel GRASP for the data association multidimensional assignment problem, In P.M. Pardalos (Editor), Parallel processing ofdiscrete problems, volume 106 of The IMA Volumes in Mathematics and Its Applications, pages 159–180. SpringerVerlag, 1998.Google Scholar
  88. [88]
    W. Nagel and A. Arnold and M. Weber and H. Hoppe and K. Solchenbach. VAMPIR: Visualization and Analysis of MPI Resources, Supercomputer, 63:69–80, 1996.Google Scholar
  89. [89]
    L.J. Osborne and B.E. Gillett. A Comparison of two Simulated Annealing Algorithms Applied to the Directed Steiner Problem in Networks, ORSA J. on Computing, 3:213–225, 1991.zbMATHGoogle Scholar
  90. [90]
    P. M. Pardalos (Eds), Parallel Processing of Discrete Problems, The IMA Volumes in Mathematics and its Applications, Vol. 106 (1999).zbMATHGoogle Scholar
  91. [91]
    P. M. Pardalos, Y. Li and K. A. Murthy. Computational Experience with Parallel Algorithms for Solving the Quadratic Assignment Problem, In Computer Science and Operations Research: New Developments in their Interface, O. Balci, R. Sharda, S.A. Zenios (eds.), Pergamon Press, pp. 267–278 (1992).Google Scholar
  92. [92]
    P. M. Pardalos, and G. Guisewite. Parallel Computing in Nonconvex Programming, Annals of Operations Research, 43:87–107, 1993.MathSciNetzbMATHGoogle Scholar
  93. [93]
    P. M. Pardalos, A. T. Phillips and J. B. Rosen. Topics in Parallel Computing in Mathematical Programming, Science Press, 1993.Google Scholar
  94. [94]
    P. M. Pardalos, L. S. Pitsoulis, T. Mavridou, and M.G.C. Resende. Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP, In Parallel Algorithms for Irregularly Structured Problems, Proceedings of the Second International Workshop — Irregular’95, A. Ferreira and J. Rolim (Editors), Lecture Notes in Computer Science, Springer-Verlag, 980:317–331, 1995.Google Scholar
  95. [95]
    P. M. Pardalos, L. S. Pitsoulis and M.G.C. Resende. A Parallel GRASP Implementation for the Quadratic Assignment Problem, In Proceedings of Parallel Algorithms for Irregularly Structured Problems (Irregular ’94), Kluwer Academic Publishers (1995).Google Scholar
  96. [96]
    P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A parallel GRASP for MAX-SAT problems, Lecture Notes in Computer Science, 1180:575–585, 1996.Google Scholar
  97. [97]
    P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan (Editors), Parallel Processing of Discrete Optimization Problems, DIMACS Series Vol. 22, American Mathematical Society, (1995).zbMATHGoogle Scholar
  98. [98]
    P. M. Pardalos, M. G. C. Resende (Editors), Handbook of Applied Optimization, Oxford University Press, (2000).Google Scholar
  99. [99]
    P.M. Pardalos and H. Wolkowicz (Editors), Quadratic Assignment and Related Problems, DIMACS Series Vol. 16, American Mathematical Society (1994).zbMATHGoogle Scholar
  100. [100]
    C. Peterson. Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem, Neural Computation, 2:261–269, 1990.Google Scholar
  101. [101]
    C.B. Pettey, M.R. Leuze and J.J. Grefenstette. A Parallel Genetic Algorithm, Proceedings of the Second International Conference on Genetic Algorithms and their Applications, J.J. Grefenstette (editor), July 1987, pp. 155–161.Google Scholar
  102. [102]
    C. Powler, C. Ferguson and R. E. Korf. Parallel Heuristic Search: Two Approaches, In Parallel Algorithms for Machine Intelligence and Vision, V. Kumar, P.S. Gopalakrishnan and L.N. (eds.), Springer-Verlag, pp. 42–65 (1990).Google Scholar
  103. [103]
    M.G.C. Resende. Computing approximate solutions of the maximum covering problem using GRASP, J. of Heuristics, 4:161–171, 1998.zbMATHGoogle Scholar
  104. [104]
    M. G. C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP, ACM Trans. Math. Software, 24:386–394, 1998.zbMATHGoogle Scholar
  105. [105]
    D.A. Reed and R.A. Aydt and R.J. Noe and P.C. Roth and K.A. Shields and B. Schwartz and L.F. Tavera. Scalable Performance Analysis: The Pablo Performance Analysis Environment, Proceedings of the Scalable Parallel Libraries Conference, IEEE Computer Society (1993), pp. 104–113.Google Scholar
  106. [106]
    J.S. Rose, W.M. Snelgrove and Z.G. Vranesic. Parallel Standard Cell Placement Algorithms with Quality Equivalent to Simulated Annealing, IEEE Transactions on Computer-Aided Design, 7:387–396, 1988.Google Scholar
  107. [107]
    A.V. Sannier and E.D. Goodman. Genetic Learning Procedures in Distributed Environments, Proceedings of the Second International Conference on Genetic Algorithms and their Applications, J.J. Grefenstette (editor), July 1987, pp. 162–169.Google Scholar
  108. [108]
    J.S. Sargent. A Parallel Row-Based Algorithm with Error Control for Standard-Cell Placement on a Hypercube Multiprocessor, Thesis, University of Illinois, Urbana-Illinois, 1988.Google Scholar
  109. [109]
    Scientific Computing Associates. Linda User’s Guide and Reference Manual, Version 3.0 (1995).Google Scholar
  110. [110]
    B. Shirazi, M. Wang and G. Pathak. Analysis and Evaluation of Heuristic Methods for Static Task Scheduling, Journal of Parallel and Distributed Computing, 10:222–232, 1990.Google Scholar
  111. [111]
    P.S. de Souza. Asynchronous Organizations for Multi-Algorithm Problems, Ph.D. Thesis, Department of Electrical and Computer Engineering, Carnegie Mellon University, 1993.Google Scholar
  112. [112]
    R. Shonkwiler and E.V. Vleck. Parallel Speed-Up of Monte Carlo methods for Global Optimization, Journal of Complexity, 10:64–95, 1994.MathSciNetzbMATHGoogle Scholar
  113. [113]
    J. Suh and D. Van Gucht. Distributed genetic Algorithms, Tech. Report 225, Computer Science Department, Indiana University, Bloomington, IN, July 1987.Google Scholar
  114. [114]
    E. Taillard. Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing, 17:443–445, 1991.MathSciNetGoogle Scholar
  115. [115]
    R. Tanese. Parallel Genetic Algorithm for a Hypercube, Proceedings of the Second International Conference on Genetic Algorithms and their Applications, J.J. Grefenstette (editor), July 1987, pp. 177–183.Google Scholar
  116. [116]
    H.M.M. Ten Eikelder and M.G.A. Verhoeven and T.W.M. Vossen and E.H.L. Aarts. A Probabilistic Analysis of Local Search, In I.H. Osman and J.P. Kelly (Eds.) Metaheuristics: Theory & Applications, pp. 605–618, Kluwer Academic Publishers (1996).Google Scholar
  117. [117]
    N.L.J. Ulder, E.H.L. Aarts, H. -J. Bandelt, P.J.M. van Laarhoven and E. Pesch. Genetic Local Search Algorithms for the Traveling Salesman Problem, In Lecture Notes in Computer Science, Parallel Problem Solving from Nature-Proceedings of 1 st Workshop, PPSN 1, 496:109–116, 1991.Google Scholar
  118. [118]
    M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search, Journal of Heuristics, 1:43–65, 1995.zbMATHGoogle Scholar
  119. [119]
    C.-P. Wong and R.-D. Fiebrich. Simulated Annealing-Based Circuit Placement on the Connection Machine System, Proceedings of International Conference on Computer Design (ICCD ’87), 1987, pp. 78–82.Google Scholar
  120. [120]
    J. Yan and S. Sarukhai and P. Mehra. Performance Measurement, Visualization and Modeling of Parallel and Distributed Programs Using the AIMS Toolkit, Software Practice and Experience, 25:429–461, 1995.Google Scholar
  121. [121]
    J. Yan and S. Sarukhai. Analyzing Parallel Program Performance Using Normalized Performance Indices and Trace Transformation Techniques, Parallel Computing, 22:1215–1237, 1996.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Sandra Duni Ekşiog̃lu
    • 1
  • Panos M. Pardalos
    • 1
  • Mauricio G. C. Resende
    • 2
  1. 1.Center for Applied Optimization, Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA
  2. 2.Information Sciences Research CenterAT&T Labs ResearchFlorham ParkUSA

Personalised recommendations