{"id":"986e780e-9627-4b2f-a416-db60286ba57f","arxiv_id":"2506.02795","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"Robotic liquid-handling schedules can be optimized as capacitated vehicle routing problems, yielding double-digit percentage reductions in execution time on simulated and real laboratory tasks.","lead":"This paper recasts liquid-handling robot scheduling as a familiar logistics problem, the capacitated vehicle routing problem, and uses an existing solver (Google OR-Tools) to cut pipetting time. It reports up to 37% faster execution on random tasks and 61 minutes saved on one real materials-discovery campaign, with no hardware changes.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proxy validation uses only random work lists; CVRP-optimized schedules are never compared on true execution time for random tasks, so the constant-t4 simplification in Eq. (1) could be exploited and the 37% gain may not transfer to hardware.","rationale":"The reader identified the constant-t4 assumption as the weakest point, and I agree that is the most concrete modeling simplification. However, the deeper problem is that the proxy is validated only on randomly ordered schedules; the CVRP solver minimizes exactly that proxy, so any systematic proxy error correlated with route structure can be exploited. The t4 simplification is the most plausible such error, but the validation gap is broader: Figure 5's random-task numbers appear to be computed proxy times, not simulated or measured times, and the only hardware test is a single JANUS task. This does not change the reader's CONDITIONAL verdict: the paper is useful and the proxy is reasonable, but the central claim needs direct validation of optimized schedules against true execution time, ideally with distance-dependent movement. A concrete EvoSim-based re-benchmark of Figure 5 schedules would settle whether the concern lands.","tokens_in":10710,"tokens_out":15262,"duration_ms":187211,"concrete_test":"Run the Figure 5 benchmark (e.g., 96-well to 96-well, 2000 transfers, same random tasks) through EvoSim for row-major, LAP, greedy, and CVRP schedules, measuring simulated execution time rather than D'. Repeat with arm-movement time made distance-dependent (e.g., reduce arm speed 10x or set t4 = a + b*distance). If CVRP remains fastest in both settings, the proxy concern is settled; if LAP or row-major wins under distance-dependent movement, the constant-t4 assumption is load-bearing and the general claim must be qualified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim that minimizing D' in Eqs. (3)-(4) minimizes real execution time depends on D' being a faithful surrogate at the optima found by OR-Tools, not just on random schedules. Figure 4 validates D' against EvoSim only for randomly ordered work lists. Figure 5, the basis for the 37% random-task improvement, reports the computed proxy, not simulated or measured execution time; simulated time is used only for the real campaign (Fig. 7c), plus a single JANUS G3 run of iteration 3 (Fig. S5). The Methods explicitly set t4 constant and Eq. (1) charges the same binary cost for a one-well move and a full-plate move: 'we ignore the impact of different distances when moving arms.' An optimizer is free to exploit this: it can trade many short moves for few long moves at zero extra proxy cost, while true time depends on travel distance. The one JANUS test varied aspiration/dispensing speeds but not arm speed or deck geometry, so it cannot rule out this failure mode. Thus the headline gains are not yet demonstrated for true execution time in the random-task regime.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes treating the scheduling of liquid transfers for an 8-channel, individually addressable pipette as a capacitated vehicle routing problem (CVRP). It defines a job-level execution-time proxy (Eqs. 1-4) in which well adjacency on source and destination plates is binary and arm travel distance is ignored, formulates an integer program (Eq. 5), and solves it with OR-Tools. The method is benchmarked against row-major sorting, LAP, and greedy baselines on randomly generated tasks across plate formats, reporting up to a 37% reduction in the computed proxy (Fig. 5), and the proxy is correlated against Tecan EvoSim for randomly ordered work lists (Fig. 4). A real polymer-blend campaign is optimized, with EvoSim-simulated savings of 61-75 minutes, and one JANUS G3 experiment is reported (Fig. S5).","tokens_in":1454,"tokens_out":1429,"duration_ms":74589,"significance":"If the time proxy is faithful at the schedules the optimizer actually produces, the paper provides a practical, broadly applicable way to reduce liquid-handling time without hardware changes, and the open-source implementation is a valuable asset. The CVRP analogy is clearly explained, and the benchmark coverage across plate formats and task sizes is a strength. However, the load-bearing validation is incomplete: the proxy's fidelity is established only for random orderings, while the headline random-task improvements are measured in the proxy itself; true execution-time evidence at the optimized schedules is limited to the real campaign and a single JANUS run. The constant-t4 simplification creates a concrete risk that the optimizer trades many short moves for a few long moves at zero proxy cost, so the claimed gains may not transfer to true execution time.","major_comments":[{"comment":"Figure 4 validates the proxy only against randomly ordered work lists, while the random-task improvement in Figure 5 is reported in terms of the computed proxy D', not EvoSim-simulated or hardware-measured time. The conclusion that 'minimization of the former should lead to minimization of the latter' is therefore not tested on the schedules the optimizer actually produces. Because Eq. (1) charges a constant cost for any non-adjacent move, a CVRP solution can replace many short moves by few long moves at no extra proxy cost, so the 37% headline gain may not transfer to true execution time. I request EvoSim simulation (or hardware execution) of the work lists generated by all methods for the Figure 5 tasks, with actual times reported alongside the proxy.","section":"Figure 4 and Figure 5; Eqs. (1)-(4)"},{"comment":"The assumption that arm movement time t4 is constant and independent of distance is load-bearing for the proxy. The paper justifies this by experience with 'commercially available liquid handlers we have used,' but no measurement of the movement-time share is provided. The single JANUS G3 experiment (Fig. S5) varies aspiration and dispensing speeds only; it does not vary arm speed, deck geometry, or plate spacing, so it cannot detect regimes in which distance-dependent movement dominates. I ask for a sensitivity analysis (e.g., re-solving with movement cost proportional to distance, or measuring t4 across distances on at least one platform) to bound the error introduced by this simplification.","section":"Mathematical formulation, Eq. (1)"},{"comment":"The abstract's 'up to 37% reduction in execution time' overstates what is measured for random tasks. Figure 5 reports computed proxy time only, not simulated or measured execution time, so the wording should be qualified as 'computed execution time' until true-time validation for the random-task regime is added. The real-campaign claim is supported by EvoSim simulation, but the random-task claim is not.","section":"Abstract and Figure 5"},{"comment":"The stated mathematical formulation does not include subtour elimination constraints; constraints (5b)-(5e) allow cycles that are disconnected from the dummy depot. The text says Eq. (5) is 'exactly the same as CVRP' and relies on OR-Tools to enforce proper routes. For a mathematical-optimization paper, the formulation should either include the standard subtour elimination constraints or explicitly state that Eq. (5) is a relaxed model whose solutions are repaired/enforced by the routing solver.","section":"Equation (5)"}],"minor_comments":[{"comment":"The affiliation address contains a typo: 'Cambrdige' should be 'Cambridge'; the same typo appears twice.","section":"Author affiliations"},{"comment":"Panels (d) and (f) are both described as 'from 96-well plate to 96-well plate'; if this is not a typo, the difference between the two panels should be stated explicitly.","section":"Figure 5 caption"},{"comment":"The LAP method is underspecified: 'iteratively sampling the jobs on the axis that belongs to the larger plate' is ambiguous, and a precise algorithm or pseudocode is needed for reproducibility.","section":"Baseline methods"},{"comment":"The proxy parameters t_src_1,3,4 and t_dst_1,3,4 are set to 1 in the main text, but the EvoSim parameters in Table S1 list only aspiration speed, delays, and retraction speed; please clarify whether these proxy constants were calibrated to the simulator or chosen heuristically, since this affects the interpretation of the correlation in Figure 4.","section":"Supporting Information, Table S1"},{"comment":"The text contains a typo: 'e successfully optimized pipetting tasks' should read 'we successfully optimized pipetting tasks.'","section":"Results and discussion"}],"recommendation":"major_revision","confidential_remarks":"The paper is best viewed as an applied scheduling contribution rather than a methodological advance in vehicle routing. The main obstacle is validation: the central claim about random-task speedups rests on the proxy, not on true execution time. If the authors add EvoSim simulation of the optimized random-task work lists and qualify the abstract accordingly, the result could become acceptable; the journal should decide whether the application-level contribution fits its scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Rough take: the paper is a solid, clearly-written application of CVRP to 8-tip liquid handling, and it ships code. The main number to be skeptical about is the 37% random-task improvement, because that figure comes from the paper's proxy, not from simulated or measured execution time. The real-campaign evidence (EvoSim plus one JANUS G3 run) is more convincing, but it is a single case.\n\nWhat's new: to my knowledge, this is the first explicit CVRP encoding for individually addressable pipette tips. The job-to-location mapping, the capacity-8 constraint, and the adjacency-based distance matrix are straightforward in hindsight, but the paper works through them carefully and validates the proxy against EvoSim across plate formats. The broad benchmark (12-well to 384-well, plus 1536-well) and the real polymer-blend campaign are concrete and useful. The authors are also honest about the constant-arm-movement simplification, and the open-source implementation is a plus.\n\nSoft spots, in order of importance. First, the proxy validation in Fig. 4 only uses randomly ordered work lists. The CVRP solver optimizes a proxy that charges the same binary cost for a one-well move and a full-plate move. Nothing in the paper shows the proxy stays faithful at the optimizer's chosen schedules; an optimizer could exploit the simplification by trading many short moves for a few long moves at zero proxy cost. The single JANUS experiment varied aspiration/dispensing speeds but not arm speed or deck geometry, so it cannot rule this out. That is a real gap, not a nitpick. Second, the random-task benchmark uses only three tasks per condition, so the error bars are wide and some comparisons are noisy. Third, the GitHub link is unpinned; a commit hash would improve reproducibility.\n\nNone of this sinks the paper. The real-campaign simulation shows a 25% reduction in EvoSim, and the JANUS spot-check reproduces the ordering on actual hardware. That is meaningful evidence the approach works where it matters. But the 37% random-task claim should be restated as a proxy-level result until optimized work lists are run through EvoSim and, ideally, hardware.\n\nWho it's for: people building liquid-handling software and OR folks looking for a clean applied CVRP case. A serious referee should be engaged; the paper is publishable after revision. I'd ask for (a) EvoSim or hardware validation of the optimized schedules on a few random tasks, and (b) a discussion of when constant t4 might break down. Accept for review.","headline":"A genuinely useful CVRP formulation for pipette scheduling, but the headline 37% random-task gain is proxy-level until validated on true execution time.","tokens_in":11483,"tokens_out":3522,"would_cite":true,"duration_ms":38289,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90B06","90C27","90C59"],"pacs":[],"model":"deepseek-v4-flash","headline":"The central claim is that pipette scheduling on an 8-channel liquid handler is exactly a capacitated vehicle routing problem, so an off-the-shelf logistics solver can reorder the work list to cut execution time by up to 37% on random…","keywords":["liquid handling","pipette scheduling","capacitated vehicle routing problem","laboratory automation","combinatorial screening","execution time optimization","OR-Tools","self-driving labs"],"falsifier":"Run the same set of random liquid-handling tasks on a platform whose arm movement time strongly depends on the distance between source and destination plates, schedule them with row-major sorting and with the CVRP method, and compare measured execution times; if the CVRP schedule is not faster, or the computed proxy fails to correlate with measured time, the constant-movement-time premise is falsified.","tokens_in":10488,"feed_emoji":"🧪","tokens_out":3679,"duration_ms":36525,"temperature":0.7,"pith_summary":"This paper argues that scheduling the liquid-transfer jobs of an 8-channel robotic pipette can be reformulated as a capacitated vehicle routing problem (CVRP). The authors define a job-level distance matrix that encodes whether two transfers can be executed in the same pipette cycle, then hand this matrix to a standard CVRP solver to produce an optimized work list. They report that this approach beats row-major sorting by up to 37% in execution time on randomly generated tasks across several labware formats, and saves 61 minutes (25%) on a real high-throughput polymer-blend discovery campaign. If the time proxy is faithful, laboratories can accelerate combinatorial screening without any hardware modification.","feed_headline":"Pipette scheduling as delivery routing cuts time up to 37%","feed_subtitle":"A CVRP solver beats row-major sorting on random tasks and saves 61 minutes on a real enzyme-stabilization campaign.","key_machinery":"The load-bearing object is the job-level distance matrix $D' = D_{\\text{src}}' + D_{\\text{dst}}'$, defined in Equations (3) and (4). It assigns a cost of $t_{1,3,4} + v_j/q$ when two jobs are on adjacent wells and can be performed in the same pipette stroke, and a cost of $\\max(0, (v_j - v_i)/q)$ otherwise, with the dummy job representing the depot. This matrix is passed to the OR-Tools CVRP solver, which finds a route through all jobs in $K = \\lceil m/8 \\rceil$ cycles, each cycle respecting the capacity of eight tips. The machinery works by converting the geometric adjacency of wells into a routing cost, so that minimizing the routing distance maximizes parallel tip usage.","core_discovery":"The paper's central claim is that the pipette-scheduling problem, where up to eight liquid transfers are batched per aspiration-dispensing cycle, is precisely a capacitated vehicle routing problem: each cycle is a vehicle with capacity eight, the dummy job is the depot, and the distance between jobs is a computed metric built from well adjacency on both the source and destination plates. The discovery is a new application: logistics routing solvers transfer directly to laboratory automation, and minimizing this computed proxy leads to measurable reductions in simulated and real execution time. The authors demonstrate the equivalence through a CVRP formulation and validate it with EvoSim simulations and a real-world campaign, showing consistent gains over row-major, greedy, and long-axis-prioritized baselines.","pith_inferences":["The CVRP formulation naturally extends to jointly selecting destination well assignments during experimental design rather than only ordering a fixed task matrix, which the paper mentions as a possible future direction.","On liquid handlers where arm movement time scales with physical distance, the constant-$t_4$ proxy would need a distance-dependent term; otherwise the routing cost could mis-price transitions, a limitation the paper itself flags.","Integrating the scheduler into active-learning loops could let an autonomous platform trade optimization time against execution time, potentially exploring larger design spaces within reagent shelf-life limits.","The capacity constant $K=8$ is a parameter of the formulation, so the same code applies to pipettes with other channel counts, a straightforward but untested generalization."],"forward_implications":["Liquid-handling tasks can be accelerated without hardware changes, with up to about 37% reduction in execution time on random tasks and 25% (61 minutes) on a real polymer-blend screening campaign.","The method scales to high-density labware: with 120 seconds of solver time it handles up to roughly 14,000 transfers on 1536-well plates, suggesting it fits large combinatorial workflows.","The computed execution time is validated as a proxy by strong correlation with EvoSim-simulated execution times across 12-, 24-, 96-, and 384-well formats.","The approach is platform-independent enough to carry over to a JANUS G3 workstation, where the CVRP schedule outperformed all baselines across different aspiration and dispensing speeds."],"supporting_citations":[{"why":"Provides the OR-Tools Routing Library, the off-the-shelf CVRP solver used to compute all optimized schedules.","marker":"[21]"},{"why":"Describes the autonomous polymer-blend discovery campaign whose iteration data are re-scheduled in the real-world demonstration and provide the 61-minute savings claim.","marker":"[22]"},{"why":"Supplies liquid-handling device parameters and the observation that viscous liquids require slow aspiration and dispensing, which motivates the time model in Equations (3) and (4).","marker":"[20]"}],"fun_headline_variants":["CVRP optimization reduces liquid handling time by 37%","Vehicle routing solver speeds robotic pipetting by 37%","Pipette scheduling as delivery routing saves 61 minutes","Logistics algorithm for pipette tasks cuts execution time","Capacitated vehicle routing boosts lab automation efficiency"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The time model in Equations (3) and (4) treats arm movement time as a constant and ignores the physical distance between wells; if a liquid handler's movement time grows with distance, the routing cost mis-prices many transitions and the optimized schedule may no longer be the fastest.","fun_headline_variants_meta":{"raw":{"variants":["CVRP optimization reduces liquid handling time by 37%","Vehicle routing solver speeds robotic pipetting by 37%","Pipette scheduling as delivery routing saves 61 minutes","Logistics algorithm for pipette tasks cuts execution time","Capacitated vehicle routing boosts lab automation efficiency"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00052,"raw_usage":{"total_tokens":2485,"prompt_tokens":882,"completion_tokens":1603,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":498,"completion_tokens_details":{"reasoning_tokens":1524}},"tokens_in":498,"tokens_out":1603,"duration_ms":16221,"temperature":1.0,"reasoning_tokens":1524,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T11:14:13.335041+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same set of random liquid-handling tasks on a platform whose arm movement time strongly depends on the distance between source and destination plates, schedule them with row-major sorting and with the CVRP method, and compare measured execution times; if the CVRP schedule is not faster, or the computed proxy fails to correlate with measured time, the constant-movement-time premise is falsified.","supporting_citations":[{"cited_title":"OR-Tools Routing Library","cited_arxiv_id":null,"evidence_quote":"Provides the OR-Tools Routing Library, the off-the-shelf CVRP solver used to compute all optimized schedules."},{"cited_title":"distance","cited_arxiv_id":null,"evidence_quote":"Describes the autonomous polymer-blend discovery campaign whose iteration data are re-scheduled in the real-world demonstration and provide the 61-minute savings claim."},{"cited_title":"Devices and systems for laboratory automation; John Wiley & Sons, 2022","cited_arxiv_id":null,"evidence_quote":"Supplies liquid-handling device parameters and the observation that viscous liquids require slow aspiration and dispensing, which motivates the time model in Equations (3) and (4)."}],"review_version":1}