Study- Experiment Based Algorithm for Minimum Time

Case Study- Experiment Based Algorithm for Minimum Time 

Greaves et al, (2001) developed an experiment-based algorithm for finding the minimum batch time for the column and mixture described in section 3.3.4. 

For a given separation task [defined in terms of amount and composition of the 

The optimum reflux ratio and the minimum batch time for separation task 1 are 3 and 80.62 min (Table 3.1). The separation task 2 could be achieved using 3 different reflux ratio (Table 3.2) but however, / exp = 2 gives the true minimum batch time which is about 40% lower than the batch time that would be required to achieve the same separation with Rexp = 4. 

The main advantage of the algorithm is that for a given reflux ratio it will estimate the duration of the batch. However, the major disadvantage of this approach is that a time consuming experiment is to be carried out for each new value of the Rexp until the given separation task can be achieved in minimum time. 

---