Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 27-46

  Bourbeau, Benoît ^a   Gabriel Crainic, Teodor ^a,b   Gendron, Bernard ^a,c  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^c Dept d'Info Rech Operationnelle ^*  (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FLEET OPERATIONS; MICROPROCESSOR CHIPS; OPTIMIZATION;

MULTICOMMODITY LOCATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0343168007     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00094-0     Document Type: Article

References (22)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice-Hall, Englewood Cliffs, MA.
2. G.M. Amdahl, Validity of the single processor approach to achieving large scale computing capabilities, in: AFIPS Conference Proceedings, 1967, pp. 483-485.
3. G. Authié, M. Elkihel, F. Viader, A parallel best-first branch-and-bound algorithm for 0-1 problems: single pool and multiple pool implementations, Report LAAS 96155, Laboratoire d'analyse et d'architecture des systèmes, CNRS, Toulouse, 1996.
4. B. Bourbeau, Approches de parallélisation basées sur l'organisation de la mémoire pour des méthodes de séparation et évaluation progressive, M.Sc. Thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, publication CRT-98-18, Centre de recherche sur les transports, Montréal, 1998.
5. J. Clausen, M. Perregaard, On the best search strategy in parallel branch-and-bound - best-first search vs. lazy depth-first-search, Annals of Operations Research 90 (1999) 1-17.
6. G. Cornuéjols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: R.L. Francis, P.B. Mirchandani (Eds.), Discrete Location Theory, Wiley/Interscience, New York, 1990, pp. 119-168.
7. Crainic T.G., Dejax P.J., Delorme L. Models for multimode multicommodity location problems with interdepot balancing requirements. Annals of Operations Research. 18:1989;279-302.
8. Crainic T.G., Delorme L., Dejax P.J. A branch-and-bound method for multicommodity location with balancing requirements. European Journal of Operational Research. 65(3):1993;368-382.
9. Eckstein J. Distributed versus centralized storage and control for parallel branch and bound: mixed integer programming on the CM-5. Computational Optimization and Applications. 7(2):1997;199-220.
10. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research. 26(6):1978;992-1009.
11. Gendron B., Crainic T.G. Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements. INFOR. 31(3):1993;151-165.
12. Gendron B., Crainic T.G. Parallel branch-and-bound algorithms: survey and synthesis. Operations Research. 42(6):1994;1042-1066.
13. Gendron B., Crainic T.G. A branch-and-bound algorithm for depot location and container fleet management. Location Science. 3(1):1995;39-53.
14. Gendron B., Crainic T.G. A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Computers and Operations Research. 24(9):1997;829-847.
15. B. Gendron, T.G. Crainic, A. Frangioni, Multicommodity capacitated network design, in: B. Sansó, P. Soriano (Eds.), Telecommunications Network Planning, Kluwer Academics Publishers, Dordrecht, 1998, pp. 1-19.
16. Ibaraki T. Enumerative approaches to combinatorial optimization. Annals of Operations Research. 1987;10-11.
17. Krarup J., Pruzan P.M. The simple plant location problem: survey and synthesis. European Journal of Operational Research. 12:1983;36-81.
18. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science. 18(1):1984;1-55.
19. McKeown G.P., Rayward-Smith V.J., Turpin H.J. Branch-and-bound as a higher-order function. Annals of Operations Research. 33:1991;379-402.
20. Minoux M. Network synthesis and optimum network design problems: models, solution methods and applications. Networks. 19:1989;313-360.
21. J. Mohan, A study in parallel computation: the traveling salesman problem, Report CMU-CS-82-136(R), Computer Science Department, Carnegie-Mellon University, Pittsburgh, 1982.
22. Quinn M.J. Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer. IEEE Transactions on Computers. 39(3):1990;384-387.