PARALLEL IMPLEMENTATIONS OF A BRANCH-AND-BOUND ALGORITHM FOR MULTICOMMODITY LOCATION WITH BALANCING REQUIREMENTS

This paper presents two parallel branch-and-bound algorithms for the multicommodity location problem with balancing requirements. The first algorithm implements a master-slave approach in order to perform a parallel exploration of the search tree. The second algorithm decomposes the problem in order to compute the lower bounds in parallel. The authors realize implementations of these algorithms on a PC-based network of Transputers. Experimental results are reported and analyzed. (A)

  • Corporate Authors:

    CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

    C.P. 6128, SUCCURSALE A
    MONTREAL, QUEBEC  Canada  H3C 3J7
  • Authors:
    • Gendron, B
    • Crainic, T G
  • Publication Date: 1992

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00674443
  • Record Type: Publication
  • Source Agency: Transportation Association of Canada (TAC)
  • Files: ITRD
  • Created Date: Mar 8 1995 12:00AM