A linear programming-based strategy to save pipette tips in automated DNA assembly

Laboratory automation and mathematical optimization are key to improving the efficiency of synthetic biology research. While there are algorithms optimizing the construct designs and synthesis strategies for DNA assembly, the optimization of how DNA assembly reaction mixes are prepared remains largely unexplored. Here, we focus on reducing the pipette tip consumption of a liquid-handling robot as it delivers DNA parts across a multi-well plate where several constructs are being assembled in parallel. We propose a linear programming formulation of this problem based on the capacitated vehicle routing problem, as well as an algorithm which applies a linear programming solver to our formulation, hence providing a strategy to prepare a given set of DNA assembly mixes using fewer pipette tips. The algorithm performed well in randomly generated and real-life scenarios concerning several modular DNA assembly standards, proving to be capable of reducing the pipette tip consumption by up to [Formula: see text] in large-scale cases. Combining automatic process optimization and robotic liquid handling, our strategy promises to greatly improve the efficiency of DNA assembly, either used alone or combined with other algorithmic DNA assembly optimization methods. Graphical Abstract [Image: see text]