Efficient discovery of chromatography equipment sizing strategies for antibody purification processes using evolutionary computing

10Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper considers a real-world optimization problem involving the discovery of cost-effective equipment sizing strategies for the chromatography technique employed to purify biopharmaceuticals. Tackling this problem requires solving a combinatorial optimization problem subject to multiple constraints, uncertain parameters (and thus noise), and time-consuming fitness evaluations. After introducing this problem, an industrially-relevant case study is used to demonstrate that evolutionary algorithms perform best when infeasible solutions are repaired intelligently, the population size is set appropriately, and elitism is combined with a low number of Monte Carlo trials (needed to account for uncertainty). Adopting this setup turns out to be more important for scenarios where less time is available for the purification process. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Allmendinger, R., Simaria, A. S., & Farid, S. S. (2012). Efficient discovery of chromatography equipment sizing strategies for antibody purification processes using evolutionary computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7492 LNCS, pp. 468–477). https://doi.org/10.1007/978-3-642-32964-7_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free