Global optimal design of reverse osmosis networks for seawater desalination: modeling and algorithm [An article from: Desalination] Buy on Amazon

https://www.ebooknetworking.net/books_detail-B000RR5CE0.html

Global optimal design of reverse osmosis networks for seawater desalination: modeling and algorithm [An article from: Desalination]

8.95 USD
Buy New on Amazon 🇺🇸

Available for download now

Book Details

PublisherElsevier
ISBN / ASINB000RR5CE0
ISBN-13978B000RR5CE7
AvailabilityAvailable for download now
Sales Rank99,999,999
MarketplaceUnited States  🇺🇸

Description

This digital document is a journal article from Desalination, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
A novel global optimization algorithm to solve nonconvex problem is used to find the global optimal design of reverse osmosis networks for seawater desalination. The objective is to determine the optimal process design and operating conditions for a given water production. The networks were designed by using hollow fiber reverse osmosis modules. The Kimura-Sourirajan model was used for describing transport phenomena of solute and water transport through the membrane. The concentration polarization phenomenon has been taken into account. It was mathematically described using the film theory. The objective function to be minimized is the cost, which includes capital investment (membrane cost, pumping and energy recovery system, intake and pre-treatment systems, etc.) and operation and maintenance costs (membrane replacement, chemical treatment, spares, required and recovered energy, etc.). The proposed algorithm is deterministic and attains finite convergence to the global optimum. It is iterative and a main problem is solved each iteration. The main problem has convex constraints and a nonconvex objective function. The main problem solution indicates either a better solution for the original problem, or a region which can be discarded. Therefore, the feasible region to improve the objective function is reduced each iteration. The algorithm finishes when the whole region has been analysed and discarded. A bound reduction technique is performed in order to accelerate the convergence speed. The algorithm shows a good performance and efficient execution time. Different cases are solved in order to show the methodology and computational performance.
Donate to EbookNetworking
Prev
Next