Skip to main content
Log in

Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements

  • Tabu Search
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We study and compare asynchronous parallelization strategies for tabu search, and evaluate the impact on performance and solution quality of some important algorithmic design parameters: 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.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Chakrapani and J. Skorin-Kapov, A connectionist approach to the quadratic assignment problem, Computers and Operations Research 19(1992)287–295.

    Article  Google Scholar 

  2. J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Annals of Operations Research 41(1993)327–341.

    Article  Google Scholar 

  3. T.G. Crainic, P.J. Dejax and L. Delorme, Models for multimode multicommodity location problems with interdepot balancing requirements, Annals of Operations Research 18(1989)279–302.

    Article  Google Scholar 

  4. T.G. Crainic, L. Delorme and P.J. Dejax, A branch-and-bound method for multicommodity location with balancing requirements, European Journal of Operational Research 65(1993)368–382.

    Article  Google Scholar 

  5. T.G. Crainic, M. Gendreau, P. Soriano and M. Toulouse, A tabu search procedure for multi-commodity location/allocation with balancing requirements, Annals of Operations Research 41(1993)359–383.

    Article  Google Scholar 

  6. T.G. Crainic, M. Toulouse and M. Gendreau, Towards a taxonomy of parallel tabu search algorithms, INFORMS Journal on Computing (1996), forthcoming.

  7. T.G. Crainic, M. Toulouse and M. Gendreau, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, OR Spektrum 17(1995)113–123.

    Article  Google Scholar 

  8. B. Gendron and T.G. Crainic, A branch-and-bound algorithm for depot location and container fleet management, Location Science 3(1995)39–53.

    Article  Google Scholar 

  9. F. Glover, Tabu search - Part I, ORSA Journal on Computing 1(1989)190–206.

    Google Scholar 

  10. F. Glover, Tabu search - Part II, ORSA Journal on Computing 2(1990)4–32.

    Google Scholar 

  11. F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74–94.

    Google Scholar 

  12. F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems (1992).

  13. M. Malek, M. Guruswamy, M. Pandya and H. Owens, Serial and parallel simulated annealing and tabu search algorithm for the Traveling Salesman Problem, Annals of Operations Research 21(1989)59–84.

    Article  Google Scholar 

  14. M.D. Grigoriadis and T. Hsu, RNET — The Rutgers minimum cost network flow subroutines, Technical Report, Rutgers University, New Brunswick, NJ (1979).

    Google Scholar 

  15. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Computing 17(1991)443–455.

    Article  Google Scholar 

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

    Google Scholar 

  17. E. Taillard, Parallel taboo search techniques for the job shop scheduling problem, ORSA Journal on Computing 6(1994)108–117.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crainic, T.G., Toulouse, M. & Gendreau, M. Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements. Ann Oper Res 63, 277–299 (1996). https://doi.org/10.1007/BF02125458

Download citation

  • Issue Date:

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

Keywords

Navigation