Abstract
In this paper we develop and implement a parallel algorithm for a real-world application: finding optimal designs for multi-product batch plants. We describe two parallelization strategies – for systems with shared-memory and distributed-memory – based on the branch-and-bound paradigm and implement them using OpenMP (Open Multi-Processing) and MPI (Message Passing Interface), correspondingly. Experimental results demonstrate that our approach provides competitive speedup on modern clusters of multi-core processors.
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
Aida, K., Natsume, W., Futakata, Y.: Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm. In: Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2003), pp. 156–164 (2003)
Bouziane, H.L., Pérez, C., Priol, T.: Extending software component models with the master-worker paradigm. Parallel Computing 36(2-3), 86–103 (2010)
Brassard, G., Bratley, P.: Fundamentals of Algorithmics. Prentice-Hall, Englewood Cliffs (1996)
Cauley, S., Balakrishnan, V., Hu, Y.C., Koh, C.K.: A parallel branch-and-cut approach for detailed placement. ACM Transactions on Design Automation of Electronic Systems (TODAES) 16(2), 18:1–18:19 (2011)
El Hamzaoui, Y., Hernandez, J., Cruz-Chavez, M., Bassam, A.: Search for Optimal Design of Multiproduct Batch Plants under Uncertain Demand using Gaussian Process Modeling Solved by Heuristics Methods. Berkeley Electronic Press (2010)
Gendron, B., Crainic, T.G.: Parallel branch-and-bound algorithms: Survey and synthesis. Operations Research 42(6), 1042–1066 (1994)
Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, Design and Analysis of Algorithms, 2nd edn. Addison-Wesley, Reading (2003)
Leyffer, S., Linderoth, J., Luedtke, J., Miller, A., Munson, T.: Applications and algorithms for mixed integer nonlinear programming. Journal of Physics: Conference Series 180(1), 12–14 (2009)
Malygin, E., Karpushkin, S., Borisenko, A.: A mathematical model of the functioning of multiproduct chemical engineering systems. Theoretical Foundations of Chemical Engineering 39(4), 429–439 (2005)
Mansa, B., Roucairol, C.: Performances of parallel branch and bound algorithms with best-first search. Discrete Applied Mathematics 66(1), 57–74 (1996)
Martí, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. European Journal of Operational Research 200(1), 36–44 (2010)
Message Passing Interface Forum: Message Passing Interface Standards Documents, http://www.mpi-forum.org
Moreno, M.S., Montagna, J.M.: Multiproduct batch plants design using linear process performance models. American Institute of Chemical Engineer Journal 57(1), 122–135 (2011)
OpenMP Architecture Review Board: The OpenMP API specification for parallel programming, http://www.openmp.org
Ponsich, A., Azzaro-Pantel, C., Domenech, S., Pibouleau, L.: Mixed-integer nonlinear programming optimization strategies for batch plant design problems. Industrial & Engineering Chemistry Research 46(3), 854–863 (2007)
Rasmussen, M., Stolpe, M.: Global optimization of discrete truss topology design problems using a parallel cut-and-branch method. Computers & Structures 86(13-14), 1527–1538 (2008)
Rebennack, S., Kallrath, J., Pardalos, P.M.: Optimal storage design for a multi-product plant: A non-convex minlp formulation. Computers & Chemical Engineering 35(2), 255–271 (2011)
Reinefeld, A., Schnecke, V.: Work-load balancing in highly parallel depth-first search. In: Scalable High-Performance Computing Conference, pp. 773–780 (1994)
Sanders, P.: Better algorithms for parallel backtracking. In: Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1995. LNCS, vol. 980, pp. 333–347. Springer, Heidelberg (1995)
Wang, Z., Jia, X.P., Shi, L.: Optimization of multi-product batch plant design under uncertainty with environmental considerations. Clean Technologies and Environmental Policy 12, 273–282 (2010)
Zhou, J., Yu, K.M., Lin, C., Shih, K.C., Tang, C.: Balanced multi-process parallel algorithm for chemical compound inference with given path frequencies. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol. 6082, pp. 178–187. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borisenko, A., Kegel, P., Gorlatch, S. (2011). Optimal Design of Multi-product Batch Plants Using a Parallel Branch-and-Bound Method. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2011. Lecture Notes in Computer Science, vol 6873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23178-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-23178-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23177-3
Online ISBN: 978-3-642-23178-0
eBook Packages: Computer ScienceComputer Science (R0)