Skip to main content
The effectiveness of a hybrid of simulated annealing (SA) and the simplex algorithm for optimization of a chromatographic separation has been examined. The method has been used to solve optimization problems for separations in batch and... more
The effectiveness of a hybrid of simulated annealing (SA) and the simplex algorithm for optimization of a chromatographic separation has been examined. The method has been used to solve optimization problems for separations in batch and continuous chromatographic systems under isocratic and gradient conditions. To verify the robustness of the algorithm a variety of test problems have been solved. Different objective functions have been optimized subject to different optimization constraints for several operating conditions used as decision variables. The effectiveness of the hybrid procedure has been compared with that of a random search algo-rithm. The hybrid method proved particularly effective for multicondition optimization involving changes of mobile-phase composition. The method is rapid and robust in location of the global optimum. It does not, moreover, require initiation of the calculations with a "feasible point", i.e. a point for which optimization constraints a...
Dynamics of the purification process of a CHO derived monoclonal antibody by ion exchange chromatography (IEC), hydrophobic interaction chromatography (HIC) and their integration has been investigated. To quantify the adsorption behavior... more
Dynamics of the purification process of a CHO derived monoclonal antibody by ion exchange chromatography (IEC), hydrophobic interaction chromatography (HIC) and their integration has been investigated. To quantify the adsorption behavior of the target protein (IgG1) and impurities contained in the supernatant, their elution course on IEC and HIC columns has been analyzed versus pH and/or the salt concentration in the mobile phase. A short-cut method has been proposed for mathematical modeling and determining underlying kinetic and thermodynamic parameters. The accuracy of the model predictions has been verified by comparing the simulated and experimental band profiles recorded in both chromatographic processes. After verification, the model was used to optimize operating conditions for the column loading and chromatographic elution in the integrated process IEC/HIC. Two alternative loading techniques based on the upstream and downstream feed dilution were taken into account in the o...
Goal of the paper is to demonstrate how configuration of a certain number of identical HPLC columns influences on the effectiveness of the isolation of a target component. There are two extreme configurations: all the available columns... more
Goal of the paper is to demonstrate how configuration of a certain number of identical HPLC columns influences on the effectiveness of the isolation of a target component. There are two extreme configurations: all the available columns are operated in parallel (provided there are enough pumps available) or all the columns are connected in series. Various combinations of columns connected parallel and in series are possible. Besides batch operation more sophisticated multicolumn arrangements allowing continuous separation are considered. In particular, in this work different configurations of five columns were examined. For illustration the separation of a binary mixture was considered. As the objective function the productivity of the less retained component has been used. A standard model capable to describe the propagation of chromatographic bands has been used to optimize the operating conditions for various possible multicolumn arrangements.
... (3). The Rouchon scheme for each component can be rewritten as: t+lt t+lt t+l r+l ci.zt ci,z + F i.: Fi.zi + wCi= ci,: i Ati AZ Ati =0 (6) where i= 1,..,NC. It should be noted that all advan tages of the original Rouchon algorithm are... more
... (3). The Rouchon scheme for each component can be rewritten as: t+lt t+lt t+l r+l ci.zt ci,z + F i.: Fi.zi + wCi= ci,: i Ati AZ Ati =0 (6) where i= 1,..,NC. It should be noted that all advan tages of the original Rouchon algorithm are pre served. K. Kaczmarski. D. Antos J. Chromato4r. ...

And 30 more