Parallel processing for difficult combinatorial optimization problems

European Journal of Operational Research

Volumn 92, Issue 3, 1996, Pages 573-590

  Roucairol, Catherine ^a  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Branch and bound; Combinatorial optimization; Metaheuristics; Parallel algorithms

Indexed keywords

COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING;

BRANCH AND BOUND METHOD; METAHEURISTICS;

PARALLEL PROCESSING SYSTEMS;

EID: 0030576458     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00009-4     Document Type: Article

References (109)

1. Aarts, E.H.L. and Korst, J.H.M., Simulated Annealing and Boltzmann Machines, Wiley, Chichester, 1989.
2. Abramson, D., "Constructing school time tables using simulated annealing: Sequential and parallel algorithms", Management Science 37 (1991) 98-113.
3. Allwright, J.A., and Carpenter, D.B., "A distributed implementation of simulated annealing for the travelling salesman problem", Parallel Computing 10 (1989) 335-338.
4. Arvindam, S., Kumar, V., and Rao, U.N., "Efficient parallel algorithms for search problems: Applications in VLSI CAD", in: Proc. 3rd Symp. of Massively parallel computation, 1990.
5. August, N., and Mautor, T., "Méthodes de recherche tabou massivement parallèle pour le problème d'affectation quadratique", Tech. Rep. INRIA 2182, Rocquencourt, France, 1994.
6. Authié, G., Ferreira, A., Roch, J.L., Villard, G., Roman, J., Roucairol, C., and Virot, B., Algorithmes Parallèles: Analyse et Conception, Hermès, France, 1994.
7. Beasley, J.E., "Supercomputers and OR", Journal of the Operations Research Society 38/11 (1987) 1085-1089.
8. Benaïchouche, M., Dowaji, S., Le Cun, B., Mautor, T., Roucairol, C., "BoB: A unified platform for implementing Branch and Bound like algorithms", Tech. Rep., Univ. Versailles, PRiSM 95/16 Paris, France, 1995.
9. Bertocchi, M., and Sergi, P., "Parallel global optimization over continuous domain by simulated annealing", in: P. Messina and A Murli (eds.), Proceedings of Parallel computing: Problems, Methods and Applications, Elsevier Science Publishers, Amsterdam, 1992, 87-97.
10. Bierwirth, C., and Stöppier, S., "The application of parallel genetic algorithm to the n/m/P/Cmax flowshop problem", in: G. Fandel, Th. Gulledge and A. Jones (eds.) New Directions for Operations Research in Manufacturing, Springer, Berlin, 1992.
11. Bixby, R., "Two applications in linear programming", in: Proc. of Workshop on Parallel Computing of Discrete Optimization Problems, Univ. Minneapolis-AHPC, 1991.
12. Bœhning, R.L., Butler, R.M., and Gillett, B.E., "A parallel integer linear programming algorithm", European Journal of Operational Research 34 (1988) 393-398.
13. Brown, D., Huntley, C., and Spillane, A., "A parallel genetic heuristic for the quadratic assignment problem", in: Proc. on conference on genetic algorithms, Arlington, VA, 1989, 406-415.
14. Burton, F.W., McKeown, G.P., Rayward-Smith, V.J., and Sleep, M.R., "Parallel processing and combinatorial optimization", in: L.B. Wilson, C.S. Edwards and V.J. Rayward-Smith (eds.), Combinatorial Optimization III, Univ. of Stirling, UK, 1982, 19-36.
15. Cannon, T.L., and Hoffman, K.L., "Large-scale 0-1 Linear Programming on distributed workstations", Annals of Operations Research 22 (1990) 181-217.
16. Chakrapani, J., and Skorin-Karpov, J., "Massively parallel tabu search for the quadratic assignment problem", Annals of Operations Research 41 (1993) 327-341.
17. Ciriani, T., "A Branch and Bound library", ECCO VI, European Chapter on Combinatorial Optimization, Brussels, 1993.
18. Clausen, J., and Träff, J.L., "Implementation of parallel branch and bound algorithms: Experiences with the graph partitioning problem", Annals of Operations Research 33 (1991) 331-349.
19. Crainic, T.G., Toulouse, M., and Gendreau, M., "Towards a taxonomy of parallel tabu search algorithms", Tech. Rep. CRT-933, Centre de Recherche sur les transports, Université de Montréal, Canada, 1993.
20. Crouse, J., and Pardalos, P., "A parallel algorithm for the quadratic assignment problem", in: Proc. of Supercomputing 89, ACM, 1989, 351-360.
21. Cung, V.-D., and Roucairol, C., "Parcours parallèle d'arbres minimax", Tech. Rep. INRIA 1549, Rocquencourt, France, 1991.
22. Cung, V.D., "Contribution à l'algorithmique non numérique parallèle: Exploration d'espaces de recherche", Thèse Univ. Paris 6, Paris, France, 1994.
23. Dehne, F., Ferreira, A., and Rau Chaplin, A., "Parallel Branch and Bound on fine grained hypercubes multiprocessors", Parallel Computing 15/1-3 (1990) 201-209.
24. Deo, N., "Data structures for parallel computation on shared memory machines", in: J.S. Kowalik (ed.), Supercomputing 89, NATO ASI Series Vol. F62, Springer, Berlin, 1990, 341-345.
25. Diamond, M.J., Kimbel, C., Rennolet, C.L., and Ross, S.E., "PICO: Parallel implementation of Combinatorial Optimization", Workshop on Parallel Computing of Discrete Optimization Problems, Univ. Minneapolis-AHPC, 1991.
26. Dowadji, S., "Equilibrage des tâches: Un état de l'art", Tech. Rep., Univ. Paris 6, MASI 101, Paris, 1992.
27. Eckstein, J., "Parallel Branch and Bound algorithms for general mixed integer programming on the CM 5", Tech. Rep., Thinking Machine Corporation TMC-257, 1993.
28. El Dessouki, O., and Huen, W.H., "Distributed enumeration on networks computers", IEEE Transactions on Computers 29 (1980) 818-825.
29. Finkel, R., and Manber, U., "DIB - A distributed implementation of backtracking", ACM Transactions on Programming Language Systems 9 (1987) 235-256.
30. Geist, A., et al., "PVM 3.0 User guide and reference manual", Tech. Rep. No. ORNL/TM-12187, Oak Ridge National Laboratory, 1993.
31. Gendron, B., and Crainic, T.C., "Parallel implementations of a Branch and Bound algorithm for Multicommodity location with balancing requirements", Tech. Rep. CRT-813, CRT, Univ. Montréal, Canada, 1992.
32. Gendron, B., and Crainic, T.C., "Parallel Branch and Bound algorithms: A survey and synthesis", Operations Research 42, 1042-1066.
33. Gengler, M., and Coray, G., "A parallel best first B & B with synchronization phases, in: L. Bougé, M. Cosnard, Y. Robert, D. Trystram (eds.), Proc. of CONPAR 92, Series, LNCS 634, Springer, Berlin, 1992, 515-526.
34. Greening, D.R., "Parallel simulated annealing techniques", Physica D 42 (1990) 293-306.
35. Imaï, M., and Fukuruma, T., "A parallelized Branch and Bound algorithms implementation and efficiency", Systems Computers Controls 10/3 (1979) 62-70.
36. Jones, D.W., "Concurrent operations on priority queues", Communications of the ACM 32/1 (1989) 132-137.
37. Karp, R.M., and Ramachandran, V., "A survey of parallel algorithms for shared memory machines", Tech. Rep UCB/CSD 88/408, Univ. of California, Berkeley, CA, 1988.
38. Karp, R.M., and Zhang, Y., "A randomized parallel Branch and Bound procedure", in: Proc. of ACM Symposium on Theory of Computing, 1988, 290-300.
39. Kindervater, G.A.P., and Lenstra, J.K., "Parallel algorithms", in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Combinatorial Optimization: Annoted Bibliographies, Wiley, New York, 1985, 106-128.
40. Kindervater, G.A.P., and Lenstra, J.K., "Parallel computing in combinatorial optimization", Annals of Operations Research 14 (1988) 245-289.
41. Kindervater, G.A.P., Lenstra, J.K., and Rinnooy Kan, A.H.G., "Perspectives on parallel computing", Operations Research 37/6 (1989) 985-990.
42. Kindervater, G.A.P., "A virtual parallel B & B machine", Workshop Parallel Processing of Discrete Optimization Problems, Dimacs center, Rutgers, New Brunswick, 1994.
43. Kröger, B., and Vornberger, O.,"A parallel Branch and Bound approach for solving a two dimensional cutting stock problem", Tech. Rep., Dept. of Math, and computer Sc., Univ. of Osnabruck, Germany, 1990.
44. Kudva, G.K., and Pekny, J.F., "DCABB: A distributed control architecture for B & B computations", ORSA/ TIMS Conference, Phoenix, AZ, 1993.
45. Kumar, V., and Kanal, L., "Parallel Branch and Bound formulations for AND/OR tree search", IEEE Transactions on Pattern Analysis and Machine Intelligence 6/6 (1984) 768-788.
46. Kumar, V., Ramesh, K., and Rao, V.N., "Parallel best-first search of state-space graphs: A summary of results", in: Proc. of the Nat. Conf. on Artificial Intelligence, 1988, 122-126.
47. Kumar, V., Gopalakrishnan, P.S., and Kanal, L., Parallel Algorithms in Machine Intelligence and Vision, Springer, Berlin, 1990.
48. Kumar, V., and Rao, V.N., "Parallel depth-first search, part II: Analysis", International Journal of Parallel Programming 16/6 (1992) 501-519.
49. Kumar, V., and Gupta, A., "Analyzing the scability of parallel algorithms and architectures", Inter. Conf. on Supercomputing, 1991.
50. Lai, T.H., and Sahni, S.,"Anomalies in parallel Branch and Bound algorithms", Communications of the ACM 27 (1984) 594-602.
51. Lai, T.H., and Sprague, A., "Performance of parallel Branch and Bound algorithms", IEEE Transactions on Computers 34 (1985) 962-964.
52. Lavallée, I. and Roucairol, C., "A parallel B & B algorithm", Tech. Rep. LRI No. 164, Univ. Orsay, 1984.
53. Le Cun, B., Mans, B., and Roucairol, C., "Opérations concurrentes et files de priorité", Tech. Rep. INRIA No. 1548, 1991.
54. Le Cun, B., and Cung, V.D., "An efficient implementation of parallel A*", in: Proceedings of Canada-France Conference on Parallel Computing, Montreal, 1994.
55. Li, G.J., and Wah, B.W., "Computational efficiency of parallel approximate Branch and Bound algorithms", in: Proc. Inter. Conf. on Parallel Processing, 1984, 473-480.
56. Lin, Y., and Kumar, V., "An execution model for exploiting AND-parallelism in logic programs", New Generation Computing 5/4 (1988) 393-425.
57. Lüling, R., and Monien, B., Two Strategies for Solving the Vertex Cover Problem on a Transputer Network, Lecture Notes in Computer Science 392, Springer, Berlin, 1989, 160-170.
58. Lüling, R., and Monien, B., "Load balancing for distributed Branch and Bound algorithms", Tech. Rep., Dept of Math. and computer Sc., Univ. of Paderborn, Germany, 1991.
59. Malek, M., Guruswamy, M., Pandya, M., and Owens, H., "Serial and parallel simulated annealing and tabu search algorithms for the Travelling Salesman Problem", Annals of Operations Research 21 (1989) 59-84.
60. Mans, B., "Contribution à l'algorithmique parallèle: Parallélisation des méthodes de recherche arborescente", Ph.D. Thesis, Université Paris VI, France, 1992.
61. Mans, B., Mautor, T., and Roucairol, C., "Recent exact and approximate algorithms for the quadratic assignment problem", in: Proc. of Symposium on Applied Mathematical Programming and modeling, APMOD 93, Budapest, 1993, 395-402.
62. Mans, B., and Roucairol, C., "Performance of parallel Branch and Bound algorithms with best first search", Discrete Applied Mathematics 66 (1996) 57-74.
63. Mans, B., Mautor, T., and Roucairol, C., "A parallel depth first search branch and bound algorithm for the quadratic assignment problem", European Journal of Operational Research 81 (1995) 617-628.
64. Mans, B., and Roucairol, C., "Characterization of data structures for parallel Branch and Bound algorithms", in: Proceedings of the European Congress of Operational Research, EURO'XI, Aix-la-Chapelle, Allemagne, 1991.
65. McKeown, G.P., Rayward-Smith, V.J., and Turpin, H.J., "Branch and Bound as a higher order function", Annals of Operations Research 33 (1991) 379-402.
66. Miller, D.L., and Pekny, J.F., "Exact solution of larger asymmetric travelling salesman problems", Science 251 (1991) 754-761.
67. Miller, D.L., and Pekny, J.F., "Exact distributed algorithms for travelling salesman problems", in: Proc. of Workshop on Parallel Computing of Discrete Optimization Problems, Univ. Minneapolis-AHPC, 1991.
68. Mohan, J., "Experience with two parallel programs solving the travelling salesman problem", IEEE Int. Conf. on parallel processing, 1983, 191-193.
69. Mühlenbein, H., Gorges-Scheutler, M., and Krämer, O., "Evolution algorithm in combinatorial optimization", Parallel Computing 7 (1988) 65-85.
70. Mühlenbein, H., "Evolution in time and space - The parallel genetic algorithm", in: R. Rawlins (ed.), Foundations of Genetic Algorithms, Morgan Kaufmann, 1991, San Mateo, CA, 316-337.
71. Ortega, M., and Troya, J., "Live nodes distributions in parallel Branch and Bound algorithms", Microprocessing and Microprogramming 25, (1989) 301-306.
72. Ortega, M., and Troya, J., "A study of parallel Branch and Bound algorithms with best first search", Parallel Computing 11 (1989) 121-126.
73. Papadimitriou, C.H., and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NY, 1982.
74. Pardalos, P.M., and Rodgers, G.P., "Parallel Branch and Bound algorithms for unconstrained quadratic zero-one programming", in: R. Shandra, B.L. Golden, E. Wasil, O. Balci and W. Stewart (eds.), Impact of Recent Computer Advances in Operational Research, Elsevier Science Publishers, North-Holland, 1989.
75. Pargas, R.P., and Wooster, E.D., "Branch and Bound algorithms on a hypercube", in: Proc. of Conf. on Hypercube Concurrent Computers and Applications, Vol. II, 1988, 1514-1519.
76. Pearl, J., Heuristics, Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA, 1984.
77. Pekny, J.F., Miller, D.L., and McRae, G.J., " Application of a parallel Travelling Salesman problem: Algorithm to nowait flowshop scheduling", Engineering Design Research Center Tech. Rep. 06-51-89, Carnegie Mellon Univ., Pittsburg, 1989.
78. Pekny, J.F., Miller, D.L., and McRae, G.J., "An exact parallel algorithm for scheduling when production costs depend on consecutive system states", Engineering Design Research Center Tech. Rep. 06-52-89, Carnegie Mellon Univ., Pittsburg, 1989.
79. Pekny, J.F., and Miller, D.L., "A parallel Branch and Bound algorithm for solving large asymmetric travelling salesman problems", Mathematical Programming 55 (1992) 17-33.
80. Plateau, G., and Roucairol, C., "A supercomputer algorithms for the 0-1 multiknapsack problem", in: R. Shandra, B.L. Golden, E. Wasil, O. Balci and W. Stewart (eds.), Impact of Recent Computers Advances on Operational Research, Elsevier Science Publishers, North-Holland, 1989, 144-157.
81. Powley, C., Ferguson, C., and Korf, R.E., "Parallel tree search on a SIMD Machine", in: Proc. of the 3rd IEEE Symp. on Parallel and Distributed Processing, Dallas, TX, 1991.
82. Pruul, E., "Parallel processing and a Branch and bound algorithm", M.Sc. Thesis, School of Operations Research and Industrial Engineering, Cornell Univ., Ithaca, NY, 1975.
83. Pruul, E., Nemhauser, G.L., and Rushmeier, R.A., "Branch and Bound and parallel computation: A historical note", Operations Research Letters 7/2 (1988) 65-69.
84. Quinn, M.J., "Implementing best first Branch and Bound algorithms on hypercube multicomputers", in: M. Health (ed.), Hypercube Multiprocessors, SIAM Press, Philadelphia, PA, 1987, 318-326.
85. Quinn, M.J., Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, New York, 1987.
86. Rao, V.N., and Kumar, V., "Concurrent insertions and deletions in a priority queuee", in: IEEE Proc. of Int. Conf. on Parallel Processing, 1988, 207-211.
87. Roussel-Ragot, P., "La méthode du recuit simulé: Accélération et parallélisation", Thèse de l'Université Paris 6, Paris, France, 1990.
88. Rayward-Smith, V.J., Rush, S.A., and McKeown, G.P., "Efficiency consideration in the implementation of parallel Branch and Bound", Tech. Rep., School of Information Systems, Univ. of East Anglia, Norwich, UK, 1991.
89. Reeves, C.R., Modern Heuristic Techniques for Combinatorial Problems, Advanced Topics in Computer Science Series, Blackwell Scientific Publications, Oxford, 1993.
90. Ribeiro, C., "Parallel computer models and combinatorial algorithms", Annals of Discrete Mathematics 31 (1987) 325-364.
91. Roucairol, C., "A parallel Branch and Bound algorithm for the quadratic assignment problem", Discrete Applied Mathematics 18 (1987) 211-225.
92. Roucairol, C., "Parallel computing in combinatorial optimization", Computer Physics Reports 11 (1989) 195-220.
93. Roucairol, C., "Parallel Branch and Bound algorithms: An overview", in: M. Cosnard, Y. Robert, P. Quinton and M. Raynal (eds.), Parallel and Distributed Algorithms, Elsevier Science Publishers, North-Holland, 1988, 153-163.
94. Roucairol, C., "Recherche arborescente en parallèle", Tech. Rep. MASI 90.4, Université Paris 6, Paris, France, 1990.
95. Roucairol, C., "Parallel Branch and Bound on shared memory multiprocessors", Workshop on Parallel Computing of Discrete Optimization Problems, Univ. Minneapolis-AHPC, 1991.
96. Rudolph, G., "Parallel simulated annealing and its relation to evolutionary algorithms", in: Proc. of Symposium on Applied Mathematical Programming and Modeling, APMOD 93, Budapest, 1993, 508-515.
97. Rushmeier, M., and Nemhauser, G., "Performances of a parallel B & B for the set covering problem", Tech. Rep. J 89-02, School of Ind. Eng., Georgia Inst. of Technology, 1989.
98. Saletore, V.A., and Kalé, L.V., "Consistent linear speedups to a first solution in parallel state-space search", in: Proc. of the Nat. Conf. on Artificial Intelligence, 1988, 227-233.
99. Sarkar, U.K., Chakrabarti, P.P., Ghose, S., and De Sarkar, S.C., "Multiple stack Branch and Bound", Information Processing Letters 37 (1991) 43-48.
100. Wei, S., and Kalé, L.V., "A dynamic scheduling strategy for the chare kernel system", in: Proc. Supercomputing 89, 1989, 389-398.
101. Taillard, E., "Robust taboo search for the quadratic assignment problem", Parallel Computing 17 (1991) 443-455.
102. Taillard, E., "Parallel iterative search methods for vehicule routing problems", Tech. Rep. ORWP 92/03, Dept. of Math., Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1992.
103. Talbi, E.G., and Bessière, P., "A parallel genetic algorithm applied to the mapping problem", in: SIAM News, 1991, 12-27.
104. Trienekens, H.W.J.M., "Computational experiments with an asynchronous parallel Branch and Bound algorithm", Tech. Rep. EUR-CS-89-02, Computer Science Dept., Fac. of Economics, Erasmus Univ., Rotterdam, 1989.
105. Tschöke, S., "A portable parallel Branch and Bound library", ECCO VII, European Chapter on Combinatorial Optimization, Milano, 1994.
106. Vornberger, O., "Load balancing in a network of transputers", Second Workshop on Distributed Algorithms, Lecture Notes in Computer Science 312, 1987, 116-126.
107. Voss, S., "Concepts for parallel tabu search", in: Proc. of Symposium on Applied Mathematical Programming and Modeling, APMOD 93, Budapest, 1993, 595-604.
108. Wah, B.W., Li, G.J., and Yu, C.F., "Multiprocessing of combinatorial search problems", IEEE Computers (1985) 93-108.
109. Wah, B.W., and Ma, Y.W., "MANIP - A multicomputer architecture for solving combinatorial extremum search problems", IEEE Transactions on Computers 33/5 (1984) 377-390.