Advertisement

Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP

  • P. M. Pardalos
  • L. Pitsoulis
  • T. Mavridou
  • M. G. C. Resende
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 980)

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    I. Alth, A Parallel Game Tree Search Algorithm with a Linear Speedup, Journal of Algorithms 15 (1993), pp. 175–198.CrossRefGoogle Scholar
  4. 4.
    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
  5. 5.
    R. Battiti and G. Tecchiolli, Parallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU, Microprocessors and Microsystems 16 (1992), pp. 351–367.CrossRefGoogle Scholar
  6. 6.
    N. Boissin and J.-L. Lutton, A Parallel Simulated Annealing Algorithm, Parallel Computing, 19 (1993), pp. 859–872.MathSciNetGoogle Scholar
  7. 7.
    R.J. Brouwer and 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
  8. 8.
    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
  9. 9.
    J. Chakrapani and J. Skorin-Kapov, Massively Parallel Tabu Search for the Quadratic Assignment Problem, Annals of Operation Research, 41 (1993), pp.327–341.Google Scholar
  10. 10.
    R.D. Chamberlain, M.N. Edelman, M.A. Franklin and E.E. Witte, Simulated Annealing on a Multiprocessor, Proceedings of 1988 IEEE International Conference on Computer Design, pp. 540–544.Google Scholar
  11. 11.
    G.A. Cleveland and S.F. Smith, Using Genetic Algorithms to Schedule Flow Shop Releases, Proceeding of the Third International Conference on Genetic Algorithms, (1990), Morgan Kaufmann, Los Altos, CA.Google Scholar
  12. 12.
    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
  13. 13.
    D. Cvijovic and J. Klinowski, Taboo Search: An Approach to the Multiple Minima Problem, Science, 267 (1995), pp. 664–666.Google Scholar
  14. 14.
    K.A. De Jong, An Analysis fo the Behavior of a Class of Genetic Adaptive Systems, Doctoral dissertation, Department of Computer and Communication Sciences, University of Michigan, 1975.Google Scholar
  15. 15.
    T.A. Feo, M.G.C. Resende and S.H. Smith, A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Operations Research, 42 (1994), pp. 860–878.Google Scholar
  16. 16.
    T.A. Feo and M.G.C. Resende, Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization, 6 (1995), pp. 109–133.Google Scholar
  17. 17.
    C.-N. Fiechter, A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems, Discrete Applied Mathematics, 51 (1994), pp. 243–267.CrossRefGoogle Scholar
  18. 18.
    F. Glover, Tabu Search. Part I, ORSA J. Comput., 1 (1989), pp. 190–206.Google Scholar
  19. 19.
    F. Glover, Tabu Search. Part II, ORSA J. Comput., 2 (1990), pp. 4–32.Google Scholar
  20. 20.
    F. Glover, E. Taillard and D. de Werra, A User's Guide to Tabu Search, Annals of Operation Research, 41 (1993), pp. 3–28.Google Scholar
  21. 21.
    M. Gorges-Schleuter, ASPARAGOS: A Parallel Genetic Algorithm and Population Genetics, Lecture Notes on Computer Science, Vol. 565 (1989), pp. 407–518.Google Scholar
  22. 22.
    D.R. Greening, Asynchronous Parallel Simulated Annealing, Lectures in Complex Systems, Vol. 3 (1990), pp. 497–505.Google Scholar
  23. 23.
    J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.Google Scholar
  24. 24.
    S. R. Huang and L.S. Davis, Speedup Analysis of Centralized Parallel Heuristic Search Algorithms, Proceedings of the International Conference on Parallel Processing, Vol. 3. Algorithms and Applications (1990), pp. 18–21.Google Scholar
  25. 25.
    P. Jog, J.Y. Suh and D. Van Gucht, Parallel Genetic Algorithms Applied to the Traveling Salesman Problem, SIAM Journal of Optimization, 1 (1991), pp.515–529.CrossRefGoogle Scholar
  26. 26.
    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
  27. 27.
    S. Kirkpatrick, C.D. Gellat Jr. and M.P. Vecchi, Optimization by Simulated Annealing, Science, 220 (1983), pp. 671–680.Google Scholar
  28. 28.
    V. Kumar And L.N. Kanal, Parallel Branch-and-Bound Formulations for AND/OR Tree Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-6 (1984), pp. 768–778.Google Scholar
  29. 29.
    G. von Laszewski, Intelligent Structural Operators for K-Way Graph Partitioning Problem, Proceeding of the Fourth International Conference on Genetic Algorithms, (1991), Morgan Kaufmann, San Mateo, CA.Google Scholar
  30. 30.
    C.Y. Lee and S.J. Kim, Parallel Genetic Algorithms for the Earliness-Tardiness Job Scheduling Problem with General Penalty Weights, Computers & Ind. Eng., 28 (1995), pp. 231–243.Google Scholar
  31. 31.
    A. Mahanti and C.J. Daniels, A SIMD Approach to Parallel Heuristic Search, Artificial Intelligence, 10 (1993), pp. 243–282.MathSciNetGoogle Scholar
  32. 32.
    N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of State Calculations by Fast Computing Machines, Journal of Chemical Physics, 21 (1953), pp. 1087–1092.CrossRefGoogle Scholar
  33. 33.
    H. Muhlenbein, Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 565 (1989), pp. 398–406.Google Scholar
  34. 34.
    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
  35. 35.
    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
  36. 36.
    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
  37. 37.
    P. M. Pardalos, and G. Guisewite, Parallel Computing in Nonconvex Programming, Annals of Operations Research 43 (1993), pp. 87–107.Google Scholar
  38. 38.
    P. M. Pardalos, A. T. Phillips and J. B. Rosen, Topics in Parallel Computing in Mathematical Programming, Science Press, 1993.Google Scholar
  39. 39.
    P. M. Pardalos, L. S. Pitsoulis and M.G.C. Resende, A Parallel GRASP Implementation for the Quadratic Assignment Problem, In Solving Irregular Problems in Parallel: State of the Art (Editors: A. Ferreira and J. Rolim), Kluwer Academic Publishers (1995).Google Scholar
  40. 40.
    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).Google Scholar
  41. 41.
    P.M. Pardalos and H. Wolkowicz (Editors), Quadratic Assignment and Related Problems, DIMACS Series Vol. 16, American Mathematical Society (1994).Google Scholar
  42. 42.
    C. Peterson, Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem, Neural Computation, Vol. 2, (1990), pp. 261–269.Google Scholar
  43. 43.
    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
  44. 44.
    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
  45. 45.
    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, Vol. 7 (1988), pp. 387–396.CrossRefGoogle Scholar
  46. 46.
    sc 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
  47. 47.
    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
  48. 48.
    B. Shirazi, M. Wang and G. Pathak, Analysis and Evaluation of Heuristic Methods for Static Task Scheduling, Journal of Parallel and Distributed Computing 10 (1990), pp. 222–232.CrossRefGoogle Scholar
  49. 49.
    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
  50. 50.
    R. Shonkwiler and E.V. Vleck, Parallel Speed-Up of Monte Carlo methods for Global Optimization, Journal of Complexity 10 (1994), pp. 64–95.CrossRefGoogle Scholar
  51. 51.
    J. Suh and D. Van Gucht, Distributed genetic Algorithms, Tech. Report 225, Computer Science Department, Indiana University, Bloomington, IN, July 1987.Google Scholar
  52. 52.
    E. Taillard, Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing, 17 (1991), pp. 443–445.Google Scholar
  53. 53.
    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
  54. 54.
    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 1st Workshop, PPSN 1, Vol. 496 (1991), pp. 109–116.Google Scholar
  55. 55.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • P. M. Pardalos
    • 1
  • L. Pitsoulis
    • 1
  • T. Mavridou
    • 1
  • M. G. C. Resende
    • 2
  1. 1.Center for Applied Optimization and Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA
  2. 2.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations