SYNCHRONOUS TABU SEARCH PARALLELIZATION STRATEGIES FOR MULTICOMMODITY LOCATION-ALLOCATION WITH BALANCING REQUIREMENTS - REVISED EDITION

Tabu search is an adaptive search technique that aims to explore the solution space intelligently in search of good, and hopefully optimal, solutions. Parallel computer architectures offer the possibility to design procedures that explore the solution space more efficiently. This study examines and compares synchronous parallelization strategies for tabu search. It identifies the most promising parallelization approaches and evaluates the impact on performance and solution quality of some important algorithmic design parameters, including length of the synchronization steps, number of processors, and handling of exchanged information. The authors implement parallelization approaches and compare these applications by using a tabu search algorithm for multicommodity location-allocation problems with balancing requirements.

  • Corporate Authors:

    University of Montreal

    Center for Research on Transportation (CRT)/CIRRELT
    P.O. Box 6128, Station Centre-ville
    Montreal, Quebec  Canada  H3C 3J7
  • Authors:
    • Crainic, T G
    • Toulouse, M
    • Gendreau, M
  • Publication Date: 1995

Language

  • English

Media Info

  • Pagination: 30 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00719127
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 16 1996 12:00AM