Abstract
A manufacturing system consists of operating units converting materials of different properties into further materials. In a design problem we are to find a suitable network of operating units which produces the desired products from the given raw materials. By considering this network design from a structural point of view, we obtain a combinatorial optimization problem called the Process Network Synthesis or (PNS) problem. It is known that the PNS problem is NP-complete. In this work two heuristic algorithms are presented for solving this problem. Moreover, we establish some worst-case bound theorems for the algorithms under consideration, and we present an empirical analysis on randomly generated PNS problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bellore, S. Goldwasser, C. Lund, A. Russel, Efficient probabilistically checkable proofs and applications to approximation, Proc. of 25-th STOL, 1993, 294–304.
Blázsik, Z. and B. Imreh, A note on connection between PNS and set covering problems, Acta Cybernetica 12, 1996, 309–312.
V. Chvatal, V., A Greedy Heuristic for the Set-Covering Problem, Math. Oper. Res. 4 (1979) 233–235.
Fiilöp, J., B. Imreh, F. Friedler, On the reformulation of some classes of PNS problems as set covering problems, Acta Cybernetics, 13 (1998),329–337.
F. Friedler, L. T. Fan, B. Imreh, Process Network Synthesis: Problem Definition, Networks 28 (1998), 119–124.
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis: Axioms and Theorems, Chem. Eng. Sci. 47(8) (1992), 1973–1988.
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Combinatorial Algorithms for Process Synthesis, Computer chem. Engng. 16 (1992), 313–320.
Friedler, F., K. Tarján, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis: Polynomial Algorithm for maximal structure generation, Computer chem. Engng. 17 (1993), 924–942.
Garey, M. R., D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman & Co, San Francisco, 1979.
Imreh, B., F. Friedler, L. T. Fan, An Algorithm for Improving the Bounding Procedure in Solving Process Network Synthesis by a Branch-and-Bound Method Developments in Global Optimization, editors: I. M. Bonze, T. Csendes, R. Horst, P. M. Pardalos, Kluwer Academic Publisher, Dordrecht, Boston, London, 1996, 301–348.
B. Imreh, J. Fiilöp, F. Friedler, A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems, Acta Cybernetica 14 (2000), 497–501.
Imreh, B., G. Magyar, Empirical Analysis of Some Procedures for Solving Process Network Synthesis Problem, Journal of Computing and Information Technology-CIT 6 (1998), 373–382.
Papadimitriou, C. H., K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this chapter
Cite this chapter
Blázsik, Z., Holló, C., Imreh, C., Kovács, Z. (2001). Heuristics for the Process Network Synthesis Problem. In: Giannessi, F., Pardalos, P., Rapcsák, T. (eds) Optimization Theory. Applied Optimization, vol 59. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0295-7_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0295-7_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-0009-6
Online ISBN: 978-1-4613-0295-7
eBook Packages: Springer Book Archive