Advertisement

Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis

  • F. Friedler
  • J. B. Varga
  • E. Fehér
  • L. T. Fan
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 7)

Abstract

Process network synthesis (PNS) has enormous practical impact; however, its mixed integer programming (MIP) model is tedious to solve because it usually involves a large number of binary variables. The present work elucidates the recently proposed accelerated branch-and- bound algorithm that exploits the unique feature of the MIP model of PNS. Implementation of the algorithm is based on the so-called decision-mapping that consistently organizes the system of complex decisions. The accelerated branch-and-bound algorithm of PNS reduces both the number and size of the partial problems. The efficacy of the algorithm is demonstrated with a realistic example.

Keywords

Process network synthesis mixed integer programming branch-and-bound combinatorial acceleration 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Floudas, C. A. and I. E. Grossmann, Algorithmic Approaches to Process Synthesis: Logic and Global Optimization, International Symposium on Foundations of Computer Aided Process Design, Snowmass Village, CO, U.S.A., July 10–15, 1994 (in press).Google Scholar
  2. 2.
    Floudas, C. A. and P. M. Pardalos, A Collection of Test Problems for Constrained Global Optimization Algorithms, In: Lecture Notes in Computer Science ( Eds: G. Goos and J. Hartmanis) Springer-Verlag, 1990.Google Scholar
  3. 3.
    Friedler, F., L. T. Fan, and B. Imreh, Process Network Synthesis: Problem Definition, accepted for publication in Networks, 1995.Google Scholar
  4. 4.
    Friedler, F., K. Tarjan, Y. W. Huang, and L. T. Fan, Combinatorial Algorithms for Process Synthesis, ESCAPE-1 Conference, Elsinore, Denmark, May 24–28, 1992; Computers chem. Engng, 16, Suppl., S313–20, 1992.Google Scholar
  5. 5.
    Friedler, F., K. Tarjan, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis: Axioms and Theorems, Chem. Eng. Sci., 47 (8), 1973–1988, 1992.CrossRefGoogle Scholar
  6. 6.
    Friedler, F., K. Tarjan, Y. W. Huang, and L. T. Fan, Graph-Theoretic Approach to Process Synthesis; Polynomial Algorithm for Maximal Structure Generation, Computers chem. Engng, 17 (9), 929–942, 1993.CrossRefGoogle Scholar
  7. 7.
    Friedler, F., J. B. Varga, and L. T. Fan, Decision-Mapping: A Tool for Consistent and Complete Decisions in Process Synthesis, accepted for publication in Chem. Engng Sci., 1995.Google Scholar
  8. 8.
    Friedler, F., J. B. Varga, and L. T. Fan, Decision-Mapping for Design and Synthesis of Chemical Processes: Application to Reactor-Network Synthesis, International Symposium on Foundations of Computer Aided Process Design, Snowmass Village, CO, U.S.A., July 10–15, 1994 (in press).Google Scholar
  9. 9.
    Grossmann, I. E., V. T. Voudouris, O. Ghattas, Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems, In: Recent Advances in Global Optimization (Eds: C. A. Floudas and P. M. Pardalos) Princeton University Press, New Jersey, 1992.Google Scholar
  10. 10.
    Guisewite, G. M, Network Problems, In: Handbook of Global Optimization, Nonconvex Optimization and Its Applications, 2, (Eds: R. Horst and P. M. Pardalos) Kluwer Academic Publishers, Dordrecht/Boston/London, pp. 609–648, 1995.Google Scholar
  11. 11.
    Ibaraki, T., Theoretical Comparisons of Search Strategies in Branch-and-Bound Algorithms, Journal of Computer and Information Science, 5, 315–344, 1976.MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Lawler, E. L. and D. E. Wood, Branch-and-Bound Methods: A Survey, Operations Research, 14 (4), 699–719, 1966.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Voudouris, V. T. and I. E. Grossmann, Optimal Synthesis of Multiproduct Batch Plants with Cyclic Scheduling and Inventory Considerations, Ind. Eng. Chem. Res., 32, 1962–1980, 1993.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • F. Friedler
    • 1
    • 2
    • 3
  • J. B. Varga
    • 1
  • E. Fehér
    • 1
  • L. T. Fan
    • 4
  1. 1.Department of Computer ScienceUniversity of VeszprémVeszprémHungary
  2. 2.Department of Chemical EngineeringKansas State UniversityManhattanUSA
  3. 3.Department of Systems Engineering, Research Institute of Chemical EngineeringHungarian Academy of SciencesVeszprémHungary
  4. 4.Department of Chemical EngineeringKansas State UniversityManhattanUSA

Personalised recommendations