Abstract
This paper presents computational results of the parallelized version of the αBB global optimization algorithm. Important algorithmic and implementational issues are discussed and their impact on the design of parallel branch and bound methods is analyzed. These issues include selection of the appropriate architecture, communication patterns, frequency of communication, and termination detection. The approach is demonstrated with a variety of computational studies aiming at revealing the various types of behavior of the distributed branch and bound global optimization algorithm can exhibit. These include ideal behavior, speedup, detrimental, and deceleration anomalies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Adjiman, I. Androulakis, and C. Floudas, A global optimization method, αbb, for general twice differentiable nlp’s - ii. implementation and computational results, Computers and Chemical Engineering (in press), (1997).
C. Adjiman, I. Androulakis, and C. Floudas, Global optimization of minlp problems in process synthesis, Computers and Chemical Engineering, S21 (1997), pp. 445–450.
C. Adjiman, S. Dawlling, C. Floudas, and A. Neumaier, A global optimization method, αbb, for genzeral twice differentiable nip’s - i. theoretical advances, Computers and Chemical Engineering (in press), (1997).
C. Adjiman and C. Floudas, Rigorous convex underestimators for general twice-differentiable problems, Journal of Global Optimization, 9 (1996), pp. 23–40.
I. Androulakis, C. Maranas, and C. Floudas, abb: A global optimization method for general constrained nonconvex problems, Journal of Global Optimization, 7 (1995), pp. 337–363.
I. Androulakis, C. Maranas, and C. Floudas,Predicting oligopeptide conformations via deterministic optimization, Jour-nal of Global Optimization, 11 (1997), pp. 1–34.
I. Androulakis and G. Reklaitis, Analysis of the spurious behavior of asynchronous relaxation algorithms, Computers and Chemical Engineering, 123 (1994), pp. 456–789.
I. Androulakis, V. Visweswaran, and C. Floudas, Distributed decomposition based approaches in global optimization, in State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P. Pardalos, eds., Kluwer Academic Publishers: Book Series on Nonconvex Optimization and its Applications, 1996, pp. 285–302.
D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computing, Prentice Hall, 1989.
E. Dijkstra, W. Feijen, and A. Van Gasteren, Derivation of a termination detection algorithm for distributed computations, Information Processing Letters, 16 (1983), pp. 217–219.
E. Dijkstra and C. Scholten, Termination detection for diffusing computations,Information Processing Letters, 11 (1980), pp. 1–6.
J. Eckstein, Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5, Thinking Machines Corporation Technical Report TMC-257, 1993.
C. Floudas, Deterministic global optimization in design, control and computational chemistry, in IMA Proceedings: Large Scale Optimization with Applications. Part II: Optimal Design and Control, L. Biegler, A. Conn, L. Coleman, and F. Santosa, eds., Springer-Verlag, 1995, pp. 129–184.
C. Floudas, Nonlinear and Mixed Integer Optimization: Fundamentals and Applica- tions, Oxford University Press, 1995.
C. Floudas and I. Grossmann, Algorithmic approaches to process synthesis: Logic and global optimization,in Proceedings of FOCAPD’94, M. Doherty and L. Biegler, eds., 1995, pp. 198–221.
C. Floudas and P. Pardalos, A Collection of Test Problems for Constrained Global Optimization Algorithms, Springer-Verlag, 1990.
C. Floudas and P. Pardalos, State of the Art in Global Optimization, Kluwer Academic Publishers, 1996.
B. Gendron and T. Crainic, Parallel branch-and-bound algorithms: Survey and synthesis, Operations Research, 42 (1994), pp. 1042–1066.
I. Grossmann(Editor), Global Optimization in Chemical Engineering, Kluwer Academic Publishers, 1996.
P. Laursen, Simple approaches to parallel branch and bound,Parallel Computing, 19 (1993), pp. 143–152.
G. Li and B. Wah, Coping with anomalies in parallel branch-and-bound algorithms,IEEE Transactions on Computers, 35 (1986), pp. 568–573.
C. Maranas and C. Floudas, Global minimum potential energy conformations of small molecules, Journal of Global Optimization, 4 (1994), pp. 135–170.
P. Pardalos, A. Phillips, and J. Rosen, Topics in Parallel Computing in Mathematical Programming,Science Press, 1992.
P. Pardalos, G. Xue, and P. Panagiotopoulos, Parallel algorithms for global optimization: Methods and techniques,in Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science, vol. 1054, A. Ferreira and P. Pardalos, eds., Springer-Verlag, 1996, pp. 232–247.
J. Pekny and D. Miller, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems,Mathematical Programming, 55 (1992), pp. 17–33.
M. Quinn, Analysis and implementation of branch and bound algorithms on a hypercube multicomputer,IEEE Transactions on Computers, 39 (1990), pp. 384–387.
O. Vorneberg, Transputer networks for operations research, Journal of Microcomputer Applications, 13 (1990), pp. 69–79.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Androulakis, I.P., Floudas, C.A. (1999). Distributed Branch and Bound Algorithms for Global Optimization. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1492-2_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7165-9
Online ISBN: 978-1-4612-1492-2
eBook Packages: Springer Book Archive