Mixed-integer nonlinear programming optimization strategies for batch plant design problems

Industrial and Engineering Chemistry Research

Volumn 46, Issue 3, 2007, Pages 854-863

  Ponsich, Antonin ^a   Azzaro Pantel, Catherine ^a   Domenech, Serge ^a   Pibouleau, Luc ^a  

^a LABORATOIRE DE GÉNIE CHIMIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

BATCH PLANT DESIGN; NONLINEAR FUNCTIONS;

PROCESS CONTROL;

COMPUTATION THEORY; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; PROCESS CONTROL;

EID: 33847254837     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie060733d     Document Type: Article

References (44)

1. Padberg, M.; Rinaldi, G. A branch-and-cut algorithm for the resolution of large scale symmetric travelling salesman problems. SIAM Rev. 1991, 33, 60.
2. Hao, J. K.; Dorne, R. Study of genetic search for the frequency assignment problem. Lecture Notes in Computer Science; Springer-Verlag: New York, 1996; Vol. 1063, p 333.
3. Lee, S.; Grossmann, I. E. Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks. Comput. Chem. Eng. 2003, 27, 1557.
4. Teh, Y. S.; Rangaiah, G. P. Tabu search for global optimization of continuous functions with application to phase equilibrium calculations. Comput. Chem. Eng. 2003, 27, 1665.
5. Jain, A.; Srinivasalu, S. Determination of an optimal unit pulse response function using real-coded genetic algorithms. J. Hydrol. 2005, 303, 199.
6. Zamora, M. Z.; Grossmann, I. E. A global MINLP optimization algorithm for for the synthesis of heat exchanger networks with no stream splits. Comput. Chem. Eng. 1998, 22, 367.
7. Guillén, G.; Badeil, M.; Espuña, A.; Puigjaner, L. Simultaneous optimization of process operations and financial decisions to enhance the integrated planning/scheduling of chemical supply chains. Comput. Chem. Eng. 2006, 30, 421.
8. Ravemark, D. E.; Rippin, D. W. T. Optimal design of a multiproduct batch plant. Comput. Chem. Eng. 1998, 22, 177.
9. Dedieu, S.; Pibouleau, L.; Azzaro-Pantel, C.; Domenech, S. Design and retrofit of multiobjective batch plants via a multicriteria genetic algorithm. Comput. Chem. Eng. 2003, 27, 1723.
10. Montagna, J. M.; Vecchietti, A. R. Retrofit of multiproduct batch plants through generalized disjunctive programming. Math. Comp. Model. 2003, 38, 465.
11. Wolpert, D. H.; Macready, W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1997, 1, 67.
12. Grossmann, I. E. Review of nonlinear mixed-integer and disjunctive programming techniques. Opt. Eng. 2002, 3, 227.
13. Biegler, L. T.; Grossmann, I. E. Retrospective on optimization. Comput. Chem. Eng. 2004, 28, 1169.
14. Hao, J. K.; Galinier, P.; Habib, M. Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contrainte. Rev. Intell. Artif. 1999, 13, 121.
15. Gupta, O. K.; Ravindran, V. Branch and bound experiments in convex nonlinear integer programming. Manage. Sci. 1985, 31 ,1533.
16. Ryoo, H. S.; Sahinidis, N. V. Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 1995, 19, 551.
17. Smith, E. M. B.; Pantelides, C. C. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 1999, 23, 457.
18. Geoffrion, A. M. Generalized benders decomposition. J. Opt. Theory Appl. 1972, 10, 237.
19. Duran, M. A.; Grossmann, I. E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Prog. 1986, 36, 307.
20. Westerlünd, T.; Petterson, F. A cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 1995, 19, S131.
21. Raman, R.; Grossmann, I. E. Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 1994, 18, 563.
22. Brooke, A.; Kendrick, D.; Meeraus, A.; Raman, R. GAMS User's Guide; GAMS Development Corporation: Washington, D.C., 1998.
23. Leyffer, S. User manual for MINLP_BB; University of Dundee Numerical Ananlysis Report NA/XXX: Dundee, UK, 1999.
24. Westerlünd, T.; Lundqvist, K. Alpha-ECP, Version 5.04. An interactive MINLP-solver based on the extended cutting plane method; Report 01-178-A, Process Design Laboratory, Abo Akademi University: Abo, Finlande, 2003.
25. Kirkpatrick, S.; Gelatt S. D., Jr.; Vecchi, M. P. Optimization by simulated annealing. Science 1983, 220, 671.
26. Holland, J. H. Adaptation in natural and artificial systems; University of Michigan Press: Ann Arbor, MI, 1975.
27. Beyer, H. G.; Schwefel, H. P. Evolution Strategies, a comprehensive introduction. Nat. Comp. Int. J. 2002, 1, 3.
28. Yang, Y. W.; Xu, J. F.; Soh, C. K. An evolutionary programming algorithm for continuous global optimization. Eur, J. Oper. Res. 2006, 168, 354.
29. Grossmann, I. E.; Sargent, R. W. H. Optimum design of multipurpose chemical plants. Ind. Eng. Chem. Process Des. Dev. 1979, 18, 343.
30. Kocis, G. R.; Grossmann, I. E. Global optimisation of nonconvex mixed-integer non linear programming (MINLP) problems in process synthesis. Ind. Eng. Chem. Res. 1988, 27, 1407.
31. Modi, A. K.; Karimi, I. A. Design of multiproduct batch processes with finite intermediate storage. Comput. Chem. Eng. 1989, 13, 127.
32. Patel, A. N.; Mah, R. S. H.; Karimi, I. A. Preliminary design of multiproduct non-continuous plants using simulated annealing. Comput. Chem. Eng. 1991, 15, 451.
33. Wang, C.; Quan, H.; Xu, X. Optimal design of multiproduct batch chemical process using genetic algorithms. Ind. Eng. Chem. Res. 1996, 35, 3560.
34. Wang, C.; Quan, H.; Xu, X. Optimal design of multiproduct batch chemical process using tabu search. Comput. Chem. Eng. 1999, 23, 427.
35. Wang, C.; Xin, Z. Ants foraging mechanism in the design of batch chemical process. Ind. Eng. Chem. Res. 2002, 41, 6678.
36. Ponsich, A.; Azzaro-Pantel, C.; Pibouleau, D.; Domenech, S. Constraint handling strategies in genetic algorithms -Application to optimal batch plant design. Chem. Eng. Process., in press.
37. Viswanathan, J.; Grossmann, I. E. A combined penalty function and outer-approximation method for MINLP optimisation. Comput. Chem. Eng. 1990, 14, 769.
38. Floudas, C.A. Non-linear and mixed-integer optimization, Fundamentals and applications; Oxford University Press: New York, 1995.
39. Deb, K. An efficient constraint handling method for genetic algorithms. Comp. Methods Appl. Mech. Eng. 2000, 186, 311.
40. Michalewicz, Z.; Schoenauer, M. Evolutionary algorithms for constrained parameters optimization problems. Evol. Comp. 1996, 4, 1.
41. Raghuwanshi, M. M.; Kakde O. G. Survey on multiobjective evolutionary and real coded genetic algorithms. Proceedings of the 7th International Conference on Adaptative and Natural Computing Algorithms, Coimbra, Portugal, March 21-23, 2005.
42. Deb, K.; Agrawal, R. B. Simulated binary crossover for continuous search space. Complex Syst. 1995, 9, 115.
43. Goldberg, D. E. Genetic algorithms in search, optimization and machine learning; Addison-Wesley Publishing Company Inc.: Reading, MA, 1989.
44. Coello Coello, C. A.; Mezura Montes, E. Constraint-handling in genetic algorithms through the use of dominance-based tournament selection Adv. Eng. Informatics 2002, 16, 193.