Skip to main content
SpringerLink
Log in

Parallel heuristic search — Introductions and a new approach

  • Chapter
  • First Online:
Solving Combinatorial Optimization Problems in Parallel

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1054))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. Allwright, J.R.A., Carpenter, D.B., A distributed implementation of Simulated Annealing for the Traveling Salesman Problem, Parallel Computing 10 (1989) 335–338.

    Article  Google Scholar 

  3. Battiti, R., Tecchioli, G., Parallel biased search for Combinatorial Optimization: Genetic Algorithms and TABU, Microprocessors and Microsystems 16 (1992) 351–367.

    Article  Google Scholar 

  4. Casotto, A., Romeo, F., Sangiovanni-Vincentelli, A., A parallel Simulated Annealing algorithm for the placement of macro-cells, IEEE Transactions on Computer Aided Design 6 (1987) 838–847.

    Article  Google Scholar 

  5. Chakrapani, J., Skorin-Kapov, J., Massively parallel Tabu Search for the Quadratic Assignment Problem, Annals of Operations Research 41 (1993) 327–341.

    Article  Google Scholar 

  6. Christofides, N., Worst-case analysis of a new heuristic for the Traveling Salesman Problem, Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1976.

    Google Scholar 

  7. Cohoon, J.P., Martin, W.N., Richards, D.S., Genetic Algorithms and Punctuated Equilibria in VLSI, Lecture Notes in Computer Science (Proceedings of the First Conference on Parallel Problem Solving from Nature-PPSN I) 496 (1990) 134–144.

    Google Scholar 

  8. Crainic, T.G., Toulouse, M., Gendreau, M., Towards a Taxonomy of Parallel Tabu Search Algorithms, Report no. CRT-933, Centre for Research on Transportation, University of Montreal, 1993.

    Google Scholar 

  9. Crainic, T.G., Toulouse, M., Gendreau, M., A Study of Synchronous Parallelization Strategies for Tabu Search, Report no. CRT-934, Centre for Research on Transportation, University of Montreal, 1993.

    Google Scholar 

  10. Crainic, T.G., Toulouse, M., Gendreau, M., An Appraisal of Asynchronous Parallelization Approaches for Tabu Search, Report no. CRT-935, Centre for Research on Transportation, University of Montreal, 1993.

    Google Scholar 

  11. Diekmann, R., Lüling, R., Simon, J., Problem independent distributed Simulated Annealing and its applications, Technical Report, Paderborn Center for Parallel Computing, TR-003-93, 1993.

    Google Scholar 

  12. Glover, F., Tabu Search — Part I, ORSA Journal on Computing 1 (1989) 190–206.

    Google Scholar 

  13. Glover, F., Tabu Search — Part II, ORSA Journal on Computing 2 (1989) 4–32.

    Google Scholar 

  14. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.

    Google Scholar 

  15. Gorges-Schleuter, M., Explicit Parallelism of Genetic Algorithms through Population Structures, Lecture Notes in Computer Science (Proceedings of the First Conference on Parallel Problem Solving from Nature — PPSN I) 496 (1990) 150–159.

    Google Scholar 

  16. Hauser, R., Männer, R., Implementation of Standard Genetic Algorithm on MIMD Machines, Lecture Notes in Computer Science (Proceedings of the Third Conference on Parallel Problem Solving from Nature — PPSN III) 866 (1994) 504–513.

    Google Scholar 

  17. Holland, J.H., Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.

    Google Scholar 

  18. Johnson, D.S., Papadimitriou, C.H., How Easy is Local Search?, Journal of Computer and System Sciences 37 (1988) 79–100.

    Article  Google Scholar 

  19. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., Optimization by Simulated Annealing: An experimental evaluation; Part I, Graph Partitioning, Operations Research 37 (1989) 865–892.

    Google Scholar 

  20. Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C., Optimization by Simulated Annealing: An experimental evaluation; Part II, Graph Coloring and Number Partitioning, Operations Research 39 (1991) 378–406.

    Google Scholar 

  21. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., Optimization by Simulated Annealing, IBM Research Report RC 9355, 1982.

    Google Scholar 

  22. Kravitz, S.A., Rutenbar, R., Placement by Simulated Annealing on a multiprocessor, IEEE Transactions on Computer Aided Design 6 (1987) 534–549.

    Article  Google Scholar 

  23. Laarhoven, P.J.M., Aarts, E.H.L., Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Dordrecht, 1987.

    Google Scholar 

  24. Laursen, P.S., Simulated Annealing for the QAP — optimal tradeoff between simulation time and solution quality, European Journal of Operational Research 69 (1993) 238–243.

    Article  Google Scholar 

  25. Laursen, P.S., Parallel Optimization Algorithms — Efficiency vs. Simplicity, Ph.D. Thesis, DIKU-Report no. 94/31, Department of Computer Science, University of Copenhagen, 1994.

    Google Scholar 

  26. Lin, S., Kernighan, B.W., An effective heuristic algorithm for the travelling salesman problem, Operations Research 21 (1973) 498–516.

    Google Scholar 

  27. Reeves, C.R., (ed.), Modern Heuristic Techniques for Combinatorial Optimization, Alfred Waller Ltd., 1993.

    Google Scholar 

  28. Taillard, E., Robust Tabu Search for the Quadratic Assignment Problem, Parallel Computing 17 (1991) 443–455.

    Article  Google Scholar 

  29. Whitley, D., Starkweather, T., Mathias, K., Optimization Using Distributed Genetic Algorithms, Lecture Notes in Computer Science (Proceedings of the First Conference on Parallel Problem Solving from Nature — PPSN I) 496 (1990) 134–144.

    Google Scholar 

  30. Wilf, H.S., Algorithms and Complexity, Prentice-Hall, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Copenhagen, Universitetsparken 1, 2100, Copenhagen Ø, Denmark

    Per S. Laursen

Authors
  1. Per S. Laursen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Afonso Ferreira Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Laursen, P.S. (1996). Parallel heuristic search — Introductions and a new approach. In: Ferreira, A., Pardalos, P. (eds) Solving Combinatorial Optimization Problems in Parallel. Lecture Notes in Computer Science, vol 1054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027125

Download citation

  • DOI: https://doi.org/10.1007/BFb0027125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61043-4

  • Online ISBN: 978-3-540-49875-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation