A Fix-and-Optimize Variable Neighborhood Search for the Biomedical Sample Transportation Problem
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Biomedical tests play a crucial role in helping physicians to make accurate diagnoses. To perform these tests, thousands of samples are daily transported from several healthcare facilities, where they are collected from patients, to laboratories, where they are analyzed. We consider the challenging Biomedical Sample Transportation Problem (BSTP), which is a complex variant of the vehicle routing problem with time windows, where both the number of visits and the opening and closing hours of the collection centers are decision variables, while the objective is to minimize the total duration of routes. We propose a linear programming formulation for the BSTP, and we develop a matheuristics to solve the problem in real-size problem instances, which consists of a decomposition coupled with a Variable Neighborhood Search (VNS) algorithm. The decomposition is based on a spatio-temporal clustering method, which takes into account both the travel times between the centers and their collection periods; then, a Fix-and-Optimize VNS is applied to improve the decomposed solution. The performance of the proposed method is assessed over a large number of realistic instances, which are based on the laboratory network in the Province of Québec, Canada. Results show good quality solutions and the capability of the matheuristics to solve real-size problem instances within an adequate time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it