Skip to main content
SpringerLink
Log in

Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements

  • Published:
Operations-Research-Spektrum Aims and scope Submit manuscript

Abstract

We study and compare synchronous parallelization strategies for tabu search. We identify the most promising parallelization approaches, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: length of the synchronization steps, number of processors, handling of exchanged information, etc. Parallelization approaches are implemented and compared by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.

Zusammenfassung

Die Arbeit befaßt sich mit synchronen Parallelisierungsstrategien für Tabu Search. Wir zeigen die vielversprechendsten Parallelisierungsansätze auf und beurteilen deren Auswirkungen auf Leistungsverhalten und Lösungsgüte einiger wesentlicher Parameter; Länge der Synchronisationsschritte, Anzahl der Prozessoren, Art der Kommunikationsbeziehungen etc. Die Parallelisierungsansätze wurden implementiert und einander bei Anwendung eines Tabu Search-Verfahrens für Mehrgüter-Standort-Einzugsbereich-Probleme mit Ausgleichsbedingungen gegenübergestellt.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chakrapani J, Skorin-Kapov J (1992) A Connectionist Approach to the Quadratic Assignment Problem. Comput Oper Res 19(3/4):287–295

    Google Scholar 

  2. Chakrapani J, Skorin-Kapov J (1993) Mapping tasks to processors to minimize communication time in a multiprocessor system. Technical report, Harriman School for Management and Policy State University of New York at Stony Brook

    Google Scholar 

  3. Chakrapani J, Skorin-Kapov J (1993) Massively parallel tabu search for the quadratic assignment problem. Ann Oper Res 41:327–341

    Google Scholar 

  4. Crainic TG, Dejax PJ, Delorme L (1989) Models for Multimode Multicommodity Location Problems with Interdepot Balancing Requirements. Ann Oper Res 18:279–302

    Google Scholar 

  5. Crainic TG, Delorme L, Dejax PJ (1993) A Branch-and-Bound Method for Multicommodity Location with Balancing Requirements. Eur J Oper Res 65(3):368–382

    Google Scholar 

  6. Crainic TG, Gendreau M, Soriano P, Toulouse M (1993) A Tabu Search Procedure for Multicommodity Location/Allocation with Balancing Requirements. Ann Oper Res 41:359–383

    Google Scholar 

  7. Crainic TG, Toulouse M, Gendreau M (1993) Towards a Taxonomy of Parallel Tabu Search Heuristics. Publication 933, Centre de recherche sur les transports, Université de Montréal

  8. Gendron B, Crainic TG (1995) A Branch-and-Bound Algorithm for Depot Location and Container Flat Management. Location Science (to appear)

  9. Glover F (1986) Future Paths for Integer Programming and Links to Artificial Intelligence. Comput Oper Res 1(3):533–549

    Google Scholar 

  10. Glover F (1989) Tabu Search — Part I. ORSA J Comput 1(3):190–206

    Google Scholar 

  11. Glover F (1990) Tabu Search — Part II. ORSA J Comput 2(1):4–32

    Google Scholar 

  12. Glover F (1990) Tabu Search: A Tutorial. Interfaces 20(4):74–94

    Google Scholar 

  13. Glover F, Laguna M (1993) Tabu search. In C.R. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, London

    Google Scholar 

  14. Glover F, Taillard E, de Werra D (1993) A user's guide to tabu search. Ann Oper Res 41:3–28

    Google Scholar 

  15. Malek M, Guruswamy M, Pandya M, Owens H (1989) Serial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem. Ann Oper Res 21:59–84

    Google Scholar 

  16. Grigoriadis MD, Hsu T (1979) RNET — The Rutgers Minimum Cost Network Flow Subroutines. Technical report, Rutgers University, New Brunswick, New Jersey

    Google Scholar 

  17. Taillard E (1991) Robust Taboo Search for the Quadratic Assignment Problem. Parallel Comput 17:443–455

    Google Scholar 

  18. Taillard E (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661–673

    Google Scholar 

  19. Trienekens HWJM, de Bruin A (1992) Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam

  20. Voß S (1993) Tabu search: Applications and prospects. In: D-Z Du, PM Pardalos, (eds) Network Optimization Problems, World Scientific, Singapore, pp 333–353

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports, Université de Montréal, Succ Centre-ville, CP 6128, H3C3J7, Montreal, Quebec, Canada

    Teodor Gabriel Crainic, Michel Toulouse & Michel Gendreau

Authors
  1. Teodor Gabriel Crainic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Toulouse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crainic, T.G., Toulouse, M. & Gendreau, M. Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum 17, 113–123 (1995). https://doi.org/10.1007/BF01719254

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Schlüsselwörter

Search

Navigation