Abstract
Combining Simulated Annealing (SA) algorithm with Linear Programming (LP), SA/LP algorithm is proposed for solving nonconvex MINLP problems. An MINLP model for optimal design of multipurpose batch process with multiple routes is developed. It allows the existence of intermediate storage, parallel units in and out of phase as well as discrete equipment size. SA/LP algorithm is implemented to solve the proposed MINLP model. The results of illustrating examples are conducted and compared with those of some previous published paper. SA/LP procedure find the global optima and is shown to be far more efficient in computing time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
