Abstract
We will consider some optimization problems arising in air pollution modeling. An analogy with similar optimization problems, which can be formulated as Quadratic Optimization and Mixed Integer Linear Programming problems and arising in placement of components on a Printed Circuit Board (PCB) under different geometrical and technological constraints, will be made. We will also describe an efficient parallel Branch and Bound (B&B) algorithms to solve these MILP problems in a MIMD distributed memory environment. The algorithms are scalable and run on a cluster of workstations under PVM. The efficiency of the algorithms has been investigated and the test results on some placement tasks and from MIPLIB library are presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alonso, J. L., Schmidt, H. and Alexandrov, V. (1997) Parallel Branch and Bound Algorithms for Integer and Mixed Integer Linear Programming Problems under PVM, in M. Bubak, J. Dongarra and J. Wasniewski (eds), Recent Advances in Parallel Virtual Machine and Message Passing Interface, LNCS No 1332, Springer, Berlin, pp. 313–320.
. Alonso, J. L., Schmidt, H., Alexandrov, V. and Stube, B. (1998) High Quality PCB Placement using Parallel B&B Algorithms for M1LP, submitted to Parallel Computing.
Babayev, D. A. and Mardanov, S. S., (1994) Reducing the Number of Variables in Integer and Linear Programming Problems, Computational Optimization and Applications, 3, 99–109.
. Bixby, R. E., Cook, D., Cox, D. D. and Lee, T. (1996) Computational Experience with Parallel Mixed Integer Programming in a Distributed Environment, Annals of Operations Research.
Eckstein, J. (1993) Parallel Branch-and-Bound Algorithm for General Integer Programming on the CM-5, TMC-257, Thinking Machines Corporation.
Ferreira, A. and Pardalos P. (1996) Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science, No 1054, Springer, Berlin.
Gendron, B. and Crainic, T. G. (1994) Parallel Branch and Bound algorithms: survey and synthesis, Operations Research, 42, 1042–1066.
Kleinhans, J. M., Sigl, G., Johannes, F. M. and Artreich K. J. (1991) GORDIAN: VLSI placement by quadratic programming and slicing optimization, IEEE Transactions on CAD, 10(3), 356–365.
Laursen, P. S. (1993) Simple Approaches to Parallel Branch and Bound, Parallel Computing, 19, 143–152.
Nemhauser, G. L. and Wolsey, L. A. (1988) Integer and Combinatorial Optimization, John Wiley and Sons, 1988.
Stube, B. and Schmidt, H. (1997) A Multi-Method Approach to PCB Placement under EMC and Thermal Constraints, in Proceedings of the Workshop on EMC-Adequate Design of Systems and Components at 12th International Zurich Symposium on Electromagnetic Compatibility (in Supplement), pp. 205–212.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Alonso, J.L., Alexandrov, V.N. (1999). Parallel Algorithms for Some Optimization Problems Arising in Air Pollution Modeling. In: Zlatev, Z., et al. Large Scale Computations in Air Pollution Modelling. NATO Science Series, vol 57. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4570-1_1
Download citation
DOI: https://doi.org/10.1007/978-94-011-4570-1_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-5678-3
Online ISBN: 978-94-011-4570-1
eBook Packages: Springer Book Archive